Evenly Distributed Clusters over a Target Area of Wireless Sensor Network

Abstract

Wireless sensor networks (WSNs) finds wide applications in various fields. The most important problem faced by these networks is low lifetime. These are generally battery powered devices with ability to communicate with each other. Networks should be designed so that load is equally distributed among the nodes. In WSNs maximum load is on nodes being cluster heads, so for proper load distribution various nodes should get chance of becoming cluster head. Further entire network should have proper connectivity that is clusters should be evenly distributed throughout the network. To achieve this paper discusses algorithm to get dominating sets in a fully connected network. Dominating sets ensure that either a node is a cluster head or is adjacent to a cluster head. This leads to even distribution which may increase the lifespan of entire network. Not much attention has been given to even distribution of clusters. WSNs consists of spatially distributed nodes over a target area with sensing and communication facility. Purpose of these nodes is to study the entire area and communicate their observation to the central base station. This work presents an idea to form evenly distributed clusters. Even distribution in necessary for proper load sharing and prolonging the life of network. It needs much more emphasis than given to it. Further Ranking methodology has been discussed to rank the dominating sets based on certain parameters. This ranking methodology is used to determine which dominating set should become cluster heads ensuring even distribution. Ranking methodology comes into play if more than one dominating sets are obtained. These may be used where it is difficult for humans to physically visit on a regular basis. High lifetime of network ensures less physical presence of humans.