z-logo
Premium
Towards efficient data collection mechanisms in the vehicular ad hoc networks
Author(s) -
Pourghebleh Behrouz,
Jafari Navimipour Nima
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.3893
Subject(s) - computer science , vehicular ad hoc network , computer network , scalability , network packet , data collection , wireless ad hoc network , geocast , overhead (engineering) , mobile ad hoc network , packet loss , distributed computing , wireless , telecommunications , statistics , mathematics , database , operating system
Summary Recently, the fast growth of communication technology has led to the design and implementation of different types of networks in different environments. One of these remarkable networks is vehicular ad hoc network (VANET). The ubiquitous connectivity among vehicles is possible through VANET in the absence of fixed infrastructure. Moreover, it provides safety and comfort to people sitting in the vehicles. In this regard, collecting information from vehicles that are moved constantly is an essential challenge. To develop an efficient method for data collection in the VANET, some parameters must be considered such as data aggregation, latency, packet delivery ratio, packet loss, scalability, security, transmission overhead, and vehicle density. Since data collection has a significant importance in the VANET, the aim of this study is to investigate the existing methods and describe the types of important issues and challenging problems that can be addressed in data collection in the VANET. The data collection techniques are investigated in four primary groups, namely, topology‐based, cluster‐based, geocast‐based, and fog‐based. Also, the mentioned parameters are important to compare all of the presented techniques.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here