Localization in Wireless Sensor Networks Using Reach Centroid Algorithm

2018 ◽  
Vol 5 (2) ◽  
pp. 06-08
Author(s):  
Vazralu M. ◽  
Novy Jacob
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Centroid Algorithm

A Kind of Improved Triangle Centroid Algorithm Based on RSSI-Ranged

2011 ◽  
Vol 317-319 ◽  
pp. 1114-1118
Author(s):  
Lin Na Zhu ◽  
Hai Feng Jiang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Measurement Error ◽  
Wireless Sensor ◽  
Localization Error ◽  
Present Stage ◽  
Centroid Algorithm ◽  
Key Technologies ◽  
Simulation Results

Node self-localization is one of the key technologies in the wireless sensor networks. The localization technology based on RSSI is a focus studied at the present stage. For the localization error of RSSI-ranged method is relatively great, a kind of triangle centroid algorihms based on RSSI-ranged is proposed. The simulation results show that measurement error of this algorithm effective decrease as to tranditional triangle centroid algorithm based on RSSI-ranged.

Iterated Hybrid Localization Algorithm for Random Wireless Sensor Networks Based on Centroid and DV-Hop Algorithm

2012 ◽  
Vol 182-183 ◽  
pp. 1854-1857 ◽  
Author(s):  
Xin Hua Nie ◽  
Zhong Ming Pan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Hybrid Algorithm ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Positioning Accuracy ◽  
Advantages And Disadvantages ◽  
Centroid Algorithm ◽  
Initial Location ◽  
Unknown Node

Localization has been a major challenge in Wireless Sensor Networks (WSNs), especially for the applications requiring the accurate position of the sensed information. In this paper, we propose a new localization algorithm based on the Centroid algorithm and the DV-Hop algorithm to improve the positioning accuracy without increasing any extra hardware for sensor nodes. This paper firstly analyzed the advantages and disadvantages of the centroid algorithm and the DV-Hop algorithm. Then we put forward an iterated hybrid algorithm, which is comprised of three steps. Firstly, obtaining the initial location of each unknown node by using the centroid algorithm; secondly, computing the distances among each unknown node to the anchor nodes based on the DV-Hop algorithm; finally, Taylor Series Expansion (TSE) algorithm is utilized to estimate coordinate of each unknown node. Simulation results show that our iterated hybrid algorithm has better positioning 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.

Sign in / Sign up

Export Citation Format

Share Document