Energy Minimization Using Cluster-Based Approach In Wireless Sensor Network

Abstract

A wireless sensor network (WSN) consists of a set of mobile nodes, which are small energy-consumed devices. The effective use of energy in mobile nodes is the most ideal standard for extending the life of WSN. Therefore, designing an effective route to reduce energy consumption is an important factor. Mostly the existing routing protocols in WSN do not completely turn off the radio frequency. This results in increase in energy consumption. LEACH (Low Energy Adaptive Cluster Hierarchy) is a cluster-based protocol in which non-cluster head nodes will completely turn off their RF until their pre-allocated time slots. However, LEACH has a shortcoming, that is, due to the random rotation of its local Cluster Head (CH); the clusters are not uniformly distributed. To overcome this problem, K-means algorithm is used, which divide the network area into equal parts. For route formation between the source and the destination node LEACH as hierarchy routing protocol is used. Later on, the concept of AI is also introduced to find the dead and the failure node within the route. The performance is examined in MATLAB simulator. The resultant outputs are observed at different nodes ranges from 20 to 100. The results reveals that the concept of ANN with K-means and LEACH performed better and we obtained better results in terms of quality of service parameters. These include energy consumption, delay, throughput, and Packet Delivery Ratio (PDR). To show the efficiency of the proposed technique comparison between proposed and existing approach has also been presented, which reveals that energy upto 25.17 % has been saved compared to existing OK-means approach.