scholarly journals A Novel Joint TDOA/FDOA Passive Localization Scheme Using Interval Intersection Algorithm

Information ◽  
2021 ◽  
Vol 12 (9) ◽  
pp. 371
Author(s):  
Lingyu Ai ◽  
Min Pang ◽  
Changxu Shan ◽  
Chao Sun ◽  
Youngok Kim ◽  
...  
Keyword(s):  
Simulation Analysis ◽  
Point Estimation ◽  
Localization Algorithm ◽  
Localization Scheme ◽  
Localization Algorithms ◽  
Analysis Theory ◽  
Intersection Algorithm ◽  
Large Measurement ◽  
Passive Localization ◽  
True Values

Due to the large measurement error in the practical non-cooperative scene, the passive localization algorithms based on traditional numerical calculation using time difference of arrival (TDOA) and frequency difference of arrival (FDOA) often have no solution, i.e., the estimated result cannot meet the localization background knowledge. In this context, this paper intends to introduce interval analysis theory into joint FDOA/TDOA-based localization algorithm. The proposed algorithm uses the dichotomy algorithm to fuse the interval measurement of TDOA and FDOA for estimating the velocity and position of a moving target. The estimation results are given in the form of an interval. The estimated interval must contain the true values of the position and velocity of the radiation target, and the size of the interval reflects the confidence of the estimation. The point estimation of the position and the velocity of the target is given by the midpoint of the estimation interval. Simulation analysis shows the efficacy of the algorithm.

scholarly journals Underwater TDOA Acoustical Location Based on Majorization-Minimization Optimization

Sensors ◽  
2020 ◽  
Vol 20 (16) ◽  
pp. 4457
Author(s):  
Shuangshuang Li ◽  
Haixin Sun ◽  
Hamada Esmaiel
Keyword(s):  
Information Matrix ◽  
Initial Point ◽  
Auxiliary Function ◽  
Localization Algorithm ◽  
Underwater Acoustic ◽  
Acoustic Localization ◽  
Mm Algorithm ◽  
Localization Scheme ◽  
Localization Algorithms ◽  
Gradient Based

Underwater acoustic localization is a useful technique applied to any military and civilian applications. Among the range-based underwater acoustic localization methods, the time difference of arrival (TDOA) has received much attention because it is easy to implement and relatively less affected by the underwater environment. This paper proposes a TDOA-based localization algorithm for an underwater acoustic sensor network using the maximum-likelihood (ML) ratio criterion. To relax the complexity of the proposed localization complexity, we construct an auxiliary function, and use the majorization-minimization (MM) algorithm to solve it. The proposed localization algorithm proposed in this paper is called a T-MM algorithm. T-MM is applying the MM algorithm to the TDOA acoustic-localization technique. As the MM algorithm iterations are sensitive to the initial points, a gradient-based initial point algorithm is used to set the initial points of the T-MM scheme. The proposed T-MM localization scheme is evaluated based on squared position error bound (SPEB), and through calculation, we get the SPEB expression by the equivalent Fisher information matrix (EFIM). The simulation results show how the proposed T-MM algorithm has better performance and outperforms the state-of-the-art localization algorithms in terms of accuracy and computation complexity even under a high presence of underwater noise.

Accuracy analysis of BLE beacon-based localization in smart buildings

2021 ◽  
pp. 1-20
Author(s):  
Rosen Ivanov
Keyword(s):  
Use Case ◽  
Accuracy Analysis ◽  
Localization Algorithm ◽  
Computing Power ◽  
Smart Buildings ◽  
Localization Accuracy ◽  
Positioning Systems ◽  
Deployment Strategy ◽  
Accurate Localization ◽  
Localization Algorithms

The majority of services that deliver personalized content in smart buildings require accurate localization of their clients. This article presents an analysis of the localization accuracy using Bluetooth Low Energy (BLE) beacons. The aim is to present an approach to create accurate Indoor Positioning Systems (IPS) using algorithms that can be implemented in real time on platforms with low computing power. Parameters on which the localization accuracy mostly depends are analyzed: localization algorithm, beacons’ density, deployment strategy, and noise in the BLE channels. An adaptive algorithm for pre-processing the signals from the beacons is proposed, which aims to reduce noise in beacon’s data and to capture visitor’s dynamics. The accuracy of five range-based localization algorithms in different use case scenarios is analyzed. Three of these algorithms are specially designed to be less sensitive to noise in radio channels and require little computing power. Experiments conducted in a simulated and real environment show that using proposed algorithms the localization accuracy less than 1 m can be obtained.

scholarly journals Multi-UAV Area Coverage Based on Relative Localization: Algorithms and Optimal UAV Placement

Sensors ◽  
2021 ◽  
Vol 21 (7) ◽  
pp. 2400
Author(s):  
Ziyong Zhang ◽  
Xiaoling Xu ◽  
Jinqiang Cui ◽  
Wei Meng
Keyword(s):  
Quadratic Programming ◽  
Wide Band ◽  
Area Coverage ◽  
Localization Algorithm ◽  
Placement Problem ◽  
Position Information ◽  
Relative Localization ◽  
Coverage Control ◽  
Localization Algorithms ◽  
Multi Uav

This paper is concerned with relative localization-based optimal area coverage placement using multiple unmanned aerial vehicles (UAVs). It is assumed that only one of the UAVs has its global position information before performing the area coverage task and that ranging measurements can be obtained among the UAVs by using ultra-wide band (UWB) sensors. In this case, multi-UAV relative localization and cooperative coverage control have to be run simultaneously, which is a quite challenging task. In this paper, we propose a single-landmark-based relative localization algorithm, combined with a distributed coverage control law. At the same time, the optimal multi-UAV placement problem was formulated as a quadratic programming problem by compromising between optimal relative localization and optimal coverage control and was solved by using Sequential Quadratic Programming (SQP) algorithms. Simulation results show that our proposed method can guarantee that a team of UAVs can efficiently localize themselves in a cooperative manner and, at the same time, complete the area coverage task.

scholarly journals Performance Analysis of AOA-Based Localization Using the LS Approach: Explicit Expression of Mean-Squared Error

2020 ◽  
Vol 2020 ◽  
pp. 1-22
Author(s):  
Byung-Kwon Son ◽  
Do-Jin An ◽  
Joon-Ho Lee
Keyword(s):  
Explicit Expression ◽  
Mean Squared Error ◽  
Weighted Least Squares ◽  
Localization Algorithm ◽  
Angle Of Arrival ◽  
Squared Error ◽  
Distance Weighted ◽  
The Mean ◽  
Passive Localization ◽  
Location Estimate

In this paper, a passive localization of the emitter using noisy angle-of-arrival (AOA) measurements, called Brown DWLS (Distance Weighted Least Squares) algorithm, is considered. The accuracy of AOA-based localization is quantified by the mean-squared error. Various estimates of the AOA-localization algorithm have been derived (Doğançay and Hmam, 2008). Explicit expression of the location estimate of the previous study is used to get an analytic expression of the mean-squared error (MSE) of one of the various estimates. To validate the derived expression, we compare the MSE from the Monte Carlo simulation with the analytically derived MSE.

scholarly journals NLOS Identification and Positioning Algorithm Based on Localization Residual in Wireless Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 2991 ◽  
Author(s):  
Jingyu Hua ◽  
Yejia Yin ◽  
Weidang Lu ◽  
Yu Zhang ◽  
Feng Li
Keyword(s):  
Hypothesis Test ◽  
Intermediate Position ◽  
Wireless Sensor ◽  
Line Of Sight ◽  
Localization Algorithm ◽  
Target Node ◽  
Localization Algorithms ◽  
Anchor Nodes ◽  
Positioning Algorithm ◽  
Non Line Of Sight

The problem of target localization in WSN (wireless sensor network) has received much attention in recent years. However, the performance of traditional localization algorithms will drastically degrade in the non-line of sight (NLOS) environment. Moreover, variable methods have been presented to address this issue, such as the optimization-based method and the NLOS modeling method. The former produces a higher complexity and the latter is sensitive to the propagating environment. Therefore, this paper puts forward a simple NLOS identification and localization algorithm based on the residual analysis, where at least two line-of-sight (LOS) propagating anchor nodes (AN) are required. First, all ANs are grouped into several subgroups, and each subgroup can get intermediate position estimates of target node through traditional localization algorithms. Then, the AN with an NLOS propagation, namely NLOS-AN, can be identified by the threshold based hypothesis test, where the test variable, i.e., the localization residual, is computed according to the intermediate position estimations. Finally, the position of target node can be estimated by only using ANs under line of sight (LOS) propagations. Simulation results show that the proposed algorithm can successfully identify the NLOS-AN, by which the following localization produces high accuracy so long as there are no less than two LOS-ANs.

Low Cost Recursive Localization scheme for High Density Wireless Sensor Networks

2020 ◽  
pp. 263-285
Author(s):  
Badia Bouhdid ◽  
Wafa Akkari ◽  
Sofien Gannouni
Keyword(s):  
Low Cost ◽  
Cost Effective ◽  
High Density ◽  
Communication Overhead ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Localization Scheme ◽  
Implementation Costs ◽  
Cost Effective Alternative ◽  
Algorithm Implementation

While existing localization approaches mainly focus on enhancing the accuracy, particular attention has recently been given to reducing the localization algorithm implementation costs. To obtain a tradeoff between location accuracy and implementation cost, recursive localization approaches are being pursued as a cost-effective alternative to the more expensive localization approaches. In the recursive approach, localization information increases progressively as new nodes compute their positions and become themselves reference nodes. A strategy is then required to control and maintain the distribution of these new reference nodes. The lack of such a strategy leads, especially in high density networks, to wasted energy, important communication overhead and even impacts the localization accuracy. In this paper, the authors propose an efficient recursive localization approach that reduces the energy consumption, the execution time, and the communication overhead, yet it increases the localization accuracy through an adequate distribution of reference nodes within the network.

Evaluation of Localization Algorithms

2009 ◽  
pp. 348-379 ◽  
Author(s):  
Michael Allen ◽  
Sebnem Baydere ◽  
Elena Gaura ◽  
Gurhan Kucuk
Keyword(s):  
Performance Metrics ◽  
Methodological Approach ◽  
Evaluation Criteria ◽  
Simulation Models ◽  
Data Sets ◽  
Localization Algorithm ◽  
Localization Algorithms ◽  
Development Cycle ◽  
Complete Test ◽  
And Performance

This chapter introduces a methodological approach to the evaluation of localization algorithms. The chapter contains a discussion of evaluation criteria and performance metrics followed by statistical/ empirical simulation models and parameters that affect the performance of the algorithms and hence their assessment. Two contrasting localization studies are presented and compared with reference to the evaluation criteria discussed throughout the chapter. The chapter concludes with a localization algorithm development cycle overview: from simulation to real deployment. The authors argue that algorithms should be simulated, emulated (on test beds or with empirical data sets) and subsequently implemented in hardware, in a realistic Wireless Sensor Network (WSN) deployment environment, as a complete test of their performance. It is hypothesised that establishing a common development and evaluation cycle for localization algorithms among researchers will lead to more realistic results and viable comparisons.

A Localization Algorithm for Wireless Sensor Network Based on the Weighted Correction in Geometric Measurement

2015 ◽  
Vol 740 ◽  
pp. 823-829
Author(s):  
Meng Long Cao ◽  
Chong Xin Yang
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Signal Strength ◽  
Received Signal Strength ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Received Signal Strength Indicator ◽  
Localization Algorithms ◽  
Weighted Centroid Localization ◽  
Geometric Measurement

Firstly, the characteristics of regular Zigbee localization algorithms-the received signal strength indicator algorithm (RSSI) and the weighted centroid localization algorithm are introduced. Then, the factors of the errors existing in the aforementioned algorithms are analyzed. Based on these above, the improved RSSI algorithm-correction geometric measurement based on weighted is proposed. Finally, utilizing this algorithm to design and implement the localization nodes, which have the CC2431 wireless microcontroller on them. The simulation and experimental results show that the accuracy of this localization algorithm improved about 2%, comparing with the regular algorithms.

Autonomous Passive Localization Algorithm for Road Sensor Networks

2011 ◽  
Vol 60 (11) ◽  
pp. 1622-1637 ◽  
Author(s):  
Jaehoon Jeong ◽  
Shuo Guo ◽  
Tian He ◽  
D. H. C. Du
Keyword(s):  
Sensor Networks ◽  
Localization Algorithm ◽  
Passive Localization
Sign in / Sign up

Export Citation Format

Share Document