An Improved Triangle Centroid Localization Algorithm Based on PIT Criterion

2020 ◽  
Author(s):  
Mao Li ◽  
Feng Jiang ◽  
Cong Pei
Keyword(s):  
Response Speed ◽  
Estimation Algorithm ◽  
Localization Algorithm ◽  
Iterative Estimation ◽  
Localization Accuracy ◽  
Experimental Platform ◽  
Surrounding Environment ◽  
Intersection Points ◽  
Simulation Results ◽  
Communication Distance

Abstract Considering that the traditional triangle centroid localization algorithm based on RSSI is susceptible to surrounding environment, this paper improves the algorithm from two aspects of positioning accuracy and response speed also proposes an improved triangle centroid localization algorithm based on PIT criterion. Combined with actual positioning situation, the algorithm treats the calculated coordinates of the intersection points as the new beacon nodes. Thus, the area of triangle in the intersection region is reduced. Repeat positioning process until the predicted position of node is outside the triangle according to the PIT criterion. Compared with traditional triangle centroid localization algorithm, it showed from the simulation results that the improved triangle centroid localization algorithm can increase the localization accuracy up to 5 times based on the guaranteed response time when communication distance is 15 ~ 30 m, and this algorithm has higher localization accuracy and faster response speed than centroid iterative estimation algorithm in larger communication range. In additions, the experimental platform is built to verify that the proposed algorithm can effectively reduce the positioning error.

A Research of Improving Data Fusing Algorithm Localization in Multistaic Sonar

2014 ◽  
Vol 530-531 ◽  
pp. 240-244
Author(s):  
Yong Sun ◽  
Jun Wei Zhao
Keyword(s):  
New Method ◽  
Localization Algorithm ◽  
Distance Measurements ◽  
Localization Accuracy ◽  
Sonar System ◽  
Measured Information ◽  
Simulation Results ◽  
Data Fusing

For the purpose of improving the localization accuracy of bistatic sonar in baseline districts and side districts, the most effective method is to increase the number of transmitting and receiving stations, which forms a multistatic sonar system. The mature algorithm of multistatic sonar system which contains three distance measurements volume in one subset, calls the multistatic time-only localization (TOL) algorithm. This paper proposes a new algorithm which merges the TOL algorithm and IBOL algorithm. of improving the bearing-only localization algorithm. The simulation results show that the proposed localization algorithm exhibits higher accuracy compared with the TOL algorithm and IBOL algorithm. This new method can take full application of the measured information to improved the localization accuracy in the whole controlled area.

A Collaborative Multilateral Localization Algorithm for Wireless Sensor Networks

2013 ◽  
Vol 303-306 ◽  
pp. 201-205
Author(s):  
Shao Ping Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimization Method ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Localization Method ◽  
Anchor Nodes ◽  
Simulation Results ◽  
Unknown Node

Localization technology is one of the key supporting technologies in wireless sensor networks. In this paper, a collaborative multilateral localization algorithm is proposed to localization issues for wireless sensor networks. The algorithm applies anchor nodes within two hops to localize unknown nodes, and uses Nelder-Mead simplex optimization method to compute coordinates of the unknown nodes. If an unknown node can not be localized through two-hop anchor nodes, it is localized by anchor nodes and localized nodes within two hops through auxiliary iterative localization method. Simulation results show that the localization accuracy of this algorithm is very good, even in larger range errors.

Localization in Wireless Sensor Networks in Beacon Drifting Scenarios

2012 ◽  
Vol 562-564 ◽  
pp. 1234-1239
Author(s):  
Ming Xia ◽  
Qing Zhang Chen ◽  
Yan Jin
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Probability Density ◽  
Sensor Nodes ◽  
Density Model ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Scenarios Simulation ◽  
Simulation Results

The beacon drifting problem occurs when the beacon nodes move accidentally after deployment. In this occasion, the localization results of sensor nodes in the network will be greatly affected and become inaccurate. In this paper, we present a localization algorithm in wireless sensor networks in beacon drifting scenarios. The algorithm first uses a probability density model to calculate the location reliability of each node, and in localization it will dynamically choose nodes with highest location reliabilities as beacon nodes to improve localization accuracy in beacon drifting scenarios. Simulation results show that the proposed algorithm achieves its design goals.

Improved DV-Hop Algorithm for Enhancing Localization Accuracy in WSN

2014 ◽  
Vol 543-547 ◽  
pp. 3256-3259 ◽  
Author(s):  
Da Peng Man ◽  
Guo Dong Qin ◽  
Wu Yang ◽  
Wei Wang ◽  
Shi Chang Xuan
Keyword(s):  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Error ◽  
Localization Algorithm ◽  
Node Localization ◽  
Localization Accuracy ◽  
Global Average ◽  
Key Technologies ◽  
Simulation Results ◽  
Range Free

Node Localization technology is one of key technologies in wireless sensor network. DV-Hop localization algorithm is a kind of range-free algorithm. In this paper, an improved DV-Hop algorithm aiming to enhance localization accuracy is proposed. To enhance localization accuracy, average per-hop distance is replaced by corrected value of global average per-hop distance and global average per-hop error. When calculating hop distance, unknown nodes use corresponding average per-hop distance expression according to different hop value. Comparison with DV-Hop algorithm, simulation results show that the improved DV-Hop algorithm can reduce the localization error and enhance the accuracy of sensor nodes localization more effectively.

GTMA: Localization in Wireless Sensor Network Based a Group of Tri-Mobile Anchors

2017 ◽  
Vol 14 (1) ◽  
pp. 847-857 ◽  
Author(s):  
Bassam Gumaida ◽  
Chang Liu ◽  
Juan Luo
Keyword(s):  
High Accuracy ◽  
Outdoor Environment ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Target Node ◽  
Localization Accuracy ◽  
Mobile Anchor ◽  
Trajectory Mapping ◽  
Simulation Results ◽  
Better Than

Sensors positioning with high accuracy is a fundamental stone in Wireless Sensor Networks (WSNs). In outdoor environment which is hostile and unreachable, mobile anchors method is considered as an appropriate solution for locating unknown nodes. In this case, the key problems are the trajectory mapping and the needed number of mobile anchors. These mobile anchors should travel along the trajectory in order to determine the positions of unknown nodes with minimum localization error. In this paper, a localization algorithm named Group of Tri-Mobile Anchors (GTMA) is proposed, which is based on a group of tri-mobile anchors with adjustable square trajectory in the deployment area. The position of a target node is calculated by Trilateration. Simulation results show that the performance of the proposed algorithm GTMA is better than that of other algorithms adopted one mobile anchor, e.g., HILBERT, LMAT and SPIRAL algorithms. This is clearly evident in both the localization accuracy and trajectory planning.

An Improved Algorithm of Bearing-Only Localization and Optimal Position Performance of Multistaic Sonar

2013 ◽  
Vol 475-476 ◽  
pp. 964-967
Author(s):  
Yong Sun ◽  
Jun Wei Zhao
Keyword(s):  
Localization Algorithm ◽  
Optimal Position ◽  
Localization Accuracy ◽  
Sonar System ◽  
Simulation Results ◽  
Improved Algorithm

To improve the localization accuracy of bistatic sonar in such districts as baseline district, and side districts of transmitting and receiving stations, the most effective method is to increase the number of transmitting and receiving stations, which forms a multistatic sonar system. The mature algorithm of multistatic sonar system which contains three measurements in one subset, calls the multistatic bearing-only localization (BOL) algorithm. This paper proposes a new algorithm of improving the bearing-only localization algorithm. The simulation results show that the proposed localization algorithm exhibits higher accuracy compared with the BOL algorithm and provides less time than it.

Localization from Connectivity in Wireless Sensor Networks Based on Distributed Weight-Multidimensional Scaling

2012 ◽  
Vol 220-223 ◽  
pp. 1887-1891
Author(s):  
Zhong Sheng Li ◽  
Zhi Long Shan
Keyword(s):  
Multidimensional Scaling ◽  
Wireless Sensor ◽  
Iteration Step ◽  
Localization Algorithm ◽  
Stable Convergence ◽  
Step Size ◽  
Localization Accuracy ◽  
Simulation Results ◽  
Absolute Coordinates ◽  
Function Connectivity

A localization algorithm from connectivity based on distributed weighted-multidimensional scaling (cdwMDS) algorithm is proposed in this paper. Each sensor selects a neighbor sensor adaptively, calculates the iteration step size with the average connectivity and updates the estimate location by optimizing the local cost function. Connectivity is used to determine the step size of gradient iterative optimization in this algorithm. After getting the estimated positions, a relative map is built and the absolute coordinates can be obtained. Simulation results show that this method could achieve higher localization accuracy and more stable convergence.

An Anchor Filtering Localization Algorithm to Improve the Localization Accuracy of DV-Hop

2013 ◽  
Vol 716 ◽  
pp. 548-553
Author(s):  
Chun Jie Sun ◽  
Zhi Hui Ye
Keyword(s):  
Sensor Networks ◽  
Localization Algorithm ◽  
Positioning Accuracy ◽  
Localization Accuracy ◽  
Positioning Errors ◽  
Localization Precision ◽  
Simulation Results

By calculating the average distances between each anchor and the unknown nodes, the anchor filtering localization algorithm filtered the anchors with smaller average distances, and chose qualified anchors to improve localization precision, especially in the non-uniform sensor networks. Simulation results showed that the proposed AFDV-Hop algorithm achieved higher positioning accuracy either in uniform or non-uniform sensor networks. The improvement of positioning accuracy became more obvious as the non-uniformity of the nodes increased. The node positioning errors were reduced 20%~30% and 40%~50% by AFDV-Hop algorithm when the non-uniformities of the node distributions were 10%~20% and 30%~40% respectively.

The Mobile Node Localization Algorithm Based on Monte Carlo

2013 ◽  
Vol 712-715 ◽  
pp. 1847-1850
Author(s):  
Jun Gang Zheng ◽  
Cheng Dong Wu ◽  
Zhong Tang Chen
Keyword(s):  
Monte Carlo ◽  
Mobile Node ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Node Localization ◽  
Localization Accuracy ◽  
Monte Carlo Localization ◽  
Simulation Results ◽  
Specialized Hardware ◽  
High Node

There exist some mobile node localization algoriths in wireless sensor netwok,which require high computation and specialized hardware and high node large density of beacon nodes.The Monte Carlo localization method has been studied and an improved Monte Carlo node localization has been proposed. Predicting the trajectory of the node by interpolation and combing sampling box to sampling. The method can improve the efficiency of sampling and accuracy. The simulation results show that the method has achieved good localization accuracy.

Research and Improvement of DV-Hop Localization Algorithm for Wireless Sensor Network

2010 ◽  
Vol 44-47 ◽  
pp. 4028-4032
Author(s):  
Xue Guang Wang ◽  
Jie Ke Lin
Keyword(s):  
Energy Consumption ◽  
Low Cost ◽  
Wireless Sensor ◽  
Low Power Consumption ◽  
Localization Algorithm ◽  
Practical Application ◽  
Coverage Area ◽  
Localization Accuracy ◽  
Simulation Results ◽  
Average Size

Rang-free distributed localization algorithm has advantages of low power consumption, low cost etc, but it is weak in the localization accuracy, energy consumption of localization and the algorithm extend ability.That can not meet to the needs of practical application. To overcome the disadvantage of DV-Hop algorithm, in this paper, Two aspects improved algorithm are proposed based on the characteristics research of the original DV-Hop localization algorithm, which are the coverage area of beacon nodes and average size for one hop received by unknown nodes. Simulation results prove their validity and show the performance of the improvement algorithms is superior to the original DV-Hop algorithm.

Sign in / Sign up

Export Citation Format

Share Document