Abstract
SUMMARYThe characteristics of vehicular ad hoc networks (VANETs) make the design of routing protocol a great challenge. In this paper, we propose a vehicle density and load aware routing protocol for VANETs called VDLA. VDLA adopts sequential selection of junctions to construct the route. The selection is based on the real‐time vehicle density, the traffic load, and the distance to the destination. The network information is collected by a decentralized mechanism. Through factoring in these metrics, the packets are avoided being sent to roads where network is disconnected, and the network load is balanced to mitigate network congestion. The intermediate junctions are selected before the packet reaches a junction to reduce the unnecessary hops. Our study also investigates the impact of the high mobility of the nodes. An analytical framework is proposed to analyze the mobility. Based on the analysis, the traditional Hello scheme is enhanced to improve the accuracy of the neighbor table. In the simulation, we compare VDLA with greedy perimeter coordinator routing and GpsrJ+, which are geographic routings protocols proposed for VANETs. The results validate the superiority of VDLA in terms of end‐to‐end delay and packet delivery rate. And the superiority holds in different scenarios. Copyright © 2013 John Wiley & Sons, Ltd.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
