Energy aware unequal clustering algorithm with multi-hop routing via low degree relay nodes for wireless sensor networks

Abstract

The nodes in wireless sensor networks contain limited energy resources, so the node’s energy should be astutely utilized. Clustering is an effective approach to lessen the energy utilization that enhances the network’s lifespan. In the clustering approach, nodes near the BS also have to relay the data traffic of the upper layer’s clusters. Therefore nodes near to BS deteriorate their energy hastily. That causes the early demise of these nodes and creates the energy holes. In this paper, we proposed an energy-aware unequal clustering algorithm (EAUCA) to diminish the energy holes and enhance the network’s lifetime. The proposed EAUCA creates the unequal sized clusters in such a way that clusters in the base station vicinity are smaller than the farthest. The competition radius to divide the network into unequal clusters is decided by considering the node’s residual energy and distance to the base station. The cluster heads are selected based on remaining energy and a node’s degree in a competition radius. In the inter-cluster data forwarding, the role of relay node and cluster head is also detached, which reduces the data traffic load of the cluster head nodes. The nodes with low node’s degree relay the inter-cluster traffic to the base station. The performance of the proposed EAUCA is analyzed with the aid of the Matlab tool and compared with the existing three URBD, EAUCF, and EEUC unequal clustering protocols along with the LEACH protocol. The result demonstrates that the proposed EAUCA effectively addresses the energy hole issue and significantly enriches the network’s lifetime.