Internet of Things Energy Efficient Cluster-Based Routing Using Hybrid Particle Swarm Optimization for Wireless Sensor Network

2021 
Specialized transducers in wireless sensor networks that offer sensing services to the internet of things devices have limited storage and energy resources. One of the most vital issues in WSN design is power usage, as it is nearly impossible to recharge or replace sensor nodes’ batteries. A prominent role in conserving power for energy-constrained networks is served by the clustering algorithm. It is possible to reduce network energy usage and network lifespan prolongation by proper balancing of the network load with Cluster Head (CH) election. The single-hop inter-cluster routing technique, in which there is a direct transfer from CHs to the base station, is done by the low energy adaptive clustering hierarchy. However, for networks with large-regions, this technique is not viable. An optimized Orphan-LEACH (O-LEACH) has been proposed in this work to facilitate the formation of a novel process of clustering, which can result in minimized usage of energy as well as enhanced network longevity. Sufficient energy is possessed by the orphan node, which will attempt to cover the network. The proposed work’s primary novel contribution is the O-LEACH protocol that supplies the entire network’s coverage with the least number of orphaned nodes and has extremely high connectivity rates. A hybrid optimization utilizing simulated annealing with Lightning Search Algorithm (LSA) (SA-LSA), and particle swarm optimization with LSA (PSO-LSA) Algorithm is proposed. These proposed techniques effectively manage the CH election achieving optimal path routing and minimization in energy usage, resulting in the enhanced lifespan of the WSN. The proposed technique’s superior performance, when compared with other techniques, is confirmed from the outcomes of the experimentations.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    17
    References
    0
    Citations
    NaN
    KQI
    []