Abstract

Vehicular AdHoc networks (VANETs) allow connectivity in dispersed vehicle environments and other difficult access areas, where conventional network systems are not satisfactory. One of the most significant technical challenges faced in implementing VANET is designing an efficient routing protocol that can provide a reliable path between the source and destination of the information. This paper discusses a routing scheme that incorporates the control strategy for transmitting messages and Global Navigation Satellite System (GGNS) information to optimize network routing. This scheme uses geolocation information to select the best path to forward the messages. To simulate communication in real-life scenarios, we used the Simulation of Urban MObility (SUMO) and Network Simulator-version 3 (NS-3) platform to compare our proposed algorithm to the traditional routing protocols scenarios when the number of source-destination pairs varies. Our results show that the proposed NAV2V algorithm can decrease the packet loss rate, end-to-end delay, and enhance network efficiency.

Highlights

  • The fundamental requirement for the future of vehicular communication is that the network arrangement is to be done in an autonomous, intelligent, and optimized way to forward the information among themselves without needing infrastructure

  • We examine and analyze the performance of four routing algorithms for Vehicular AdHoc networks (VANETs): AdHoc On-demand Distance Vector (AODV), Destination Sequenced DistanceVector Routing (DSDV), the Optimized Link State Routing, Protocol (OLSR) and Greedy Perimeter Stateless Routing (GPSR), because they are the most used and researched in AdHoc communication in vehicular networks today

  • We present additional methods to improve the performance of our proposed algorithm, including (1) Using information from the position of neighboring nodes to make the selection of the best path and try to avoid nodes that do not connect to the final destination, to avoid loops of packages; (2) Selection of the best path, using a modified shorter distance algorithm, which takes time as the main weight and (3) We compare the performance of our proposed Navigation Assisted V2V Routing Protocol (NAV2V) with traditional protocols, analyzing the performance metrics, such as packet loss rate, end-to-end delay, and network performance

Read more

Summary

INTRODUCTION

The fundamental requirement for the future of vehicular communication is that the network arrangement is to be done in an autonomous, intelligent, and optimized way to forward the information among themselves without needing infrastructure. The vehicles are mobile nodes linked in a wireless set through AdHoc systems These nodes are not displayed the information can pass through multiple intermediate nodes to assist routing protocols [2]. These moving cars are utilized as routers to provide a reliable mobile communication structure among the vehicles [3]. An optimized routing protocol scheme is proposed to reduce packet transfer times which can be used for faster communication in a real environment, analyzed in a network simulator

Methods
RELATED WORK
Vehicle Position and Route
A PROPOSED NAV2V ROUTING SCHEME
Position Information
Algorithm
Short Path Temporal Algorithm - SPT
SIMULATED ENVIRONMENT
RESULTS AND DISCUSSION
Obstacle Model
CONCLUSION
Full Text
Published version (Free)

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