Robust Localization from Incomplete Local Information

We consider the problem of localizing wireless devices in an ad-hoc network embedded in a d-dimensional Euclidean space. Obtaining a good estimation of where wireless devices are located is crucial in wireless network applications including environment monitoring, geographic routing and topology control. When the positions of the devices are unknown and only local distance information is given, we need to infer the positions from these local distance measurements. This problem is particularly challenging when we only have access to measurements that have limited accuracy and are incomplete. We consider the extreme case of this limitation on the available information, namely only the connectivity information is available, i.e., we only know whether a pair of nodes is within a fixed detection range of each other or not, and no information is known about how far apart they are. Further, to account for detection failures, we assume that even if a pair of devices is within the detection range, it fails to detect the presence of one another with some probability and this probability of failure depends on how far apart those devices are. Given this limited information, we investigate the performance of a centralized positioning algorithm MDS-MAP introduced by Shang et al., and a distributed positioning algorithm, introduced by Savarese et al., called HOP-TERRAIN. In particular, for a network consisting of n devices positioned randomly, we provide a bound on the resulting error for both algorithms. We show that the error is bounded, decreasing at a rate that is proportional to R/Rc, where Rc is the critical detection range when the resulting random network starts to be connected, and R is the detection range of each device.Comment: 40 pages, 13 figure

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

Hybrid 3D Localization for Visible Light Communication Systems

In this study, we investigate hybrid utilization of angle-of-arrival (AOA) and received signal strength (RSS) information in visible light communication (VLC) systems for 3D localization. We show that AOA-based localization method allows the receiver to locate itself via a least squares estimator by exploiting the directionality of light-emitting diodes (LEDs). We then prove that when the RSS information is taken into account, the positioning accuracy of AOA-based localization can be improved further using a weighted least squares solution. On the other hand, when the radiation patterns of LEDs are explicitly considered in the estimation, RSS-based localization yields highly accurate results. In order to deal with the system of nonlinear equations for RSS-based localization, we develop an analytical learning rule based on the Newton-Raphson method. The non-convex structure is addressed by initializing the learning rule based on 1) location estimates, and 2) a newly developed method, which we refer as random report and cluster algorithm. As a benchmark, we also derive analytical expression of the Cramer-Rao lower bound (CRLB) for RSS-based localization, which captures any deployment scenario positioning in 3D geometry. Finally, we demonstrate the effectiveness of the proposed solutions for a wide range of LED characteristics and orientations through extensive computer simulations.Comment: Submitted to IEEE/OSA Journal of Lightwave Technology (10 pages, 14 figures

Magneto-inductive Passive Relaying in Arbitrarily Arranged Networks

We consider a wireless sensor network that uses inductive near-field coupling for wireless powering or communication, or for both. The severely limited range of an inductively coupled source-destination pair can be improved using resonant relay devices, which are purely passive in nature. Utilization of such magneto-inductive relays has only been studied for regular network topologies, allowing simplified assumptions on the mutual antenna couplings. In this work we present an analysis of magneto-inductive passive relaying in arbitrarily arranged networks. We find that the resulting channel has characteristics similar to multipath fading: the channel power gain is governed by a non-coherent sum of phasors, resulting in increased frequency selectivity. We propose and study two strategies to increase the channel power gain of random relay networks: i) deactivation of individual relays by open-circuit switching and ii) frequency tuning. The presented results show that both methods improve the utilization of available passive relays, leading to reliable and significant performance gains.Comment: 6 pages, 9 figures. To be presented at the IEEE International Conference on Communications (ICC), Paris, France, May 201