Wireless sensor network positioning algorithm based on APIT (approximation of the perfect PIT test) test

Abstract

The invention discloses a wireless sensor network positioning algorithm based on an APIT test. The coordinates of virtual anchor nodes are calculated through building a Voronoi graph; sequence ranks are built for overlapped areas; the possible unknown node existing areas are reduced; and finally determined area centroids are taken as estimated coordinates of the nodes. The specific steps comprise: building the Voronoi graph related to the anchor nodes; carrying out the approximation of the perfect PIT test; reducing generation probabilities of Out-To-In and In-To-Out; screening reasonable triangles; determining the overlapped areas through a grid scanning method; carrying out space division to the areas; building the sequence ranks; calculating the similarities of the sequence rank of each subarea and the sequence ranks of the unknown nodes; and taking the subarea centroids with the highest integrating degrees as the estimated coordinates of the unknown nodes. According to the algorithm of the invention, the relatively high positioning coverage, the relatively less positioning error and the relatively stable positioning result are obtained on the premise of increasing no hardware cost and communication cost.

Description

technical field [0001] The invention belongs to the technical field of wireless communication networks, and relates to a wireless sensor network positioning algorithm based on APIT testing. Background technique [0002] In Wireless Sensor Networks (WSN), sensor nodes perceive and collect the required information, and transmit the information to the network for processing. In the future world where everything is connected, the relative position relationship between objects is the basis for realizing the Internet of Things. Sensory data combined with location information is meaningless, and the localization problem has become a hot issue in the Internet of Things. [0003] APIT algorithm (approximation of the perfect PIT test) is a basic algorithm widely used in wireless positioning. This algorithm simulates the movement process of nodes by exchanging neighbor node information. The unknown node is outside the triangle, otherwise, the unknown node is inside the triangle, so as...

AI Technical Summary

Problems solved by technology

[0004] In practical applications, due to the influence of various factors such as hardware conditions, environmental constraints, and the rationality of the propagation model, the measured or estimated positioning results often have certain errors. The error caused by the line-of-sight (NLOS) will also have a greater impact on the positioning results, and the data that deviates from the true value will bring higher positioning errors

[0005] In terms of the impact of ranging errors on the APIT positioning algorithm, it mainly focuses on three aspects: on the one hand, when the anchor nodes are sparse, triangles cannot be formed, or the number of triangles formed is small, and the final overlap area is large, resulting in positioning accuracy. Not high; on the other hand, due to the existence of edge effects, there will be two kinds of errors, Out-To-In and In-To-Out, in the nodes near the triangle edge; on the last aspect, use the centroid directly after using the grid scanning method Positioning will bring the result of low positioning accuracy

Images