Mohar Satinder Singh, Goyal Sonia, Kaur Ranjit
Department of Electronics and Communication Engineering, Punjabi University Patiala, Punjab, India.
J Supercomput. 2022;78(9):11975-12023. doi: 10.1007/s11227-022-04320-x. Epub 2022 Feb 22.
Wireless sensor networks (WSNs) contain sensor nodes in enormous amount to accumulate the information about the nearby surroundings, and this information is insignificant until the exact position from where data have been collected is revealed. Localization of sensor nodes in WSNs plays a significant role in several applications such as detecting the enemy movement in military applications. The major aim of localization problem is to find the coordinates of all target nodes with the help of anchor nodes. In this paper, two variants of bat optimization algorithm (BOA) are proposed to localize the sensor nodes in a more efficient way and to overcome the drawbacks of original BOA, i.e. being trapped in local optimum solution. The exploration and exploitation features of original BOA are modified in the proposed BOA variants 1 and 2 using improved global and local search strategies. To validate the efficiency of the proposed BOA variants 1 and 2, several simulations have been performed for various numbers of target nodes and anchor nodes, and the results are compared with original BOA and other existing optimization algorithms applied to node localization problem. The proposed BOA variants 1 and 2 outperform the other algorithms in terms of mean localization error, number of localized nodes and computing time. Further, the proposed BOA variants 1 and 2 and original BOA are also compared in terms of various errors and localization efficiency for several values of target and anchor nodes. The simulations results signify that the proposed BOA variant 2 is superior to the proposed BOA variant 1 and existing BOA in terms of several errors. The node localization based on the proposed BOA variant 2 is more effective as it takes less time to perform computations and has less mean localization error than the proposed BOA variant 1, BOA and other existing optimization algorithms.
无线传感器网络(WSNs)包含大量传感器节点,用于收集周围环境信息,而在揭示数据收集的确切位置之前,这些信息并无实际意义。无线传感器网络中传感器节点的定位在多种应用中发挥着重要作用,比如在军事应用中探测敌方行动。定位问题的主要目标是借助锚节点找到所有目标节点的坐标。本文提出了蝙蝠优化算法(BOA)的两种变体,以便更高效地定位传感器节点,并克服原始BOA的缺点,即陷入局部最优解。在所提出的BOA变体1和2中,使用改进的全局和局部搜索策略对原始BOA的探索和利用特性进行了修改。为了验证所提出的BOA变体1和2的效率,针对不同数量的目标节点和锚节点进行了多次仿真,并将结果与原始BOA以及应用于节点定位问题的其他现有优化算法进行了比较。在所提出的BOA变体1和2在平均定位误差、定位节点数量和计算时间方面优于其他算法。此外,还针对目标节点和锚节点的几个值,在所提出的BOA变体1和2以及原始BOA之间比较了各种误差和定位效率。仿真结果表明,在所提出的BOA变体2在多种误差方面优于所提出的BOA变体1和现有BOA。基于所提出的BOA变体2的节点定位更有效,因为它执行计算所需的时间更少,并且平均定位误差比所提出的BOA变体1、BOA和其他现有优化算法更小。