Abstract
Vehicular ad hoc network is an ad hoc network constituted among moving vehicles that have wireless dedicated short range communication (DSRC) devices in order to provide ubiquitous connectivity even if the road-side infrastructure is unavailable. Message dissemination in vehicular ad hoc networks is necessary for exchanging information about prevailing traffic information, so that the vehicles can take alternate routes to avoid traffic jam. A major challenge in broadcast protocols is that they result in flooding of messages that reduce the speed of dissemination due to collision. Dissemination of messages using tree topology reduces the number of rebroadcasts. Dynamicity Aware Graph Relabeling System model provides a framework to construct spanning tree in mobile wireless network. In this paper, we propose a new distributed algorithm for constructing an arbitrary spanning tree based on Dynamicity Aware Graph Relabeling System model, which develops a maximum leaf spanning tree in order to reduce the number of rebroadcasts and dissemination time. Our simulation results prove that the number of vehicles rebroadcasting the message is curtailed to 15% and the dissemination time required to achieve 100% reachability is curtailed by 10% under average vehicle density.
Highlights
Vehicular Ad hoc Networks (VANETs) are helpful in implementing Intelligent Transport Systems (ITS) that improve the safety of the transportation as well as provide comfort to the drivers by giving valuable on-time suggestions regarding the current traffic
We propose a new distributed algorithm for constructing a maximum leaf spanning tree based on Dynamicity Aware Graph Relabeling System (DA-GRS) model by making maximum number of nodes as leaf nodes in order to reduce number of rebroadcasts and dissemination time
Ruiz et al [7, 8] used the DA-GRS model for constructing the spanning tree and established that the tree topology constructed in Mobile Ad hoc Networks (MANET) and the VANETs have same link characteristics and tree topology can be used for message dissemination in VANETs
Summary
Vehicular Ad hoc Networks (VANETs) are helpful in implementing Intelligent Transport Systems (ITS) that improve the safety of the transportation as well as provide comfort to the drivers by giving valuable on-time suggestions regarding the current traffic. Some applications developed for the safety of vehicle users are Traffic Signal Violation Warning, Curve Speed Warning, Cooperative Forward Collision Warning, Precrash Warning, Intersection Collision Warning, and so forth [1] All these road safety applications require information dissemination to all vehicles moving towards the zone. Several improvements in the broadcasting protocols are devised to reduce the number of rebroadcasts Many of these protocols calculate a probability for rebroadcasting based on the information known to them [3, 4]. We propose a new distributed algorithm for constructing a maximum leaf spanning tree based on DA-GRS model by making maximum number of nodes as leaf nodes in order to reduce number of rebroadcasts and dissemination time.
Sign-in/Register to view highlights & summary 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.
