Research of Centroid Localization Algorithm Based on Grid Distribution

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.

Download Full-text

Centroid Localization Algorithm Based on the Anchor Nodes Cellular Distribution

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.475-476.579 ◽

2013 ◽

Vol 475-476 ◽

pp. 579-582 ◽

Cited By ~ 1

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.

Download Full-text

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

Sensor Letters ◽

10.1166/sl.2013.2512 ◽

2013 ◽

Vol 11 (4) ◽

pp. 745-748 ◽

Cited By ~ 1

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

Download Full-text

Research of Node Localization Algorithm Based on DV-HOP in Wireless Sensor Networks

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.403-408.1442 ◽

2011 ◽

Vol 403-408 ◽

pp. 1442-1446 ◽

Cited By ~ 1

Author(s):

Hong Bin Wang

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Wireless Sensor ◽

Localization Algorithm ◽

Node Localization ◽

Error Sources ◽

Positioning Accuracy ◽

Process Error ◽

Position Correction ◽

Algorithmic Process

Node self-positioning is one of the core technologies in wireless sensor networks and is the premise of many applications. It is significant to achieve highly efficient and reliable node localization for event observation, target tracking and efficient routing. The DV-Hop localization algorithm which is one of the Range-Free algorithms is researched deeply. Firstly, algorithmic process, error sources, and the amount of communication and computing for Traditional DV-Hop algorithm are analyzed. For low positioning accuracy in Conventional DV-Hop localization algorithm, an improved DV-Hop localization algorithm based on estimate of average hop distance, Min-Max and position correction is brought forward. The simulation results show that the improved algorithm can improve the positioning accuracy more effectively without increasing hardware consumption in nodes comparing with conventional DV-Hop algorithm. So it is a practical and effective node localization method in wireless sensor networks.

Download Full-text

Localization Algorithm Based on DV-HOP for Wireless Sensor Network

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.128-129.909 ◽

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.

Download Full-text

DV-Hop Localization Algorithm Based on Distance Geometry Constrain

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.433-440.4009 ◽

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.

Download Full-text

Node Localization Algorithm Based on DV-HOP in Wireless Sensor Networks

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.440.289 ◽

2013 ◽

Vol 440 ◽

pp. 289-292

Author(s):

Jie Zhang ◽

Hong Bin Wang ◽

Xue Gong Qiao ◽

Yue Qi Han

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Wireless Sensor ◽

Localization Algorithm ◽

Node Localization ◽

Error Sources ◽

Positioning Accuracy ◽

Process Error ◽

Position Correction ◽

Algorithmic Process

Node self-positioning is one of the core technologies in wireless sensor networks and is the premise of many applications. It is significant to achieve highly efficient and reliable node localization for event observation, target tracking and efficient routing. The DV-Hop localization algorithm which is one of the Range-Free algorithms is researched deeply. Firstly, algorithmic process, error sources, and the amount of communication and computing for Traditional DV-Hop algorithm are analyzed. For low positioning accuracy in Conventional DV-Hop localization algorithm, an improved DV-Hop localization algorithm based on estimate of average hop distance, Min-Max and position correction is brought forward. The simulation results show that the improved algorithm can improve the positioning accuracy more effectively without increasing hardware consumption in nodes comparing with conventional DV-Hop algorithm. So it is a practical and effective node localization method in wireless sensor networks.

Download Full-text

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

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.442.360 ◽

2012 ◽

Vol 442 ◽

pp. 360-365 ◽

Cited By ~ 2

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.

Download Full-text

Localization Algorithm Based on Iterative Centroid Estimation for Wireless Sensor Networks

Mathematical Problems in Engineering ◽

10.1155/2018/5456191 ◽

2018 ◽

Vol 2018 ◽

pp. 1-11 ◽

Cited By ~ 1

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.

Download Full-text