Hierarchical Clustering Based Greedy Routing in Vehicular Ad Hoc Networks

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.

Provided by: EuroJournals Topic: Mobility Date Added: Dec 2011 Format: PDF

Find By Topic