An Efficient On-Demand Hierarchical Routing Protocol Based on Autonomous Clustering for Mobile Ad Hoc Networks

In order to make routing efficient for large-scaled ad hoc networks, we have proposed the autonomous clustering scheme and the hierarchical routing called Hi-AODV based on the autonomous clustering. Since, in the current autonomous clustering, a tree rooted at a clusterhead which manages a cluster is constructed for each cluster, data and control packets always pass through the clusterhead in the hierarchical routing and the overhead of the clusterhead becomes much higher. Therefore, in order to reduce the number of data and control packets which each clusterhead handles, this paper proposes an efficient on-demand hierarchical routing protocol based on the autonomous clustering for ad hoc networks