Adaptive routing protocol for urban vehicular networks to support sellers and buyers on wheels

被引:15
作者
Bhoi, Sourav Kumar [1 ]
Puthal, Deepak [2 ]
Khilar, Pabitra Mohan [3 ]
Rodrigues, Joel J. P. C. [4 ,5 ,6 ,7 ]
Panda, Sanjaya Kumar [8 ]
Yang, Laurence T. [9 ]
机构
[1] Parala Maharaja Engn Coll Govt, Berhampur, Orissa, India
[2] Univ Technol Sydney, Sydney, NSW 2122, Australia
[3] Natl Inst Technol Rourkela, Rourkela, India
[4] Natl Inst Telecommun Inatel, Santa Rita Do Sapucai, MG, Brazil
[5] Inst Telecomunicacoes, Lisbon, Portugal
[6] ITMO Univ, St Petersburg, Russia
[7] Univ Fortaleza UNIFOR, Fortaleza, Ceara, Brazil
[8] Veer Surendra Sai Univ Technol, Burla, India
[9] St Francis Xavier Univ, Antigonish, NS, Canada
关键词
VANET; Routing; Seller-Buyer model; Marketing; AD HOC NETWORKS; DATA DISSEMINATION PROTOCOL; COMMUNICATION; EFFICIENT; ALGORITHM; ROAD;
D O I
10.1016/j.comnet.2018.05.024
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Marketing on wheels is an emerging area of research, where users can buy or sell items using inter vehicular communication and web is not required. For quicker delivery of items, the communication between the vehicles should be faster. In this paper, a routing protocol is proposed for urban vehicular ad hoc network (VANET) to send the messages from the buyer to the seller or vice versa in a minimum time to get faster service. Currently, many routing protocols are proposed for urban environment, which are based on the methods of shortest path, high density, minimum packet forwarding delay, and intermediate junction selection. However, these protocols lack knowledge about the communication gaps generated between the junctions before forwarding the data. In this method, the RSU at the junction calculates a path value for each path to choose the next path. The parameters used for path value calculation are number of network fragments between the junctions, delay to send the data from to other junction, and destination closeness. Then, the path which has a less path value is chosen as the next path. Results show that proposed protocol performs better than the existing city based routing protocols in terms of delay, number of network fragments or gaps encountered, path length, total service time, and packet delivery ratio. At last, the proposed routing protocol is validated by conducting an experiment in a small VANET platform designed in an indoor laboratory environment (https://www.youtube.comiwatch ?v=H3Umg15AAH0). Crown Copyright (C) 2018 Published by Elsevier B.V. All rights reserved.
引用
收藏
页码:168 / 178
页数:11
相关论文
共 54 条
[1]   Prediction-based protocols for vehicular Ad Hoc Networks: Survey and taxonomy [J].
Abdel-Halim, Islam Tharwat ;
Fahmy, Hossam Mahmoud Ahmed .
COMPUTER NETWORKS, 2018, 130 :34-50
[2]   Cooperative Vehicular Networking: A Survey [J].
Ahmed, Ejaz ;
Gharavi, Hamid .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2018, 19 (03) :996-1014
[3]   A New Scalable Hybrid Routing Protocol for VANETs [J].
Al-Rabayah, Mohammad ;
Malaney, Robert .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2012, 61 (06) :2625-2635
[4]  
[Anonymous], 2003, P 4 ACM INT S MOB AD
[5]  
[Anonymous], CS200006 DUK U
[6]  
Bhoi S. K., 2015, WIREL NETW, P1
[7]   A Road Selection Based Routing Protocol for Vehicular Ad Hoc Network [J].
Bhoi, Sourav Kumar ;
Khilar, Pabitra Mohan .
WIRELESS PERSONAL COMMUNICATIONS, 2015, 83 (04) :2463-2483
[8]   Vehicular communication: a survey [J].
Bhoi, Sourav Kumar ;
Khilar, Pabitra Mohan .
IET NETWORKS, 2014, 3 (03) :204-217
[9]   A Content-Based Dissemination Protocol for VANETs: Exploiting the Encounter Probability [J].
Cenerario, Nicolas ;
Delot, Thierry ;
Ilarri, Sergio .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2011, 12 (03) :771-782
[10]   An energy-efficient geographic routing protocol design in vehicular ad-hoc network [J].
Chang, Jian-Ming ;
Lai, Chin-Feng ;
Chao, Han-Chieh ;
Zhu, Rongbo .
COMPUTING, 2014, 96 (02) :119-131