Clustered-Based Approach for Energy Efficient Routing in Wireless Sensor Networks

Abstract

A vast variety of tiny and low-value detector nodes form up Wireless Sensor Networks (WSNs) that runs by non-reversible and non-rechargeable batteries and equipped with a variety of sensing devices. Cluster-based approaches guide in reducing the power consumption in WSNs and increase the life span. Sensor nodes in WSNs are often dispersed across a sensor field, which is an area or region where the sensor nodes are available or distributed. The processing power, memory, and battery life of these nodes are all constrained. Each of those distributed nodes has the power to accumulate and route information back to the stationary or mobile base stations, and the nodes in these networks work along to present high-quality information. The main goal of this study is to improve the LEACH (Low Energy adaptive bunch Hierarchy) method ranked routing ought to be examined for 2 reasons. One, device networks area unit dense, requiring a high level of redundancy in communication. Second, to extend the device network’s scalability whereas maintaining communication security. to enhance the potency of the LEACH protocol, this endeavor simulates the LEACH routing protocol in MATLAB then implements the I-LEACH routing protocol to make sure that the chosen cluster heads area unit equally distributed over the network. The results were then evaluated for usefulness in wireless sensor networks based on energy consumption, average lifetime, and average throughput. It also outperforms LEACH, in terms of network throughput.