DV-Hop based localization algorithm using node negotiation and multiple communication radii for wireless sensor network

• Published in: Wireless networks Vol. 29; no. 8; pp. 3493 - 3513
• Main Authors: Cao, Yuxiao, Qian, Ying, Wang, Zhen
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.11.2023; Springer Nature B.V
• Subjects: Accuracy; Algorithms; Combinatorial analysis; Communication; Communications Engineering; Computer Communication Networks; Electrical Engineering; Engineering; Hardware; IT in Business; Localization; Mathematical analysis; Negotiations; Networks; Nodes; Original Paper; Particle swarm optimization; Wireless networks; Wireless sensor networks; Wireless sensor network; Multiple communication radii; Binary particle swarm optimization; Localization; Combinatorial optimization problem
• ISSN: 1022-0038; 1572-8196
• DOI: 10.1007/s11276-023-03417-2

Nodes localization has been a critical subject in wireless sensor network (WSN) field. As far as existing localization algorithms are concerned, distance vector hop (DV-Hop) has the advantages of no extra hardware and implementation simplicity, however its localization accuracy cannot meet some specific requirements. In order to enhance the accuracy of WSN nodes localization, a DV-Hop based localization algorithm based on nodes negotiation and multi communication radii (NNMCR DV-Hop) is proposed in this paper. Firstly, the hop counts between WSN nodes is modified from an integer to a decimal by changing communication radius of anchor nodes through nodes negotiation. By refining the hop counts, the accuracy of the estimated distance from the unknown to the anchor nodes is improved. Secondly, the calculation of the average hop size of the anchor node is abstracted into a combinatorial optimization problem which is solved by using binary particle swarm optimization (BPSO) to improve the accuracy of the estimated distance which is between the anchor and the unknown node. Finally, when calculating the coordinates of unknown nodes, only the anchor nodes with smaller hop counts are selected to participate in the calculation. Simulation experiments show that compared with the original DV-Hop as well as other improved algorithms based on DV-Hop, NNMCR DV-Hop greatly improves the localization accuracy of unknown nodes without additional hardware.