Computation in networks of passively mobile finite-state sensors

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 290-299

  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

ALGORITHMS; AUTOMATA THEORY; COMPUTATION THEORY; COMPUTER SIMULATION; PROBABILITY; SENSORS; SIGNAL PROCESSING;

DIFFUSE COMPUTATION; FINITE-STATE AGENT; MOBILE AGENTS; SENSOR NET;

TELECOMMUNICATION NETWORKS;

EID: 10444287574     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1011767.1011810     Document Type: Conference Paper

References (18)

1. D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta. Urn automata. Technical Report YALEU/DCS/TR-1280, Yale University Department of Computer Science, Nov. 2003.
2. G. Berry and G. Boudol. The Chemical Abstract Machine. Theoretical Computer Science, 96:217-248, 1992.
3. D. Brand and P. Zafiropulo. On communicating finite-state machines. J. ACM, 30(2):323-342, Apr. 1983.
4. Z. Diamadi and M. J. Fischer. A simple game for the study of trust in distributed systems. Wuhan University Journal of Natural Sciences, 6(1-2):72-82, Mar. 2001. Also appears as Yale Technical Report TR-1207, January 2001, available at URL ftp://ftp.cs.yale.edu/pub/TR/tr1207.ps.
5. Z. Diamadi and M. J. Fischer. A simple game for the study of trust in distributed systems. Wuhan University Journal of Natural Sciences, 6(1-2):72-82, Mar. 2001. Also appears as Yale Technical Report TR-1207, January 2001, available at URL ftp://ftp.cs.yale.edu/pub/TR/tr1207.ps.
6. J. Esparza. Decidability and complexity of Petri net problems-an introduction. In G. Rozenberg and W. Reisig, editors, Lectures on Petri Nets I: Basic models., pages 374-428. Springer Verlag, 1998. Published as LNCS 1491.
7. J. Esparza and M. Nielsen. Decibility issues for Petri nets - a survey. Journal of Informatik Processing and Cybernetics, 30(3):143-160, 1994.
8. Q. Fang, F. Zhao, and L. Guibas. Lightweight sensing and communication protocols for target enumeration and aggregation. In Proceedings of the 4th ACM International Symposium on Mobile ad hoc networking & computing, pages 165-176. ACM Press, 2003.
9. S. Ginsburg and E. H. Spanier. Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics, 16:285-296, 1966.
10. M. Grossglauser and D. N. C. Tse. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Transactions on Networking, 10(4):477-486, 2002.
11. O. H. Ibarra, Z. Dang, and O. Egecioglu. Catalytic p systems, semilinear sets, and vector addition systems. Theor. Comput. Sci., 312(2-3):379-399, 2004.
12. N. Immerman. Nondeterministic space is closed under complementation. SIAM J. Comput., 17(5):935-938, Oct. 1988.
13. C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion: a scalable and robust communication paradigm for sensor networks. In Proceedings of the 6th Annual International Conference on Mobile computing and networking, pages 56-67. ACM Press, 2000.
14. S. R. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong. TAG: a Tiny AGgregation service for ad-hoc sensor networks. In OSDI 2002: Fifth Symposium on Operating Systems Design and Implementation, December, 2002.
15. R. Milner. Bigraphical reactive systems: basic theory. Technical report, University of Cambridge, 2001. UCAM-CL-TR-523.
16. M. L. Minsky. Computation: Finite and Infinite Machines. Prentice-Hall Series in Automatic Computation. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1967.
17. H. Volzer. Randomized non-sequential processes. In Proceedings of CONCUR 2001-Concurrency Theory, pages 184-201, Aug. 2001.
18. F. Zhao, J. Liu, J. Liu, L. Guibas, and J. Reich. Collaborative signal and information processing: An information directed approach. Proceedings of the IEEE, 91(8):1199-1209, 2003.