Research On Node Localization Algorithm Of 3D Wireless Sensor Network Based On Non-ranging

At present,researchers define Wireless Sensor Network(WSN)as a network system formed by multiple nodes with low energy consumption,small size and mutual communication.The network system can assist the Internet of Things(Io T)to collect basic information in the detection area,and can also be applied to tasks such as building monitoring,environmental monitoring,and target tracking.In many Io T applications,the lack of wireless sensor nodes with geographic location information will be useless.Therefore,node localization becomes a challenging research topic in WSN.The principle of non-ranging wireless sensor node positioning is to solve the position by exchanging information with nodes with unknown positions according to the nodes with known positions.At present,most of the mainstream positioning algorithms are researched based on two-dimensional planes,but with the progress of society,positioning under two-dimensional planes can no longer meet the needs of human production.For example,forest fire fighting,earthquake rescue,underwater positioning,etc.,the two-dimensional positioning algorithm cannot be applied to the above scenarios,and the three-dimensional wireless sensor node positioning algorithm came into being.Different from the two-dimensional algorithm,the three-dimensional node localization algorithm brings larger positioning error and complexity to the algorithm as the number of dimensions increases.In this paper,two new algorithms are proposed by studying the operating principle of the positioning algorithm under 3D non-ranging and the causes of errors.The main work is as follows:A new error correction algorithm based on improved particle swarm optimization,3DEC-DVHop,is proposed to solve the problem of low accuracy of node positioning in non-uniformly distributed networks with three-dimensional range-free DV-Hop algorithm.The algorithm first designs a correction factor to adjust the minimum hop value of the node to be located in the phase of calculating the minimum hop value of the node.;Secondly,the error generated by solving the average hop distance of the beacon node is corrected by introducing a correction factor;Finally,a particle swarm optimization algorithm with dynamic inertia weights is used to solve the coordinate location of the node to be located.Experiments show that,under the same simulation environment,compared with 3D-DVHop,3DPHW-DVHop and 3D weighted iterative multi-communication radius positioning algorithms,the average positioning error of3DEC-DVHop decreases by 29.3%,9.74%,and 4.92%.Aiming at the problems of low positioning coverage and poor positioning accuracy of APIT positioning algorithm in wireless sensor network in mountainous environment,this paper proposes an APIT positioning algorithm 3DTC-APIT based on tetrahedral centroid cutting.First,the algorithm reduces the occurrence of misjudgment by setting the node counter.Second,use the centroid of the tetrahedron to cut the node location area multiple times to solve the node coordinates to be located.Finally,the node to be located whose position has been determined is added as a temporary anchor node to assist other anchor nodes in positioning.The simulation results show that compared with the comparison algorithm,the algorithm 3DTC-APIT can better improve the positioning accuracy and coverage of nodes.