EDDA: An Efficient Distributed Data Replication Algorithm in VANETs

Authors

Junyu Zhu
Chuanhe Huang
Xiying Fan
Sipei Guo
Bin Fu, The University of Texas Rio Grande Valley

Document Type

Article

Publication Date

2-2018

Abstract

Efficient data dissemination in vehicular ad hoc networks (VANETs) is a challenging issue due to the dynamic nature of the network. To improve the performance of data dissemination, we study distributed data replication algorithms in VANETs for exchanging information and computing in an arbitrarily-connected network of vehicle nodes. To achieve low dissemination delay and improve the network performance, we control the number of message copies that can be disseminated in the network and then propose an efficient distributed data replication algorithm (EDDA). The key idea is to let the data carrier distribute the data dissemination tasks to multiple nodes to speed up the dissemination process. We calculate the number of communication stages for the network to enter into a balanced status and show that the proposed distributed algorithm can converge to a consensus in a small number of communication stages. Most of the theoretical results described in this paper are to study the complexity of network convergence. The lower bound and upper bound are also provided in the analysis of the algorithm. Simulation results show that the proposed EDDA can efficiently disseminate messages to vehicles in a specific area with low dissemination delay and system overhead.

Comments

Original published version available at https://doi.org/10.3390/s18020547

Recommended Citation

Zhu, J., Huang, C., Fan, X., Guo, S., & Fu, B. (2018). EDDA: An Efficient Distributed Data Replication Algorithm in VANETs. Sensors, 18(2), 547. https://doi.org/10.3390/s18020547

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Publication Title

Sensors

DOI

10.3390/s18020547