Results 1 - 10 of 149

Robust Distributed Network Localization with Noisy Range Measurements

by David Moore, John Leonard, Daniela Rus, Seth Teller , 2004
"... This paper describes a distributed, linear-time algorithm for localizing sensor network nodes in the presence of range measurement noise and demonstrates the algorithm on a physical network. We introduce the probabilistic notion of robust quadrilaterals as a way to avoid flip ambiguities that otherw ..."
Abstract - Cited by 392 (21 self) - Add to MetaCart
This paper describes a distributed, linear-time algorithm for localizing sensor network nodes in the presence of range measurement noise and demonstrates the algorithm on a physical network. We introduce the probabilistic notion of robust quadrilaterals as a way to avoid flip ambiguities that otherwise corrupt localization computations. We formulate the localization problem as a two-dimensional graph realization problem: given a planar graph with approximately known edge lengths, recover the Euclidean position of each vertex up to a global rotation and translation. This formulation is applicable to the localization of sensor networks in which each node can estimate the distance to each of its neighbors, but no absolute position reference such as GPS or fixed anchor nodes is available. We implemented the algorithm on a physical sensor network and empirically assessed its accuracy and performance. Also, in simulation, we demonstrate that the algorithm scales to large networks and handles real-world deployment geometries. Finally, we show how the algorithm supports localization of mobile nodes.

A Theory of Network Localization

by J. Aspnes, T. Eren , D. K. Goldenberg, A. S. Morse , W. Whiteley , Y. R. Yang , B. D. O. Anderson , P. N. Belhumeur , 2004
"... In this paper we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigid ..."
Abstract - Cited by 122 (12 self) - Add to MetaCart
In this paper we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly.
(Show Context)

Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards

by Paolo Baronti, Prashant Pillai, Vince Chook, Stefano Chessa, Alberto Gotta, Y. Fun Hu - Computer Communications , 2007
"... Abstract: Wireless sensor networks are an emerging technology for low-cost, unattended monitoring of a wide range of environments, and their importance has been enforced by the recent delivery of the IEEE 802.15.4 standard for the physical and MAC layers and the forthcoming Zigbee standard for the n ..."
Abstract - Cited by 106 (6 self) - Add to MetaCart
Abstract: Wireless sensor networks are an emerging technology for low-cost, unattended monitoring of a wide range of environments, and their importance has been enforced by the recent delivery of the IEEE 802.15.4 standard for the physical and MAC layers and the forthcoming Zigbee standard for the network and application layers. The fast progress of research on energy efficiency, networking, data management and security in wireless sensor networks, and the need to compare with the solutions adopted in the standards motivates the need for a survey on this field. 1 Introduction Recent advances in Microelectromechanical Systems, tiny microprocessors and low power radio technologies have created low-cost, low-power, multi-functional miniature sensor devices, which can observe and react to changes in the physical phenomena of their surrounding environments. When networked together over a wireless medium, these devices can provide an overall result of their sensing functionality.
(Show Context)

Signal Processing Techniques in Network-Aided Positioning: A Survey of State-ofthe-Art Positioning Designs

by Guolin Sun, Jie Chen, Wei Guo - IEEE Signal Processing Magazine , 2005
"... [A survey of state-of-the-art positioning designs] The U.S. Federal Communications Commission (FCC) requires that the precise location of all enhanced 911 (E911) callers be automatically determined. This requirement has motivated the development of cellular-aided positioning. To facilitate emergency ..."
Abstract - Cited by 97 (3 self) - Add to MetaCart
[A survey of state-of-the-art positioning designs] The U.S. Federal Communications Commission (FCC) requires that the precise location of all enhanced 911 (E911) callers be automatically determined. This requirement has motivated the development of cellular-aided positioning. To facilitate emergency services, the FCC has mandated that 95 % of all handsets sold be location compatible by the end of December 2005 [1]. Wireless positioning has also been found very useful for other applications besides E911 service, ranging from vehicle navigation and network optimization to resource management and automated billing. Ubiquitous computing and location-aware computing also necessitate that we develop techniques for estimating the location of mobile users in both outdoor and indoor environments. Various positioning systems have been proposed for use in ubiquitous computing [2]. As an essential prerequisite for ubiquitous computing, mobile positioning techniques, linked with wireless networks, have increasingly provided mobile users with opportunities to access personal information, corporate data, and shared resources anytime, anywhere. Positioning systems can be grouped in many different ways, including indoor versus outdoor systems or cellular versus sensor network positioning designs, as shown in Figure 1.
(Show Context)

On the Computational Complexity of Sensor Network Localization

by James Aspnes, David Goldenberg, Yang Richard Yang - In Proceedings of First International Workshop on Algorithmic Aspects of Wireless Sensor Networks , 2004
"... Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localization problem for sensor networks is to reconstruct the positions of all of the sensors in a network, given the distances ..."
Abstract - Cited by 88 (4 self) - Add to MetaCart
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localization problem for sensor networks is to reconstruct the positions of all of the sensors in a network, given the distances between all pairs of sensors that are within some radius r of each other. In the past few years, many algorithms for solving the localization problem were proposed, without knowing the computational complexity of the problem. In this paper, we show that no polynomial-time algorithm can solve this problem in the worst case, even for sets of distance pairs for which a unique solution exists, unless RP = NP. We also discuss the consequences of our result and present open problems.

Rendered Path: Range-Free Localization in Anisotropic Sensor Networks with Holes

by Mo Li, et al. , 2007
"... Sensor positioning is a crucial part of many location-dependent applications that utilize wireless sensor networks (WSNs). Current localization approaches can be divided into two groups: range-based and range-free. Due to the high costs and critical assumptions, the range-based schemes are often imp ..."
Abstract - Cited by 86 (15 self) - Add to MetaCart
Sensor positioning is a crucial part of many location-dependent applications that utilize wireless sensor networks (WSNs). Current localization approaches can be divided into two groups: range-based and range-free. Due to the high costs and critical assumptions, the range-based schemes are often impractical for WSNs. The existing range-free schemes, on the other hand, suffer from poor accuracy and low scalability. Without the help of a large number of uniformly deployed seed nodes, those schemes fail in anisotropic WSNs with possible holes. To address this issue, we propose the Rendered Path (REP) protocol. To the best of our knowledge, REP is the only range-free protocol for locating sensors with constant number of seeds in anisotropic sensor networks.
(Show Context)

The effects of ranging noise on multihop localization: an empirical study

by Kamin Whitehouse, Chris Karlof, Alec Woo, Fred Jiang, David Culler - in IPSN , 2005
"... Abstract — This paper presents a study of how empirical ranging characteristics affect multihop localization in wireless sensor networks. We use an objective metric to evaluate a well-established parametric model of ranging called Noisy Disk: if the model accurately predicts the results of a real-wo ..."
Abstract - Cited by 68 (4 self) - Add to MetaCart
Abstract — This paper presents a study of how empirical ranging characteristics affect multihop localization in wireless sensor networks. We use an objective metric to evaluate a well-established parametric model of ranging called Noisy Disk: if the model accurately predicts the results of a real-world deployment, it sufficiently captures ranging characteristics. When the model does not predict accurately, we systematically replace components of the model with empirical ranging characteristics to identify which components contribute to the discrepancy. We reveal that both the connectivity and noise components of Noisy Disk fail to accurately represent real-world ranging characteristics and show that these shortcomings affect localization in different ways under different circumstances. I.
(Show Context)

Localization in sparse networks using sweeps

by David K. Goldenberg, Pascal Bihler, Ming Cao, Jia Fang - in Proceedings of ACM MobiCom , 2006
"... Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density higher than required for unique localizability. In this paper, we describe a class of algorithms for fine-grained localiza ..."
Abstract - Cited by 60 (6 self) - Add to MetaCart
Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density higher than required for unique localizability. In this paper, we describe a class of algorithms for fine-grained localization called Sweeps. Sweeps correctly finitely localizes all nodes in bilateration networks. Sweeps also handles angle measurements and noisy measurements. We demonstrate the practicality of our algorithm through extensive simulations on a large number of networks, upon which it consistently localizes one-thousand-node networks of average degree less than five in less than two minutes on a consumer PC.

Network localization in partially localizable networks

by David K. Goldenberg, Arvind Krishnamurthy, Wesley C. Maness, Yang Richard Yang, Anthony Young, A. Stephen Morse, Andreas Savvides, Brian D. O. Anderson - IN PROCEEDINGS OF IEEE INFOCOM , 2005
"... Knowing the positions of the nodes in a network is essential to many next generation pervasive and sensor network functionalities. Although many network localization systems have recently been proposed and evaluated, there has been no systematic study of partially localizable networks, i.e., netwo ..."
Abstract - Cited by 59 (10 self) - Add to MetaCart
Knowing the positions of the nodes in a network is essential to many next generation pervasive and sensor network functionalities. Although many network localization systems have recently been proposed and evaluated, there has been no systematic study of partially localizable networks, i.e., networks in which there exist nodes whose positions cannot be uniquely determined. There is no existing study which correctly identifies precisely which nodes in a network are uniquely localizable and which are not. This absence of a sufficient uniqueness condition permits the computation of erroneous positions that may in turn lead applications to produce flawed results. In this paper, in addition to demonstrating the relevance of networks that may not be fully localizable, we design the first framework for two dimensional network localization with an efficient component to correctly determine which nodes are localizable and which are not. Implementing this system, we conduct comprehensive evaluations of network localizability, providing guidelines for both network design and deployment. Furthermore, we study an integration of traditional geographic routing with geographic routing over virtual coordinates in the partially localizable network setting. We show that this novel cross-layer integration yields good performance, and argue that such optimizations will be likely be necessary to ensure acceptable application performance in partially localizable networks.
(Show Context)

Distributed weighted-multidimensional scaling for node localization in sensor networks

by Jose A. Costa, Neal Patwari, Alfred O. Hero Iii - ACM Trans. Sens. Netw , 2006
"... Accurate, distributed localization algorithms are needed for a wide variety of wireless sensor net-work applications. This article introduces a scalable, distributed weighted-multidimensional scal-ing (dwMDS) algorithm that adaptively emphasizes the most accurate range measurements and naturally acc ..."
Abstract - Cited by 54 (0 self) - Add to MetaCart
Accurate, distributed localization algorithms are needed for a wide variety of wireless sensor net-work applications. This article introduces a scalable, distributed weighted-multidimensional scal-ing (dwMDS) algorithm that adaptively emphasizes the most accurate range measurements and naturally accounts for communication constraints within the sensor network. Each node adap-tively chooses a neighborhood of sensors, updates its position estimate by minimizing a local cost function and then passes this update to neighboring sensors. Derived bounds on communication requirements provide insight on the energy efficiency of the proposed distributed method ver-sus a centralized approach. For received signal-strength (RSS) based range measurements, we demonstrate via simulation that location estimates are nearly unbiased with variance close to the Cramér-Rao lower bound. Further, RSS and time-of-arrival (TOA) channel measurements are used to demonstrate performance as good as the centralized maximum-likelihood estimator (MLE) in a real-world sensor network.