An urban location service for vehicular area networks. (25th May 2018)

• Record Type: Journal Article
• Authors: Nebbou, Tawfiq; Lehsaini, Mohamed; Fouchal, Hacène; Ayaida, Marwane
• Other Names: Li Gang guestEditor.; Batten Lynn guestEditor.; Foschini Luca guestEditor.; Kim Hyunbum guestEditor.; Dong Fang guestEditor.; Wu Chenshu guestEditor.; Gao Shangce guestEditor.
• Is Part Of: Concurrency and computation. Volume 31:Number 24(2019)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2018-05-25
• Subjects: geographic routing protocols -- location‐based services -- mobility -- simulation -- VANETs; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4693
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Position‐based routing, also called geographic routing, is widely recognised as an efficient routing approach for highly dynamic and mobile networks as vehicular ad hoc networks (VANETs). In this kind of networks, the high‐speed mobility of vehicles causes rapid changes on the network topology measured with vehicles density, limited‐time communication links, link failures, etc. In the meantime, the need of location service is a key issue; indeed, it will allow finding the position of a target node in order to reach it with a message. Some theoretical studies have proposed location services based on sharing nodes informations in different ways with hierarchy mechanism or with distribution mechanism or with centralization process. This paper proposes a location service deployed on RSUs (Road Side Units) for unicast routing over VANETs in urban environment. The proposed approach is able to measure the connectivity of a route. We propose then a new metric called Link Connectivity (LC) which measures this connectivity. Additionally, we have implemented our proposal using OMNET++ simulator and we have conducted extensive simulations with various scenarios to evaluate its scalability and robustness against frequent topology changes. As a conclusion, the proposed mechanism provides significant performance improvements in terms of packet delivery ratio, end‐to‐end delay, and overhead when it is compared to some other known proposals.