版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Department of Computer Science of Chosun University Gwangju61452 Korea Republic of School of Electrical Engineering and Computer Science Gwangju Institute of Science and Technology Gwangju61005 Korea Republic of College of Electrical & Mechanical Engineering National University of Sciences and Technology Islamabad Pakistan School of Electrical Engineering Korea Advanced Institute of Science and Technology Daejeon34141 Korea Republic of
出 版 物:《arXiv》 (arXiv)
年 卷 期:2024年
核心收录:
摘 要:This paper presents a novel approach to deal with the cooperative localization problem in wireless sensor networks based on received signal strength measurements. In cooperative scenarios, the cost function of the localization problem becomes increasingly nonlinear and nonconvex due to the heightened interaction between sensor nodes, making the estimation of the positions of the target nodes more challenging. Although most of existing cooperative localization algorithms assure acceptable localization accuracy, their computational complexity increases dramatically, which may restrict their applicability. To reduce the computational complexity and provide competitive localization accuracy at the same time, we propose a localization algorithm based on the differential evolution with multiple populations, opposite-based learning, redirection, and anchoring. In this work, the cooperative localization cost function is split into several simpler cost functions, each of which accounts only for one individual target node. Then, each cost function is solved by a dedicated population of the proposed algorithm. In addition, an enhanced version of the proposed algorithm which incorporates the population midpoint scheme for further improvement in the localization accuracy is devised. Simulation results demonstrate that the proposed algorithms provide comparative localization accuracy with much lower computational complexity compared with the state-of-the-art algorithms. Copyright © 2024, The Authors. All rights reserved.