Divisive Clustering Based Data Forwarding Approach in Vehicular Ad hoc Networks

Abstract

VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. In VANET, the possible occurrence of link breakage event is unknown and unpredictable. In a packet forwarding event, one node could select a next forwarder from its neighbors. The neighbor node that was in the transmission range at the moment, but at the edge, could already have left this range and, choosing this neighbor as next forwarder will lead to low packet delivery, increased packet delay, and increased routing overhead. In this paper, we propose HCBGR (Hierarchical Clustering Based Greedy Routing), a greedy position based routing approach which uses weighted score based strategy for reliable and efficient packet forwarding. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. The simulation results using ns 2.33 show that routing overhead is reduced considerably compared to Greedy Perimeter Stateless Routing Protocol (GPSRP) and Predictive Directional Greedy Routing Protocol (PDGRP) of VANET. The simulation results show that HCBGR had overcome the limitations of PDGRP and GPSRP in VANET environment.