Document Type: Research Paper
Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran
Department of Electrical Engineering, Ilam Branch, Islamic Azad University, Ilam, Iran
Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks. In this paper, a new routing algorithm based on a hierarchical clustering is proposed for these networks. In each level of this hierarchical clustering, the appropriate nodes are selected as cluster heads and then formed the clusters. The proposed algorithm is distributed and selects cluster heads and forms the clusters with the smallest number of the control messages. Moreover, while clustering is performed, an efficient routing among cluster heads towards the sink is created which does not need sending any more control messages in the network. Simulation results show that the proposed algorithm has better performance than other similar algorithms.