What is the use of collision detection (in wireless networks)?

Authors:
Johannes Schneider;Roger Wattenhofer
Affiliations:
Computer Engineering and Networks Laboratory, ETH Zurich, Zurich, Switzerland;Computer Engineering and Networks Laboratory, ETH Zurich, Zurich, Switzerland
Venue:
DISC'10 Proceedings of the 24th international conference on Distributed computing
Year:
2010

Citing 16
Cited 6

Log-logarithmic selection resolution protocols in a multiple access channel

SIAM Journal on Computing
A lower bound for radio broadcast

Journal of Computer and System Sciences
An Ω(D log(N/D)) lower bound for broadcast in radio networks

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels

Journal of the ACM (JACM)
Deterministic broadcasting in unknown radio networks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Distributed broadcast in radio networks of unknown topology

Theoretical Computer Science
Maximal independent sets in radio networks

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Broadcasting in undirected ad hoc radio networks

Distributed Computing - Special issue: PODC 02
Broadcasting in geometric radio networks

Journal of Discrete Algorithms
A log-star distributed maximal independent set algorithm for growth-bounded graphs

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Coloring unstructured wireless multi-hop networks

Proceedings of the 28th ACM symposium on Principles of distributed computing
Fast radio broadcasting with advice

Theoretical Computer Science
Consensus and mutual exclusion in a multiple access channel

DISC'09 Proceedings of the 23rd 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

Beeping a maximal independent set

DISC'11 Proceedings of the 25th international conference on Distributed computing
Leveraging channel diversity to gain efficiency and robustness for wireless broadcast

DISC'11 Proceedings of the 25th international conference on Distributed computing
Leader election using loneliness detection

DISC'11 Proceedings of the 25th international conference on Distributed computing
Asynchronous leader election and MIS using abstract MAC layer

FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
Deterministic distributed data aggregation under the SINR model

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Randomized broadcast in radio networks with collision detection

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks, i.e. the maximal independent set (MIS), broadcasting and coloring problem. We present lower and upper bounds for all three problems for the Growth-Bounded Graph such as the Unit Disk Graph. We prove that the benefit of collision detection ranges from an exponential improvement down to no asymptotic gain at all. In particular, for the broadcasting problem our deterministic algorithm is running in time O(Dlog n). It is an exponential improvement over prior work, if the diameter D is polylogarithmic in the number of nodes n, i.e. D ∈ O(logc n) for some constant c.