An efficient clustering algorithm for spatially correlated sensor network

A wireless sensor network is comprised of self organized sensor nodes which are distributed in a particular area to collect, process and transmit the acquired data from the physical environment. Since, sensor nodes are battery powered devices with limited processing and transmission power, energy consumption is a serious issue in system designs of WSNs. The main goal of WSN is the reliable detection and accurate evaluation of events in the monitoring area. For this purpose sensor nodes are deployed densely that will cause overlapping of sensor nodes sensing area and redundant data transmission to the sink node hence sensor node will consume large amount of energy. In order to avoid the redundant transmission of data to the sink many number of correlation based data aggregation methods are developed in WSN. In the proposed work the nodes are clustered by a threshold range calculated from the average value of the acquired data to reduce the data redundancy between the nodes and implements a schedule based data transferring to avoid collision. In addition, the cluster head rotation happens whenever its energy drops below a dynamic threshold value computed by the algorithm.