An Energy-Aware On-Demand Clustering Routing Algorithm for Ad Hoc Networks

The more the number of nodes is, the worse the performance of the flat-based routing protocol is in the wireless ad hoc network. And the clustering algorithm based on maximal connectivity ignores the equipoise of network energy, and it affects network lifetime. So, this paper brings forward a self-maintenance clustering algorithm, which takes on-demand flat-based routing mechanism, remnant energy of nodes and their maximal connectivity into account. These simulation results show its validity, and this algorithm improves the scalability, enhances the network performance and prolongs the existence time of the network.