Stably computable properties of network graphs

Full textClick to download.
CitationIn Proc. of IEEE/ACM International Conference on Distributed Computing in Sensor Systems (DCOSS 2005), June 2005.
AuthorsDana Angluin
James Aspnes
Melody Chan
Michael J. Fischer
Hong Jiang
Rene Peralta


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.

Back to publications
Back to previous page