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-...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-02-01
|
| Series: | Sensors |
| Subjects: | |
| Online Access: | http://www.mdpi.com/1424-8220/18/2/547 |
| _version_ | 1818007526088638464 |
|---|---|
| author | Junyu Zhu Chuanhe Huang Xiying Fan Sipei Guo Bin Fu |
| author_facet | Junyu Zhu Chuanhe Huang Xiying Fan Sipei Guo Bin Fu |
| author_sort | Junyu Zhu |
| collection | DOAJ |
| 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. |
| first_indexed | 2024-04-14T05:16:41Z |
| format | Article |
| id | doaj.art-a70e94e406ff415d8049f6b397d8e532 |
| institution | Directory Open Access Journal |
| issn | 1424-8220 |
| language | English |
| last_indexed | 2024-04-14T05:16:41Z |
| publishDate | 2018-02-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Sensors |
| spelling | doaj.art-a70e94e406ff415d8049f6b397d8e5322022-12-22T02:10:20ZengMDPI 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 |
| 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 |
| title | 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_short | EDDA: An Efficient Distributed Data Replication Algorithm in VANETs |
| title_sort | edda an efficient distributed data replication algorithm in vanets |
| 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 |