An Adaptable Destination-Based Dissemination Algorithm Using a Publish/Subscribe Model in Vehicular Networks

Abstract

Vehicular Ad Hoc Networks (VANETs) are highly dynamic and unstable due to the heterogeneous nature of the communications, intermittent links, high mobility and constant changes in network topology. Currently, some of the most important challenges of VANETs are the scalability problem, congestion, unnecessary duplication of data, low delivery rate, communication delay and temporary fragmentation. Many recent studies have focused on a hybrid mechanism to disseminate information implementing the store and forward technique in sparse vehicular networks, as well as clustering techniques to avoid the scalability problem in dense vehicular networks. However, the selection of intermediate nodes in the store and forward technique, the stability of the clusters and the unnecessary duplication of data remain as central challenges. Therefore, we propose an adaptable destination-based dissemination algorithm (DBDA) using the publish/ subscribe model. DBDA considers the destination of the vehicles as an important parameter to form the clusters and select the intermediate nodes, contrary to other proposed solutions. Additionally, DBDA implements a publish/subscribe model. This model provides a context-aware service to select the intermediate nodes according to the importance of the message, destination, current location and speed of the vehicles; as a result, it avoids delay, congestion, unnecessary duplications and low delivery rate.

A Destination Based Routing Protocol for Context Based Clusters in VANET

“…ARD k is the average of the distances between relative destination of vehicle "k" and each of its neighbor "j" [12]. It is calculated by using Equation (6).…”

Dubhe: A Reliable and Low-Latency Data Dissemination Mechanism for VANETs

“…It is clear that the maximum waiting time is a critical parameter to Algorithm 1, which closely relies on the one-hop (1) //Definition: denotes a vehicle in a VANET, ( ) denotes a neighbor list of ; (2) // denotes the last intersection passed by; dist ( , ) denotes the length from to ; (3) // denotes wireless transmission radius; (4) // denotes the data packet which needs to be delivered, and consists of ID, data, sender node , a neighbor list of ( ), the coordinates of , and the distance between and (5) On receiving a data packet at node (6) Extract dist( , ), coordinates of and ( ) from ; (7) I f has been received before or ∉ ( ) then (8) D r o pd a t ap a c k e t ; (9) If exists any defer timer on then (10) Cancel all the timers; (11) return; (12) Ifdist( , ) ≤ dist( , ) then (13) D r o pd a t ap a c k e t ; (14) If ( ) ⊆ ( ) then (15) D r o pd a t ap a c k e t ; (16) Set defer timer 1 time to ; (17) On expiration of deferred timer 1 (18) Broadcast data packet ; (19) Set equals to ( − (dist( , ) mod )) * / ; (20) Set defer timer 2 with ; (21) On expiration of deferred timer 2 (22) U p d a t e : replace ( ) with ( ),dist( , ) with dist( , ) (23) Broadcast data packet Algorithm 1: An improved greedy broadcast algorithm with coverage elimination.…”

New Bargaining Game Model for Collaborative Vehicular Network Services

“…However, the primary difference is that the nodes in VANETs are mobile vehicles; they move at much higher speeds and possess substantial power resources, which is an advantage over traditional MANETs. As a newly introduced technology, the goal of VANET research is to develop vehicle-to-vehicle (V2V) communications to enable quick and cost-efficient data sharing for enhanced vehicle safety and comfort [1][2][3].…”