Beeping a maximal independent set

Authors:
Yehuda Afek;Noga Alon;Ziv Bar-Joseph;Alejandro Cornejo;Bernhard Haeupler;Fabian Kuhn
Affiliations:
The Blavatnik School of Computer Science, Tel Aviv University, Israel;The Blavatnik School of Computer Science, Tel Aviv University and Sackler School of Mathematics, Tel Aviv University, Israel;School of Computer Science, Carnegie Mellon Univ., Pittsburgh, PA;CSAIL, Massachusetts Institute of Technology, MA;CSAIL, Massachusetts Institute of Technology, MA;Faculty of Informatics, University of Lugano, Lugano, Switzerland
Venue:
DISC'11 Proceedings of the 25th international conference on Distributed computing
Year:
2011

Citing 20
Cited 4

A fast and simple randomized parallel algorithm for the maximal independent set problem

Journal of Algorithms
A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
On the complexity of distributed network decomposition

Journal of Algorithms
Deterministic broadcasting in unknown radio networks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Distributed construction of connected dominating set in wireless ad hoc networks

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
What cannot be computed locally!

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Maximal independent sets in radio networks

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The price of being near-sighted

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
DESYNC: self-organizing desynchronization and TDMA on wireless sensor networks

Proceedings of the 6th international conference on Information processing in sensor networks
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Network decomposition and locality in distributed computation

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
A log-star distributed maximal independent set algorithm for growth-bounded graphs

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Fast radio broadcasting with advice

Theoretical Computer Science
Slotted programming for sensor networks

Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
What is the use of collision detection (in wireless networks)?

DISC'10 Proceedings of the 24th international conference on Distributed computing
Deploying wireless networks with beeps

DISC'10 Proceedings of the 24th international conference on Distributed computing
Fast deterministic distributed maximal independent set computation on growth-bounded graphs

DISC'05 Proceedings of the 19th international conference on Distributed Computing
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)

SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity

Oblivious collaboration

DISC'11 Proceedings of the 25th international conference on Distributed computing
Weak models of distributed computing, with connections to modal logic

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Stone age distributed computing

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Feedback from nature: an optimal distributed algorithm for maximal independent set selection

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

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(log3 n) time. Second, if sleeping nodes are awoken by neighboring beeps, then we can also find an MIS in O(log3 n) 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(log2 n) time. Finally, if instead we endow nodes with synchronous clocks, it is also possible to compute an MIS in O(log2 n) time.