RSSI-Based Self-Localization with Perturbed Anchor Positions

We consider the problem of self-localization by a resource-constrained mobile node given perturbed anchor position information and distance estimates from the anchor nodes. We consider normally-distributed noise in anchor position information. The distance estimates are based on the log-normal shadowing path-loss model for the RSSI measurements. The available solutions to this problem are based on complex and iterative optimization techniques such as semidefinite programming or second-order cone programming, which are not suitable for resource-constrained environments. In this paper, we propose a closed-form weighted least-squares solution. We calculate the weights by taking into account the statistical properties of the perturbations in both RSSI and anchor position information. We also estimate the bias of the proposed solution and subtract it from the proposed solution. We evaluate the performance of the proposed algorithm considering a set of arbitrary network topologies in comparison to an existing algorithm that is based on a similar approach but only accounts for perturbations in the RSSI measurements. We also compare the results with the corresponding Cramer-Rao lower bound. Our experimental evaluation shows that the proposed algorithm can substantially improve the localization performance in terms of both root mean square error and bias.Comment: Accepted for publication in 28th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE PIMRC 2017

Geolocation of a Known Altitude Target Using TDOA and GROA in the Presence of Receiver Location Uncertainty

This paper considers the problem of geolocating a target on the Earth surface using the target signal time difference of arrival (TDOA) and gain ratio of arrival (GROA) measurements when the receiver positions are subject to random errors. The geolocation Cramer-Rao lower bound (CRLB) is derived and the performance improvement due to the use of target altitude information is quantified. An algebraic geolocation solution is developed and its approximate efficiency under small Gaussian noise is established analytically. Its sensitivity to the target altitude error is also studied. Simulations justify the validity of the theoretical developments and illustrate the good performance of the proposed geolocation method

Consistent and Asymptotically Efficient Localization from Range-Difference Measurements

We consider signal source localization from range-difference measurements. First, we give some readily-checked conditions on measurement noises and sensor deployment to guarantee the asymptotic identifiability of the model and show the consistency and asymptotic normality of the maximum likelihood (ML) estimator. Then, we devise an estimator that owns the same asymptotic property as the ML one. Specifically, we prove that the negative log-likelihood function converges to a function, which has a unique minimum and positive definite Hessian at the true source's position. Hence, it is promising to execute local iterations, e.g., the Gauss-Newton (GN) algorithm, following a consistent estimate. The main issue involved is obtaining a preliminary consistent estimate. To this aim, we construct a linear least-squares problem via algebraic operation and constraint relaxation and obtain a closed-form solution. We then focus on deriving and eliminating the bias of the linear least-squares estimator, which yields an asymptotically unbiased (thus consistent) estimate. Noting that the bias is a function of the noise variance, we further devise a consistent noise variance estimator that involves $3$-order polynomial rooting. Based on the preliminary consistent location estimate, a one-step GN iteration suffices to achieve the same asymptotic property as the ML estimator. Simulation results demonstrate the superiority of our proposed algorithm in the large sample case

Emitter velocity estimation comparison for frequency difference of arrival measurement based single and multiple reference lateration algorithm

The accuracy at which the instantaneous velocity and position of a non-stationary emitting source estimated using a lateration algorithm depends on several factors such as the lateration algorithm approach, the number and choice of reference receiving station (RS) used in developing the lateration algorithm. In this paper, the use of multiple reference RSs was proposed to improve the velocity estimation accuracy of the frequency difference of arrival (FDOA) based lateration algorithm. The velocity estimation performance of the proposed multiple reference FDOA based lateration algorithm is compared with the conventional approach of using single reference RS at some selected emitter positions using Monte Carlo simulation. Simulation result based on an equilateral triangle RS configuration shows that the use of multiple reference RSs improved the velocity estimation accuracy of the lateration algorithm. Based on the selected emitter positions, a reduction in velocity estimation error of about 0.033m/s and 1.31 m/s for emitter positions at ranges 0.5 km and 5 km respectively was achieved using the multiple reference lateration algorithm

Low-complexity three-dimensional AOA-cross geometric center localization methods via multi-UAV network

The angle of arrival (AOA) is widely used to locate a wireless signal emitter in unmanned aerial vehicle (UAV) localization. Compared with received signal strength (RSS) and time of arrival (TOA), AOA has higher accuracy and is not sensitive to the time synchronization of the distributed sensors. However, there are few works focusing on three-dimensional (3-D) scenarios. Furthermore, although the maximum likelihood estimator (MLE) has a relatively high performance, its computational complexity is ultra-high. Therefore, it is hard to employ it in practical applications. This paper proposed two center of inscribed sphere-based methods for 3-D AOA positioning via multiple UAVs. The first method could estimate the source position and angle measurement noise at the same time by seeking the center of an inscribed sphere, called the CIS. Firstly, every sensor measures two angles, the azimuth angle and the elevation angle. Based on that, two planes are constructed. Then, the estimated values of the source position and the angle noise are achieved by seeking the center and radius of the corresponding inscribed sphere. Deleting the estimation of the radius, the second algorithm, called MSD-LS, is born. It is not able to estimate angle noise but has lower computational complexity. Theoretical analysis and simulation results show that proposed methods could approach the Cramér–Rao lower bound (CRLB) and have lower complexity than the MLE

Position estimation performance evaluation of a linear lateration algorithm with an SNR-based reference station selection technique

The position estimation accuracy of the multilateration system lateration algorithm depends on several factors such as the number of stations deployed, time difference of arrival (TDOA) estimation technique and the choice of reference station. In this paper, a technique to select the suitable reference station for the lateration algorithm based on received signal-to-noise (SNR) at each of the deployed stations is presented. The position estimation performance analysis of the lateration algorithm with the reference selection technique is carried out and improvement in the position estimation accuracy is determined by comparing it with the convention approach of using fixed reference station. Monte Carlo simulation results when compared with the conventional approach based on a square station configuration showed a reduction in the position estimation error of about 20%.Keywords: reference selection, lateration algorithm, signal-to-noise-ratio, position estimatio

A Framework for Low Complexity Least-Squares Localization With High Accuracy

In this paper, a new framework is proposed for least-squares localization based on estimated ranges, coveringtime-difference-of-arrival (TDoA), time-of-arrival (ToA), and received signal strength (RSS) cases. The multidimensional nonlinear localization problem is first transformed to a lower dimension and then solved iteratively. Within the proposed transformed least-squares (TLS) framework, we introduce a method in which the localization problem is transformed to one dimension (1-D). In this way, compared to the classical nonlinear least-squares (NLS) type of methods, the amount of computations in each iteration is greatly reduced; a reduction of 67% for a 3-D positioning system is shown. Hence, the introduced 1-D iterative (1DI) method is fairly light on the computational load.The way to choose the 1-D parameter is proposed, and theoretical expressions for the convergence rate and the root- mean-squared error (RMSE) of the 1DI estimator are derived. Validation is performed mainly based on actual ultra-wideband (UWB) radio measurements, collected in typical office environments, with signal bandwidths varying from 0.5 to 7.5 GHz. Supplementary simulations are also included for validation. Results show that, in terms of RMSE, the 1DI method performs better than the linear least-squares (LLS) method, where the solution is obtained noniteratively, and performs similarly as NLS, especially in TDoA cases

A survey of localization in wireless sensor network

Localization is one of the key techniques in wireless sensor network. The location estimation methods can be classified into target/source localization and node self-localization. In target localization, we mainly introduce the energy-based method. Then we investigate the node self-localization methods. Since the widespread adoption of the wireless sensor network, the localization methods are different in various applications. And there are several challenges in some special scenarios. In this paper, we present a comprehensive survey of these challenges: localization in non-line-of-sight, node selection criteria for localization in energy-constrained network, scheduling the sensor node to optimize the tradeoff between localization performance and energy consumption, cooperative node localization, and localization algorithm in heterogeneous network. Finally, we introduce the evaluation criteria for localization in wireless sensor network

Wireless Emitter Location Estimation Based on Linear and Nonlinear Algorithms using TDOA Technique

Low-power devices such as cell phones, and wireless routers are commonly used to control Improvised Explosive Devices (IEDs) and as the communication nodes for the sake of command and control. Quickly locating the source of these signals is ambitious, specifically in a metropolitan environment where buildings and towers may cause intervention. This presents a geolocation system that compounds the attributes of several proven geolocation and error mitigation methods to locate an emitter of interest in an urban environment. The proposed geolocation system uses a Time Difference of Arrival (TDOA) approach to estimate the position of the emitter of interest. Using multiple sensors at known locations, TDOA estimates are achieved by the cross-correlation of the signal received at all the sensors. A Weighted Least Squares (WLS) solution, Linear least Square (LLS) method and maximum likelihood (ML) estimation is used to estimate the emitter's location. If the variance of this location estimate is too high, a sensor is detected and identified as possessing a Non-Line of Sight (NLOS) path from the emitter. This poorly located sensor is then removed from the geolocation system and a new position estimate is computed with the remaining sensor TDOA information. The performance of the TDOA system is determined through modeling and simulations. Test results confirm the feasibility of identifying a NLOS sensor, thereby improving the geolocation system's accurateness in a metropolitan environment