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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 290–299. ACM Press, New York (2004)
Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Urn automata. Technical Report YALEU/DCS/TR–1280, Yale University Department of Computer Science (2003)
Diamadi, Z., Fischer, M.J.: A simple game for the study of trust in distributed systems. Wuhan University Journal of Natural Sciences 6, 72–82 (2001); Also appears as Yale Technical Report TR–1207 (January 2001), available at ftp://ftp.cs.yale.edu/pub/TR/tr1207.ps
Bernardinello, L., Cindio, F.D.: A survey of basic net models and modular net classes. In: Rozenberg, G. (ed.) APN 1992. LNCS, vol. 609, pp. 304–351. Springer, Heidelberg (1992)
Esparza, J., Nielsen, M.: Decibility issues for Petri nets - a survey. Journal of Informatik Processing and Cybernetics 30, 143–160 (1994)
Esparza, J.: Decidability and complexity of Petri net problems-an introduction. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 374–428. Springer, Heidelberg (1998)
Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13, 441–460 (1984)
Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics 16, 285–296 (1966)
Hopcroft, J., Pansiot, J.: On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science 8, 135–159 (1978)
Berry, G., Boudol, G.: The Chemical Abstract Machine. Theoretical Computer Science 96, 217–248 (1992)
Ibarra, O.H., Dang, Z., Egecioglu, O.: Catalytic p systems, semilinear sets, and vector addition systems. Theor. Comput. Sci. 312, 379–399 (2004)
Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM 30, 323–342 (1983)
Milner, R.: Bigraphical reactive systems: basic theory. Technical report, University of Cambridge, UCAM-CL-TR-523 (2001)
Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proceedings of the 6th Annual International Conference on Mobile computing and networking, pp. 56–67. ACM Press, New York (2000)
Madden, S.R., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a Tiny AGgregation service for ad-hoc sensor networks. In: OSDI 2002: Fifth Symposium on Operating Systems Design and Implementation (December 2002)
Fang, Q., Zhao, F., Guibas, L.: Lightweight sensing and communication protocols for target enumeration and aggregation. In: Proceedings of the 4th ACM International Symposium on Mobile ad hoc networking & computing, pp. 165–176. ACM Press, New York (2003)
Zhao, F., Liu, J., Liu, J., Guibas, L., Reich, J.: Collaborative signal and information processing: An information directed approach. Proceedings of the IEEE 91, 1199–1209 (2003)
Grossglauser, M., Tse, D.N.C.: Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Transactions on Networking 10, 477–486 (2002)
Kahn, J.M., Katz, R.H., Pister, K.S.J.: Next century challenges: mobile networking for “Smart Dust”. In: MobiCom 1999: Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, pp. 271–278. ACM Press, New York (1999)
Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: Smart dust protocols for local detection and propagation. In: POMC 2002: Proceedings of the second ACM international workshop on Principles of mobile computing, pp. 9–16. ACM Press, New York (2002)
Itkis, G., Levin, L.A.: Fast and lean self-stabilizing asynchronous protocols. In: Proceeding of 35th Annual Symposium on Foundations of Computer Science, pp. 226–239. IEEE Press, Los Alamitos (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R. (2005). Stably Computable Properties of Network Graphs. In: Prasanna, V.K., Iyengar, S.S., Spirakis, P.G., Welsh, M. (eds) Distributed Computing in Sensor Systems. DCOSS 2005. Lecture Notes in Computer Science, vol 3560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11502593_8
Download citation
DOI: https://doi.org/10.1007/11502593_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26422-4
Online ISBN: 978-3-540-31671-8
eBook Packages: Computer ScienceComputer Science (R0)