EDDA: An Efficient Distributed Data Replication Algorithm in VANETs

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

Full description

Bibliographic Details
Main Authors: Junyu Zhu, Chuanhe Huang, Xiying Fan, Sipei Guo, Bin Fu
Format: Article
Language:English
Published: MDPI AG 2018-02-01
Series:Sensors
Subjects:
Online Access:http://www.mdpi.com/1424-8220/18/2/547
id doaj-a70e94e406ff415d8049f6b397d8e532
record_format Article
spelling doaj-a70e94e406ff415d8049f6b397d8e5322020-11-24T22:13:23ZengMDPI AGSensors1424-82202018-02-0118254710.3390/s18020547s18020547EDDA: An Efficient Distributed Data Replication Algorithm in VANETsJunyu Zhu0Chuanhe Huang1Xiying Fan2Sipei Guo3Bin Fu4School of computer, Wuhan University, Wuhan 430072, ChinaSchool of computer, Wuhan University, Wuhan 430072, ChinaSchool of computer, Wuhan University, Wuhan 430072, ChinaSchool of Mathematics and Statistics, Central China Normal University, Wuhan 430079, ChinaDepartment of Computer Science, The University of Texas Rio Grande Valley, Edinburg, TX 78541, USAEfficient 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.http://www.mdpi.com/1424-8220/18/2/547VANETsdata disseminationbounded number of messagesdistributed consensussensor
collection DOAJ
language English
format Article
sources DOAJ
author Junyu Zhu
Chuanhe Huang
Xiying Fan
Sipei Guo
Bin Fu
spellingShingle Junyu Zhu
Chuanhe Huang
Xiying Fan
Sipei Guo
Bin Fu
EDDA: An Efficient Distributed Data Replication Algorithm in VANETs
Sensors
VANETs
data dissemination
bounded number of messages
distributed consensus
sensor
author_facet Junyu Zhu
Chuanhe Huang
Xiying Fan
Sipei Guo
Bin Fu
author_sort Junyu Zhu
title EDDA: An Efficient Distributed Data Replication Algorithm in VANETs
title_short EDDA: An Efficient Distributed Data Replication Algorithm in VANETs
title_full EDDA: An Efficient Distributed Data Replication Algorithm in VANETs
title_fullStr EDDA: An Efficient Distributed Data Replication Algorithm in VANETs
title_full_unstemmed EDDA: An Efficient Distributed Data Replication Algorithm in VANETs
title_sort edda: an efficient distributed data replication algorithm in vanets
publisher MDPI AG
series Sensors
issn 1424-8220
publishDate 2018-02-01
description 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.
topic VANETs
data dissemination
bounded number of messages
distributed consensus
sensor
url http://www.mdpi.com/1424-8220/18/2/547
work_keys_str_mv AT junyuzhu eddaanefficientdistributeddatareplicationalgorithminvanets
AT chuanhehuang eddaanefficientdistributeddatareplicationalgorithminvanets
AT xiyingfan eddaanefficientdistributeddatareplicationalgorithminvanets
AT sipeiguo eddaanefficientdistributeddatareplicationalgorithminvanets
AT binfu eddaanefficientdistributeddatareplicationalgorithminvanets
_version_ 1725801322070933504