A Uniformly Distributed Adaptive Clustering Hierarchy Routing Protocol

Energy efficiency is one of the most important considerations in wireless sensor networks. In a clustered sensor network, some of the nodes become cluster heads. They aggregate the data from their cluster members and transmit it to the base station. In this paper, we propose a uniformly distributed adaptive clustering hierarchy routing protocol (UDACH). Unlike LEACH and LEACH-C, our protocol is based on energy equilibrium instead of choosing cluster heads randomly. We divide the protocol into three stages: cluster construction, building a cluster head tree, and sending data. In cluster construction stage, cluster heads are elected and each node identifies its cluster head. In the stage of building a cluster head tree, the tree is created based on the weight of each cluster head. And the weight is inversely proportional to the distance from the base station to the node. In the last stage, each cluster member collects the data and sends it to the base station by its cluster head. Our proposed protocol is simulated and compared with LEACH and LEACH-C. The simulation result shows that UDACH has better performance in network lifetime and energy expense than LEACH and LEACH-C.