Abstract
In Wireless Sensor Networks (WSNs), sensors are deployed in a specific region to sense the environment’s physical parameters. After sensing, data is processed and sent to the base station through a given route. Sensing and transmitting nodes consume a lot of energy; hence nodes die quickly; therefore, hot spot problems occur. Henceforth, data transmission is done by a single route; thus, WSNs experience network overhead problems. Nowadays, the enhancement of the energy of WSNs remains a challenging issue. Alternatively, efficient processes such as routing or clustering may be improved. Dynamic cluster head selection can be considered an important decision approach for optimal path selection and saving energy. This paper proposes a Meta-heuristic Optimized Cluster head selection-based Routing algorithm for WSNs (MOCRAW) to minimize node’s energy consumption and fast data transmission. MOCRAW removes isolated nodes or hot-spot problems and provides loop-free routing with the help of the Dragonfly Algorithm (DA), wherein the decision is based on Local Search Optimization (LSO) and Global Search Optimization (GSO). This protocol exploits two sub-processes: the optimal Cluster Head Selection Algorithm (CHSA) and Route Search Algorithm (RSA). CHSA uses Energy Level Matrix (ELM). ELM is based on node density, residual energy, the distance between Cluster Head (CH) and Base Station (BS), and inter-cluster formation. The inter-cluster discovers the optimum path between source to destination in RSA by levy distribution. MOCRAW performance is compared with other clustering and routing protocols on parameters such as the number of alive nodes, delay, packet delivery ratio, and average energy consumption. Simulation-based findings exhibit that the proposed methodology surpasses its peers and competitors in terms of energy efficiency.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.