A Novel Cluster-Based Routing Algorithm in Ad Hoc Networks

Abstract

Aimed at the stability of clusters and load balancing, a novel cluster-based routing algorithm is proposed in this paper. In order to maintain the stability of clusters, speed and energy of mobile nodes, but not the identity and connectivity, are taken as the basis of cluster-head election. Try to make all the nodes share the role of cluster-head, so as to balance the traffic loads of the network, and to avoid invalidity caused by certain nodes exhausting energy. Based on clustering, the backbone network composed by cluster-heads, gateways, and compound gateways is constructed, which reduces the complexity of maintaining routing information and topology information, and simplifies the routing process in large hierarchical ad hoc networks. Simulation results show that compared to the lowest ID and largest connectivity algorithms, it has better performance on network life duration, energy consumption, and signaling overhead.