A novel self‐adaptive hybrid slime mould naked mole‐rat algorithm for numerical optimization and energy‐efficient wireless sensor network

Author:

Singh Supreet1ORCID,Singh Urvinder1

Affiliation:

1. Department of ECE Thapar Institute of Engineering and Technology Patiala India

Abstract

SummaryA wireless sensor network (WSN) is made up of widely spaced nodes inside the sensor field. Clustering is an effective data collection approach that lowers energy consumption by organizing nodes into groups. So, choosing the right cluster head (CH) and employing an effective routing protocol is required to prolong the lifetime of WSNs. This paper develops a novel self‐adaptive hybrid slime mould naked mole‐rat algorithm (SM‐NMRA) based on the hybridization of the slime mould algorithm (SMA) and naked mole‐rat algorithm (NMRA) to solve the above‐said problem of WSN. The new approach integrates SMA's wrap food abilities with NMRA to improve the working capabilities of the original NMRA. A new stagnation phase inspired by the grey wolf optimizer and cuckoo search algorithms has been integrated to handle the local optima stagnation problem. In addition, self‐adaptivity has been added for SM‐NMRA's parameters. Here, the performance of SM‐NMRA is evaluated for CEC 2005 and CEC 2014 numerical test suites. The statistical outcomes along with Freidman's test, Wilcoxon's rank‐sum test, and convergence profiles validate the superior performance of SM‐NMRA. The proposed clustering protocol for efficient CH selection in WSN using SM‐NMRA outperforms other state‐of‐the‐art techniques with improved network lifespan and reduced energy consumption.

Publisher

Wiley

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Theoretical Computer Science,Software

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3