Singh Supreet, Singh Urvinder, Mittal Nitin, Gared Fikreselam
Department of ECE, Thapar Institute of Engineering and Technology, Patiala, India.
Department of CSE, Faculty of Engineering and Technology, SGT University, Gurugram, India.
Sci Rep. 2024 Jan 10;14(1):1040. doi: 10.1038/s41598-024-51218-0.
Naked mole-rat algorithm (NMRA) is a swarm intelligence-based algorithm that draws inspiration from the mating behaviour of mole rats (workers and breeders). This approach, which is based on the ability of breeders to reproduce with the queen, has been utilized to tackle optimization problems. The algorithm, however, suffers from local optima stagnation problem and a slower rate of convergence in order to provide gobal optimal solution. This study suggests attraction and repulsion strategy based NMRA (ARNMRA) along with self-adaptive properties to avoid trapping of solution in local optima. This strategy is utilized to create new breeder rat solutions and mating factor [Formula: see text] is made self-adaptive using simulated annealing (sa) based mutation operator. ARNMRA is evaluated on CEC 2005 numerical benchmark problems and found to be superior to other algorithms, including well-known ones like selective operation based GWO (SOGWO), opposition based laplacian equilibrium optimizer (OB-L-EO), improved whale optimization algorithm (IWOA), success-history based adaptive DE (SHADE) and original NMRA. Further, according to experimental results, the performance of ARNMRA is likewise superior to the NMRA for the CEC 2019 and CEC 2020 numerical problems. Convergence profiles and statistical tests (rank-sum test and Friedman test) are employed further to validate the experimental results. Moreover, this article extends the application of ARNMRA to address the data gathering aspect in mobile wireless sensor networks (MWSNs) with the goal of prolonging network lifetime and enhancing energy efficiency. In this MWSN-based protocol, a sensor node is elected as a cluster head based on factors like mobility, residual energy, and connection time. The protocol aims to maximize the system lifetime by efficiently collecting data from all sensors and transmitting it to the base station. The study emphasizes the significance of considering dynamic node densities and speed when designing effective data-gathering protocols for MWSNs.
裸鼹鼠算法(NMRA)是一种基于群体智能的算法,它从鼹鼠(工鼠和繁殖鼠)的交配行为中获得灵感。这种基于繁殖鼠与鼠后的繁殖能力的方法已被用于解决优化问题。然而,该算法存在局部最优停滞问题和收敛速度较慢的问题,难以提供全局最优解。本研究提出了基于吸引和排斥策略的NMRA(ARNMRA)以及自适应特性,以避免解陷入局部最优。该策略用于创建新的繁殖鼠解,并使用基于模拟退火(sa)的变异算子使交配因子[公式:见原文]自适应。在CEC 2005数值基准问题上对ARNMRA进行了评估,发现它优于其他算法,包括基于选择性操作的灰狼优化算法(SOGWO)、基于反对的拉普拉斯平衡优化器(OB-L-EO)、改进的鲸鱼优化算法(IWOA)、基于成功历史的自适应差分进化算法(SHADE)和原始的NMRA等著名算法。此外,根据实验结果,ARNMRA在CEC 2019和CEC 2020数值问题上的性能同样优于NMRA。进一步采用收敛曲线和统计检验(秩和检验和弗里德曼检验)来验证实验结果。此外,本文将ARNMRA的应用扩展到移动无线传感器网络(MWSN)的数据收集方面,目的是延长网络寿命并提高能源效率。在这个基于MWSN的协议中,根据移动性、剩余能量和连接时间等因素选择一个传感器节点作为簇头。该协议旨在通过有效地从所有传感器收集数据并将其传输到基站来最大化系统寿命。该研究强调了在为MWSN设计有效的数据收集协议时考虑动态节点密度和速度的重要性。