scholarly journals Multi-Target Localization Based on Unidentified Multiple RSS/AOA Measurements in Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (13) ◽  
pp. 4455
Author(s):  
Seyoung Kang ◽  
Taehyun Kim ◽  
Wonzoo Chung
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Complexity Analysis ◽  
Target Localization ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Angle Of Arrival ◽  
Computationally Efficient ◽  
Localization Algorithms ◽  
Single Target

All existing hybrid target localization algorithms using received signal strength (RSS) and angle of arrival (AOA) measurements in wireless sensor networks, to the best of our knowledge, assume a single target such that even in the presence of multiple targets, the target localization problem is translated to multiple single-target localization problems by assuming that multiple measurements in a node are identified with their originated targets. Herein, we first consider the problem of multi-target localization when each anchor node contains multiple RSS and AOA measurement sets of unidentified origin. We propose a computationally efficient method to cluster RSS/AOA measurement sets that originate from the same target and apply the existing single-target linear hybrid localization algorithm to estimate multiple target positions. The complexity analysis of the proposed algorithm is presented, and its performance under various noise environments is analyzed via simulations.

Distributed Target Localization in Wireless Sensor Networks using Diffusion Adaptation

2016 ◽  
Vol 3 (3) ◽  
pp. 512
Author(s):  
Amirhosein Hajihoseini ◽  
Seyed Ali Ghorashi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Public Transportation ◽  
Location Based Services ◽  
Target Localization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Algorithms ◽  
Distributed Target

<p>Localization is an important issue for wireless sensor networks. Target localization has attracted many researchers who work on location based services such as navigation, public transportation and so on. Localization algorithms may be performed in a centralized or distributed manner. In this paper we apply diffusion strategy to the Gauss Newton method and introduce a new distributed diffusion based target localization algorithm for wireless sensor networks. In our proposed method, each node knows its own location and estimates the location of target using received signal strength. Then, all nodes cooperate with their neighbors and share their measurements to improve the accuracy of their decisions. In our proposed diffusion based algorithm, each node can localize target individually using its own and neighbor’s measurements, therefore, the power consumption decreases. Simulation results confirm that our proposed method improves the accuracy of target localization compared with alternative distributed consensus based target localization algorithms.  Our proposed algorithm is also shown that is robust against network topology and is insensitive to uncertainty of sensor nodes’ location.</p>

scholarly journals DALT: Double Anchor-Based Localization Technique For Wireless Sensor Networks Using RSS And AoA Measures

2019 ◽  
Vol 8 (10) ◽  
pp. 1862-1869
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Vital Role ◽  
Location Estimation ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Angle Of Arrival ◽  
Localization Technique ◽  
Localization Algorithms ◽  
Gps Device

Tracking the location of target nodes/objects plays a vital role in disaster management and emergency rescue operations. The wireless sensor network is an easiest and cheapest solution to track the target nodes/objects in emergency applications. Use of GPS installed devices in wireless sensor networks is one of the solutions to track the target node’s location. Installing GPS device on every target node is very expensive and the GPS device drains the battery power, and increases the size of sensor nodes. Localization is an alternative solution to track the target node’s location. Many localization algorithms are available to track/estimate the target node’s location coordinates, but the accuracy of the estimated target nodes is poor. A new localization technique is proposed in this work to improve the accuracy of the estimated location of the target nodes. The proposed technique uses two anchor nodes, and parameters like linear vector segments, received signal strength, and angle of arrival measures in the location estimation process. This work has been simulated in MATLAB. The proposed algorithm outperforms the existing localization techniques.

scholarly journals An Enhanced Hybrid 3D Localization Algorithm Based on APIT and DV-Hop

2017 ◽  
Vol 13 (09) ◽  
pp. 69 ◽  
Author(s):  
Lianjun Yi ◽  
Miaochao Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Hybrid Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
3D Localization ◽  
Localization Algorithms ◽  
Wide Range

<p>Wireless sensor networks (WSN), as a new method of information collection and processing, has a wide range of applications. Since the acquired data must be bound with the location information of sensor nodes, the sensor localization is one of the supporting technologies of wireless sensor networks. However, the common localization algorithms, such as APIT algorithm and DV-Hop algorithm, have the following problems: 1) the localization accuracy of beacon nodes is not high; 2) low coverage rate in sparse environment. In this paper, an enhanced hybrid 3D localization algorithm is designed with combining the advantages of APIT algorithm and DV-Hop algorithm. The proposed hybrid algorithm can improve the localization accuracy of the beacon nodes in dense environments by reducing the triangles in the triangle interior point test (PIT) and selecting good triangles. In addition, the algorithm can combine the advantages of APIT algorithm and DV-Hop algorithm localization algorithm to calculate the unknown node coordinates, and also improve the location coverage of the beacon nodes in sparse environment. Simulation results show that the proposed hybrid algorithm can effectively improve the localization accuracy of beacon nodes in the dense environment and the location coverage of beacon nodes in sparse environment.</p>

Advanced Sequence-Based Localization Algorithm in Wireless Sensor Networks

2014 ◽  
Vol 651-653 ◽  
pp. 387-390 ◽  
Author(s):  
Fu Bin Zhou ◽  
Shao Li Xue
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Measuring Devices ◽  
Localization Algorithms ◽  
Positioning Algorithm ◽  
Range Free

As an important application of Internet of Things , Wireless Sensor Networks utilized in surveillance and other case.Localization of nodes in wireless sensor networks is the prerequisite and base of target tracking in some surveillance applications, so localization error of sensor nodes is a key. However, due to limited energy, unreliable link and limited communication ranges of sensor nodes, high accurate positioning is difficult to achieve, which made it hot and full of challenging for wireless sensor nodes to localize without any auxiliary facilities. Range-based localization algorithm , could achieve good accuracy but require measuring devices, thus it is not appropriate for large-scale wireless sensor networks.So range-free localization algorithms are more popular.This paper analyses the algorithms in range-free localization,and proposed Advanced Sequence-Based Localization algorithm to improve the performance of positioning algorithm in wireless sensor network.

Correlation between Estimation Error and Possible Region in Localization Algorithms

2012 ◽  
Vol 457-458 ◽  
pp. 1514-1520
Author(s):  
Shi Hao Yan ◽  
Jian Ping Xing ◽  
De Qiang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Estimation Error ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Estimation Errors ◽  
Localization Algorithms ◽  
Localization Precision ◽  
Simulation Results ◽  
Definite Correlation

Many localization algorithms in wireless sensor networks mention possible regions to increase the degree of localization precision. In this paper, we present the definite correlation between the estimation error and the possible region. The estimation error, which is the most important indictor to judge the performance of a localization algorithm, is proportional to the square root of the area of the possible region and the factor of proportionality relates to the shape of the possible region. We also propose two applications of the definite correlation, including estimation errors detection and energy conservation. The simulation results show that the definite correlation is suitable for all kinds of possible regions and it is feasible to detect estimation errors and conserve energy when we fix reasonable areas of possible regions in wireless sensor networks.

A Gossip-Based AOA Distributed Localization Algorithm for Wireless Sensor Networks

2014 ◽  
Vol 577 ◽  
pp. 841-846 ◽  
Author(s):  
Wen Cui ◽  
Shao Chuan Wu ◽  
Yu Ze Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Cooperative Localization ◽  
Central Processor ◽  
Localization Algorithm ◽  
Angle Of Arrival ◽  
Position Information ◽  
Localization Method ◽  
Gossip Algorithm

Position information of individual nodes is useful in implementing functions such as routing in wireless sensor networks. Distributed localization method has been widely concerned in the case of no central processor is available to handle the calculations in the networks. In this paper, we focus on distributed localization techniques based on angle of arrival information between neighboring nodes. A novel distributed cooperative localization method based on gossip algorithm is proposed, which can obviously improve the positioning performance of the previous methods.

scholarly journals Improved Recursive DV-Hop Localization Algorithm with RSSI Measurement for Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (12) ◽  
pp. 4152
Author(s):  
Sana Messous ◽  
Hend Liouane ◽  
Omar Cheikhrouhou ◽  
Habib Hamam
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Position Estimation ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Error ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Localization Algorithms ◽  
Recursive Computation

As localization represents the main backbone of several wireless sensor networks applications, several localization algorithms have been proposed in the literature. There is a growing interest in the multi-hop localization algorithms as they permit the localization of sensor nodes even if they are several hops away from anchor nodes. One of the most famous localization algorithms is the Distance Vector Hop (DV-Hop). Aiming to minimize the large localization error in the original DV-Hop algorithm, we propose an improved DV-Hop algorithm in this paper. The distance between unknown nodes and anchors is estimated using the received signal strength indication (RSSI) and the polynomial approximation. Moreover, the proposed algorithm uses a recursive computation of the localization process to improve the accuracy of position estimation. Experimental results show that the proposed localization technique minimizes the localization error and improves the localization accuracy.

scholarly journals A Survey on DV-Hop localization Techniques in Three- Dimensional Wireless Sensor Networks

2020 ◽  
Vol 16 (10) ◽  
pp. 23
Author(s):  
Fengrong Han ◽  
Izzeldin Ibrahim Mohamed Abdelaziz ◽  
Xinni Liu ◽  
Kamarul Hawari Ghazali ◽  
Hao Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Three Dimensional ◽  
Wireless Sensor ◽  
Future Research ◽  
Localization Algorithm ◽  
Monitoring And Control ◽  
Position Information ◽  
Localization Algorithms ◽  
Range Free

Location information is prerequisite for wireless sensor networks (WSNs) monitoring and control applications, since there is no meaning without position information for collected data. Distance vector hop (DV-Hop) localization algorithm as the typical range-free algorithm that has been widely applied in various applications. Nowadays, the research on range-free localization for WSNs is mostly based on two-dimensional (2D) space. Hence, there are few surveys concentrated on range-free localization in three-dimensional (3D) WSNs. This motivated us to present an extensive overview of enhanced DV-Hop localization algorithms in 3D WSNs. This paper focused on critical challenge between 2D and 3D in localization model, representative range-free 3D localization technique surveys. Moreover, a comprehensive taxonomy of most essential enhanced methods applied in 3D DV-Hop is illustrated. A considerable comparison in term of localization error, computational complexity and node type is given. Future research directions dealing with localization under 3D DV-Hop is also discussed.

Sign in / Sign up

Export Citation Format

Share Document