Non-line-of-sight Node Localization based on Semi-Definite Programming in Wireless Sensor Networks

An unknown-position sensor can be localized if there are three or more anchors making time-of-arrival (TOA) measurements of a signal from it. However, the location errors can be very large due to the fact that some of the measurements are from non-line-of-sight (NLOS) paths. In this paper, we propose a semi-definite programming (SDP) based node localization algorithm in NLOS environment for ultra-wideband (UWB) wireless sensor networks. The positions of sensors can be estimated using the distance estimates from location-aware anchors as well as other sensors. However, in the absence of LOS paths, e.g., in indoor networks, the NLOS range estimates can be significantly biased. As a result, the NLOS error can remarkably decrease the location accuracy. And it is not easy to efficiently distinguish LOS from NLOS measurements. In this paper, an algorithm is proposed that achieves high location accuracy without the need of identifying NLOS and LOS measurement.Comment: submitted to IEEE ICC'1

Localization of wireless sensor nodes with erroneous anchors via EM algorithm

Finding locations of the sensor nodes in Wireless Sensor Network has been an active research area in recent years. One important category of approaches uses distance measurements between anchors and sensors to localize the unknown node. However, most approaches assume that the anchor positions are perfectly known, while in practice the anchor positions may not be accurate due to estimation errors as well as observation errors. In this paper, we study the localization of wireless sensor node with erroneous anchors, and propose an EM estimator which iteratively refines the anchor positions and estimates the sensor location. Simulation results shows that the EM estimator converges in a few iterations and outperforms the existing robust least squares algorithm. ©2010 IEEE.published_or_final_versionThe 2010 IEEE Global Telecommunications Conference (GLOBECOM 2010), Miami, FL., 6-10 December 2010. In Globecom. IEEE Conference and Exhibition, 2010, p. 1-

Wireless Sensor Networks for Underwater Localization: A Survey

Autonomous Underwater Vehicles (AUVs) have widely deployed in marine investigation and ocean exploration in recent years. As the fundamental information, their position information is not only for data validity but also for many real-world applications. Therefore, it is critical for the AUV to have the underwater localization capability. This report is mainly devoted to outline the recent advance- ment of Wireless Sensor Networks (WSN) based underwater localization. Several classic architectures designed for Underwater Acoustic Sensor Network (UASN) are brie y introduced. Acoustic propa- gation and channel models are described and several ranging techniques are then explained. Many state-of-the-art underwater localization algorithms are introduced, followed by the outline of some existing underwater localization systems

Perturbation Propagation Models for Underwater Sensor Localisation using Semidefinite Programming

Real time Underwater sensor networks (UWSNs) suffer from localisation issues due to a dearth of incorporation of different geometric scenarios in UWSN scenarios. To address these issues, this paper visualises three specific scenarios of perturbation. First, small sized and large numbered particles of perturbance moving in a tangential motion to the sensor nodes; second, a single numbered and large-sized particle moving in a rectilinear motion by displacing the sensor nodes into sideward and forward direction, and third, a radially outward propagating perturbance to observe the influenced sensor nodes as the perturbance moves outwards. A novel target localisation and tracking is facilitated by including marine vehicle navigation as a source of perturbation. Using semidefinite programming, the proposed perturbation models minimise localisation errors, thereby enhancing physical security of underwater sensor nodes. By leveraging the spin, cleaving motion and radial cast-away behaviour of underwater sensor nodes, the results confirm that the proposed propagation models can be conveniently applied to real time target detection and estimation of underwater target nodes

Bayesian CRLB for hybrid ToA and DoA based wireless localization with anchor uncertainty

In this paper, we derive the Bayesian Cramér-Rao lower bound for three dimensional hybrid localization using time-of-arrival (ToA) and direction-of-arrival (DoA) types of measurements. Unlike previous works, we include the practical constraint that the anchor position is not known exactly but rather up to some error. The resulting bound can be used for error analysis of such a localization system or as an optimality criterion for the selection of suitable anchors

Estimation of Distributed Fermat-Point Location for Wireless Sensor Networking

This work presents a localization scheme for use in wireless sensor networks (WSNs) that is based on a proposed connectivity-based RF localization strategy called the distributed Fermat-point location estimation algorithm (DFPLE). DFPLE applies triangle area of location estimation formed by intersections of three neighboring beacon nodes. The Fermat point is determined as the shortest path from three vertices of the triangle. The area of estimated location then refined using Fermat point to achieve minimum error in estimating sensor nodes location. DFPLE solves problems of large errors and poor performance encountered by localization schemes that are based on a bounding box algorithm. Performance analysis of a 200-node development environment reveals that, when the number of sensor nodes is below 150, the mean error decreases rapidly as the node density increases, and when the number of sensor nodes exceeds 170, the mean error remains below 1% as the node density increases. Second, when the number of beacon nodes is less than 60, normal nodes lack sufficient beacon nodes to enable their locations to be estimated. However, the mean error changes slightly as the number of beacon nodes increases above 60. Simulation results revealed that the proposed algorithm for estimating sensor positions is more accurate than existing algorithms, and improves upon conventional bounding box strategies

Distributed Algorithms for Target Localization in Wireless Sensor Networks Using Hybrid Measurements

This dissertation addresses the target localization problem in wireless sensor networks (WSNs). WSNs is now a widely applicable technology which can have numerous practical applications and offer the possibility to improve people’s lives. A required feature to many functions of a WSN, is the ability to indicate where the data reported by each sensor was measured. For this reason, locating each sensor node in a WSN is an essential issue that should be considered. In this dissertation, a performance analysis of two recently proposed distributed localization algorithms for cooperative 3-D wireless sensor networks (WSNs) is presented. The tested algorithms rely on distance and angle measurements obtained from received signal strength (RSS) and angle-of-arrival (AoA) information, respectively. The measurements are then used to derive a convex estimator, based on second-order cone programming (SOCP) relaxation techniques, and a non-convex one that can be formulated as a generalized trust region sub-problem (GTRS). Both estimators have shown excellent performance assuming a static network scenario, giving accurate location estimates in addition to converging in few iterations. The results obtained in this dissertation confirm the novel algorithms’ performance and accuracy. Additionally, a change to the algorithms is proposed, allowing the study of a more realistic and challenging scenario where different probabilities of communication failure between neighbor nodes at the broadcast phase are considered. Computational simulations performed in the scope of this dissertation, show that the algorithms’ performance holds for high probability of communication failure and that convergence is still achieved in a reasonable number of iterations