Abstract

Due to the random delay, local maximum and data congestion in vehicular networks, the design of a routing is really a challenging task especially in the urban environment. In this paper, a distributed routing protocol DGGR is proposed, which comprehensively takes into account sparse and dense environments to make routing decisions. As the guidance of routing selection, a road weight evaluation (RWE) algorithm is presented to assess road segments, the novelty of which lies that each road segment is assigned a weight based on two built delay models via exploiting the real-time link property when connected or historic traffic information when disconnected. With the RWE algorithm, the determined routing path can greatly alleviate the risk of local maximum and data congestion. Specially, in view of the large size of a modern city, the road map is divided into a series of Grid Zones (GZs). Based on the position of the destination, the packets can be forwarded among different GZs instead of the whole city map to reduce the computation complexity, where the best path with the lowest delay within each GZ is determined. The backbone link consisting of a series of selected backbone nodes at intersections and within road segments, is built for data forwarding along the determined path, which can further avoid the MAC contentions. Extensive simulations reveal that compared with some classic routing protocols, DGGR performs best in terms of average transmission delay and packet delivery ratio by varying the packet generating speed and density.

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 call

Disclaimer: 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.