Social-Based Routing Scheme for Fixed-Line VANET
Abstract
Vehicle Ad hoc NETwork (VANET) routing is facing a lot of challenges, such as efficient and effective message forwarding in the distributed network, as well as exploring and exploiting the movement regularity among vehicles and the social ties among passengers. Oriented to the fixed-line VANET, we propose a social-based routing scheme to enable the efficient and effective message routing among passengers. In the proposed scheme, passengers are divided into different communities based on the Improved K-Clique community detection algorithm (IKC). For determining the forwarding and dropping order of messages, a Social-based Message Buffering scheme at vehicles (SMB) is devised with their closeness and contribution considered. A Bilateral Forwarder Determination method (BFD) is proposed to make the optimal message forwarding, including Intra-Community Forwarder Determination (ICFD) and intEr-Community Forwarder Determination (ECFD). Simulation results show that the proposed scheme has better message delivery ratio and lower network overhead than other existing ones.
Recommended Citation
J. Shi et al., "Social-Based Routing Scheme for Fixed-Line VANET," Computer Networks, vol. 113, pp. 230 - 243, Elsevier, Feb 2017.
The definitive version is available at https://doi.org/10.1016/j.comnet.2016.12.016
Department(s)
Computer Science
Research Center/Lab(s)
Center for High Performance Computing Research
Keywords and Phrases
Ad hoc networks; Network routing; Routing protocols; Transportation; Vehicles; Community; Community detection algorithms; Determination methods; Messages buffering; Movement regularities; Routing; VANET; Vehicle ad-hoc networks; Vehicular ad hoc networks; Fixed-line transportation
International Standard Serial Number (ISSN)
1389-1286
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2017 Elsevier, All rights reserved.
Publication Date
01 Feb 2017
Comments
This work is supported by the National Science Foundation for Distinguished Young Scholars of China under Grant No. 61225012 and No. 71325002; the National Natural Science Foundation of China under Grant No. 61572123.