Numerical Simulation and Design of Memetic Algorithm based Improved LEACH for Energy Efficiency and Lifetime Improvement of Wireless Sensor Network
Abstract
In recent years, the deployment of wireless sensor networks (WSNs) has gotten a lot of interest. Given the limited energy available to sensor nodes, it is critical to design WSNs that are energy efficient. Sensing network coverage, on the other hand, could be beneficial. After WSNs are activated, they gradually degrade over time. When it comes to mission-critical applications. As a result, energy-efficient coverage control should be considered to help support the WSNs' quality of service (QoS). Coverage-controlling methods are usually present. A few difficult problems like resolving conflicts while figuring out which nodes to use to save energy, they should be turned off and creating an optimal wake-up method that ensures no more nodes are awakened than are required. We use an energy-efficient method in this work. Using a Memetic Algorithm (MA)-based coverage control in cluster-based WSNs. Memetic algorithm based improvement in LEACH is a technique to resolving difficult situations. The algorithm is made up of two optimization strategies: a sensor node MA-based scheduling and a wake-up scheme who are in charge of extending the network's lifespan while maintaining coverage preservation. The MA-based schedule is applied to a specific WSN in order to avoid wasting resources. The redundant nodes consume a lot of energy. The nodes are responsible for the network's operation. The proposed algorithm performance was evaluated on a cluster based WSN (CWSN) with either a random or uniform sensor node deployment. The performance of the combination of MA with wake-up scheme is superior to that of certain existing techniques, according to simulation data. Furthermore, the proposed algorithm can monitor the required sensing area with fewer sensor nodes activated. The wake-up strategy reawakens sleeping sensor nodes in order to fill the coverage gap left by dead sensor nodes.
