中圖分類號： TP393 文獻標(biāo)識碼： A DOI：10.16157/j.issn.0258-7998.222633 中文引用格式： 劉芷珺，張玲華. 基于鄰域搜索粒子群算法的節(jié)點定位算法研究[J].電子技術(shù)應(yīng)用，2022，48(9)：97-102. 英文引用格式： Liu Zhijun, Zhang Linghua. Research on node location algorithm based on neighborhood search particle swarm optimization algorithm[J]. Application of Electronic Technique，2022，48(9)：97-102.
Research on node location algorithm based on neighborhood search particle swarm optimization algorithm
Liu Zhijun1，Zhang Linghua2
1.College of Communication and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China; 2.Jiangsu Engineering Research Center of Communication and Network Technology, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
Abstract： In view of the large error of DV- Hop positioning algorithm, after in-depth analysis of the source of positioning error, IDVHop-NSPSO algorithm based on Particle Swarm Optimization was presented on the basis of in-depth analysis of the source of positioning error of DV-Hop algorithm. The algorithm improves the precision of DV-Hop through the improvements on three parts. Firstly, half jump is added refining the minimum hop.Secondly, the weight coefficient is introduced to calculate the average jump distance to make the calculated jump distance more accurate. Thirdly, neighborhood search particle swarm optimization algorithm is used instead of least square method to calculate the location of unknown nodes.The simulation results show that compared with DV-Hop, DV-Hop+PSO and simulated annealing weighted DV-Hop algorithm, IDVHop-NSPSO algorithm can significantly improve the positioning accuracy without significantly increasing the computing resources.
