Course Contents (Syllabus):
Distributed algorithms by autonomous agents. Examples in geometric environments, communication networks, distributed databases, internet. Models of computation. Basic algorithms for message-passing systems. Algorithms and models of computation for robots in 2D/3D space. Algorithms for mobile agents in networks. Implementation and visualization of distributed algorithms. The Look-Compute-Move model. Synchronous and asynchronous systems. The Rendezvous (Gathering) problem. The Pattern problem. The Exploration problem. Faulty networks with hostile nodes. Algorithms for discovering hostile nodes. Fault tolerant algorithms. The Graph Searching problem. Reliable communication in faulty environments.
Post-graduate course.
Prerequisites and/or related courses:
Discrete Mathematics, Design and Analysis of Algorithms, Graph Theory, Theory of Computation, Distributed Systems
Bibliography:
- Algorithmic Theory of Distributed Computing (in greek), Markou, E., Kranakis, E., Pagourtzis, A., & Krizanc, D. (2015). Kallipos, Open Academic Editions. https://dx.doi.org/10.57713/kallipos-476
- Distributed Computing by Mobile Entities, P. Flocchini, G. Prencipe, N. Santoro (Ed.), LNCS 11340, Springer Cham, 2019.
- Design and Analysis of Distributed Algorithms, N. Santoro, Wiley, 2006.
- Distributed Computing, , , Cambridge University Press, 2008.
- The Mobile Agent Rendezvous Problem in the Ring. Evangelos Kranakis, Danny Krizanc, and Euripides Markou. Morgan and Claypool Publishers. Synthesis Lectures on Distributed Computing Theory, 2010.
- Distributed Computing by Oblivious Mobile Robots. Morgan and Claypool Publishers. Synthesis Lectures on Distributed Computing Theory. P. Flocchini, G. Prencipe, N. Santoro 2010.
- Mobile Agents in Networking and Distributed Computing, J. Cao, S. Das, Wiley. 2012.