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.

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.

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.

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.

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.

A Node Localization Algorithm for Wireless Sensor Networks Using Distance Clustering to Select the Anchor Nodes

2013 ◽  
Vol 11 (4) ◽  
pp. 745-748 ◽  
Author(s):  
Xiaohui Chen ◽  
Jinpeng Chen ◽  
Chen Chen ◽  
Jing He ◽  
Bangjun Lei
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Node Localization ◽  
Anchor Nodes

Research on Wireless Sensor Networks with an Improved DV-Hop Localization Algorithm Based on Weighted Processing and Error Modification

2014 ◽  
Vol 1022 ◽  
pp. 396-401
Author(s):  
Hang Xia Zhou ◽  
Chen Cui ◽  
Jia Jun Ye
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Theoretical Analysis ◽  
Network Topology ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Anchor Nodes ◽  
Simulation Results

Regarding the conventional DV-Hop algorithm easily caused big error in a network topology scenario, this paper proposes an improved DV-Hop localization algorithm comprehensive consideration of all anchor nodes average one-hop distance and normalized weighted, use anchor nodes as unknown nodes calculating error and use the error optimizing accuracy. Theoretical analysis and simulation results show that the proposed algorithm has better locating performance in locating precision and precision stability.

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.

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.

Sign in / Sign up

Export Citation Format

Share Document