Ali Sedighimanesh - Department of Electrical, Computer and IT Engineering Islamic Azad University of Qazvin
Mohammad Sedighimanesh - Department of Electrical, Computer and IT Engineering Islamic Azad University of Qazvin
Javad Baqeri - Department of Electrical, Computer and It Engineering Islamic Azad University of Qazvin

Wireless sensor networks are extremely limited in terms of resources. Resource limitation includes limited energy rate, short range communication, low bandwidth, limited memory capacity and processing in every single sensor. Therefore, it is essential to use routing algorithms which lead to energy consumption reduction and suitable bandwidth efficiency. The proposed algorithm layered the sensor network environment through a specific mechanism and determined the optimal number of cluster heads. After determining the cluster head, each cluster head began recruiting using topology control mechanism, except the first layer (the layer near to base station) in which nodes function as gateway nodes. The cluster heads of lower layers sent information to the cluster heads of their upper layer. In this paper, the proposed algorithm is compared with known algorithms including ELEACH and LEACH. The results suggest that in terms of network lifetime increase, the proposed algorithm has better performance in comparison with ELEACH and LEACH protocols.

Wireless sensor networks, lifetime, Hierarchical clustering, Hierarchical routing, cluster topology