Accurate range-free localization for anisotropic wireless sensor networks

Journal ArticlePosition information plays a pivotal role in wireless sensor network (WSN) applications and protocol/ algorithm design. In recent years, range-free localization algorithms have drawn much research attention due to their low cost and applicability to large-scale WSNs. However, the application of range-free localization algorithms is restricted because of their dramatic accuracy degradation in practical anisotropic WSNs, which is mainly caused by large error of distance estimation. Distance estimation in the existing range-free algorithms usually relies on a unified per hop length (PHL) metric between nodes. But the PHL between different nodes might be greatly different in anisotropic WSNs, resulting in large error in distance estimation. We find that, although the PHL between different nodes might be greatly different, it exhibits significant locality; that is, nearby nodes share a similar PHL to anchors that know their positions in advance. Based on the locality of the PHL, a novel distance estimation approach is proposed in this article. Theoretical analyses show that the error of distance estimation in the proposed approach is only one-fourth of that in the state-of-the-art pattern-driven scheme (PDS). An anchor selection algorithm is also devised to further improve localization accuracy by mitigating the negative effects from the anchors that are poorly distributed in geometry. By combining the locality-based distance estimation and the anchor selection, a range-free localization algorithm named Selective Multilateration (SM) is proposed. Simulation results demonstrate that SM achieves localization accuracy higher than 0.3r, where r is the communication radius of nodes. Compared to the state-of-the-art solution, SM improves the distance estimation accuracy by up to 57% and improves localization accuracy by up to 52% consequently.This work is partially supported by the National Science Foundation of China (61103203, 61173169, 61332004, and 61420106009), the Hong Kong RGC General Research Fund (PolyU 5106/11E), the International Science & Technology Cooperation Program of China (2013DFB10070), and the EU FP7 QUICK project (PIRSES-GA-2013-612652)

A Low-Complexity Geometric Bilateration Method for Localization in Wireless Sensor Networks and Its Comparison with Least-Squares Methods

This research presents a distributed and formula-based bilateration algorithm that can be used to provide initial set of locations. In this scheme each node uses distance estimates to anchors to solve a set of circle-circle intersection (CCI) problems, solved through a purely geometric formulation. The resulting CCIs are processed to pick those that cluster together and then take the average to produce an initial node location. The algorithm is compared in terms of accuracy and computational complexity with a Least-Squares localization algorithm, based on the Levenberg–Marquardt methodology. Results in accuracy vs. computational performance show that the bilateration algorithm is competitive compared with well known optimized localization algorithms

Self-organising an indoor location system using a paintable amorphous computer

This thesis investigates new methods for self-organising a precisely defined pattern of intertwined number sequences which may be used in the rapid deployment of a passive indoor positioning system's infrastructure.A future hypothetical scenario is used where computing particles are suspended in paint and covered over a ceiling. A spatial pattern is then formed over the covered ceiling. Any small portion of the spatial pattern may be decoded, by a simple camera equipped device, to provide a unique location to support location-aware pervasive computing applications.Such a pattern is established from the interactions of many thousands of locally connected computing particles that are disseminated randomly and densely over a surface, such as a ceiling. Each particle has initially no knowledge of its location or network topology and shares no synchronous clock or memory with any other particle.The challenge addressed within this thesis is how such a network of computing particles that begin in such an initial state of disarray and ignorance can, without outside intervention or expensive equipment, collaborate to create a relative coordinate system. It shows how the coordinate system can be created to be coherent, even in the face of obstacles, and closely represent the actual shape of the networked surface itself. The precision errors incurred during the propagation of the coordinate system are identified and the distributed algorithms used to avoid this error are explained and demonstrated through simulation.A new perimeter detection algorithm is proposed that discovers network edges and other obstacles without the use of any existing location knowledge. A new distributed localisation algorithm is demonstrated to propagate a relative coordinate system throughout the network and remain free of the error introduced by the network perimeter that is normally seen in non-convex networks. This localisation algorithm operates without prior configuration or calibration, allowing the coordinate system to be deployed without expert manual intervention or on networks that are otherwise inaccessible.The painted ceiling's spatial pattern, when based on the proposed localisation algorithm, is discussed in the context of an indoor positioning system

An Assessment on the Use of Stationary Vehicles as a Support to Cooperative Positioning

In this paper, we consider the use of stationary vehicles as tools to enhance the localisation capabilities of moving vehicles in a VANET. We examine the idea in terms of its potential benefits, technical requirements, algorithmic design and experimental evaluation. Simulation results are given to illustrate the efficacy of the technique.Comment: This version of the paper is an updated version of the initial submission, where some initial comments of reviewers have been taken into accoun

Localization using Distance Geometry : Minimal Solvers and Robust Methods for Sensor Network Self-Calibration

In this thesis, we focus on the problem of estimating receiver and sender node positions given some form of distance measurements between them. This kind of localization problem has several applications, e.g., global and indoor positioning, sensor network calibration, molecular conformations, data visualization, graph embedding, and robot kinematics. More concretely, this thesis makes contributions in three different areas.First, we present a method for simultaneously registering and merging maps. The merging problem occurs when multiple maps of an area have been constructed and need to be combined into a single representation. If there are no absolute references and the maps are in different coordinate systems, they also need to be registered. In the second part, we construct robust methods for sensor network self-calibration using both Time of Arrival (TOA) and Time Difference of Arrival (TDOA) measurements. One of the difficulties is that corrupt measurements, so-called outliers, are present and should be excluded from the model fitting. To achieve this, we use hypothesis-and-test frameworks together with minimal solvers, resulting in methods that are robust to noise, outliers, and missing data. Several new minimal solvers are introduced to accommodate a range of receiver and sender configurations in 2D and 3D space. These solvers are formulated as polynomial equation systems which are solvedusing methods from algebraic geometry.In the third part, we focus specifically on the problems of trilateration and multilateration, and we present a method that approximates the Maximum Likelihood (ML) estimator for different noise distributions. The proposed approach reduces to an eigendecomposition problem for which there are good solvers. This results in a method that is faster and more numerically stable than the state-of-the-art, while still being easy to implement. Furthermore, we present a robust trilateration method that incorporates a motion model. This enables the removal of outliers in the distance measurements at the same time as drift in the motion model is canceled

Doctor of Philosophy

dissertationIn wireless sensor networks, knowing the location of the wireless sensors is critical in many remote sensing and location-based applications, from asset tracking, and structural monitoring to geographical routing. For a majority of these applications, received signal strength (RSS)-based localization algorithms are a cost effective and viable solution. However, RSS measurements vary unpredictably because of fading, the shadowing caused by presence of walls and obstacles in the path, and non-isotropic antenna gain patterns, which affect the performance of the RSS-based localization algorithms. This dissertation aims to provide efficient models for the measured RSS and use the lessons learned from these models to develop and evaluate efficient localization algorithms. The first contribution of this dissertation is to model the correlation in shadowing across link pairs. We propose a non-site specific statistical joint path loss model between a set of static nodes. Radio links that are geographically proximate often experience similar environmental shadowing effects and thus have correlated shadowing. Using a large number of multi-hop network measurements in an ensemble of indoor and outdoor environments, we show statistically significant correlations among shadowing experienced on different links in the network. Finally, we analyze multihop paths in three and four node networks using both correlated and independent shadowing models and show that independent shadowing models can underestimate the probability of route failure by a factor of two or greater. Second, we study a special class of algorithms, called kernel-based localization algorithms, that use kernel methods as a tool for learning correlation between the RSS measurements. Kernel methods simplify RSS-based localization algorithms by providing a means to learn the complicated relationship between RSS measurements and position. We present a common mathematical framework for kernel-based localization algorithms to study and compare the performance of four different kernel-based localization algorithms from the literature. We show via simulations and an extensive measurement data set that kernel-based localization algorithms can perform better than model-based algorithms. Results show that kernel methods can achieve an RMSE up to 55% lower than a model-based algorithm. Finally, we propose a novel distance estimator for estimating the distance between two nodes a and b using indirect link measurements, which are the measurements made between a and k, for k ? b and b and k, for k ? a. Traditionally, distance estimators use only direct link measurement, which is the pairwise measurement between the nodes a and b. The results show that the estimator that uses indirect link measurements enables better distance estimation than the estimator that uses direct link measurements

Nonparametric Message Passing Methods for Cooperative Localization and Tracking

The objective of this thesis is the development of cooperative localization and tracking algorithms using nonparametric message passing techniques. In contrast to the most well-known techniques, the goal is to estimate the posterior probability density function (PDF) of the position of each sensor. This problem can be solved using Bayesian approach, but it is intractable in general case. Nevertheless, the particle-based approximation (via nonparametric representation), and an appropriate factorization of the joint PDFs (using message passing methods), make Bayesian approach acceptable for inference in sensor networks. The well-known method for this problem, nonparametric belief propagation (NBP), can lead to inaccurate beliefs and possible non-convergence in loopy networks. Therefore, we propose four novel algorithms which alleviate these problems: nonparametric generalized belief propagation (NGBP) based on junction tree (NGBP-JT), NGBP based on pseudo-junction tree (NGBP-PJT), NBP based on spanning trees (NBP-ST), and uniformly-reweighted NBP (URW-NBP). We also extend NBP for cooperative localization in mobile networks. In contrast to the previous methods, we use an optional smoothing, provide a novel communication protocol, and increase the efficiency of the sampling techniques. Moreover, we propose novel algorithms for distributed tracking, in which the goal is to track the passive object which cannot locate itself. In particular, we develop distributed particle filtering (DPF) based on three asynchronous belief consensus (BC) algorithms: standard belief consensus (SBC), broadcast gossip (BG), and belief propagation (BP). Finally, the last part of this thesis includes the experimental analysis of some of the proposed algorithms, in which we found that the results based on real measurements are very similar with the results based on theoretical models

An assessment on the use of stationary vehicles to support cooperative positioning systems

In this paper, we evaluate the ability of stationary vehicles (e.g. parked or temporary stopped cars) as tools to enhance the capabilities of existing cooperative positioning algorithms in vehicular networks. First, some real-world facts are provided to support the feasibility of our ideas. Then, we examine the idea in greater details in terms of the technical requirements and methodological analysis, and provide a comprehensive experimental evaluation using dedicated simulations. The routing of a drone through an urban scenario is presented as a non-traditional application case, where the benefits of the proposed approach are reflected in a better utilisation of the flight time