Plummeting Broadcast Storm Problem in Highways by Clustering Vehicles Using Dominating Set and Set Cover

Abstract

“Vehicular Ad-hoc Networks” (VANETs): As an active research area in the field of wireless sensor networks, they ensure road safety by exchanging alert messages about unexpected events in a decentralized manner. One of the significant challenges in the design of an efficient dissemination protocol for VANETs is the broadcast storm problem, owing to the large number of rebroadcasts. A generic solution to prevent the broadcast storm problem is to cluster the vehicles based on topology, density, distance, speed, or location in such a manner that only a fewer number of vehicles will rebroadcast the alert message to the next group. However, the selection of cluster heads and gateways of the clusters are the key factors that need to be optimized in order to limit the number of rebroadcasts. Hence, to address the aforementioned issues, this paper presents a novel distributed algorithm CDS_SC: Connected Dominating Set and Set Cover for cluster formation that employs a dominating set to choose cluster heads and set covering to select cluster gateways. The CDS_SC is unique among state-of-the-art algorithms, as it relies on local neighborhood information and constructs clusters incrementally. Hence, the proposed method can be implemented in a distributed manner as an event-triggered protocol. Also, the stability of cluster formation is increased along with a reduction in rebroadcasting by allowing a cluster head to be passive when all its cluster members can receive the message from the gateway vehicles. The simulation was carried out in dense, average, and sparse traffic scenarios by varying the number of vehicles injected per second per lane. Besides, the speed of each individual vehicle in each scenario was varied to test the degree of cohesion between vehicles with different speeds. The simulation results confirmed that the proposed algorithm achieved 99% to 100% reachability of alert messages with only 6% to 10% of rebroadcasting vehicles in average and dense traffic scenarios.

Reliable and infrastructure‐independent routing for the internet of vehicles

“…Many recent studies used the number of vehicle neighbors as a criterion for selecting a relay vehicle. [35][36][37][38] However, vehicles that are temporarily side-by-side because of differences in speed or movement direction should not be considered reliable neighbors and influential in the relay choice. If vehicles have reliable neighbors, their velocities are closer together, and their links are stable.…”

NSSC: Novel Segment Based Safety Message Broadcasting in Cluster-Based Vehicular Sensor Network

“…where,x n = 1 x j − = min ix ij (10) Linear normalization of the fuzzy matrix is represented by the score valuesH i andG i as follows:…”

“…[9]. Clustering plays vital role in safety message broadcasting in terms of reducing number of rebroadcasts in vehicular sensor environment [10].…”

Research on adaptive beacon message broadcasting cycle based on vehicle driving stability

“…In order to solve the problem of broadcast storm, Kamakshi et al 36 proposed a novel distributed algorithm, CDS_SC: control set and set cover for the connection formed by cluster. It uses control set to select cluster head and set cover to select cluster gateway It relies on the local neighbor information and constructs the cluster in an incremental way.…”