Clustering technique for Wireless Sensor Network

Wireless Sensor Network (WSN) consists of small nodes with sensing, computation, and communications capabilities. Sensor node senses the data and sends data to the base station for further processing. These sensor nodes mainly rely upon batteries for energy, which get drained at a quicker rate due to the computation and communication and this decreases the lifetime of the network. In order to solve this problem, various clustering techniques are introduced to improve the lifetime of WSN. Clustering has turned out to be a powerful approach for formulating the network into a linked hierarchy. The main goal of clustering algorithms is to gather and aggregate data in an energy efficient manner so that network lifetime is enhanced. In our proposed algorithm cluster head (CH) selection is carried out using distance between nodes and energy of the nodes. They are selected in such a way that, the distance between them is maximum and energy of the selected CH is more. All the cluster heads send data to the CH located closer to the BS and in turn, it aggregates and transmits data to the Base Station (BS).