Grid Based Clustering Technique in Wireless Sensor Network using Hierarchical Routing Protocol

A wireless sensor network (WSN) has significant applications such as monitoring the far environmental and target tracking. This has been enabled by the sensors that are smaller, cheaper, and intelligent. These sensors are equipped with wireless interfaces that can communicated with each other to form a network. The design of a WSN depends significantly on the application, and it must consider factors such as the environment, the application's design objectives, costs, hardware, and system constraints. However, the nodes closer to the sink in the network are overburdened with huge traffic loading known as hot spot problem as the data from the total region are forwarded through them to reach the sink node. As a result, their energy gets consumed quickly and the network is subdivided in to multiple region. This paper aims to study the grid based random clustering and grid based static clustering techniques in WSN and to evaluate the performance and compare between them by via simulation. The results show that grid based static clustering outperforms random clustering in term of throughput by 22%, reduces energy consumption by 30%, and increase residual energy by 20%. Thus, the network lifetime of the WSN will be prolonged.