Abstract
Vehicular Ad hoc Networks (VANETs) are an emerging technology that allows vehicles to form self-organized networks without the need of permanent infrastructure. VANETs have attracted the attention of the research community recently as they have opened up a myriad of on the road applications and increased their potential by providing intelligent transport systems. The envisaged applications, as well as some inherent VANET characteristics make data dissemination an essential service and a challenging task in these networks. Many data dissemination protocols have been proposed in the literature. However, most of these protocols were designed to operate exclusively in urban or highway scenarios and under dense or sparse networks. In addition, the existing solutions for data dissemination do not effectively address broadcast storm and network partition problems simultaneously. To tackle these problems, we propose a novel Data dissemination pRotocol In VEhicular networks (DRIVE) that relies exclusively on local one-hop neighbor information to deliver messages under dense and sparse networks. In dense scenarios, DRIVE selects vehicles inside a sweet spot to rebroadcast messages to further vehicles. Moreover, the protocol employs implicit acknowledgements to guarantee robustness in message delivery under sparse scenarios. DRIVE eliminates the broadcast storm problem and maximizes data dissemination capabilities across network partitions with short delays and low overhead. Simulation results show that DRIVE performs data dissemination with better efficiency than other algorithms, outperforming them in different scenarios in all the evaluations carried out.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
More From: Computer Networks
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.