Skip to main content
SpringerLink
Log in

Self-stabilizing Deterministic Gathering

  • Conference paper
Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 5804))

Abstract

In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, oblivious, deaf, and dumb). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong multiplicity detection, there exists a deterministic self-stabilizing algorithm solving GP for n robots if, and only if, n is odd.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. Comput. 36(1), 56–82 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: A distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Transaction on Robotics and Automation 15(5), 818–828 (1999)

    Article  Google Scholar 

  3. Chrystal, P.: On the problem to construct the minimum circle enclosing n given points in a plane. The Edinburgh Mathematical Society, Third Meeting, page 30 (1885)

    Google Scholar 

  4. Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the robots gathering problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1181–1196. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Cieliebak, M.: Gathering non-oblivious mobile robots. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 577–588. Springer, Heidelberg (2004)

    Google Scholar 

  6. Defago, X., Konagaya, A.: Circle formation for oblivious anonymous mobile robots with no common sense of orientation. In: 2nd ACM International Annual Workshop on Principles of Mobile Computing (POMC 2002), pp. 97–104 (2002)

    Google Scholar 

  7. Défago, X., Gradinariu, M., Messika, S., Raipin-Parvédy, P.: Fault-tolerant and self-stabilizing mobile robots gathering. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 46–60. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Dieudoné, Y., Petit, F.: Scatter of robots. Parallel Processing Letters 19(1), 175–184 (2009)

    Article  MathSciNet  Google Scholar 

  9. Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)

    MATH  Google Scholar 

  10. Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Remembering without memory: Tree exploration by asynchronous oblivious robots. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol. 5058, pp. 33–47. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Flocchini, P., Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Multiple mobile agent rendezvous in a ring. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 599–608. Springer, Heidelberg (2004)

    Google Scholar 

  12. Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337(1-3), 147–168 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. Theor. Comput. Sci. 390(1), 27–39 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  14. Prencipe, G.: Corda: Distributed coordination of a set of autonomous mobile robots. In: Proceedings of the Fourth European Research Seminar on Advances in Distributed Systems (ERSADS 2001), pp. 185–190 (2001)

    Google Scholar 

  15. Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theor. Comput. Sci. 384(2-3), 222–231 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  16. Preparata, F.P., Hong, S.J.: Convex hulls of finite sets of poin ts in two and three dimensions. Commun. ACM 20(2), 87–93 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  17. Souissi, S., Défago, X., Yamashita, M.: Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. ACM Trans. Auton. Adapt. Syst. 4(1), 1–27 (2009)

    Article  Google Scholar 

  18. Suzuki, I., Yamashita, M.: Agreement on a common x-y coordinate system by a group of mobile robots. In: Intelligent Robots: Sensing, Modeling and Planning, pp. 305–321 (1996)

    Google Scholar 

  19. Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots - formation of geometric patterns. SIAM Journal of Computing 28(4), 1347–1363 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MIS CNRS, Université de Picardie Jules Verne Amiens, France

    Yoann Dieudonné

  2. INRIA, LIP UMR 5668, Université de Lyon / ENS Lyon, France

    Franck Petit

Authors
  1. Yoann Dieudonné
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Franck Petit
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Ben Gurion University of the Negev, Beer-Sheva, Israel

    Shlomi Dolev

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dieudonné, Y., Petit, F. (2009). Self-stabilizing Deterministic Gathering. In: Dolev, S. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2009. Lecture Notes in Computer Science, vol 5804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05434-1_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-05434-1_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05433-4

  • Online ISBN: 978-3-642-05434-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation