An Improved Energy Efficient Routing Through A Rotated and Polled Clustering Protocol (GCRCHS) in WSN

Abstract

Wireless sensor networks have been gaining widespread significance both in terms of research as well as its widespread utility due to its immense potential that could be effectively harnessed for a number of remote applications which include monitoring and surveillance followed by control. Nodes form the backbone for any wireless sensor network and are provided with limited power and processing capabilities. These nodes sense the information from source and relay them to the destination or base station. Routing is an integral part of any WSN implementation as it defines the flow of data path from source to destination in an optimal manner. Clustering have been researched actively in recent times due to their inherent ability to drastically reduce the network complexity by grouping them based on some similarity measure. The issue of clustering has been effectively utilized in this research paper by proposing a partition based clustering and rotated clustering policy based routing mechanism for a typical wireless sensor network. This algorithm has been compared against benchmark techniques such as LEACH, C-LEACH, E-LEACH and HEED protocols which are a class of hierarchical routing methods. Performance comparison with respect to network lifetime justifies the superiority of the proposed GCRCHS (graph cut rotated cluster head selection model) over the other techniques.

 Keywords: Wireless sensor networks, Clustering, network lifetime, Dead time analysis.