A. Montresor and M. Jelasity, PeerSim: A scalable P2P simulator, The 9th Int. Conference on Peer-to-Peer (P2P'09, pp.99-100, 2009.

T. D. Chandra, V. Hadzilacos, and S. Toueg, The weakest failure detector for solving consensus, Journal of the ACM (JACM), vol.43, issue.4, pp.685-722, 1996.

D. Peleg, Time-optimal leader election in general networks, Journal of parallel and distributed computing, vol.8, issue.1, pp.96-99, 1990.

L. Lamport, The part-time parliament, ACM Transactions on Computer Systems (TOCS), vol.16, issue.2, pp.133-169, 1998.

S. Nakamoto, Bitcoin: A peer-to-peer electronic cash system, 2008.

H. V. Netto, L. C. Lung, M. Correia, A. F. Luiz, and L. M. De-souza, State machine replication in containers managed by kubernetes, Journal of Systems Architecture, vol.73, pp.53-59, 2017.

P. Hunt, M. Konar, F. P. Junqueira, and B. Reed, Zookeeper: Wait-free coordination for internet-scale systems, USENIX annual technical conference, vol.8, 2010.

G. and L. Lann, Distributed systems-towards a formal approach, IFIP congress, vol.7, pp.155-160, 1977.

E. Chang and R. Roberts, An improved algorithm for decentralized extrema-finding in circular configurations of processes, Communications of the ACM, vol.22, issue.5, pp.281-283, 1979.

N. A. Lynch, Distributed algorithms, pp.52-56, 1996.

N. Malpani, J. L. Welch, and N. Vaidya, Leader election algorithms for mobile ad hoc networks, The 4th int. workshop on Discrete algorithms and methods for mobile computing and communications, pp.96-103, 2000.

S. Vasudevan, J. Kurose, and D. Towsley, Design and analysis of a leader election algorithm for mobile ad hoc networks, The 12th int. Conference on Network Protocols, ICNP, pp.350-360, 2004.

M. Rahman, M. Abdullah-al-wadud, and O. Chae, Performance analysis of leader election algorithms in mobile ad hoc networks, Int. J. of Computer Science and Network Security, vol.8, issue.2, pp.257-263, 2008.

R. Ingram, T. Radeva, P. Shields, S. Viqar, J. E. Walter et al., A leader election algorithm for dynamic networks with causal clocks, Distributed computing, vol.26, issue.2, pp.75-97, 2013.

L. Arantes, F. Greve, P. Sens, and V. Simon, Eventual leader election in evolving mobile networks, Int. Conference On Principles Of Distributed Systems, pp.23-37, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00927651

C. Shea, B. Hassanabadi, and S. Valaee, Mobility-based clustering in vanets using affinity propagation, GLOBECOM, pp.1-6, 2009.

C. Gómez-calzado, A. Lafuente, M. Larrea, and M. Raynal, Faulttolerant leader election in mobile dynamic distributed systems, 19th Pacific Rim Int. Symposium on Dependable Computing, pp.78-87, 2013.

C. Kim and M. Wu, Leader election on tree-based centrality in ad hoc networks, Telecommunication Systems, vol.52, issue.2, pp.661-670, 2013.

C. Fernández-campusano, M. Larrea, R. Cortiñas, and M. Raynal, A distributed leader election algorithm in crash-recovery and omissive systems, Information Processing Letters, vol.118, pp.100-104, 2017.

M. Nesterenko and S. Tixeuil, Discovering network topology in the presence of byzantine faults, Transactions on Parallel and Distributed Systems, vol.20, issue.12, pp.1777-1789, 2009.

B. Bellur and R. G. Ogier, A reliable, efficient topology broadcast protocol for dynamic networks, INFOCOM'99. Conference on Computer Communications. 18th Annual Joint Conference of the IEEE Computer and Communications Societies, vol.1, pp.178-186, 1999.

R. Ingram, P. Shields, J. E. Walter, and J. L. Welch, An asynchronous leader election algorithm for dynamic networks, Int. Symposium on Parallel & Distributed Processing, pp.1-12, 2009.

D. S. Hirschberg and J. B. Sinclair, Decentralized extrema-finding in circular configurations of processors, Communications of the ACM, vol.23, issue.11, pp.627-628, 1980.

P. Humblet, A distributed algorithm for minimum weight directed spanning trees, IEEE Transactions on Communications, vol.31, issue.6, pp.756-762, 1983.

B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems, The 19th annual ACM symposium on Theory of computing, pp.230-240, 1987.

M. J. Fischer, N. A. Lynch, and M. S. Paterson, Impossibility of distributed consensus with one faulty process, J. ACM, vol.32, issue.2, pp.374-382, 1985.

M. Larrea, A. Fernández, and S. Arévalo, Optimal implementation of the weakest failure detector for solving consensus, 19th IEEE Symposium on Reliable Distributed Systems, SRDS'00, Proc, pp.52-59, 2000.

M. K. Aguilera, C. Delporte-gallet, H. Fauconnier, and S. Toueg, On implementing omega with weak reliability and synchrony assumptions, The 22nd annual symposium on Principles of distributed computing, pp.306-314, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00154822

A. Mostéfaoui, E. Mourgaya, M. Raynal, and C. Travers, A time-free assumption to implement eventual leadership, Parallel Process. Lett, vol.16, issue.2, pp.189-208, 2006.

L. Melit and N. Badache, An ?-based leader election algorithm for mobile ad hoc networks, Networked Digital Technologies -4th Int. Conference. Part I, pp.483-490, 2012.

L. Lamport, Time, clocks, and the ordering of events in a distributed system, Commun. ACM, vol.21, issue.7, pp.558-565, 1978.

A. Bavelas, Communication patterns in task-oriented groups, The journal of the acoustical society of America, vol.22, issue.6, pp.725-730, 1950.

T. Camp, J. Boleng, and V. Davies, A survey of mobility models for ad hoc network research, Wireless communications and mobile computing, vol.2, issue.5, pp.483-502, 2002.

M. Papandrea, K. K. Jahromi, M. Zignani, S. Gaito, S. Giordano et al., On the properties of human mobility, Computer Communications, vol.87, pp.19-36, 2016.