Article

Maximal independent sets in radio networks

Authors:

Thomas Moscibroda,

Rogert WattenhoferAuthors Info & Claims

PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

Pages 148 - 157

https://doi.org/10.1145/1073814.1073842

Published: 17 July 2005 Publication History

Abstract

We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detection mechanism available. Specifically, we propose a novel randomized algorithm that computes a MIS in time O(log²! n) with high probability, where n is the number of nodes in the network. This significantly improving on the best previously known solutions. A lower bound of Ω(log²!n / log log n) given in [11] implies that our algorithm's running time is close to optimal. Our result shows that the harsh radio network model imposes merely an additional O(log n) factor compared to Luby's MIS algorithm in the message passing model. This has important implications in the context of ad hoc and sensor networks whose characteristics are closely captured by the radio network model.

References

[1]

N. Alon, A. Bar-Noy, N. Linial, and D. Peleg. A lower bound for radio broadcast. J. Comput. Syst. Sci., 43(2):290--298, 1991.

Digital Library

[2]

B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin. Network decomposition and locality in distributed computation. In Proceedings of the 30th Symposium on Foundations of Computer Science (FOCS), pages 364--369, 1989.

Digital Library

[3]

R. Bar-Yehuda, O. Goldreich, and A. Itai. On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization. In Proc. of the 6th ACM Symposium on Principles of Distributed Computing (PODC), pages 98--108, 1987.

Digital Library

[4]

B. S. Chlebus. Randomized Communication in Radio Networks, chapter in Handbook of Randomized Computing, pages 401--456. Kluwer Academic Publishers, 2001.

[5]

B. S. Chlebus and D. R. Kowalski. A Better Wake-Up in Radio Networks. In Proceedings of 23rd ACM Symposium on Principles of Distributed Computing (PODC), pages 266--274, 2004.

Digital Library

[6]

M. Chrobak, L. Gasieniec, and D. Kowalski. The Wake-Up Problem in Multi-Hop Radio Networks. In Proceedings of the 15th ACM-SIAM symposium on Discrete algorithms (SODA), pages 992--1000, 2004.

Digital Library

[7]

R. Cole and U. Vishkin. Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking. Inf. Control, 70(1):32--53, 1986.

Digital Library

[8]

A. Czumaj and W. Rytter. Broadcasting Algorithms in Radio Networks with Unknown Topology. In Proc. of the 44th IEEE Symposium on Foundations of Computer Science (FOCS), page 492, 2003.

Digital Library

[9]

R. Gandhi and S. Parthasarathy. Distributed Algorithms for Coloring and Connected Domination in Wireless Ad Hoc Networks. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2004.

[10]

L. Gasieniec, A. Pelc, and D. Peleg. The Wakeup Problem in Synchronous Broadcast Systems (Extended Abstract). In Proceedings of the 19th ACM Symposium on Principles of Distributed Computing (PODC), pages 113--121. ACM Press, 2000.

Digital Library

[11]

T. Jurdzinski and G. Stachowiak. Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks. In Proceedings of 13th International Symposium on Algorithms and Computation (ISAAC), volume 2518, pages 535--549, 2002.

Digital Library

[12]

F. Kuhn, T. Moscibroda, and R. Wattenhofer. Initializing Newly Deployed Ad Hoc and Sensor Networks. In Proceedings of 10th Annual International Conference on Mobile Computing and Networking (MOBICOM), pages 260--274.

Digital Library

[13]

F. Kuhn, T. Moscibroda, and R. Wattenhofer. Radio Network Clustering from Scratch. In Proc. of 12th European Symposium on Algorithms (ESA), pages 460--471.

[14]

F. Kuhn, T. Moscibroda, and R. Wattenhofer. What Cannot Be Computed Locally! In Proceedings of 23rd Annual Symposium on Principles of Distributed Computing (PODC), pages 300--309, 2004.

Digital Library

[15]

E. Kushilevitz and Y. Mansour. An f ΩD log (N/D) Lower Bound for Broadcast in Radio Networks. SIAM Journal on Computing, 27:702--712, 1998.

Digital Library

[16]

N. Linial. Locality in Distributed Graph Algorithms. SIAM Journal on Computing, 21(1):193--201, 1992.

Digital Library

[17]

M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing, 15:1036--1053, 1986.

Digital Library

[18]

T. Moscibroda and R. Wattenhofer. Efficient Computation of Maximal Independent Sets in Unstructured Multi-Hop Radio Networks. In Proc. of 1st International Conference on Mobile Ad Hoc and Sensor Systems (MASS), pages 51--59.

[19]

T. Moscibroda and R. Wattenhofer. Coloring Unstructured Radio Networks. In Proceedings of the 17th ACM symposium on Parallel Algorithms and Architectures (SPAA), 2005.

Digital Library

[20]

L. G. Roberts. Aloha Packet System with and without Slots and Capture. ACM SIGCOMM, Computer Communication Review, 5(2):28--42, 1975.

Digital Library

[21]

P. Wan, K. Alzoubi, and O. Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. In Proceedings of Infocom, 2002.

Cited By

Giakkoupis GTurau VZiccardi IKuznetsov PGelles ROlivetti D(2024)Brief Announcement: Self-Stabilizing MIS Computation in the Beeping ModelProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662811(87-90)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662811
Zhao ZCheng HXu XPan Y(2024)Graph Partition and Multiple Choice-UCB Based Algorithms for Edge Server Placement in MEC EnvironmentIEEE Transactions on Mobile Computing10.1109/TMC.2023.3284994(1-12)Online publication date: 2024
https://doi.org/10.1109/TMC.2023.3284994
Davies POshman RNolin AHalldorsson MBalliu A(2023)Uniting General-Graph and Geometric-Based Radio Networks via Independence Number ParametrizationProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594595(290-299)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594595
Show More Cited By

Index Terms

Maximal independent sets in radio networks
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
      2. Network flows
2. Theory of computation
  1. Design and analysis of algorithms
    1. Graph algorithms analysis
      1. Network flows
  2. Randomness, geometry and discrete structures

Recommendations

A log-star distributed maximal independent set algorithm for growth-bounded graphs
PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing

We present a novel distributed algorithm for the maximal independent set (MIS) problem. On growth-bounded graphs (GBG) our deterministic algorithm finishes in O(log* n) time, n being the number of nodes. In light of Linial's Ω(log* n) lower bound our ...
Broadcasting in undirected ad hoc radio networks
Special issue: PODC 02

We consider distributed broadcasting in radio networks, modeled as undirected graphs, whose nodes have no information on the topology of the network, nor even on their immediate neighborhood. For randomized broadcasting, we give an algorithm working in ...
Scalable wake-up of multi-channel single-hop radio networks

We consider single-hop radio networks with multiple channels as a model of wireless networks. There are n stations connected to b radio channels that do not provide collision detection. A station uses all the channels concurrently and independently. ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

July 2005

364 pages

ISBN:1581139942

DOI:10.1145/1073814

General Chair:
Marcos Aguilera
HP Labs
,
Program Chair:
James Aspnes
Yale University

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 July 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PODC05

Sponsor:

PODC05: ACM Symposium on Principles of Distributed Computing

July 17 - 20, 2005

NV, Las Vegas, USA

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

88
Total Citations
View Citations
637
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)1

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Giakkoupis GTurau VZiccardi IKuznetsov PGelles ROlivetti D(2024)Brief Announcement: Self-Stabilizing MIS Computation in the Beeping ModelProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662811(87-90)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662811
Zhao ZCheng HXu XPan Y(2024)Graph Partition and Multiple Choice-UCB Based Algorithms for Edge Server Placement in MEC EnvironmentIEEE Transactions on Mobile Computing10.1109/TMC.2023.3284994(1-12)Online publication date: 2024
https://doi.org/10.1109/TMC.2023.3284994
Davies POshman RNolin AHalldorsson MBalliu A(2023)Uniting General-Graph and Geometric-Based Radio Networks via Independence Number ParametrizationProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594595(290-299)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594595
Dani VGupta AHayes TPettie S(2022)Wake up and join me! An energy-efficient algorithm for maximal matching in radio networksDistributed Computing10.1007/s00446-022-00426-w36:3(373-384)Online publication date: 7-May-2022
https://doi.org/10.1007/s00446-022-00426-w
Dani VGupta AHayes TPettie SMiller ACensor-Hillel K(2021)Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio NetworksProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467950(151-153)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467950
Halldórsson MTonoyan T(2021)Sparse Backbone and Optimal Distributed SINR AlgorithmsACM Transactions on Algorithms10.1145/345293717:2(1-34)Online publication date: 6-Jun-2021
https://dl.acm.org/doi/10.1145/3452937
Bamberger PKuhn FMaus Y(2019)Local Distributed Algorithms in Highly Dynamic Networks2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS.2019.00015(33-42)Online publication date: May-2019
https://doi.org/10.1109/IPDPS.2019.00015
Ahmadi MGhodselahi AKuhn FMolla A(2019)The cost of global broadcast in dynamic radio networksTheoretical Computer Science10.1016/j.tcs.2019.07.013Online publication date: Jul-2019
https://doi.org/10.1016/j.tcs.2019.07.013
Halldórsson MTonoyan TNewport CKeidar I(2018)Leveraging Indirect Signaling for Topology Inference and Fast BroadcastProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212766(85-93)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3212734.3212766
Halldórsson MKonrad C(2018)Computing large independent sets in a single roundDistributed Computing10.1007/s00446-017-0298-y31:1(69-82)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s00446-017-0298-y
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten