Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
91,002
6Connectivity-Based and Anchor-Free Localization in Large-Scale 2D/3D Sensor Networks GUANG TAN, SIAT, Chinese Academy of Sciences
"... A connectivity-based and anchor-free three-dimensional localization (CATL) scheme is presented for large-scale sensor networks with concave regions. It distinguishes itself from previous work with a combination of three features: (1) it works for networks in both 2D and 3D spaces, possibly containin ..."
Abstract
- Add to MetaCart
A connectivity-based and anchor-free three-dimensional localization (CATL) scheme is presented for large-scale sensor networks with concave regions. It distinguishes itself from previous work with a combination of three features: (1) it works for networks in both 2D and 3D spaces, possibly
Anchor-Free Localization in Mixed . . .
, 2008
"... Recent technological advances have fostered the emergence of Wireless Sensor Networks (WSNs), which consist of tiny, wireless, battery-powered nodes that are expected to revolutionize the ways in which we understand and construct complex physical systems. A fundamental property needed to use and mai ..."
Abstract
- Add to MetaCart
a series of useful methods for localization in mixed WSNs. First, GDL provides an approximation called âhop-coordinatesâ, which improves the accuracy of both hop-counting and connectivity-based measurement techniques. Second, GDL utilizes a distributed algorithm to compute the locations of all
Anchor-Free Distributed Localization in Sensor Networks
, 2003
"... Many sensor network applications require that each node's sensor stream be annotated with its physical location in some common coordinate system. Manual measurement and configuration methods for obtaining location don't scale and are error-prone, and equipping sensors with GPS is often exp ..."
Abstract
-
Cited by 126 (8 self)
- Add to MetaCart
algorithm called AFL (Anchor-Free Localization) where nodes start from a random initial coordinate assignment and converge to a consistent solution using only local node interactions. The key idea in AFL is fold-freedom, where nodes first configure into a topology that resembles a scaled and unfolded
Mobile anchor-free localization for wireless sensor networks
- In Distributed Computing in Sensor Systems
, 2007
"... Localization is a fundamental problem in wireless sensor networks. In this paper, we consider how to localize individual nodes in a wireless sensor network when some subset of the network nodes can be in motion at any given time. For situations in which it is not practical or costefficient to use GP ..."
Abstract
-
Cited by 8 (1 self)
- Add to MetaCart
GPS or anchor nodes, this paper proposes an Anchor-Free (AF) Mobile Geographic Distributed Localization (MGDL) algorithm for wireless sensor networks. Taking advantage of the accelerometers that are present in standard motes, MGDL monitors a moving distance for each node, then uses a procedures
Connectivity-based Localization of Large Scale Sensor Networks with Complex Shape
"... Abstract—We study the problem of localizing a large sensor network having a complex shape, possibly with holes. A major challenge with respect to such networks is to figure out the correct network layout, i.e., avoid global flips where a part of the network folds on top of another. Our algorithm fir ..."
Abstract
-
Cited by 31 (4 self)
- Add to MetaCart
localization algorithm for large networks using only network connectivity. Simulations on various network topologies show surprisingly good results. In comparison, previous connectivity-based localization algorithms such as multi-dimensional scaling and rubberband representation generate globally flipped
Accurate Anchor-Free Node Localization in Wireless Sensor Networks
"... There has been a growing interest in the applications of wireless sensor networks in unattended environments. In such applications, sensor nodes are usually deployed randomly in an area of interest. Knowledge of accurate node location is essential in such network setups in order to correlate the gat ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
. In this paper, we present an efficient anchor-free protocol for localization in wireless sensor networks. Each node discovers its neighbors that are within its transmission range and estimates their ranges. Our algorithm fuses local range measurements in order to form a network wide unified coordinate systems
Connectivity-based Localization in Robot Networks
"... Abstract—Consider a small team of autononomous robots, each equipped with a radio, that are deployed in an ad-hoc fashion and whose goal it is to act as signal relay nodes to form a temporary, adaptive, and highly robust communication network. To perform this type of self-optimization and self-heali ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
-healing, relative localization (i.e. knowing direction and distance to every other robot in the network) is necessary. In a sense, the problem is similar to the one studied in ad-hoc sensor networks. The key differences are that (1) anchor nodes with known locations are not available; that (2) the connectivity
Connectivity-based sensor network localization with incremental delaunay refinement method
- In Proc. of the 28th Annual IEEE Conference on Computer Communications (INFOCOM’09
, 2009
"... Abstract—We study the anchor-free localization problem for a large-scale sensor network with a complex shape, knowing network connectivity information only. The main idea follows from our previous work [19] in which a subset of the nodes are selected as landmarks and the sensor field is partitioned ..."
Abstract
-
Cited by 11 (1 self)
- Add to MetaCart
Abstract—We study the anchor-free localization problem for a large-scale sensor network with a complex shape, knowing network connectivity information only. The main idea follows from our previous work [19] in which a subset of the nodes are selected as landmarks and the sensor field is partitioned
Multi-scale Anchor-free Distributed Positioning in Sensor Networks
"... Abstract—Positioning is one of the most fundamental problems in sensor networks: Given the network’s connectivity graph and some additional local information on measured distances and/or angles, the goal is to recover the nodes ’ positions. Varying the assumptions regarding the nature and the qualit ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract—Positioning is one of the most fundamental problems in sensor networks: Given the network’s connectivity graph and some additional local information on measured distances and/or angles, the goal is to recover the nodes ’ positions. Varying the assumptions regarding the nature
Results 1 - 10
of
91,002
