Skip to main content
SpringerLink
Log in

Byzantine Fault-Tolerant Protocols for (n, f)-Evacuation from a Circle

  • Conference paper
  • First Online:
Algorithmics of Wireless Networks (ALGOWIN 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14061))

Included in the following conference series:

  • 69 Accesses

Abstract

In this work, we address the problem of (n, f)-evacuation on a circle, which involves evacuating n robots, with f of them being faulty, from a hidden exit located on the perimeter of a unit radius circle. The robots commence at the center of the circle and possess a speed of 1.

We introduce an algorithm for the Wireless communication model under any number of Byzantine faults. We analyze the time requirements of our proposed algorithm and we establish an upper bound on its performance.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Note that in fact we represent the circle points in polar coordinates; as the radius is always equal to 1 we give only their angle, for the sake of simplicity.

References

  1. Beck, A.: On the linear search problem. Israel J. Math. 2(4), 221–228 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bellman, R.: An optimal search. SIAM Rev. 5(3), 274–274 (1963)

    Article  Google Scholar 

  3. Baeza Yates, R., Culberson, J., Rawlins, G.: Searching in the plane. Inf. Comput. 106(2), 234–252 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ahlswede, R., Wegener, I.: Search Problems. Wiley-Interscience (1987)

    Google Scholar 

  5. Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous, vol. 55. Springer, New York (2003). https://doi.org/10.1007/b100809

    Book  MATH  Google Scholar 

  6. Stone, L.: Theory of Optimal Search. Academic Press, New York (1975)

    MATH  Google Scholar 

  7. Kao, M.-Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem. Inf. Comput. 131(1), 63–79 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  8. Demaine, E.D., Fekete, S.P., Gal, S.: Online searching with turn cost. Theoret. Comput. Sci. 361(2), 342–355 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J.: Search on a line with faulty robots. Distrib. Comput. 32(6), 493–504 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  10. Czyzowicz, J., et al.: Search on a line by byzantine robots. In: ISAAC, pp. 27:1–27:12 (2016)

    Google Scholar 

  11. Czyzowicz, J., Gąsieniec, L., Gorry, T., Kranakis, E., Martin, R., Pajak, D.: Evacuating robots via unknown exit in a disk. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 122–136. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-45174-8_9

    Chapter  Google Scholar 

  12. Czyzowicz, J., Georgiou, K., Kranakis, E., Narayanan, L., Opatrny, J., Vogtenhuber, B.: Evacuating using face-to-face communication, CoRR abs/1501.04985

    Google Scholar 

  13. Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.: Wireless autonomous robot evacuation from equilateral triangles and squares. In: Papavassiliou, S., Ruehrup, S. (eds.) ADHOC-NOW 2015. LNCS, vol. 9143, pp. 181–194. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19662-6_13

    Chapter  Google Scholar 

  14. Georgiou, K., Leizerovich, S., Lucier, J., Kundu, S.: Evacuating from \(l_p\) unit disks in the wireless model. Theor. Comput. Sci. 944, 113675 (2023)

    Article  MATH  Google Scholar 

  15. Georgiou, K., Giachoudis, N., Kranakis, E.: Evacuation from a disk for robots with asymmetric communication. In: 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, vol. 248, pp. 19:1–19:16 (2022)

    Google Scholar 

  16. Czyzowicz, J., Georgiou, K., Kranakis, E.: Group search and evacuation. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities. LNCS, vol. 11340, pp. 335–370. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-11072-7_14

    Chapter  Google Scholar 

  17. Georgiou, K., Kranakis, E., Leonardos, N., Pagourtzis, A., Papaioannou, I.: Optimal circle search despite the presence of faulty robots. Inf. Process. Lett. 182, 106391 (2023)

    Article  MathSciNet  MATH  Google Scholar 

  18. Czyzowicz, J., et al.: Evacuation from a disc in the presence of a faulty robot. In: Das, S., Tixeuil, S. (eds.) SIROCCO 2017. LNCS, vol. 10641, pp. 158–173. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-72050-0_10

    Chapter  Google Scholar 

  19. Leonardos, N., Pagourtzis, A., Papaioannou, I.: Byzantine fault tolerant symmetric-persistent circle evacuation. Theoret. Comput. Sci. 956, 113839 (2023)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical and Computer Engineering, National Technical University of Athens, Zografou, Greece

    Pourandokht Behrouz, Orestis Konstantinidis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou & Marianna Spyrakou

Authors
  1. Pourandokht Behrouz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Orestis Konstantinidis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nikos Leonardos
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Aris Pagourtzis
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ioannis Papaioannou
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Marianna Spyrakou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ioannis Papaioannou .

Editor information

Editors and Affiliations

  1. Toronto Metropolitan University, Toronto, ON, Canada

    Konstantinos Georgiou

  2. Carleton University, Ottawa, ON, Canada

    Evangelos Kranakis

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Behrouz, P., Konstantinidis, O., Leonardos, N., Pagourtzis, A., Papaioannou, I., Spyrakou, M. (2023). Byzantine Fault-Tolerant Protocols for (n, f)-Evacuation from a Circle. In: Georgiou, K., Kranakis, E. (eds) Algorithmics of Wireless Networks. ALGOWIN 2023. Lecture Notes in Computer Science, vol 14061. Springer, Cham. https://doi.org/10.1007/978-3-031-48882-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-48882-5_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-48881-8

  • Online ISBN: 978-3-031-48882-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation