IEEE Std 802.11n-2009 – Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications Amendment 5: Enhancements for Higher Throughput. 2009. doi: 10.1109/IEEESTD.2009.5307322.
Karl Abrahamson. ‘On achieving consensus using a shared memory’. In: Proceedings of the seventh annual ACM Symposium on Principles of distributed computing. 1988, pp. 291–302.
Yehuda Afek. ‘Distributed algorithms for election in unidirectional and complete networks (traversal, synchronous, leader, asynchronous, complexity).’ PhD thesis. University of California, Nov. 1985.
Yehuda Afek and Eli Gafni. ‘Time and message bounds for election in synchronous and asynchronous complete networks’. In: Proceedings of the fourth annual ACM symposium on Principles of distributed computing. 1985, pp. 186–195.
Marcos Kawazoe Aguilera et al. ‘Stable Leader Election’. In: Distributed Computing, 15th Int. Conference, DISC 2001, Proc. 2001, pp. 108–122.
Marcos K Aguilera et al. ‘On implementing omega with weak reliability and synchrony assumptions’. In: The 22nd annual symposium on Principles of distributed computing. 2003, pp. 306–314.
Marcos K Aguilera et al. ‘Communication-efficient leader election and consensus with limited link synchrony’. In: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing. 2004, pp. 328–337.
Marcos K Aguilera et al. ‘On implementing omega in systems with weak reliability and synchrony assumptions’. In: Distributed Computing 21.4 (2008), pp. 285–314.
Marcos K Aguilera. ‘A pleasant stroll through the land of infinitely many creatures’. In: ACM Sigact News 35.2 (2004), pp. 36–59.
Antonio Fernández Anta, Ernesto Jiménez, and Michel Raynal. ‘Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony’. In: J. Comput. Sci. Technol. 25.6 (2010), pp. 1267–1281. doi: 10.1007/s11390-010-9404-3. url: https://doi.org/10.1007/s11390-010-9404-3.
Gregory R Andrews. Foundations of multithreaded, parallel, and distributed programming. Vol. 11. Addison-Wesley Reading, 2000.
Dana Angluin. ‘Local and global properties in networks of processors’. In: Proceedings of the twelfth annual ACM symposium on Theory of computing. 1980, pp. 82–93.
Luciana Arantes et al. ‘Eventual Leader Election in Evolving Mobile Networks’. In: Principles of Distributed Systems - 17th International Conference, OPODIS 2013, Nice, France, December 16-18, 2013. Proceedings. Ed. by Roberto Baldoni, Nicolas Nisse, and Maarten van Steen. Vol. 8304. Lecture Notes in Computer Science. Springer, 2013, pp. 23–37. doi: 10.1007/978-3-319-03850-6“˙3. url: https://doi.org/10.1007/978-3-319-03850-6%5C_3.
Nils Aschenbruck et al. ‘Bonnmotion: a mobility scenario generation and analysis tool’. In: Proceedings of the 3rd international ICST conference on simulation tools and techniques. 2010, pp. 1–10.
Hagit Attiya and Jennifer Welch. Distributed computing: fundamentals, simulations, and advanced topics. Vol. 19. John Wiley & Sons, 2004.
Baruch Awerbuch. ‘Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems’. In: The 19th annual ACM symposium on Theory of computing. 1987, pp. 230–240.
László Babai. ‘Monte-Carlo algorithms in graph isomorphism testing’. In: Université tde Montréal Technical Report, DMS 79-10 (1979).
Alex Bavelas. ‘Communication patterns in task-oriented groups’. In: The journal of the acoustical society of America 22.6 (1950), pp. 725–730.
Ulrik Brandes, Stephen P Borgatti, and Linton C Freeman. ‘Maintaining the duality of closeness and betweenness centrality’. In: Social Networks 44 (2016), pp. 153–159.
Anindya Basu, Bernadette Charron-Bost, and Sam Toueg. Solving problems in the presence of process crashes and lossy links. Tech. rep. Cornell University, 1996.
Stephen P Borgatti and Martin G Everett. ‘A graph-theoretic perspective on centrality’. In: Social networks 28.4 (2006), pp. 466–484.
Marin Bertier. ‘Service de détection de défaillances hiérarchique’. PhD thesis. Paris 6, 2004.
Bhargav Bellur and Richard G Ogier. ‘A reliable, efficient topology broadcast protocol for dynamic networks’. In: INFOCOM’99. Conference on Computer Communications. 18th Annual Joint Conference of the IEEE Computer and Communications Societies. Vol. 1. IEEE. 1999, pp. 178–186.
Stephen P Borgatti. ‘Centrality and network flow’. In: Social networks 27.1 (2005), pp. 55–71.
Sergey Brin and Lawrence Page. ‘The anatomy of a large-scale hypertextual web search engine’. In: Computer networks and ISDN systems 30.1-7 (1998), pp. 107–117.
Ulrik Brandes. ‘A faster algorithm for betweenness centrality’. In: Journal of mathematical sociology 25.2 (2001), pp. 163–177.
Martin Biely, Peter Robinson, and Ulrich Schmid. ‘Agreement in directed dynamic networks’. In: International Colloquium on Structural Information and Communication Complexity. Springer. 2012, pp. 73–84.
James E Burns. ‘A formal model for message-passing systems’. In: Technical Report 91 (1980).
Carlos Gómez Calzado. ‘Contributions on agreement in dynamic distributed systems’. PhD thesis. Universidad del País Vasco-Euskal Herriko Unibertsitatea, 2015.
Christian Robert Fernandez Campusano. ‘Distributed eventual leader election in the crash-recovery and general omission failure models’. PhD thesis. Universidad del País Vasco-Euskal Herriko Unibertsitatea, 2020.
Arnaud Casteigts et al. ‘Time-varying graphs and dynamic networks’. In: Int. Conference on Ad-Hoc Networks and Wireless. Springer. 2011, pp. 346–359.
Tracy Camp, Jeff Boleng, and Vanessa Davies. ‘A survey of mobility models for ad hoc network research’. In: Wireless communications and mobile computing 2.5 (2002), pp. 483–502.
Rodolfo WL Coutinho, Azzedine Boukerche, and Antonio AF Loureiro. ‘Design guidelines for information-centric connected and autonomous vehicles’. In: IEEE Communications Magazine 56.10 (2018), pp. 85–91.
Christian Cachin, Rachid Guerraoui, and Luís Rodrigues. Introduction to reliable and secure distributed programming. Springer Science & Business Media, 2011.
Ernest J. H. Chang. ‘Echo algorithms: Depth parallel operations on general graphs’. In: IEEE Transactions on Software Engineering 4 (1982), pp. 391–401.
Tushar Deepak Chandra, Vassos Hadzilacos, and Sam Toueg. ‘The weakest failure detector for solving consensus’. In: Journal of the ACM (JACM) 43.4 (1996), pp. 685–722.
Edith Cohen et al. ‘Computing classic closeness centrality, at scale’. In: Proceedings of the second ACM conference on Online social networks. 2014, pp. 37–50.
Standards Comnittee. Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications. IEEE Standard 802.11. 1999.
Thomas H Cormen et al. Introduction to algorithms. MIT press, 2009.
Ernest Chang and Rosemary Roberts. ‘An improved algorithm for decentralized extrema-finding in circular configurations of processes’. In: Communications of the ACM 22.5 (1979), pp. 281–283.
Francis Chin and HF Ting. ‘An almost linear time and O (nlogn+ e) messages distributed algorithm for minimum-weight spanning trees’. In: 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). IEEE. 1985, pp. 257–266.
Tushar Deepak Chandra and Sam Toueg. ‘Unreliable failure detectors for reliable distributed systems’. In: Journal of the ACM (JACM) 43.2 (1996), pp. 225–267.
Yogen Kantilal Dalal. Broadcast protocols in packet switched computer networks. Stanford University, 1977.
Alan Demers et al. ‘Epidemic algorithms for replicated database maintenance’. In: Proceedings of the sixth annual ACM Symposium on Principles of distributed computing. 1987, pp. 1–12.
Danny Dolev, Maria Klawe, and Michael Rodeh. ‘An O (n log n) unidirectional distributed algorithm for extrema finding in a circle’. In: Journal of algorithms 3.3 (1982), pp. 245–260.
Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. ‘Consensus in the presence of partial synchrony’. In: Journal of the ACM (JACM) 35.2 (1988), pp. 288–323.
Donglei Du. ‘Social network analysis: Centrality measures’. In: University of New Brunswick (2019).
Swan Dubois. ‘Tolerating Transient, Permanent, and Intermittent Failures’. PhD thesis. Université Pierre et Marie Curie-Paris VI, 2011.
Albert Einstein. Investigations on the Theory of the Brownian Movement. Courier Corporation, 1956.
Arnaud Favier et al. ‘Un algorithme d’élection de leader cross-layer pour réseaux mobiles ad hoc (résumé)’. In: COMPAS 2019 - Conférence d’informatique en Parallélisme, Architecture et Système. Anglet, France, June 2019. url: https://hal.inria.fr/hal-03471426.
Arnaud Favier et al. ‘Topology Aware Leader Election Algorithm for Dynamic Networks’. In: 25th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2020, Perth, Australia, December 1-4, 2020. IEEE, 2020, pp. 1–10. doi: 10.1109/PRDC50213.2020.00011. url: https://doi.org/10.1109/PRDC50213.2020.00011.
Arnaud Favier et al. ‘Topology Aware Leader Election Algorithm for MANET’. In: COMPAS 2020 - Conférence francophone d’informatique en Parallélisme, Architecture et Système. Lyon, France, June 2020. url: https://hal.inria.fr/hal-03471423.
Arnaud Favier et al. ‘Centrality-Based Eventual Leader Election in Dynamic Networks’. In: 20th IEEE International Symposium on Network Computing and Applications, NCA 2021, Boston, MA, USA, November 23-26, 2021. Ed. by Mauro Andreolini, Mirco Marchetti, and Dimiter R. Avresky. IEEE, 2021, pp. 1–8. doi: 10.1109/NCA53618.2021.9685390. url: https://doi.org/10.1109/NCA53618.2021.9685390.
Christian Fernández-Campusano et al. ‘A distributed leader election algorithm in crash-recovery and omissive systems’. In: Information Processing Letters 118 (2017), pp. 100–104.
Afonso Ferreira. ‘Building a reference combinatorial model for MANETs’. In: IEEE network 18.5 (2004), pp. 24–29.
Antonio Fernández, Ernesto Jiménez, and Michel Raynal. ‘Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony’. In: (2006), pp. 166–178. doi: 10.1109/DSN.2006.34. url: https://doi.org/10.1109/DSN.2006.34.
Greg N Frederickson and Nancy A Lynch. ‘The impact of synchronous communication on the problem of electing a leader in a ring’. In: The 16th annual ACM symposium on Theory of computing. 1984, pp. 493–503.
Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. ‘Impossibility of Distributed Consensus with One Faulty Process’. In: J. ACM 32.2 (Apr. 1985), pp. 374–382.
Paola Flocchini, Bernard Mans, and Nicola Santoro. ‘Exploration of periodically varying graphs’. In: International Symposium on Algorithms and Computation. Springer. 2009, pp. 534–543.
Randolph Franklin. ‘On an improved algorithm for decentralized extrema finding in circular configurations of processors’. In: Communications of the ACM 25.5 (1982), pp. 336–337.
Linton C Freeman. ‘A set of measures of centrality based on betweenness’. In: Sociometry (1977), pp. 35–41.
Linton C Freeman. ‘Centrality in social networks conceptual clarification’. In: Social networks 1.3 (1978), pp. 215–239.
Eli Gafni. ‘Improvements in the time complexity of two message-optimal election algorithms’. In: The 4th annual ACM symposium on Principles of distributed computing. 1985, pp. 175–185.
Robert G Gallager. ‘Finding a leader in a network with O (e)+ O (n log n) messages’. In: Unpublished Note (1977).
Hector Garcia-Molina. ‘Elections in a distributed computing system’. In: IEEE transactions on Computers 31.01 (1982), pp. 48–59.
Marwan Ghanem. ‘Temporal centralities: a study of the importance of nodes in dynamic graphs’. PhD thesis. Sorbonne Universites, UPMC University of Paris 6, 2018.
Robert G. Gallager, Pierre A. Humblet, and Philip M. Spira. ‘A distributed algorithm for minimum-weight spanning trees’. In: ACM Transactions on Programming Languages and systems (TOPLAS) 5.1 (1983), pp. 66–77.
Rachid Guerraoui and N Lynch. ‘A general characterization of indulgence’. In: ACM Transactions on Autonomous and Adaptive Systems (TAAS) 3.4 (2008), pp. 1–19.
Carlos Gómez-Calzado et al. ‘Fault-tolerant leader election in mobile dynamic distributed systems’. In: 19th Pacific Rim Int. Symposium on Dependable Computing. IEEE. 2013, pp. 78–87.
Rachid Guerraoui and Michel Raynal. ‘The information structure of indulgent consensus’. In: IEEE Transactions on Computers 53.4 (2004), pp. 453–466.
Rachid Guerraoui and Luis Rodrigues. Introduction to reliable distributed programming. Springer Science & Business Media, 2006.
Saurav Haloi. Apache zookeeper essentials. Packt Publishing Ltd, 2015.
Kostas P Hatzis et al. ‘Fundamental control algorithms in mobile networks’. In: Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures. 1999, pp. 251–260.
Zygmunt J Haas, Joseph Y Halpern, and Li Li. ‘Gossip-based ad hoc routing’. In: Proceedings. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Vol. 3. IEEE. 2002, pp. 1707–1716.
Lisa Higham and Teresa Przytycka. ‘A simple, efficient algorithm for maximum finding on rings’. In: Int. Workshop on Distributed Algorithms. Springer. 1993, pp. 249–263.
Daniel S. Hirschberg and James B Sinclair. ‘Decentralized extrema-finding in circular configurations of processors’. In: Communications of the ACM 23.11 (1980), pp. 627–628.
Vassos Hadzilacos and Sam Toueg. A modular approach to fault-tolerant broadcasts and related problems. Tech. rep. Cornell University, 1994.
Pierre Humblet. ‘A distributed algorithm for minimum weight directed spanning trees’. In: IEEE Transactions on Communications 31.6 (1983), pp. 756–762.
Martin Hutle et al. ‘Chasing the weakest system model for implementing Ω and consensus’. In: IEEE Transactions on Dependable and Secure Computing 6.4 (2008), pp. 269–281.
Rebecca Ingram et al. ‘An asynchronous leader election algorithm for dynamic networks’. In: Int. Symposium on Parallel & Distributed Processing. IEEE. 2009, pp. 1–12.
Rebecca Ingram et al. ‘A leader election algorithm for dynamic networks with causal clocks’. In: Distributed computing 26.2 (2013), pp. 75–97.
Alon Itai and Michael Rodeh. ‘Symmetry breaking in distributive networks’. In: 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981). IEEE. 1981, pp. 150–158.
Ernesto Jiménez, Sergio Arévalo, and Antonio Fernández. ‘Implementing unreliable failure detectors with unknown membership’. In: Information Processing Letters 100.2 (2006), pp. 60–63.
Márk Jelasity et al. ‘Gossip-based peer sampling’. In: ACM Transactions on Computer Systems (TOCS) 25.3 (2007), 8–es.
P Kanellakis. ‘An election problem in a network’. In: Term paper, MIT (May 1977-1978).
David Kempe, Jon Kleinberg, and Amit Kumar. ‘Connectivity and inference problems for temporal networks’. In: Journal of Computer and System Sciences 64.4 (2002), pp. 820–842.
Fabian Kuhn, Nancy Lynch, and Rotem Oshman. ‘Distributed computation in dynamic networks’. In: Proceedings of the forty-second ACM symposium on Theory of computing. 2010, pp. 513–522.
A-M Kermarrec, Laurent Massoulié, and Ayalvadi J. Ganesh. ‘Probabilistic reliable dissemination in large-scale systems’. In: IEEE Transactions on Parallel and Distributed systems 14.3 (2003), pp. 248–258.
Ephraim Korach, Shlomo Moran, and Shmuel Zaks. ‘Tight lower and upper bounds for some distributed algorithms for a complete network of processors’. In: Proceedings of the third annual ACM symposium on Principles of distributed computing. 1984, pp. 199–207.
Vassilis Kostakos. ‘Temporal graphs’. In: Physica A: Statistical Mechanics and its Applications 388.6 (2009), pp. 1007–1023.
ChongGun Kim and Mary Wu. ‘Leader election on tree-based centrality in ad hoc networks’. In: Telecommunication Systems 52.2 (2013), pp. 661–670.
Leslie Lamport. ‘Proving the correctness of multiprocess programs’. In: IEEE transactions on software engineering 2 (1977), pp. 125–143.
Leslie Lamport. ‘Time, Clocks, and the Ordering of Events in a Distributed System’. In: Commun. ACM 21.7 (1978), pp. 558–565.
Leslie Lamport. distribution. 1987. url: https://lamport.azurewebsites.net/pubs/distributed-system.txt. (accessed: 10.09.2021).
Leslie Lamport. ‘The part-time parliament’. In: ACM Transactions on Computer Systems (TOCS) 16.2 (1998), pp. 133–169.
Mikel Larrea et al. ‘Specifying and implementing an eventual leader service for dynamic systems’. In: International Journal of Web and Grid Services 8.3 (2012), pp. 204–224.
Gérard Le Lann. ‘Distributed Systems-Towards a Formal Approach.’ In: IFIP congress. Vol. 7. 1977, pp. 155–160.
Mikel Larrea, Antonio Fernández, and Sergio Arévalo. ‘Optimal Implementation of the Weakest Failure Detector for Solving Consensus’. In: 19th IEEE Symposium on Reliable Distributed Systems, SRDS’00, Proc. 2000, pp. 52–59.
Hyojun Lim and Chongkwon Kim. ‘Flooding in wireless ad hoc networks’. In: Computer Communications 24.3-4 (2001), pp. 353–363.
Jure Leskovec, Jon M. Kleinberg, and Christos Faloutsos. ‘Graph evolution: Densification and shrinking diameters’. In: ACM Trans. Knowl. Discov. Data 1.1 (2007), p. 2. doi: 10.1145/1217299.1217301. url: https://doi.org/10.1145/1217299.1217301.
Avinash Lakshman and Prashant Malik. ‘Cassandra: a decentralized structured storage system’. In: ACM SIGOPS Operating Systems Review 44.2 (2010), pp. 35–40.
Mikel Larrea, Cristian Martín, and Iratxe Soraluze. ‘Communication-efficient leader election in crash-recovery systems’. In: Journal of Systems and Software 84.12 (2011), pp. 2186–2195.
Leslie Lamport, Robert Shostak, and Marshall Pease. ‘The Byzantine generals problem’. In: Concurrency: the Works of Leslie Lamport. 2019, pp. 203–226.
Jan van Leeuwen and Richard B. Tan. ‘An improved upperbound for distributed election in bidirectional rings of processors’. In: Distributed Computing 2.3 (1987), pp. 149–160.
Alessandro Lulli et al. ‘Distributed current flow betweenness centrality’. In: 2015 IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems. IEEE. 2015, pp. 71–80.
Nancy A Lynch. ‘Distributed algorithms’. In: Elsevier, 1996. Chap. 4.1, pp. 52–56.
Salahuddin Mohammad Masum, Amin Ahsan Ali, et al. ‘Asynchronous leader election in mobile ad hoc networks’. In: 20th International Conference on Advanced Information Networking and Applications-Volume 1 (AINA’06). Vol. 2. IEEE. 2006, 5–pp.
Leila Melit and Nadjib Badache. ‘An 
-Based Leader Election Algorithm for
Mobile Ad Hoc Networks’. In: Networked Digital Technologies - 4th International
Conference, NDT 2012, Dubai, UAE, April 24-26, 2012. Proceedings, Part I. Ed.
by Rachid Benlamri. Vol. 293. Communications in Computer and Information
Science. Springer, 2012, pp. 483–490. doi: 10.1007/978-3-642-30507-8“˙41. url:
https://doi.org/10.1007/978-3-642-30507-8%5C_41.
Alberto Montresor and Márk Jelasity. ‘PeerSim: A Scalable P2P Simulator’. In: The 9th Int. Conference on Peer-to-Peer (P2P’09). 2009, pp. 99–100.
Jeff Magee and Jeff Kramer. State models and java programs. Vol. 10. 1999.
Cristian Martín, Mikel Larrea, and Ernesto Jiménez. ‘Implementing the omega failure detector in the crash-recovery failure model’. In: Journal of Computer and System Sciences 75.3 (2009), pp. 178–189.
Achour Mostefaoui, Eric Mourgaya, and Michel Raynal. ‘Asynchronous implementation of failure detectors’. In: 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings. Citeseer. 2003, pp. 351–351.
Achour Mostefaoui et al. ‘From static distributed systems to dynamic systems’. In: 24th IEEE Symposium on Reliable Distributed Systems (SRDS’05). IEEE. 2005, pp. 109–118.
Dahlia Malkhi, Florin Oprea, and Lidong Zhou. ‘Ω meets paxos: Leader election and stability without eventual timely links’. In: International Symposium on Distributed Computing. Springer. 2005, pp. 199–213.
Achour Mostefaoui, Michel Raynal, and Corentin Travers. ‘Crash-resilient time-free eventual leadership’. In: Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004. IEEE. 2004, pp. 208–217.
Achour Mostéfaoui, Michel Raynal, and Corentin Travers. ‘Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership’. In: IEEE Trans. Parallel Distrib. Syst. 17.7 (2006), pp. 656–666.
Levente Mészáros, Andras Varga, and Michael Kirsche. ‘Inet framework’. In: Recent Advances in Network Simulation. Springer, 2019, pp. 55–106.
Navneet Malpani, Jennifer L Welch, and Nitin Vaidya. ‘Leader election algorithms for mobile ad hoc networks’. In: The 4th int. workshop on Discrete algorithms and methods for mobile computing and communications. ACM. 2000, pp. 96–103.
Satoshi Nakamoto. ‘Bitcoin: A Peer-to-Peer Electronic Cash System’. In: (Oct. 2008). url: https://bitcoin.org/bitcoin.pdf.
Mikhail Nesterenko and Sébastien Tixeuil. ‘Discovering network topology in the presence of byzantine faults’. In: Transactions on Parallel and Distributed Systems 20.12 (2009), pp. 1777–1789.
Diego Ongaro and John Ousterhout. ‘In search of an understandable consensus algorithm’. In: 2014 {USENIX} Annual Technical Conference ({USENIX}{ATC} 14). 2014, pp. 305–319.
Michela Papandrea et al. ‘On the properties of human mobility’. In: Computer Communications 87 (2016), pp. 19–36.
Vincent Douglas Park and M Scott Corson. ‘A highly adaptive distributed routing algorithm for mobile wireless networks’. In: Proceedings of INFOCOM’97. Vol. 3. IEEE. 1997, pp. 1405–1413.
David Peleg. ‘Time-optimal leader election in general networks’. In: Journal of parallel and distributed computing 8.1 (1990), pp. 96–99.
Gary L Peterson. ‘An O (n log n) unidirectional algorithm for the circular extrema problem’. In: ACM Transactions on Programming Languages and Systems (TOPLAS) 4.4 (1982), pp. 758–762.
Jan K Pachl, Ephraim Korach, and Doron Rotem. ‘A technique for proving lower bounds for distributed maximum-finding algorithms (Preliminary Version)’. In: Proceedings of the fourteenth annual ACM symposium on Theory of computing. 1982, pp. 378–382.
Muhammad Rahman, M Abdullah-Al-Wadud, and Oksam Chae. ‘Performance analysis of leader election algorithms in mobile ad hoc networks’. In: Int. J. of Computer Science and Network Security 8.2 (2008), pp. 257–263.
Michel Raynal. ‘Eventual leader service in unreliable asynchronous systems: Why? how?’ In: Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007). IEEE. 2007, pp. 11–24.
Michel Raynal. Distributed algorithms for message-passing systems. Vol. 500. Springer, 2013.
Injong Rhee et al. ‘On the levy-walk nature of human mobility’. In: IEEE/ACM transactions on networking 19.3 (2011), pp. 630–643.
Gert Sabidussi. ‘The centrality index of a graph’. In: Psychometrika 31.4 (1966), pp. 581–603.
Giovanna Di Marzo Serugendo, Marie-Pierre Gleizes, and Anthony Karageorgos. Self-organising Software. Springer, 2011.
Miguel Sánchez and Pietro Manzoni. ‘ANEJOS: a Java based simulator for ad hoc networks’. In: Future generation computer systems 17.5 (2001), pp. 573–583.
P Spira. ‘Communication complexity of distributed minimum spanning tree algorithms’. In: The 2nd Berkeley conference on distributed data management and computer networks. 1977.
John Tang et al. ‘Characterising temporal distance and reachability in mobile and online social networks’. In: ACM SIGCOMM Computer Communication Review 40.1 (2010), pp. 118–124.
Tapiocozzo-Wikipedia. Centrality - Wikipedia. 2015. url: https://en.wikipedia.org/wiki/Centrality. (accessed: 06.12.2021).
Sara Tucci-Piergiovanni and Roberto Baldoni. ‘Eventual leader election in infinite arrival message-passing system model with bounded concurrency’. In: 2010 European Dependable Computing Conference. IEEE. 2010, pp. 127–134.
Gerard Tel. Introduction to distributed algorithms. Cambridge university press, 2000.
Andrew S Tanenbaum, David J Wetherall, et al. Computer networks. 1996.
Andras Varga. ‘OMNeT++’. In: Modeling and tools for network simulation. Springer, 2010, pp. 35–59.
András Varga and Rudolf Hornig. ‘An overview of the OMNeT++ simulation environment’. In: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops. 2008, pp. 1–10.
Sudarshan Vasudevan, Jim Kurose, and Don Towsley. ‘Design and analysis of a leader election algorithm for mobile ad hoc networks’. In: The 12th int. Conference on Network Protocols, ICNP. IEEE. 2004, pp. 350–360.
Maarten Van Steen and Andrew S Tanenbaum. Distributed Systems. 3. Maarten van Steen Leiden, The Netherlands, 2017. url: distributed-systems.net.
Gavin Wood et al. ‘Ethereum: A secure decentralised generalised transaction ledger’. In: Ethereum project yellow paper 151.2014 (2014), pp. 1–32.
Wei Wang and Choon Yik Tang. ‘Distributed estimation of closeness centrality’. In: 2015 54th IEEE Conference on Decision and Control (CDC). IEEE. 2015, pp. 4860–4865.