Improving wireless sensor network lifetime using layering in hierarchical routing
Ali Sedighimanesh, Mohammad Sedighimanesh, Javad Baqeri
Abstract
Ali Sedighimanesh, Mohammad Sedighimanesh, Javad Baqeri
Abstract
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.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Computer network, Computer science, Wireless sensor network, Energy consumption, Default gateway, Distributed computing, Bandwidth (computing), Routing protocol