Computation in networks of passively mobile finite-state sensors

Distributed Computing

Volumn 18, Issue 4, 2006, Pages 235-253

  Angluin, Dana ^a   Aspnes, James ^a   Diamadi, Zoë ^a   Fischer, Michael J ^a   Peralta, René ^a  

^a Yale University   (United States)

Author keywords

Diffuse computation; Finite state agent; Intermittent communication; Mobile agent; Sensor net; Stable computation

Indexed keywords

AUTOMATA THEORY; COMPUTATION THEORY; DIGITAL ARITHMETIC; MATHEMATICAL MODELS; MOBILE TELECOMMUNICATION SYSTEMS; NETWORK PROTOCOLS;

DIFFUSE COMPUTATION; FINITE-STATE AGENT; INTERMITTENT COMMUNICATION; MOBILE AGENT; SENSOR NET; STABLE COMPUTATION;

SENSORS;

EID: 33646536376     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-005-0138-3     Document Type: Conference Paper

References (25)

1. Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Viktor K. Prasanna, Sitharama Iyengar, Paul Spirakis and Matt Welsh (eds.), Distributed Computing in Sensor Systems: First IEEE International Conference (2005). Lecture Notes in Computer Science 3560, 63-74 (June/July, 2005) Proceedings Marina del Rey, CA, USA
2. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Urn automata. Tech. Rep. YALEU/DCS/TR-1280, Yale University Department of Computer Science (2003)
3. Berry, G., Boudol, G.: The chemical abstract machine. Theor. Comp. Sci. 96, 217-248 (1992)
4. Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323-342 (1983)
5. Diamadi, Z., Fischer, M.J.: A simple game for the study of trust in distributed systems. Wuhan Univ. J. Natur. Sci. 6(1-2), 72-82 (2001).
6. Also appears as Yale Technical Report TR-1207, January 2001, available at URL ftp://ftp.cs.yale.edu/pub/TR/tr1207.ps
7. Esparza, J.: Decidability and complexity of Petri net problems-an introduction. In: Rozenberg, G., Reisig, W., (eds.) Lectures on Petri Nets I: Basic models, pp. 374-428. Springer Verlag (1998). Published as LNCS 1491
8. Esparza, J., Nielsen, M.: Decibility issues tor Petri nets - a survey. J. Inform. Process. Cybern. 30(3), 143-160 (1994)
9. 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 (2003)
10. Fischer, M.T., Rabin, M.O.: Super-exponential complexity of Presburger arithmetic. In: Complexity ot Computation, SIAM-AMS Proceedings, vol. VII, pp. 27-41. American Mathematical Society (1974)
11. Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pac. J. Math. 16, 285-296 (1966)
12. Grossglauser, M., Tse, D.N.C.: Mobility increases the capacity of ad hoc wireless networks. IEEH/ACM Transac. Networking 10(4), 477-486(2002)
13. Ibarra, O.H., Dang, Z., Egecioglu, O.: Catalytic p systems, semilinear sets, and vector addition systems. Theor. Comput. Sci. 312(2-3), 379-399 (2004)
14. Immerman, N.: Nondeterministic space is closed under complementation. SIAM J. Comput. 17(5), 935-938 (1988)
15. 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 (2000)
16. Kracht, M.: The Mathematics of Language. Studies in Generative Grammar, vol. 63. Mouton de Gruyter (2003). ISBN 3-11-017620-3
17. Madden, S.R., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: A Tiny AGgregation service for ad-hoc sensor networks (December, 2002). In OSDI 2002: Fifth Symposium on Operating Systems Design and Implementation
18. Milner, R.: Bigraphical reactive systems: basic theory. Tech. rep., University of Cambridge (2001). UCAM-CL-TR-523
19. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall Series in Automatic Computation. Prentice-Hall, Inc., Englewood Cliffs, N.J. (1967)
20. Monk, J.D.: Mathematical Logic. Springer, Berlin, Heidelberg (1976)
21. von Neumann, J.: Theory and organization of complicated automata. In: A.W. Burks (ed.) Theory of Self-Reproducing Automata [by] John von Neumann, pp. 29-87 (Part One). University of Illinois Press, Urbana (1949). Based on transcripts of lectures delivered at the University of Illinois, in December 1949. Edited for publication by A.W. Burks
22. Parikh, R.J.: On context-free languages. J. ACM 13(4), 570-581 (1966). DOI http://doi.acm.org/10.1145/321356.321364
23. Presburger, M.: Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Comptes-Rendus du I Congrès de Mathématiciens des Pays Slaves, pp. 92-101. Warszawa (1929)
24. Volzer, H.: Randomized non-sequential processes. In: Proceedings of CONCUR 2001-Concurrency Theory, pp. 184-201 (2001)
25. Zhao, F., Liu, J., Liu, J., Guibas, L., Reich, J.: Collaborative signal and information processing: An information directed approach. Proc. IEEE 91(8), 1199-1209 (2003)