Characterizing topological assumptions of distributed algorithms in dynamic networks

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

Volumn 5869 LNCS, Issue , 2010, Pages 126-140

  Casteigts, Arnaud ^a   Chaumette, Serge ^b   Ferreira, Afonso ^c  

^a UNIVERSITY OF OTTAWA   (Canada)

^b UNIVERSITÉ DE BORDEAUX   (France)

^c INRIA   (France)

Author keywords

Distributed algorithms; Dynamic networks; Evolving graphs; Local interactions; Topological assumptions

Indexed keywords

DISTRIBUTED ALGORITHM; DYNAMIC NETWORK; EVOLVING GRAPHS; LOCAL COMPUTATION; LOCAL INTERACTIONS; NETWORK DYNAMICS; THEORETICAL FRAMEWORK; UNDERLYING NETWORKS;

TOPOLOGY;

ALGORITHMS;

EID: 77949458226     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11476-2_11     Document Type: Conference Paper

References (9)

1. +06] Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing 18(4), 235-253 (2006)
2. [AAER07] Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distributed Computing 20(4), 279-304 (2007)
3. [BF03] Bhadra, S., Ferreira, A.: Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks. In: Pierre, S., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2003. LNCS, vol. 2865, pp. 259-270. Springer, Heidelberg (2003)
4. [BRS03] Bettstetter, C., Resta, G., Santi, P.: The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Transactions on Mobile Computing 2(3), 257-269 (2003)
5. [CMZ06] Chalopin, J., Métivier, Y., Zielonka, W.: Local computations in graphs: The case of cellular edge local computations. Fundamenta Informaticae 74(1), 85-114 (2006)
6. [Fer04] Ferreira, A.: Building a reference combinatorial model for MANETs. IEEE Network 18(5), 24-29 (2004); A preliminary version appeared as On models and algorithms for dynamic communication networks: The case for evolving graphs, Algotel 2002, Meze, FR
7. [GMMS02] Godard, E., Métivier, Y., Mosbah, M., Sellami, A.: Termination detection of distributed algorithms by graph relabelling systems. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 106-119. Springer, Heidelberg (2002)
8. [LMS99] Litovsky, I., Métivier, Y., Sopena, E.: Graph relabelling systems and distributed algorithms. In: World Scientific (ed.) Handbook of graph grammars and computing by graph transformation, vol. III, pp. 1-56. World Scientific, Singapore (1999)
9. [Lyn89] Lynch, N.: A hundred impossibility proofs for distributed computing. In: PODC 1989: Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, pp. 1-28. ACM, New York (1989)