Probabilistic network formation through coverage and freeze-tag

Eric Meisner, Wei Yang, Volkan Isler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We address the problem of propagating a piece of information among robots scattered in an environment. Initially, a single robot has the information. This robot searches for other robots to pass it along. When a robot is discovered, it can participate in the process by searching for other robots. Since our motivation for studying this problem is to form an ad-hoc network, we call it the Network Formation Problem. In this paper, we study the case where the environment is a rectangle and the robots' locations are unknown but chosen uniformly at random.We present an efficient network formation algorithm, Stripes, and show that its expected performance is within a logarithmic factor of the optimal performance.We also compare Stripes with an intuitive network formation algorithm in simulations. The feasibility of Stripes is demonstrated with a proof-of-concept implementation.

Original languageEnglish (US)
Title of host publicationAlgorithmic Foundations of Robotics VIII - Selected Contributions of the Eighth International Workshop on the Algorithmic Foundations of Robotics
Pages3-17
Number of pages15
DOIs
StatePublished - Mar 29 2010
Event8th International Workshop on the Algorithmic Foundations of Robotics, WAFR - Guanajuato, Mexico
Duration: Dec 7 2008Dec 9 2008

Publication series

NameSpringer Tracts in Advanced Robotics
Volume57
ISSN (Print)1610-7438
ISSN (Electronic)1610-742X

Other

Other8th International Workshop on the Algorithmic Foundations of Robotics, WAFR
CountryMexico
CityGuanajuato
Period12/7/0812/9/08

Fingerprint Dive into the research topics of 'Probabilistic network formation through coverage and freeze-tag'. Together they form a unique fingerprint.

Cite this