Skip to main content

Uniform Covering of Rings and Lines by Memoryless Mobile Sensors

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms
  • 40 Accesses

Years and Authors of Summarized Original Work

  • 2008; Flocchini, Prencipe, Santoro

  • 2008; Cohen, Peleg

Problem Definition

The Model

A mobile robotic sensor (or simply sensor) is modeled as a computational unit with sensorial capabilities: it can perceive the spatial environment within a fixed distance V > 0, called visibility range, it has its own local working memory, and it is capable of performing local computations [6, 7].

Each sensor is a point with its own local coordinate system, which might not be consistent with the ones of the other sensors. The sensor can move in any direction, but it may be stopped before reaching its destination, e.g., because of limits to its motion energy; however, it is assumed that the distance traveled in a move by a sensor is not infinitesimally small (unless it brings the sensor to its destination).

The sensors have no means of direct communication to other sensors. Thus, any communication occurs in a totally implicit manner, by observing the other...

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Cohen R, Peleg D (2008) Local spreading algorithms for autonomous robot systems. Theor Comput Sci 399:71–82

    Article  MathSciNet  MATH  Google Scholar 

  2. Eftekhari Hesari M, Kranakis E, Krizanc D, Morales Ponce O, Narayanan L, Opatrny J (2013) Distributed algorithms for barrier coverage using relocatable sensors. In: ACM symposium on principles of distributed computing (PODC), Montreal, Canada, pp 383–392

    Google Scholar 

  3. Eftekhari Hesari M, Flocchini P, Narayanan L, Opatrny J, Santoro N (2014) Distributed barrier coverage with relocatable sensors. In: 21th international colloquium on structural information and communication complexity (SIROCCO), Takayama, Japan

    Google Scholar 

  4. Elor Y, Bruckstein AM (2011) Uniform multi-agent deployment on a ring. Theor Comput Sci 412:783–795

    Article  MathSciNet  MATH  Google Scholar 

  5. Flocchini P, Prencipe G, Santoro N (2008) Self-deployment algorithms for mobile sensors on a ring. Theor Comput Sci 402(1):67–80

    Article  MathSciNet  MATH  Google Scholar 

  6. Flocchini P, Prencipe G, Santoro N (2011) Computing by mobile robotic sensors. In: Nikoletseas S, Rolim J (eds) Theoretical aspects of distributed computing in sensor networks, chap 21. Springer, Heidelberg ISBN:978-3-642-14849-1

    Google Scholar 

  7. Flocchini P, Prencipe G, Santoro N (2012) Distributed computing by oblivious mobile robots. Morgan & Claypool, San Rafael

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Flocchini, P. (2016). Uniform Covering of Rings and Lines by Memoryless Mobile Sensors. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_594

Download citation

Publish with us

Policies and ethics