
Peer to Peer Approach based Replica and Locality Awareness to Manage and Disseminate Data in Vehicular Ad Hoc Networks
Author(s) -
Abdelkader Guezzi,
Abderrahmane Lakas,
Ahmed Korichi,
Sarra Cherbal
Publication year - 2020
Publication title -
international journal of computer networks and communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.159
H-Index - 8
eISSN - 0975-2293
pISSN - 0974-9322
DOI - 10.5121/ijcnc.2020.12605
Subject(s) - distributed hash table , computer science , dissemination , vehicular ad hoc network , scalability , computer network , locality , replication (statistics) , distributed computing , peer to peer , replica , hash table , wireless ad hoc network , hash function , computer security , telecommunications , database , art , linguistics , philosophy , statistics , visual arts , mathematics , wireless
Distributed Hash Table (DHT) based structured peer-to-peer (P2P) systems provide an efficient method of disseminating information in a VANET environment owing to its high performance and properties (e.g., self-organization, decentralization, scalability, etc.). The topology of ad hoc vehicle networks (VANET) varies dynamically; its disconnections are frequent due to the high movement of vehicles. In such a topology, information availability is an ultimate problem for vehicles, in general, connect and disconnect frequently from the network. Data replication is an appropriate and adequate solution to this problem. In this contribution, to increase the accessibility of data, which also increases the success rate of the lookup, a method based on replication in the Vanet network is proposed named LAaR-Vanet. Also, this replication strategy is combined with a locality-awareness method to promote the same purpose and to avoid the problems of long paths. The performance of the proposed solution is assessed by a series of in-depth simulations in urban areas. The obtained results indicate the efficiency of the proposed approach, in terms of the following metrics: lookup success rate, the delay, and the number of the logical hop.