Abstract

Intelligent Transportation System (ITS) in sustainable smart cities are taking advantage of moving vehicle nodes for data communication. VANETs support many applications related to safety, infotainment, and accident detection. The routing protocols are using for data communication in the presence of high mobility nodes and dynamic topologies. Due to high mobility and unpredictable topologies, the data communication becomes unreliable which causes data loss, delay, and link disconnections among vehicle nodes. To address these routing limitations, various types of routing protocols have developed. In all existing routing protocols types, geographic routing protocols are one of the efficient types due to its low overhead processes. Geographical routing protocols are able to handle vehicular environment constraints. However, with many advantages, geographic routing protocols are not considering many constraints of the vehicular environment. Geographical routing protocols should have well-defined routing metrics to deal with high mobility and other data loss and link disconnection issues. This research designs a Beaconless Traffic-Aware Geographical Routing Protocol (BTA-GRP) by considering traffic density, distance and direction for next forwarder node and route selection. The protocol is feasible for urban dense and sparse traffic conditions and addresses delay, disconnection and packet dropping issues. The proposed protocol has simulated with state of the art routing protocols. The simulation results indicated that the proposed protocol has higher performance in VANETs.

Highlights

  • Vehicular Ad hoc Network (VANET), enables the communication between vehicles with or without using any infrastructure which enables drivers to drive safely [1]

  • We conduct this study to design a beaconless geographical protocol to handle the high mobility of vehicle nodes and changing the topologies of VANET

  • Greedy routing in the VANETs causes multiple local minimum events where Greedy Perimeter Stateless Routing (GPSR) uses perimeter mode for recovery, in which a packet crosses from the planner subgraph of connected VANET until success a node that is near to destination than the position that the perimeter mode started at, where greedy forwarding is resumed

Read more

Summary

INTRODUCTION

Vehicular Ad hoc Network (VANET), enables the communication between vehicles with or without using any infrastructure which enables drivers to drive safely [1]. In topology-based routing, the information stores in routing tables These protocols face data communication and delay issues. Various routing issues occur when the source node is near to the destination and its neighbors are far away from the destination In such cases the protocol switches to the perimeter mode which uses the right-hand rule. For solving the aforementioned routing issues, geographical routing uses more appropriate routing metrics including vehicle direction, vehicle speed, road segment, traffic density, distance and intersections [12], [13]. With many advantages of geographical routing protocols, still protocols have packet delay, disconnectivity and throughput issues To overcome these issues, we conduct this study to design a beaconless geographical protocol to handle the high mobility of vehicle nodes and changing the topologies of VANET. The last section concluded the paper with a future direction

MATERIALS AND METHODS
DIRECTION
TDValue TDValue
SCORE FUNCTION FOR ROUTING DECISION
ROUTING PROCESS
PERFORMANCE EVALUATION

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.