Novel Multi-hop Routing Algorithm Based on Uneven Clustering

Abstract

Aiming at the deficiency like unbalanced cluster-head distribution, rebounded amount of cluster-head, and ignorance of the residual energy of sensor nodes competing for cluster-heads caused by LEACH (Low Energy Adaptive Clustering Hierarchy) algorithm using random probability rotation to choose clusterheads, a novel multi-hop routing algorithm based on uneven clustering(MRAUC) is proposed. The problem of energy hole which caused by uneven clustering multi-hop routing is eased via adopting optimized cluster radii, and the idea of fixed partition is introduced to ensure the stable distribution and constant number of cluster-heads. In addition, residual energy and geographic locations of sensor nodes are fully taken into account in choosing cluster-heads. Furthermore, the framework of node chain consists of the innermost cluster-heads is proposed to alleviate the energy load of cluster-heads near sink node. The experiments show that MRAUC have outstanding performance in terms of network lifetime, the balance of node load and network energy consumption.