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.

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 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.

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 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.

scholarly journals Secure and Robust 3D Localization in Wireless Sensor Networks

2019 ◽  
Vol 9 (1S) ◽  
pp. 104-111
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Malicious Nodes ◽  
3D Localization ◽  
Secure Localization ◽  
Simulation Results ◽  
Two Phases

The fundamental capacity of a sensor system is to accumulate and forward data to the destination. It is crucial to consider the area of gathered data, which is utilized to sort information that can be procured using confinement strategy as a piece of Wireless Sensor Networks (WSNs).Localization is a champion among the most basic progressions since it agreed as an essential part in various applications, e.g., target tracking. If the client can't gain the definite area information, the related applications can't be skillful. The crucial idea in most localization procedures is that some deployed nodes with known positions (e.g., GPS-equipped nodes) transmit signals with their coordinates so as to support other nodes to localize themselves. This paper mainly focuses on the algorithm that has been proposed to securely and robustly decide thelocation of a sensor node. The algorithm works in two phases namely Secure localization phase and Robust Localization phase. By "secure", we imply that malicious nodes should not effectively affect the accuracy of the localized nodes. By “robust”, we indicate that the algorithm works in a 3D environment even in the presence of malicious beacon nodes. The existing methodologies were proposed based on 2D localization; however in this work in addition to security and robustness, exact localization can be determined for 3D areas by utilizing anefficient localization algorithm. Simulation results exhibit that when compared to other existing algorithms, our proposed work performs better in terms of localization error and accuracy.

scholarly journals An improved DV-Hop localization with minimum connected dominating set for mobile nodes in wireless sensor networks

2018 ◽  
Vol 14 (1) ◽  
pp. 155014771875563 ◽  
Author(s):  
Gulshan Kumar ◽  
Mritunjay Kumar Rai ◽  
Rahul Saha ◽  
Hye-jin Kim
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Wireless Sensor ◽  
Network Simulator ◽  
Localization Algorithm ◽  
Mobile Nodes ◽  
Minimum Connected Dominating Set ◽  
Anchor Nodes

Localization is one of the key concepts in wireless sensor networks. Different techniques and measures to calculate the location of unknown nodes were introduced in recent past. But the issue of nodes’ mobility requires more attention. The algorithms introduced earlier to support mobility lack the utilization of the anchor nodes’ privileges. Therefore, in this article, an improved DV-Hop localization algorithm is introduced that supports the mobility of anchor nodes as well as unknown nodes. Coordination of anchor nodes creates a minimum connected dominating set that works as a backbone in the proposed algorithm. The focus of the research paper is to locate unknown nodes with the help of anchor nodes by utilizing the network resources efficiently. The simulated results in network simulator-2 and the statistical analysis of the data provide a clear impression that our novel algorithm improves the error rate and the time consumption.

scholarly journals A Combined Localization Algorithm for Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Xiaogang Qi ◽  
Xiaoke Liu ◽  
Lifang Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
State Of The Art ◽  
Sensor Nodes ◽  
Vehicle Tracking ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Environment And Health ◽  
Anchor Nodes ◽  
Positioning Algorithm

Wireless sensor networks (WSNs) are widely used in various fields to monitor and track various targets by gathering information, such as vehicle tracking and environment and health monitoring. The information gathered by the sensor nodes becomes meaningful only if it is known where it was collected from. Considering that multilateral algorithm and MDS algorithm can locate the position of each node, we proposed a localization algorithm combining the merits of these two approaches, which is called MA-MDS, to reduce the accumulation of errors in the process of multilateral positioning algorithm and improve the nodes’ positioning accuracy in WSNs. It works in more robust fashion for noise sparse networks, even with less number of anchor nodes. In the MDS positioning phase of this algorithm, the Prussian Analysis algorithm is used to obtain more accurate coordinate transformation. Through extensive simulations and the repeatable experiments under diverse representative networks, it can be confirmed that the proposed algorithm is more accurate and more efficient than the state-of-the-art algorithms.

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 GPS-Less Cell-Based Localization Technique for Wireless Sensor Networks

2012 ◽  
Vol 601 ◽  
pp. 376-382
Author(s):  
Xue Jun Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Power Level ◽  
Wireless Sensor ◽  
Transmission Power ◽  
Localization Algorithm ◽  
Localization Technique ◽  
Simulation Results

This paper presents a localization algorithm, namely Circle Based Localization (CBL) for GPS-less wireless sensor networks. CBL works by finding the centroid of intersection of any two circles. Furthermore, we study the effect of power level mismatch among anchors. Simulation results show that CBL can significantly improve the accuracy by 5% while reducing the transmission power of anchors.

An Improved Sensor Positioning for Wireless Sensor Networks

2014 ◽  
Vol 716-717 ◽  
pp. 1322-1325
Author(s):  
Jin Tao Lin ◽  
Guang Yu Fan ◽  
Wen Hong Liu ◽  
Ying Da Hu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Signal Strength ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Positioning Accuracy ◽  
Positioning Method ◽  
Anchor Nodes ◽  
Simulation Results ◽  
Sensor Positioning

Sensor positioning is a fundamental block in various location-dependent applications of wireless sensor networks. In order to improve the positioning accuracy without increasing the complex and cost of sensor nodes, an improve sensor positioning method is proposed for wireless sensor networks. In the method, after receiving the broadcasting message of the neighboring anchor nodes, the sensor nodes calculate a modifying factor of the change of the signal strength. And they modify the distances between themselves and neighboring anchor nodes with the modifying factor. Simulation results show that the proposed method can obtain a high positioning accuracy.

Sign in / Sign up

Export Citation Format

Share Document