Premium
Reducing saturation and congestion in VANET networks: Alliance‐based approach and comparisons
Author(s) -
Ouazine Kahina,
Slimani Hachem,
Nacer Hassina,
Bermad Nabila,
Zemmoudj Salah
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.4245
Subject(s) - computer science , vehicular ad hoc network , computer network , scalability , wireless ad hoc network , network packet , network congestion , wireless , telecommunications , database
Summary A vehicular ad hoc network (VANET) is composed mainly of fixed roadside entities (RSUs) and mobile entities (vehicles). In order to exchange information and data relating to the safety and comfort of road users, these different entities must establish communications between them. In these communications, one of the main problems is related to congestion and saturation of RSUs. In this paper, we first study the main protocols that involve RSUs in their strategy of routing by classifying them according to four levels. Furthermore, to deal with the problem of saturation of RSUs, we present a new approach of cooperation between the RSUs of a VANET in order to reduce its congestion and avoid as much as possible the saturation of these entities. This approach, called “D2A2RS” (defensive alliance–based approach for reducing RSUs saturation), is based on the concept of defensive alliances in graphs that ensures effective collaboration between RSUs. To evaluate the performance of the proposed approach, we conduct a comparative analysis by using both analytical models and simulations. The obtained comparison results have shown the efficiency and the performance of our approach compared with other concurrent approaches in the literature in terms of packet loss/success rate, end‐to‐end transmission delay, and network scalability.