by Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, René Peralta
Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June/July, 2005, Proceedings, volume 3560 of Lecture Notes in Computer Science
http://www.hjiang.net/publications/graph-properties.pdf
Add To MetaCart
Abstract:
Abstract. We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what properties of the network graph can be stably computed by the devices. We show that they can detect whether the network has degree bounded by a constant d, and, if so, organize a computation that achieves asymptotically optimal linear memory use. We define a model of stabilizing inputs to such devices and show that a large class of predicates of the multiset of final input values are stably computable in any weakly-connected network. We also show that nondeterminism in the transition function does not increase the class of stably computable predicates.
Citations
|
1042
|
Directed diffusion: A scalable and robust communication paradigm for sensor networks
– Intanagonwiwat, Govindan, et al.
- 2000
|
|
547
|
Tag: a tiny aggregation service for ad-hoc sensor networks
– Madden, Franklin, et al.
- 2002
|
|
377
|
Mobility increases the capacity of ad hoc wireless networks
– Grossglauser, Tse
- 2002
|
|
315
|
Next Century Challenges: Mobile Networking for ’Smart Dust
– Kahn, Katz, et al.
- 1999
|
|
153
|
On communicating finite-state machines
– Brand, Zafiropulo
- 1983
|
|
114
|
An algorithm for the general Petri net reachability problem
– Mayr
- 1984
|
|
66
|
Decidability issues for petri nets - a survey
– Esparza, Nielsen
- 1994
|
|
44
|
Collaborative signal and information processing: An information directed approach
– Zhao, Liu, et al.
- 1999
|
|
32
|
On the reachability problem for 5-dimensional vector addition systems
– Hopcroft, Pansiot
- 1979
|
|
31
|
The Chemical Abstract Machine, Theoretical Computer Science 96
– Berry, Boudol
- 1992
|
|
30
|
Fast and lean self-stabilizing asynchronous protocols
– Itkis, Levin
- 1994
|
|
26
|
Lightweight sensing and communication protocols for target enumeration and aggregation
– Fang, Zhao, et al.
- 2003
|
|
25
|
Bigraphical reactive systems: Basic theory
– Milner
- 2001
|
|
21
|
Computation in networks of passively mobile finite-state sensors
– Angluin, Aspnes, et al.
- 2006
|
|
17
|
A simple game for the study of trust in distributed systems
– Diamadi, Fischer
- 2001
|
|
16
|
A Survey of Basic Net Models and Modular Net Classes
– Bernardinello, Cindio
- 1992
|
|
13
|
Catalytic p systems, semilinear sets, and vector addition systems
– Ibarra, Dang, et al.
- 2004
|
|
13
|
Smart Dust Protocols for Local Detection and Propagation
– Chatzigiannakis, Nikoletseas, et al.
- 2002
|
|
11
|
Urn automata
– Angluin, Aspnes, et al.
- 2003
|
|
9
|
Decidability and complexity of Petri net problems-an introduction
– Esparza
- 1998
|
|
6
|
E.H.: Semigroups, Presburger formulas, and languages
– Ginsburg, Spanier
- 1966
|
|
2
|
Pister K.S.J.: Next Century Challenges: Mobile Networking for ’Smart Dust
– Kahn, Katz
- 1999
|
