Skip to main content
SpringerLink
Log in

Mobility and Computations: Some Open Research Directions

(Abstract)

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7748))

Included in the following conference series:

  • 1019 Accesses

Abstract

Distributed computing is the study of the computational and complexity issues arising in systems of autonomous computational entities interacting with each other (e.g., to solve a problem, to perform a task). The focus is on the autonomy of the entities (i.e., absence of control(lers) external to the system) and decentralization (i.e., absence of pre-defined controllers within the system). Traditionally the entities have been assumed to be stationary. However, there is a large and varied class of distributed environments where the interacting entities, autonomous and decentralized, are mobile. This class comprises of very different environments, including for example: software mobile agents in communication networks, mobile sensors networks, robotic networks, etc. These systems have been long the subject of intensive investigations in fields as diverse as AI, robotics, and software engineering. In recent years, an increasing number of algorithmic investigations in distributed computing have started to examine these settings, creating the research area of distributed computing by mobile entities.

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

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Balamohan, B., Dobrev, S., Flocchini, P., Santoro, N.: Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles. In: Even, G., Halldórsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 279–290. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  3. Barrière, L., Flocchini, P., Fomin, F.V., Fraigniaud, P., Nisse, N., Santoro, N., Thilikos, D.: Connected graph searching. Information and Computation (to appear, 2012)

    Google Scholar 

  4. Barrière, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Rendezvous and election of mobile agents: Impact of sense of direction. Theory of Computing Systems 40(2), 143–162 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cao, J., Das, S. (eds.): Mobile Agents in Networking and Distributed Computing. Wiley (2012)

    Google Scholar 

  6. Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Measuring temporal lags in delay-tolerant networks. IEEE Transactions on Computers (to appear, 2012)

    Google Scholar 

  7. Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. Journal of Parallel, Emergent and Distributed Systems 27, 346–359 (2012)

    Google Scholar 

  8. Chalopin, J., Flocchini, P., Mans, B., Santoro, N.: Network Exploration by Silent and Oblivious Robots. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 208–219. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  9. Cielibak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: Gathering. SIAM Journal on Computing (to appear, 2012)

    Google Scholar 

  10. Clementi, A.E.F., Silvestri, R., Trevisan, L.: Information spreading in dynamic graph. In: 31st ACM Symposium on Principles of Distributed Computing, PODC, pp. 37–46 (2012)

    Google Scholar 

  11. Cohen, R., Peleg, D.: Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 549–560. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Czyzowicz, J., Dobrev, S., Královič, R., Miklík, S., Pardubská, D.: Black Hole Search in Directed Graphs. In: Kutten, S., Žerovnik, J. (eds.) SIROCCO 2009. LNCS, vol. 5869, pp. 182–194. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  13. Das, S., Flocchini, P., Kutten, S., Nayak, A., Santoro, N.: Map construction of unknown graphs by multiple agents. Theoretical Computer Science 385(1-3), 34–48 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. Das, S., Flocchini, P., Prencipe, G., Santoro, N., Yamashita, M.: Synchronizing asynchronous robots using visible bits. In: 32nd Int. Conf. Distributed Computing Systems, ICDCS (2012)

    Google Scholar 

  15. Das, S., Flocchini, P., Santoro, N., Yamashita, M.: On the computational power of oblivious robots: forming a series of geometric pattern. In: 29th ACM Symp. on Principles of Distributed Computing, PODC, pp. 267–276 (2010)

    Google Scholar 

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

  17. Dobrev, S., Flocchini, P., Kralovic, R., Santoro, N.: Exploring an unknown dangerous graph using tokens. Theoretical Computer Science (to appear, 2012)

    Google Scholar 

  18. Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Searching for a black hole in arbitrary networks: optimal mobile agents protocol. Distributed Computing 19(1), 1–19 (2006)

    Article  Google Scholar 

  19. Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile search for a black hole in an anonymous ring. Algorithmica 48, 67–90 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  20. Dobrev, S., Santoro, N., Shi, W.: Using scattered mobile agents to locate a black hole in a unoriented ring with token. Int. J. Foundations of Computer Science 19(6), 1355–1372 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  21. Flocchini, P., Mans, B., Santoro, N.: On the exploration of time-varying networks. Theoretical Computer Science (to appear, 2012)

    Google Scholar 

  22. Flocchini, P., Prencipe, G., Santoro, N.: Self-deployment of mobile sensors on a ring. Theoretical Computer Science 402(1), 67–80 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  23. Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Morgan & Claypool (2012)

    Google Scholar 

  24. Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Arbitrary pattern formation by asynchronous oblivious robots. Theoretical Computer Science 407(1-3), 412–447 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  25. Flocchini, P., Santoro: Distributed Security Algorithms for Mobile Agents. In: Cao, J., Das, S. (eds.) Mobile Agents in Networking and Distributed Computing. Wiley (2012)

    Google Scholar 

  26. Fraigniaud, P., Gasieniec, L., Kowalski, D., Pelc, A.: Collective tree exploration. Networks 48, 166–177 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  27. Fujinaga, N., Yamauchi, Y., Kijima, S., Yamashita, M.: Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 312–325. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  28. Ilcinkas, D., Flocchini, P., Santoro, N.: Ping pong in dangerous graphs: optimal black hole search with pebbles. Algorithmica 62(3-4), 1006–1033 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  29. Izumi, T., Souissi, S., Katayama, Y., Inuzuka, N., Defago, X., Wada, K., Yamashita, M.: The gathering problem for two oblivious robots with unreliable compasses. SIAM J. Computing 41(1), 26–46 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  30. Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: 42nd Symposium on Theory of Computing, STOC, pp. 513–522 (2010)

    Google Scholar 

  31. Masuzawa, T., Tixeuil, S.: Quiescence of self-stabilizing gossiping among mobile agents in graphs. Theoretical Computer Science 411(14-15), 1567–1582 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  32. Sudo, Y., Baba, D., Nakamura, J., Ooshita, F., Kakugawa, H., Masuzawa, T.: An agent exploration in unknown undirected graphs with whiteboards. In: 3rd Workshop on Reliability, Availability, and Security, WRAS (2010)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carleton University, Canada

    Nicola Santoro

Authors
  1. Nicola Santoro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Technology and Computer Science, Tata Institute of Fundamental Research, Homi Bhabha Road, 400005, Mumbai, India

    Subir Kumar Ghosh

  2. Graduate School of Information Sciences (GSIS), Tohoku University, Aobayama Campus, GSIS Building, 980-8578, Sendai, Japan

    Takeshi Tokuyama

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Santoro, N. (2013). Mobility and Computations: Some Open Research Directions. In: Ghosh, S.K., Tokuyama, T. (eds) WALCOM: Algorithms and Computation. WALCOM 2013. Lecture Notes in Computer Science, vol 7748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36065-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36065-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36064-0

  • Online ISBN: 978-3-642-36065-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation