z-logo
Premium
A stable and reliable data dissemination scheme based on intelligent forwarding in VANETs
Author(s) -
Chahal Manisha,
Harit Sandeep
Publication year - 2019
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.3869
Subject(s) - computer science , computer network , network packet , latency (audio) , wireless ad hoc network , node (physics) , throughput , vehicular ad hoc network , packet forwarding , dissemination , intelligent transportation system , network topology , scheme (mathematics) , distributed computing , wireless , telecommunications , civil engineering , structural engineering , engineering , mathematical analysis , mathematics
Summary Vehicular ad hoc networks (VANETs) have gained incredible attention because of their applications in safety, commercial uses, and traffic management. However, the dynamic topology changes caused by the high speed of vehicles raise many challenges for the effective data dissemination in vehicular applications. In this paper, with the objective to solve the problem of frequent disconnection during data delivery, we propose a novel, intelligent forwarding–based stable and reliable data dissemination scheme. First, link stability is described mathematically, by which vehicle chooses the next forwarding node. Then, a greedy algorithm is presented to transmit the data from source to destination. A separate recovery algorithm is also designed to resolve the intermediate link breakage problem. The performance of the proposed method is analyzed by performing extensive network and traffic simulations with respect to various indexes such as latency, packet delivery ratio (PDR), and throughput. Compared with the state‐of‐the‐art protocols, the proposed method under varying density improves the average PDR and throughput by 31.55% and 25.30%, respectively.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here