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

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

Positioning Accuracy Improvement via Distributed Location Estimate in Cooperative Vehicular Networks

The development of cooperative vehicle safety (CVS) applications, such as collision warnings, turning assistants, and speed advisories, etc., has received great attention in the past few years. Accurate vehicular localization is essential to enable these applications. In this study, motivated by the proliferation of the Global Positioning System (GPS) devices, and the increasing sophistication of wireless communication technologies in vehicular networks, we propose a distributed location estimate algorithm to improve the positioning accuracy via cooperative inter-vehicle distance measurement. In particular, we compute the inter-vehicle distance based on raw GPS pseudorange measurements, instead of depending on traditional radio-based ranging techniques, which usually either suffer from high hardware cost or have inadequate positioning accuracy. In addition, we improve the estimation of the vehicles' locations only based on the inaccurate GPS fixes, without using any anchors with known exact locations. The algorithm is decentralized, which enhances its practicability in highly dynamic vehicular networks. We have developed a simulation model to evaluate the performance of the proposed algorithm, and the results demonstrate that the algorithm can significantly improve the positioning accuracy.Comment: To appear in Proc. of the 15th International IEEE Conference on Intelligent Transportation Systems (IEEE ITSC'12

Multi-mode Tracking of a Group of Mobile Agents

We consider the problem of tracking a group of mobile nodes with limited available computational and energy resources given noisy RSSI measurements and position estimates from group members. The multilateration solutions are known for energy efficiency. However, these solutions are not directly applicable to dynamic grouping scenarios where neighbourhoods and resource availability may frequently change. Existing algorithms such as cluster-based GPS duty-cycling, individual-based tracking, and multilateration-based tracking can only partially deal with the challenges of dynamic grouping scenarios. To cope with these challenges in an effective manner, we propose a new group-based multi-mode tracking algorithm. The proposed algorithm takes the topological structure of the group as well as the availability of the resources into consideration and decides the best solution at any particular time instance. We consider a clustering approach where a cluster head coordinates the usage of resources among the cluster members. We evaluate the energy-accuracy trade-off of the proposed algorithm for various fixed sampling intervals. The evaluation is based on the 2D position tracks of 40 nodes generated using Reynolds' flocking model. For a given energy budget, the proposed algorithm reduces the mean tracking error by up to $20\%$ in comparison to the existing energy-efficient cooperative algorithms. Moreover, the proposed algorithm is as accurate as the individual-based tracking while using almost half the energy.Comment: Accepted for publication in the 20th international symposium on wireless personal multimedia communications (WPMC-2017

A two phase framework for visible light-based positioning in an indoor environment: performance, latency, and illumination

Recently with the advancement of solid state lighting and the application thereof to Visible Light Communications (VLC), the concept of Visible Light Positioning (VLP) has been targeted as a very attractive indoor positioning system (IPS) due to its ubiquity, directionality, spatial reuse, and relatively high modulation bandwidth. IPSs, in general, have 4 major components (1) a modulation, (2) a multiple access scheme, (3) a channel measurement, and (4) a positioning algorithm. A number of VLP approaches have been proposed in the literature and primarily focus on a fixed combination of these elements and moreover evaluate the quality of the contribution often by accuracy or precision alone. In this dissertation, we provide a novel two-phase indoor positioning algorithmic framework that is able to increase robustness when subject to insufficient anchor luminaries and also incorporate any combination of the four major IPS components. The first phase provides robust and timely albeit less accurate positioning proximity estimates without requiring more than a single luminary anchor using time division access to On Off Keying (OOK) modulated signals while the second phase provides a more accurate, conventional, positioning estimate approach using a novel geometric constrained triangulation algorithm based on angle of arrival (AoA) measurements. However, this approach is still an application of a specific combination of IPS components. To achieve a broader impact, the framework is employed on a collection of IPS component combinations ranging from (1) pulsed modulations to multicarrier modulations, (2) time, frequency, and code division multiple access, (3) received signal strength (RSS), time of flight (ToF), and AoA, as well as (4) trilateration and triangulation positioning algorithms. Results illustrate full room positioning coverage ranging with median accuracies ranging from 3.09 cm to 12.07 cm at 50% duty cycle illumination levels. The framework further allows for duty cycle variation to include dimming modulations and results range from 3.62 cm to 13.15 cm at 20% duty cycle while 2.06 cm to 8.44 cm at a 78% duty cycle. Testbed results reinforce this frameworks applicability. Lastly, a novel latency constrained optimization algorithm can be overlaid on the two phase framework to decide when to simply use the coarse estimate or when to expend more computational resources on a potentially more accurate fine estimate. The creation of the two phase framework enables robust, illumination, latency sensitive positioning with the ability to be applied within a vast array of system deployment constraints