Intelligent Three-dimensional Node Localization Algorithm Using Dynamic Path Planning

2021 ◽  
Vol 14 ◽  
Author(s):  
Songhao Jia ◽  
Cai Yang ◽  
Xing Chen ◽  
Yan Liu ◽  
Fangfang Li
Keyword(s):  
Path Planning ◽  
Dynamic Stiffness ◽  
Three Dimensional ◽  
Localization Algorithm ◽  
Node Localization ◽  
Positioning Accuracy ◽  
Dynamic Path Planning ◽  
Anchor Nodes ◽  
Simulation Results ◽  
Dynamic Path

Background: In the applications of wireless sensor network technology, three-dimensional node location technology is crucial. The process of node localization has some disadvantages, such as the uneven distribution of anchor nodes and the high cost of the network. Therefore, the mobile anchor nodes are introduced to effectively solve accurate positioning. Objective: Considering the estimated distance error, the received signal strength indication technology is used to optimize the measurement of the distance. At the same time, dynamic stiffness planning is introduced to increase virtual anchor nodes. Moreover, the bird swarm algorithm is also used to solve the optimal location problem of nodes. Method: Firstly, the dynamic path is introduced to increase the number of virtual anchor nodes. At the same time, the improved RSSI distance measurement technology is introduced to the node localization. Then, an intelligent three-dimensional node localization algorithm based on dynamic path planning is proposed. Finally, the proposed algorithm is compared with similar algorithms through simulation experiments. Results: Simulation results show that the node coordinates obtained by the proposed algorithm are more accurate, and the node positioning accuracy is improved. The execution time and network coverage of the algorithm are better than similar algorithms. Conclusion: The proposed algorithm significantly improves the accuracy of node positioning. However, the traffic of the algorithm is increased. A little increase in traffic in exchange for positioning accuracy is worthy of recognition. The simulation results show that the proposed algorithm is robust and can be implemented and promoted in the future.

DV-Hop Localization Algorithm Based on Distance Geometry Constrain

2012 ◽  
Vol 433-440 ◽  
pp. 4009-4013
Author(s):  
Jun Gang Zheng ◽  
Cheng Dong Wu ◽  
Hao Chu ◽  
Yang Xu
Keyword(s):  
Dimensional Space ◽  
Distance Geometry ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Node Localization ◽  
Positioning Accuracy ◽  
Key Technologies ◽  
Anchor Nodes ◽  
Simulation Results ◽  
Error Of Measurement

Node localization is one of the key technologies in wireless sensor networks,DV-Hop algorithm is wildly usded .The main DV-Hop localization error is the distance between unknown nodes ande anchor nodes.In this paper, The distance geometry constrain in two-dimensional space has been applied to reduce the error of measurement ,which is the distance between unknown nodes and anchor nodes. Simulation results show that this localization algorithm is effective ,which improves the positioning accuracy.

Based on RSSI Ranging Technology for DV-Hop Localization Algorithm of Wireless Sensor Network

2012 ◽  
Vol 442 ◽  
pp. 360-365 ◽  
Author(s):  
Yang Jun Zhong
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Approximate Calculation ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Positioning Accuracy ◽  
Original Algorithm ◽  
Approximate Distance ◽  
Anchor Nodes ◽  
Simulation Results

For the DV-Hop algorithm of wireless sensor networks,there is an error arising problem that anchor nodes and location node hop distance is only an approximate calculation. A method based on the original Algorithm introducing RSSI ranging technique is proposed.Using RSSI ranging technology,we accord that if the anchor nodes is only a hop away from the location node,then decide whether using the DV-Hop algorithm to approach to the approximate distance between them. Simulation results show that the algorithm can effectively improve the error problems of calculating the hop distance between the anchor nodes and the location nodes, meanwhile improve the positioning accuracy of the node.

scholarly journals Research on Algorithm of Three-Dimensional Wireless Sensor Networks Node Localization

2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Jiang Minlan ◽  
Luo Jingyuan ◽  
Zou Xiaokang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Optimization Method ◽  
Wireless Sensor ◽  
Minimum Problem ◽  
Localization Algorithm ◽  
Node Localization ◽  
Anchor Nodes

This paper proposes a three-dimensional wireless sensor networks node localization algorithm based on multidimensional scaling anchor nodes, which is used to realize the absolute positioning of unknown nodes by using the distance between the anchor nodes and the nodes. The core of the proposed localization algorithm is a kind of repeated optimization method based on anchor nodes which is derived from STRESS formula. The algorithm employs the Tunneling Method to solve the local minimum problem in repeated optimization, which improves the accuracy of the optimization results. The simulation results validate the effectiveness of the algorithm. Random distribution of three-dimensional wireless sensor network nodes can be accurately positioned. The results satisfy the high precision and stability requirements in three-dimensional space node location.

Centroid Localization Algorithm Based on the Anchor Nodes Cellular Distribution

2013 ◽  
Vol 475-476 ◽  
pp. 579-582 ◽  
Author(s):  
Dong Yao Zou ◽  
Teng Fei Han ◽  
Dao Li Zheng ◽  
He Lv
Keyword(s):  
Wireless Sensor Networks ◽  
Cellular Network ◽  
Wireless Sensor ◽  
Cellular Distribution ◽  
Localization Algorithm ◽  
Matlab Simulation ◽  
Node Localization ◽  
Key Technologies ◽  
Anchor Nodes ◽  
Simulation Results

The node localization is one of the key technologies in wireless sensor networks. To the accurate positioning of the nodes as the premise and foundation, this paper presents a centroid localization algorithm based on Cellular network. First, the anchor nodes are distributed in a regular hexagonal cellular network. Unknown nodes collect the RSSI of the unknown nodes nearby, then select the anchor nodes whose RSSI is above the threshold. Finally, the average of these anchor nodes coordinates is the positioning results. MATLAB simulation results show that localization algorithm is simple and effective, it applies to the need for hardware is relatively low.

scholarly journals Iterative L-M Algorithm in WSN – Utilizing Modifying Average Hopping Distances

2017 ◽  
Vol 13 (10) ◽  
pp. 4 ◽  
Author(s):  
Xin Qiao ◽  
Han-Sheng Yang ◽  
Zheng-Chuang Wang
Keyword(s):  
Data Exchange ◽  
Weighted Average ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Simulation Environment ◽  
Hop Count ◽  
Positioning Accuracy ◽  
Anchor Nodes ◽  
Simulation Results ◽  
Unknown Node

Wireless sensor networks are more and more important for various applications. Localization plays an important role in WSN. In this article,<strong> </strong>Aiming at the large errors that the DV—Hop localization algorithm have in net topology with randomly-distributed nodes, this paper proposed a CLDV-Hop algorithm in DV-Hop based on modifying average hopping distances. Firstly, hop count threshold is set to optimize the anchor node when data exchange. Then, according to the minimum mean square criteria and unknown nodes nearest three anchor nodes weighted average hop distance are selected as its average hop distance. Finally, L-M algorithm is used to optimize the coordinate of unknown node estimated by least squares. The simulation results show that, without increasing the overhead and the same conditions as the simulation environment, CLDV-Hop algorithm has higher positioning accuracy than existing improved algorithms, and compared with DV-Hop algorithm accuracy is improved by about 33% - 41%.

Localization Algorithm Based on DV-HOP for Wireless Sensor Network

2011 ◽  
Vol 128-129 ◽  
pp. 909-913
Author(s):  
Yu Hu ◽  
Xue Mei Li
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Weighted Average ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Positioning Accuracy ◽  
Anchor Nodes ◽  
Simulation Results ◽  
Improved Algorithm

An improved DV-HOP localization algorithm is proposed in the paper, aiming at the traditional DV-HOP localization algorithm. The improved algorithm introduces threshold M, it uses the weighted average hop distances of anchor nodes within M hops to calculate the average hop distance of unknown nodes. In addition, the positioning results are corrected in the improved algorithm. The simulation results show that the improved localization algorithm effectively improves the positioning accuracy compared with the traditional DV-HOP localization algorithm, it is an effective localization algorithm for the wireless sensor networks.

Research of Centroid Localization Algorithm Based on Grid Distribution

2015 ◽  
Vol 738-739 ◽  
pp. 401-404
Author(s):  
Dong Yao Zou ◽  
Chen Li ◽  
Teng Fei Han
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Node Localization ◽  
Positioning Accuracy ◽  
Classical Algorithm ◽  
Key Technologies ◽  
Anchor Nodes ◽  
Universal Application

The node localization is one of the key technologies in wireless sensor networks. To the accurate positioning of the nodes as the premise and foundation, this paper puts forward the centroid localization algorithm based on grid distribution. The centroid algorithms is simple and universal application, which is classical algorithm without measuring its algorithm. Grid distribution to avoid anchor nodes are distributed unevenly and empty phenomenon, improving the positioning accuracy.

Sign in / Sign up

Export Citation Format

Share Document