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.
Highlights
Vehicular ad hoc networks (VANETs), which aim to improve transportation safety and enable data services for in-vehicle consumption, have attracted much interest [1]
This paper investigates the problem of a vehicle node disseminating a message to a large number of recipients in a specific area in VANETs, and the objective is to disseminate the message to the destination area with low dissemination delay and reduced communication overhead
We measure the complexity of network convergence by the number of communication stages in a distributed computing environment
Summary
Vehicular ad hoc networks (VANETs), which aim to improve transportation safety and enable data services for in-vehicle consumption, have attracted much interest [1]. Data dissemination is a promising application in VANETs, where messages are carried and forwarded by vehicular sensor nodes cooperatively toward their destinations. Through V2V communication in VANETs, the safety-related and commercial contents can be efficiently disseminated among a large number of vehicular sensor nodes. Due to the adaptability to dynamic network topologies, gossip algorithms, a distributed averaging approach based on rounds of communications between neighbor nodes, have received considerable attention because of their simplicity and robustness in noisy and uncertain environments [15]. In replication-based data dissemination, each node possesses the message by utilizing a limited amount of local information to allow distributed knowledge of global network properties. We study distributed averaging to evaluate the efficiency of network convergence in replication-based data dissemination
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
