scholarly journals Anchor-Node-Based Distributed Localization with Error Correction in Wireless Sensor Networks

2012 ◽  
Vol 8 (4) ◽  
pp. 975147 ◽  
Author(s):  
Taeyoung Kim ◽  
Minhan Shon ◽  
Mihui Kim ◽  
Dongsoo S. Kim ◽  
Hyunseung Choo
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Estimation Error ◽  
Initial Position ◽  
Wireless Sensor ◽  
Anchor Node ◽  
Localization Accuracy ◽  
Message Transmission ◽  
Transmission Cost ◽  
Anchor Nodes

This paper proposes a scheme to enhance localization in terms of accuracy and transmission overhead in wireless sensor networks. This scheme starts from a basic anchor-node-based distributed localization (ADL) using grid scan with the information of anchor nodes within two-hop distance. Even though the localization accuracy of ADL is higher than that of previous schemes (e.g., DRLS), estimation error can be propagated when the ratio of anchor nodes is low. Thus, after each normal node estimates the initial position with ADL, it checks whether the position needs to be corrected because of the insufficient anchors within two-hop distance, that is, the node is in sparse anchor area. If correction needs, the initial position is repositioned using hop progress by the information of anchor nodes located several hops away so that error propagation is reduced (REP); the hop progress is an estimated hop distance using probability based on the density of sensor nodes. Results via in-depth simulation show that ADL has about 12% higher localization accuracy and about 10% lower message transmission cost than DRLS. In addition, the localization accuracy of ADL with REP is about 30% higher than that of DRLS, even though message transmission cost is increased.

scholarly journals Localization Algorithm Based on Iterative Centroid Estimation for Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Rui Jiang ◽  
Xin Wang ◽  
Li Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Anchor Node ◽  
Centroid Estimation ◽  
Anchor Nodes ◽  
Localization Precision ◽  
Unknown Node ◽  
Received Signal Strength Indication

According to the application of range-free localization technology for wireless sensor networks (WSNs), an improved localization algorithm based on iterative centroid estimation is proposed in this paper. With this methodology, the centroid coordinate of the space enclosed by connected anchor nodes and the received signal strength indication (RSSI) between the unknown node and the centroid are calculated. Then, the centroid is used as a virtual anchor node. It is proven that there is at least one connected anchor node whose distance from the unknown node must be farther than the virtual anchor node. Hence, in order to reduce the space enclosed by connected anchor nodes and improve the location precision, the anchor node with the weakest RSSI is replaced by this virtual anchor node. By applying this procedure repeatedly, the localization algorithm can achieve a good accuracy. Observing from the simulation results, the proposed algorithm has strong robustness and can achieve an ideal performance of localization precision and coverage.

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.

scholarly journals Improved Location Estimation in Wireless Sensor Networks Using a Vector-Based Swarm Optimized Connected Dominating Set

Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 376 ◽  
Author(s):  
Gulshan Kumar ◽  
Rahul Saha ◽  
Mritunjay Rai ◽  
Reji Thomas ◽  
Tai-Hoon Kim ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Estimation Error ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Location Estimation ◽  
Wireless Sensor ◽  
Minimum Number ◽  
Anchor Nodes

Location estimation in wireless sensor networks (WSNs) has received tremendous attention in recent times. Improved technology and efficient algorithms systematically empower WSNs with precise location identification. However, while algorithms are efficient in improving the location estimation error, the factor of the network lifetime has not been researched thoroughly. In addition, algorithms are not optimized in balancing the load among nodes, which reduces the overall network lifetime. In this paper, we have proposed an algorithm that balances the load of computation for location estimation among the anchor nodes. We have used vector-based swarm optimization on the connected dominating set (CDS), consisting of anchor nodes for that purpose. In this algorithm, major tasks are performed by the base station with a minimum number of messages exchanged by anchor nodes and unknown nodes. The simulation results showed that the proposed algorithm significantly improves the network lifetime and reduces the location estimation error. Furthermore, the proposed optimized CDS is capable of providing a global optimum solution with a minimum number of iterations.

One Anchor Distance and Angle Based Multi - Hop Adaptive Iterative Localization Algorithm for Wireless Sensor Networks

2010 ◽  
Vol 2 (3) ◽  
pp. 31-43 ◽  
Author(s):  
S. B. Kotwal ◽  
Shekhar Verma ◽  
G. S. Tomar ◽  
R. K. Abrol ◽  
Suryansh Nigam
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Error Propagation ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Anchor Node ◽  
Communication Range ◽  
Uncertainty Region ◽  
Angle Measurements ◽  
Anchor Nodes

This paper presents distance and angle measurements based Multi-Hop Adaptive and Iterative Localization algorithm for localization of unknown nodes in wireless sensor networks (WSNs). The present work determines uncertainty region of unknown nodes with respect to known (anchor) nodes using noisy distance and angle measurements. This node transmits its uncertainty region to other unknown nodes to help them determine their uncertainty region. Because of noisy distance and angle measurements, the error propagation increases the size of regions of nodes in subsequent hops. Using only one anchor node as reference, the proposed iterative localization algorithm reduces the error propagation of this noisy distance and angle measurements and the uncertainty region of all unknown nodes within a given communication range. The results clearly indicate the improved efficiency of the proposed algorithm in comparison with existing algorithms.

scholarly journals Localization of Sensor Nodes using Flooding in Wireless Sensor Networks

2013 ◽  
Vol 9 (3) ◽  
pp. 1153-1161
Author(s):  
Basavaraj K Madagouda ◽  
Varsha M Patil ◽  
Pradnya Godse
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Real Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Localization Algorithms ◽  
Anchor Nodes

The accuracy of localization is a significant criterion to evaluate the practical utility of localization algorithm in wireless sensor networks (WSN). In mostly localization algorithms, one of the main methods to improve localization accuracy is to increase the number of anchor nodes. But the number of anchor nodes is always limited because of the hardware restrict, such as cost, energy consumption and so on. In this paper, we propose a novel which uses forwarding a query message in flooding technique for localization using anchor nodes and once a node localized it acts as virtual anchor node and it helps to localize remaining sensor nodes. It is scheme to increase and upgrade the virtual anchor nodes, while the real number of physical anchors is the same as before.

Research on the Bounding-Inbox Localization Algorithm for Wireless Sensor Networks Based on RSSI

2011 ◽  
Vol 135-136 ◽  
pp. 814-819
Author(s):  
Xue Cun Yang ◽  
Yuan Bin Hou ◽  
Ling Hong Kong
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Underground Mine ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Simulating Experiment ◽  
The People ◽  
Anchor Nodes ◽  
Range Free

Aimed at the people localization in the underground mine, the bounding-inbox localization algorithm of wireless sensor networks based on RSSI is presented in this paper, which combines the merits of range-based and range-free localization methods. And, signal strength information between fixed anchor nodes and unknown ones is taken as the weights of bounding-inbox algorithm to calculate. The result of simulating experiment in underground mine environment proves that this algorithm is of less computing cost and can improve the localization accuracy.

A Model of Three Points for Location Estimation in Wireless Sensor Networks

2013 ◽  
Vol 787 ◽  
pp. 1066-1071
Author(s):  
Shao Guo Xie ◽  
Yan Jun Hu ◽  
Yi Wang ◽  
Fang Jiang ◽  
Jing Jing Liu ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Location Estimation ◽  
Wireless Sensor ◽  
Localization Accuracy ◽  
Random Deployment ◽  
Centroid Algorithm ◽  
Anchor Nodes ◽  
Novel Model ◽  
Better Than

In this paper, we propose a novel model of three points named TP for location estimation in wireless sensor networks (WSNs) with random deployment of anchor nodes. In this model, we select three anchor nodes which have the strongest received signal strength (RSS) for location estimation, the centroid algorithm and the method of intersection of judgment are used to estimate the location of unknown nodes. To further exploit three nearest intersection points in TP, the enhanced TP (ETP) is proposed. The simulation results show that the proposed models outperform MMSE and BML in terms of the localization accuracy for WSNs. Moreover, the localization accuracy of the proposed models in scenario 2 with random deployment of anchor nodes are better than in scenario 1 with planned deployment of anchor nodes. Additionally, compared with MMSE and BML, ETP and TP can reduce the environmental impact on location estimation.

One Anchor Distance and Angle Based Multi - Hop Adaptive Iterative Localization Algorithm for Wireless Sensor Networks

2012 ◽  
pp. 255-266
Author(s):  
S. B. Kotwal ◽  
Shekhar Verma ◽  
G. S. Tomar ◽  
R. K. Abrol
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Error Propagation ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Anchor Node ◽  
Communication Range ◽  
Uncertainty Region ◽  
Angle Measurements ◽  
Anchor Nodes

This paper presents distance and angle measurements based Multi-Hop Adaptive and Iterative Localization algorithm for localization of unknown nodes in wireless sensor networks (WSNs). The present work determines uncertainty region of unknown nodes with respect to known (anchor) nodes using noisy distance and angle measurements. This node transmits its uncertainty region to other unknown nodes to help them determine their uncertainty region. Because of noisy distance and angle measurements, the error propagation increases the size of regions of nodes in subsequent hops. Using only one anchor node as reference, the proposed iterative localization algorithm reduces the error propagation of this noisy distance and angle measurements and the uncertainty region of all unknown nodes within a given communication range. The results clearly indicate the improved efficiency of the proposed algorithm in comparison with existing algorithms.

An Efficient Anchor Nodes Distribution For Accurate Lo-calization (EDAL) In Mobile Wireless Sensor Networks

2020 ◽  
pp. 9
Author(s):  
عمار محمد أبو زنيد ◽  
عين الدين واحد عبدالوهاب ◽  
محمد إدريس اليمني ◽  
عمر عادل مهدي ◽  
ليانا خميس قباجة
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Mobile Wireless ◽  
Mobile Wireless Sensor Networks ◽  
Anchor Nodes ◽  
Mobile Wireless Sensor

A Novel Static Path Planning Method for Mobile Anchor-Assisted Localization in Wireless Sensor Networks

2020 ◽  
Vol 10 ◽  
Author(s):  
Abdelhady M. Naguib ◽  
Shahzad Ali
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Path Planning ◽  
Sensor Node ◽  
Large Scale ◽  
Performance Metrics ◽  
Wireless Sensor ◽  
Anchor Node ◽  
Mobile Anchor ◽  
Planning Methods

Background: Many applications of Wireless Sensor Networks (WSNs) require awareness of sensor node’s location but not every sensor node can be equipped with a GPS receiver for localization, due to cost and energy constraints especially for large-scale networks. For localization, many algorithms have been proposed to enable a sensor node to be able to determine its location by utilizing a small number of special nodes called anchors that are equipped with GPS receivers. In recent years a promising method that significantly reduces the cost is to replace the set of statically deployed GPS anchors with one mobile anchor node equipped with a GPS unit that moves to cover the entire network. Objectives: This paper proposes a novel static path planning mechanism that enables a single anchor node to follow a predefined static path while periodically broadcasting its current location coordinates to the nearby sensors. This new path type is called SQUARE_SPIRAL and it is specifically designed to reduce the collinearity during localization. Results: Simulation results show that the performance of SQUARE_SPIRAL mechanism is better than other static path planning methods with respect to multiple performance metrics. Conclusion: This work includes an extensive comparative study of the existing static path planning methods then presents a comparison of the proposed mechanism with existing solutions by doing extensive simulations in NS-2.

Sign in / Sign up

Export Citation Format

Share Document