Moving target oriented opportunistic routing algorithm in vehicular networks

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In vehicular networks, the multihop message delivery from information source to moving vehicles presents a challenging task due to many factors, including high mobility, frequent disconnection, and real-time requirement for applications. In this paper, we propose a moving target oriented opportunistic routing algorithm in vehicular networks for message delivery from information source to a moving target vehicle. In order to adapt the constantly changing topology of networks, the forwarding decisions are made locally by each intermediate vehicle based on the trajectory information of the target vehicle. The simulation and real trace experiment show that our design provides an efficient message delivery with a higher success ratio, shorter success time, and lower transmission overhead compared with other reference approaches. © 2013 Yu Ding et al.

Cite

CITATION STYLE

APA

Ding, Y., Wang, W., Cui, Y., Gong, X., & Wang, B. (2013). Moving target oriented opportunistic routing algorithm in vehicular networks. International Journal of Distributed Sensor Networks, 2013. https://doi.org/10.1155/2013/692146

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free