Beeping a maximal independent set

Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn

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

31 Scopus citations

Abstract

We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on carrier sensing. The model consists of an anonymous broadcast network in which nodes have no knowledge about the topology of the network or even an upper bound on its size. Furthermore, it is assumed that nodes wake up asynchronously. At each time slot a node can either beep (i.e., emit a signal) or be silent. At a particular time slot, beeping nodes receive no feedback, while silent nodes can only differentiate between none of its neighbors beeping, or at least one neighbor beeping. We start by proving a lower bound that shows that in this model, it is not possible to locally converge to an MIS in sub-polynomial time. We then study four different relaxations of the model which allow us to circumvent the lower bound and compute an MIS in polylogarithmic time. First, we show that if a polynomial upper bound on the network size is known, it is possible to find an MIS in O(log3n) time. Second, if sleeping nodes are awoken by neighboring beeps, then we can also find an MIS in O(log3n) time. Third, if in addition to this wakeup assumption we allow beeping nodes to receive feedback to identify if at least one neighboring node is beeping concurrently (i.e., sender-side collision detection) we can find an MIS in O(log2n) time. Finally, if instead we endow nodes with synchronous clocks, it is also possible to compute an MIS in O(log2n) time.

Original languageEnglish (US)
Title of host publicationDistributed Computing - 25th International Symposium, DISC 2011, Proceedings
Pages32-50
Number of pages19
DOIs
StatePublished - Nov 2 2011
Externally publishedYes
Event25th International Symposium on Distributed Computing, DISC 2011 - Rome, Italy
Duration: Sep 20 2011Sep 22 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6950 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other25th International Symposium on Distributed Computing, DISC 2011
CountryItaly
CityRome
Period9/20/119/22/11

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Beeping a maximal independent set'. Together they form a unique fingerprint.

  • Cite this

    Afek, Y., Alon, N., Bar-Joseph, Z., Cornejo, A., Haeupler, B., & Kuhn, F. (2011). Beeping a maximal independent set. In Distributed Computing - 25th International Symposium, DISC 2011, Proceedings (pp. 32-50). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6950 LNCS). https://doi.org/10.1007/978-3-642-24100-0_3