Abstract

Recently, continued advances in wireless communication technologies have enabled the deployment of large-scale wireless sensor networks (WSNs). A key concern in the design and development of such WSNs is energy consumption. The hierarchical clustering algorithm is a kind of a technique which is used to reduce energy consumption. It can also increase the scalability, stability, and network lifetime. In some clustering schemes, the communication between a sensor node and its designated cluster head (CH) is assumed to be single-hop. However, multihop communication is often required when the communication range of the sensor nodes is limited or the number of sensor nodes is very large in a network. In this paper, we propose a distributed, randomized, multi-hop clustering algorithm to organize the sensor nodes in a WSN into clusters. The data collected by each sensor node communicate with their respective CHs by using multi-hop communication. The selected CHs collect data from member nodes in their respective clusters, aggregate the data, and send it to a base using multi-hop communication. Simulation results show that proposed algorithm efficiently mitigates the hot spot problem in heterogeneous WSN and achieves much improvement in network lifetime and load balance compared to the existing algorithms.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call