Energy Balancing Through Cluster Head Selection Using K-Theorem in Homogeneous Wireless Sensor Networks

This is the latest version of this item.

The objective of this paper is to increase life time of homogeneous wireless sensor networks (WSNs) through minimizing long
range communication and energy balancing. Sensor nodes are resource constrained particularly with limited energy that is difficult o r
impossible to replenish. LEACH (Low Energy Adaptive Clustering Hierarchy) is most well -known cluster based architecture for WSN that aims
to evenly dissipate energy among all sensor nodes. In cluster based architecture, the role of cluster head is very c rucial for the successful
operation of WSN because once the cluster head becomes non functional, the whole cluster becomes dysfunctional. We have proposed a modified
cluster based WSN architecture by introducing a coordinator node (CN) that is rich in term s of resources. This CN take up the responsibility of
transmitting data to the base station over longer distances from cluster heads. We have proposed a cluster head selection algorithm based on K -
theorem and other parameters i.e. residual energy, distance to coordinator node, reliability and degree of mobility. The K -theorem is used to
select candidate cluster heads based on bunch of sensor nodes in a cluster. We believe that the proposed architecture and algorithm achieves
higher energy efficiency through minimizing communication and energy balancing. The proposed architecture is more scalable and proposed
algorithm is robust against even/uneven node deployment and node mobility.