Secure Hierarchical VANETs

Routing in Vehicular Ad-hoc Networks (VANETs) is a complex task due to high mobility. In such cases, short lived routes need to be established, without any prior knowledge about the network topology. Approaching routing for the unpredictable traffic conditions of unplanned cities requires quick node discovery and validation. Moreover, geographic routing gives faster relay selection. The proposed approach includes these two features along with a circular search ensuring wider coverage. Proper radio propagation model with more than two rays need to be implemented for an irregular terrain and to limit the losses due to different elevation of roads. Data redundancy plays a vital role in reducing the losses that might be caused due to misbehaving nodes or failure of a node.