Zhu Junyu, Huang Chuanhe, Fan Xiying, Guo Sipei, Fu Bin
School of computer, Wuhan University, Wuhan 430072, China.
Collaborative Innovation Center of Geospatial Technology, Wuhan University, Wuhan 430072, China.
Sensors (Basel). 2018 Feb 10;18(2):547. doi: 10.3390/s18020547.
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.
由于车载自组织网络（VANETs）的动态特性，在其中进行高效的数据传播是一个具有挑战性的问题。为了提高数据传播性能，我们研究了VANETs中的分布式数据复制算法，用于在车辆节点的任意连通网络中交换信息和进行计算。为了实现低传播延迟并提高网络性能，我们控制网络中可传播的消息副本数量，然后提出了一种高效的分布式数据复制算法（EDDA）。关键思想是让数据载体将数据传播任务分配给多个节点，以加速传播过程。我们计算网络进入平衡状态所需的通信阶段数，并表明所提出的分布式算法能够在少量通信阶段内收敛到共识。本文描述的大多数理论结果是研究网络收敛的复杂性。在算法分析中还提供了下限和上限。仿真结果表明，所提出的EDDA能够以低传播延迟和系统开销，将消息高效地传播到特定区域内的车辆。
