Heuristic Localization Algorithm with a Novel Error Control Mechanism for Wireless Sensor Networks with Few Anchor Nodes

الملخص EN

A novel iterative localization algorithm with high accuracy and low anchor node dependency for large-scale wireless sensor networks is proposed in this paper.

At each iteration, blind nodes are located using a weighted linear least squares-based algorithm.

To prevent errors in the blind nodes from propagating and accumulating throughout the network, an anchor geometric feature-based error control mechanism is used to select the nodes that participate in the localization and to estimate the localization confidence.

The simulation results show that the algorithm can be used when only a few anchor nodes are involved.

This algorithm is more advanced than traditional methods, which often require a large number of well-placed anchor nodes to operate appropriately.

By optimizing the decision parameter v of the algorithm, the average localization error of the algorithm is approximately 0.43 meters.

When the ratio of anchor nodes (the ratio of the number of anchor nodes to the number of sensor nodes in the network) is 1.25% (i.e., 5 anchor nodes for 400 sensor nodes), the received signal strength indicator (RSSI) variance is 8 dBm, and the radio range is 50 meters.

A comparison of the proposed algorithm with global localization methods, including multidimensional scaling (MDS), semidefinite programming (SDP), and shortest-path access (SPA), shows that the proposed algorithm achieves higher location accuracy and stability when the number of anchor nodes is varied.

The efficiency of the proposed localization algorithm is evaluated in a real sensor network, and the accuracy is high and robust to radio channel variance.