Multi-target localization algorithm for wireless sensor network

doi:10.1007/s12083-021-01193-4

2021-06-11

PRE

Zhenfang Teng

Ledan Qian *

Jianfei Huang

DOI：10.1007/s12083-021-01193-4

原文链接

原文求助

摘要

En 中文

The location information of sensor nodes plays a vital role in the monitoring activities of wireless sensor networks. The wireless sensor network positioning algorithm based on multi-dimensional scale is very important in the multi-target positioning of wireless sensor network. Based on the analysis of the classic MDS-MAP positioning algorithm, the paper proposes the MDS-MAP(D) positioning algorithm based on Hop-Euclidean. Aiming at the disadvantages that the distributed weighted MDS positioning algorithm cannot adapt to changes in network connectivity, irregular network topology and slow convergence speed, the paper proposes an improved algorithm. The weighting mechanism and neighbor selection mechanism adopted in this paper comprehensively consider the number of 1-hop neighbors, the node's own positioning accuracy and ranging error, and the steepest descent method is introduced to optimize its objective cost function. At the same time, the paper uses the MATLAB simulation platform to simulate and analyze the two improved algorithms proposed in terms of positioning error and topology and compare them with the original algorithm. The simulation results show that the proposed algorithm has good adaptability to irregular and large-scale networks with improved positioning accuracy.

Keyword:

Wireless network sensor

Multi-target positioning algorithm

Hop-Euclidean algorithm

Distributed weighting