Causality, influence, and computation in possibly disconnected synchronous dynamic networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7702 LNCS, Issue , 2012, Pages 269-283

  Michail, Othon ^a,b   Chatzigiannakis, Ioannis ^a,b   Spirakis, Paul G ^a,b  

^a University of Patras and Computer Technology Institute   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

adversarial schedule; counting; dynamic graph; information dissemination; mobile computing; temporal connectivity; worst case dynamicity

Indexed keywords

ADVERSARIAL SCHEDULE; COUNTING; DYNAMIC GRAPH; TEMPORAL CONNECTIVITY; WORST-CASE DYNAMICITY;

INFORMATION THEORY; MOBILE COMPUTING;

INFORMATION DISSEMINATION;

EID: 84871652647     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-35476-2_19     Document Type: Conference Paper

References (25)

1. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing, 235-253 (March 2006)
2. Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distributed Computing 20(4), 279-304 (2007)
3. Avin, C., Koucký, M., Lotker, Z.: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 121-132. Springer, Heidelberg (2008)
4. Augustine, J., Pandurangan, G., Robinson, P., Upfal, E.: Towards robust and efficient computation in dynamic peer-to-peer networks. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 551-569. SIAM (2012)
5. Attiya, H., Welch, J.: Distributed computing: fundamentals, simulations, and advanced topics, vol. 19. Wiley-Interscience (2004)
6. Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, PODC 2009, pp. 260-269. ACM (2009)
7. Bollobás, B.: Modern Graph Theory, corrected edn. Springer (July 1998)
8. Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-Varying Graphs and Dynamic Networks. In: Frey, H., Li, X., Ruehrup, S. (eds.) ADHOC-NOW 2011. LNCS, vol. 6811, pp. 346-359. Springer, Heidelberg (2011)
9. Clementi, A.E., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time in edge-markovian dynamic graphs. In: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing, PODC 2008, pp. 213-222. ACM, New York (2008)
10. Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., Spirakis, P.G.: Passively mobile communicating machines that use restricted space. Theor. Comput. Sci. 412(46), 6469-6483 (2011)
11. Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)
12. Haeupler, B.: Analyzing network coding gossip made easy. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pp. 293-302. ACM (2011)
13. Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 504-513 (2000)
14. Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, pp. 513-522. ACM, New York (2010)
15. Kuhn, F., Oshman, R.: Dynamic networks: models and algorithms. SIGACT News 42, 82-96 (2011);
16. Keidar, I. (ed): Distributed Computing Column
17. Kuhn, F., Oshman, R., Moses, Y.: Coordinated consensus in dynamic networks. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 1-10 (2011)
18. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558-565 (1978)
19. Lynch, N.A.: Distributed Algorithms, 1st edn. Morgan Kaufmann (1996)
20. Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Mediated population protocols. Theor. Comput. Sci. 412(22), 2434-2450 (2011)
21. Michail, O., Chatzigiannakis, I., Spirakis, P.G.: New Models for Population Protocols. In: Lynch, N.A. (ed.) Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool (2011)
22. Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 437-438. Springer, Heidelberg (2012)
23. O'Dell, R.,Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: Proceedings of the 2005 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC 2005, pp. 104-110 (2005)
24. Scheideler, C.: Models and Techniques for Communication in Dynamic Networks. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 27-49. Springer, Heidelberg (2002)
25. Soifer, A.: The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators, 1st edn. Springer (2009)