SCGR: Self-configuring greedy routing for minimizing routing interrupts in vehicular communication networks

Abstract

Vehicular Ad-Hoc Network (VANET) is a promising technology that enables road-side vehicle-assisted communication between users and infrastructures. The network is dynamic and independent in establishing communication and updating communication routes. Due to the openness of the network, routing, and data traffic handling is a challenging concern as it degrades its performance. In this manuscript, a novel self-configuring greedy routing (SCGR) algorithm is proposed to minimize the impact of congestion and route interrupts. This routing is designed to adapt relay-vehicle communication in the absence of infrastructure. The neighboring vehicles act as a relay in the network for retaining the seamlessness in com. The process of route discovery through a conventional routing protocol is modified with the evaluation of region traffic and neighbor density. Coverage range, distance, and mobility are the factors influencing congestion and routing and therefore, a local fitness evaluation is performed to ensure the lesser impact of the factors over the performance. This fitness function also confines the greedy nature of the routing process and thereby preventing unnecessary route congestion. The performance of the routing algorithm is evaluated through simulation performed using NS2 and SUMO. The performance is assessed using the metrics: end-to-end delay, packet delivery ratio, communication overhead, packet loss ratio and beacon messages.