## Organizing a Global Coordinate System from Local Information on an Amorphous Computer (1999)

### Cached

### Download Links

Citations: | 282 - 6 self |

### BibTeX

@MISC{Nagpal99organizinga,

author = {Radhika Nagpal},

title = {Organizing a Global Coordinate System from Local Information on an Amorphous Computer},

year = {1999}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper demonstrates that it is possible to generate a reasonably accurate coordinate system on randomly distributed processors, using only local information and local communication. By coordinate system we imply that each element assigns itself a logical coordinate that maps to its global physical location, starting with no apriori knowledge of position or orientation. The algorithm presented is inspired by biological systems that use chemical gradients to determine the position of cells [12]. Extensive analysis and simulation results are presented. Two key results are: there is a critical minimum average neighborhood size of 15 for good accuracy and there is a fundamental limit on the resolution of any coordinate system determined strictly from local communication. We also demonstrate that using this algorithm, random distributions of processors produce significantly better accuracy than regular processor grids - such as those used by cellular automata. This has implications for discrete models of biology as well as for building smart sensor arrays.

### Citations

1636 |
Distributed Algorithms
- Lynch
- 1996
(Show Context)
Citation Context ...inimum hop count value, hi, that a sensor i maintains will eventually be the length of the shortest path to the seed in communication hops. Hence a gradient is essentially a breadth-first-search tree =-=[8]-=-. In our ad hoc sensor network, a communication hop has a maximum physical distance of r associated with it. This implies that a sensor i is at most distance hir from the seed. However as the average ... |

1560 | System architecture directions for networked sensors
- Hill, Szewczyk, et al.
- 2000
(Show Context)
Citation Context ...works using inexpensive nodes consisting of a low power processor, a modest amount of memory, a wireless network transceiver and a sensor board; a typical node is comparable in size to 2 AA batteries =-=[5]-=-. Many novel applications are emerging: habitat monitoring, smart building reporting failures, target tracking, etc. In these applications it is necessary to accurately orient the nodes with respect t... |

1486 | An in-building rf-based user location and tracking system
- BAHL, PADMANABHAN
(Show Context)
Citation Context ...of sensors. There are many different localization systems that depend on having direct distance estimates to globally accessible beacons such as the Global Positioning System [6], indoor localization =-=[1]-=- [14], and cell phone location determination [3]. Recently there has been some research in localization in the context of wireless sensor networks where globally accessible beacons are not available. ... |

669 | Dynamic fine-grained localization in Ad-hoc networks for sensors
- Savvides, Han, et al.
- 2001
(Show Context)
Citation Context ...s (and a percentage of known sensor positions). This method critically depends on the availability of inter-sensor distance measurements and requires expensive centralized computation. Savvides et al =-=[15]-=- describe a distributed localization algorithm that recursively infers the positions of sensors with unknown position from the current set of sensors with known positions, using inter-sensor distance ... |

419 | Convex position estimation in wireless sensor networks
- DOHERTY, PISTER, et al.
- 2001
(Show Context)
Citation Context ...l phone location determination [3]. Recently there has been some research in localization in the context of wireless sensor networks where globally accessible beacons are not available. Doherty et al =-=[4]-=- present a technique based on constraint satisfaction using inter-sensor distance estimates (and a percentage of known sensor positions). This method critically depends on the availability of inter-se... |

337 |
Global Positioning System: Theory and Practice, Fourth Edition
- Hofmann-Wellenhof, Lichtenegger, et al.
- 1997
(Show Context)
Citation Context ...ailures and the addition of sensors. There are many different localization systems that depend on having direct distance estimates to globally accessible beacons such as the Global Positioning System =-=[6]-=-, indoor localization [1] [14], and cell phone location determination [3]. Recently there has been some research in localization in the context of wireless sensor networks where globally accessible be... |

161 |
Anit Chakraborty, and Hari Balakrishnan, “The Cricket Location-Support System
- Priyantha
- 2000
(Show Context)
Citation Context ...ensors. There are many different localization systems that depend on having direct distance estimates to globally accessible beacons such as the Global Positioning System [6], indoor localization [1] =-=[14]-=-, and cell phone location determination [3]. Recently there has been some research in localization in the context of wireless sensor networks where globally accessible beacons are not available. Doher... |

80 | SelfConfiguring Localization Systems: Design and Experimental Evaluation
- Bulusu, Heidemann, et al.
- 2004
(Show Context)
Citation Context ...y been sprinkled over the terrain. The algorithm exploits two principles: (1) the communication hops between two sensors can give us an easily obtainable and reasonably accurate distance estimate and =-=(2)-=- by using imperfect distance estimates from many sources we can minimize position error. Both of these steps can easily be computed locally by a sensor, without assuming sophisticated radio capabiliti... |

62 |
Mathematical statistics with application
- Wackerly, Mendelhall, et al.
- 1996
(Show Context)
Citation Context ...ndom x coordinate and random y coordinate on the unit square, independently of all other sensors. The probability that there are k sensors in a given area a can be described by a Poisson distribution =-=[10]-=-. P r(k sensors in area a) = (ρa)k k! e−ρa From this formula, we can derive the expected number of sensors in area a to be ρa. ρ is equal to N S where N is the total number of sensors and S is the tot... |

55 |
Connectivity Properties of Packet Radio Network model
- Philips, Panwar, et al.
- 1989
(Show Context)
Citation Context ...ze network throughput. Shivendra et al showed that the theoretical expected local neighborhood nlocal to ensure connectedness is between 2.195 and 10.526 and simulation experiments suggest at least 5 =-=[13]-=-. Silvester and Kleinrock proved that nlocal = 6 produces optimal network throughput for randomly distributed receivers [7]. In the process they6 Radhika Nagpal et al. Average Distance Covered per Ho... |

44 | An algorithm for group formation in an amorphous computer
- Nagpal, Coore
- 1998
(Show Context)
Citation Context ...ded by the group members. Group members drop out of the group when they cease to be able to sense the target. Forming the group: Group formation is based on the leader election algorithm presented in =-=[12]-=-. This is a randomized greedy election algorithm that 2 perhaps using active monitoring of neighbors’ aliveness to produce active gradients.Organizing Coordinate Systems 15 establishes which sensors ... |

26 |
Algorithms for distributed sensor networks
- McLurkin
- 1999
(Show Context)
Citation Context ...an theoretically characterize how the density of the sensors affects the error. Our algorithm is based on a simpler method introduced by one of the authors in [11] but also independently suggested in =-=[9]-=-. Section 2 presents the algorithm for organizing the global coordinate system from local information. We present a theoretical analysis of the accuracy of the coordinate system along with simulation ... |

8 |
Optimum tranmission radii for packet radio networks or why six is a magic number
- Kleinrock, Silvester
(Show Context)
Citation Context ...s is between 2.195 and 10.526 and simulation experiments suggest at least 5 [13]. Silvester and Kleinrock proved that nlocal = 6 produces optimal network throughput for randomly distributed receivers =-=[7]-=-. In the process they6 Radhika Nagpal et al. Average Distance Covered per Hop (dhop) Distance (in units of r) 1 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0 3 5 10 15 20 25 30 35 40 45 50 dhop (avg) dhop (s... |