D. Angluin, J. Aspnes, D. Eisenstat, E. [. Ruppert, A. Bhadra et al., The computational power of population protocols Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks, Distributed Computing Proceedings of Adhoc-Now'03, volume 2865 of Lecture Notes in Computer Science, pp.279-304, 2003.

C. Bettstetter, G. Resta, and P. Santi, The node distribution of the random waypoint mobility model for wireless ad hoc networks, IEEE Transactions on Mobile Computing, vol.2, issue.3, pp.257-269, 2003.
DOI : 10.1109/TMC.2003.1233531

J. Chalopin, Y. Métivier, W. Zielonka, and A. Ferreira, Local computations in graphs: The case of cellular edge local computations Building a reference combinatorial model for MANETs A preliminary version appeared as On models and algorithms for dynamic communication networks: The case for evolving graphs, Fundamenta Informaticae IEEE Network, vol.74, issue.185, pp.85-11424, 2004.

E. Godard, Y. Métivier, M. Mosbah, and A. Sellami, Termination Detection of Distributed Algorithms by Graph Relabelling Systems, ICGT '02: Proceedings of the First International Conference on Graph Transformation, pp.106-119, 2002.
DOI : 10.1007/3-540-45832-8_10

I. Litovsky, Y. Métivier, and E. Sopena, Graph relabelling systems and distributed algorithms Handbook of graph grammars and computing by graph transformation, volume III A hundred impossibility proofs for distributed computing, PODC '89: Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, pp.1-56, 1989.