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.

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.

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.

scholarly journals A Time Difference of Arrival-based Localization Algorithm for Wireless Sensor Networks

2016 ◽  
Vol 12 (11) ◽  
pp. 80 ◽  
Author(s):  
Songbo Ji
Keyword(s):  
Wireless Sensor Networks ◽  
Electromagnetic Wave ◽  
Sensor Networks ◽  
Large Scale ◽  
Time Difference ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Time Difference Of Arrival ◽  
Positioning Accuracy ◽  
Simulation Results

<p class="Abstract"><span lang="EN-US">Aimed at solving the problem of local divergence and low data accuracy, this paper introduces a new Time Difference of Arrival(TDOA)-based localization algorithm (TBL) for the large-scale, high-density wireless sensor networks which are designed for real-time surveillance and unexpected incidents management. In particular, several means to improve the accuracy of distance measurement are investigated, and the TDOA method, based on the sound wave and electromagnetic wave to locate in the large-scale WSN, is discussed. Also, the well-designed circular location process has the advantage of better positioning accuracy and coverage percentage. Simulation results have confirmed the effectiveness of the formed TBL algorithm.</span></p>

scholarly journals Iterative L-M Algorithm in WSN – Utilizing Modifying Average Hopping Distances

2017 ◽  
Vol 13 (10) ◽  
pp. 4 ◽  
Author(s):  
Xin Qiao ◽  
Han-Sheng Yang ◽  
Zheng-Chuang Wang
Keyword(s):  
Data Exchange ◽  
Weighted Average ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Simulation Environment ◽  
Hop Count ◽  
Positioning Accuracy ◽  
Anchor Nodes ◽  
Simulation Results ◽  
Unknown Node

Wireless sensor networks are more and more important for various applications. Localization plays an important role in WSN. In this article,<strong> </strong>Aiming at the large errors that the DV—Hop localization algorithm have in net topology with randomly-distributed nodes, this paper proposed a CLDV-Hop algorithm in DV-Hop based on modifying average hopping distances. Firstly, hop count threshold is set to optimize the anchor node when data exchange. Then, according to the minimum mean square criteria and unknown nodes nearest three anchor nodes weighted average hop distance are selected as its average hop distance. Finally, L-M algorithm is used to optimize the coordinate of unknown node estimated by least squares. The simulation results show that, without increasing the overhead and the same conditions as the simulation environment, CLDV-Hop algorithm has higher positioning accuracy than existing improved algorithms, and compared with DV-Hop algorithm accuracy is improved by about 33% - 41%.

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.

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.

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 Implementation of Intrusion Detection in Homogeneous and Heterogeneous Wireless Sensor Networks

2021 ◽  
pp. 664-670
Author(s):  
Manoshri A. Ghawade ◽  
Dr. Sheetal S. Dhande
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Intrusion Detection ◽  
Practical Interest ◽  
Wireless Sensor ◽  
Heterogeneous Wireless Sensor Networks ◽  
Multiple Sensor ◽  
Simulation Results ◽  
Multiple Sensing

Intrusion detection in Wireless Sensor Network (WSN) is of practical interest in many applications such as detecting an intruder in a battlefield. The intrusion detection is defined as a mechanism for a WSN to detect the existence of inappropriate, incorrect, or anomalous moving attackers. In this paper, we consider this issue according to heterogeneous WSN models. Furthermore, we consider two sensing detection models: single-sensing detection and multiple-sensing detection... Our simulation results show the advantage of multiple sensor heterogeneous WSNs.

Sign in / Sign up

Export Citation Format

Share Document