Energy Efficient Grid Based Clustering and Routing Algorithms for Wireless Sensor Networks

Energy conservation of the sensor nodes is the most important issue that has been studied extensively in the design of wireless sensor networks (WSNs). In many applications, the nodes closer to the sink are overburdened with huge traffic load as the data from the entire region are forwarded through them to reach to the sink. As a result, their energy get exhausted quickly and the network is partitioned. This is commonly known as hot spot problem. In this paper, we address the hot spot problem and present grid based clustering and routing algorithms by considering the energy efficiency of the WSN. The algorithms are tested with various scenarios of WSN and experimental results show that the proposed algorithms perform better than the existing ones in terms of network life time, energy consumption and number of dead sensor nodes.