Results 1  10
of
3,206
Uniquely Localizable Networks with Few Anchors
 in Proc. ALGOSENSORS 2006, LNCS 4240
, 2006
"... Abstract: We consider ‘source location problems ’ in undirected graphs motivated by localization problems in sensor networks. In such a network the fundamental problem is to determine the locations of the sensors in the plane from a subset of pairwise distances. To achieve unique localizability it i ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract: We consider ‘source location problems ’ in undirected graphs motivated by localization problems in sensor networks. In such a network the fundamental problem is to determine the locations of the sensors in the plane from a subset of pairwise distances. To achieve unique localizability
Network localization in partially localizable networks
 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
.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
Graphical Properties of Easily Localizable Sensor Networks
, 2006
"... The sensor network localization problem is one of determining the Euclidean positions of all sensors in a network given knowledge of the Euclidean positions of some, and knowledge of a number of intersensor distances. This paper identifies graphical properties which can ensure unique localizability ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
localizability, and further sets of properties which can ensure not only unique localizability but also provide guarantees on the associated computational complexity, which can even be linear in the number of sensors on occasions. Sensor networks with minimal connectedness properties in which sensor transmit
� Network Localization � Partially Localizable networksPLNs � Conditions for Localizability � Identifying RRT Components � Simulation results � Conclusions
"... � Perfect localization may not be possible � Erroneous positions may result in wrong decisions. � Testing for correctness of localization is possible. Mnet. L. C. Chen 3PLN � PLN � Partially Localizable networks � For realistic networks in many environments, it is unlikely that all of the nodes can ..."
Abstract
 Add to MetaCart
be uniquely localized. Mnet. L. C. Chen 4PLN and Challenges � PLN � Partially Localizable networks � To identify the uniquely localizable nodes. � Presented a sufficient graphtheoretic condition for a node to be uniquely localizable. � To determine how to best make use of nodes that cannot be uniquely
Effect of Collaboration on Localizability in RangeBased Localization Systems
"... Abstract—In this paper, we examine, via analysis, the improvement in device localizability through collaboration. Depending on the sensitivity of the receivers in the devices, it is not unusual for an unlocalized device to lack a sufficient number of detectable positioning signals from localized de ..."
Abstract
 Add to MetaCart
devices to determine its location without ambiguity (i.e., to be uniquely localizable). This occurrence is wellknown to be a limiting factor in localization performance, especially in communications systems. In cellular positioning, for example, cellular network designers call this the hearability
Robust Distributed Network Localization with Noisy Range Measurements
, 2004
"... This paper describes a distributed, lineartime 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, lineartime 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 twodimensional 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 realworld deployment geometries. Finally, we show how the algorithm supports localization of mobile nodes.
NONLOCALIZABILITY AND ASYMPTOTIC COMMUTATIVITY
, 2002
"... The mathematical formalism commonly used in treating nonlocal highly singular interactions is revised. The notion of support cone is introduced which replaces that of support for nonlocalizable distributions. Such support cones are proven to exist for distributions defined on the GelfandShilov spac ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The mathematical formalism commonly used in treating nonlocal highly singular interactions is revised. The notion of support cone is introduced which replaces that of support for nonlocalizable distributions. Such support cones are proven to exist for distributions defined on the GelfandShilov spaces S β, where 0 < β < 1. This result leads to a refinement of previous generalizations of the local commutativity condition to nonlocal quantum fields. For string propagators, a new derivation of a representation similar to that of KällenLehmann is proposed. It is applicable to any initial and final string configurations and manifests exponential growth of spectral densities intrinsic in nonlocalizable theories. 1
Robustness to the Loss of Multiple Nodes in the Localizability of Sensor Networks
"... AbstractIn the studies on the localization of wireless sensor networks (WSN), it has been shown that a network is in principle uniquely localizable if its underlying graph is globally rigid and there are at least d + 1 noncollinear anchors (in dspace). The high possibility of the loss of nodes or ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
AbstractIn the studies on the localization of wireless sensor networks (WSN), it has been shown that a network is in principle uniquely localizable if its underlying graph is globally rigid and there are at least d + 1 noncollinear anchors (in dspace). The high possibility of the loss of nodes
Beyond Trilateration: On the Localizability of Wireless Adhoc Networks
"... Abstract — The proliferation of wireless and mobile devices has fostered the demand of context aware applications, in which location is often viewed as one of the most significant contexts. Classically, trilateration is widely employed for testing network localizability; even in many cases it wrongl ..."
Abstract

Cited by 43 (13 self)
 Add to MetaCart
Abstract — The proliferation of wireless and mobile devices has fostered the demand of context aware applications, in which location is often viewed as one of the most significant contexts. Classically, trilateration is widely employed for testing network localizability; even in many cases
Results 1  10
of
3,206