Energy efficient clustering algorithm for WSN

Abstract

Wireless Sensor Networks (WSNs) in recent years have become prominent research areas with an immense effect on practical application developments. It consist of huge quantity of minute sensor nodes connected all the way through wireless medium that are used for sensing the environment and collecting information correctly. Due to resource constrained environment of sensor nodes, a number of issues have come out; network connectivity and energy consumption are the significant topic of concern. From power consumption perspective in Wireless Sensor Networks (WSNs), path routing for nodes is a difficult and tricky task. Clustering techniques in routing protocols play a crucial role to increase the stability and network lifetime. To reduce the energy consumption and increase the network connectivity, we proposed a novel routing algorithm for WSNs. The proposed routing algorithm is based on static clustering concept and dynamic cluster heads (CHs) selection technique, which divides the entire network area into a number of fixed regions. CHs are selected on the basis of residual energy, degree (number of surrounding nodes) and the distance of the sensor node from the sink. Simulation results show that our protocol outperform its counterpart routing protocols LEACH, LEACH-C and DR protocol in terms of network connectivity and power consumption.