4.6 Article

Time Barrier-Based Emergency Message Dissemination in Vehicular Ad-hoc Networks

Journal

IEEE ACCESS
Volume 7, Issue -, Pages 16494-16503

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2019.2895114

Keywords

VANET; emergency messages; data dissemination; 802.11p WAVE; probabilistic clustering; time barrier

Funding

  1. National Science Foundation

Ask authors/readers for more resources

With the advancement in technology and inception of smart vehicles and smart cities, every vehicle can communicate with the other vehicles either directly or through ad-hoc networks. Therefore, such platforms can be utilized to disseminate time-critical information. However, in an ad-hoc situation, information coverage can be restricted in situations, where no relay vehicle is available. Moreover, the critical information must be delivered within a specific period of time; therefore, timely message dissemination is extremely important. The existing data dissemination techniques in VANETs generate a large number of messages through techniques such as broadcast or partial broadcast. Thus, the techniques based on broadcast schemes can cause congestion as all the recipients re-broadcast the message and vehicles receive multiple copies of same messages. Further, re-broadcast can degrade the coverage delivery ratio due to channel congestion. Moreover, the traditional cluster-based approach cannot work efficiently. As clustering schemes add additional delays due to communication with cluster head only. In this paper, we propose a data dissemination technique using a time barrier mechanism to reduce the overhead of messages that can clutter the network. The proposed solution is based on the concept of a super-node to timely disseminate the messages. Moreover, to avoid unnecessary broadcast which can also cause the broadcast storm problem, the time barrier technique is adapted to handle this problem. Thus, only the farthest vehicle rebroadcasts the message which can cover more distance. Therefore, the message can reach the farthest node in less time and thus, improves the coverage and reduces the delay. The proposed scheme is compared with traditional probabilistic approaches. The evaluation section shows the reduction in message overhead, transmission delay, improved coverage, and packet delivery ratio.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available