A robust and efficient adaptive data dissemination protocol based on smart relay selection in vehicular networks
The dissemination of road safety messages is a challenging task in VANETs. Indeed, they should be efficiently transmitted by achieving a high packet delivery within a limited transmission delay and a minimum of overhead. In order to meet these constraints, while overcoming the data dissemination cha...
Saved in:
Published in | Wireless networks Vol. 27; no. 7; pp. 4497 - 4511 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York
Springer US
01.10.2021
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The dissemination of road safety messages is a challenging task in VANETs. Indeed, they should be efficiently transmitted by achieving a high packet delivery within a limited transmission delay and a minimum of overhead. In order to meet these constraints, while overcoming the data dissemination challenges, researchers have proposed a wide variety of solutions. Most of these solutions are addressing the well-known Broadcast Storm problem. In this context, we propose in the current work a new dissemination strategy denoted “READ” for robust and efficient adaptive data dissemination protocol. On the one hand, the originality of this protocol lies in its robustness that is achieved through a smart relay selection. Therefore, a high data reliability is guaranteed based on a beaconless strategy while taking into account the surrounding vehicles’ density. On the other hand, the protocol efficiency is manifested through the effective use of the limited network resources by reducing the excessive number of redundant messages. The simulation results show that the proposed solution achieves a high data reachability within a low transmission delay while using the minimum network resources. Furthermore, READ presents an adaptive feature that makes it suitable either for safety applications or for comfort application. |
---|---|
ISSN: | 1022-0038 1572-8196 |
DOI: | 10.1007/s11276-021-02726-8 |