Distributed MIS in O(log log n) Awake Complexity

Dufoulon, Fabien; Moses Jr., William K.; Pandurangan, Gopal

Abstract

Maximal Independent Set (MIS) is one of the fundamental and most well-studied problems in distributed graph algorithms. Even after four decades of intensive research, the best known (randomized) MIS algorithms have O(log n) round complexity on general graphs [Luby, STOC 1986] (where n is the number of nodes), while the best known lower bound is [EQUATION] [Kuhn, Moscibroda, Wattenhofer, JACM 2016]. Breaking past the O(log n) round complexity upper bound or showing stronger lower bounds have been longstanding open problems. Energy is a premium resource in various settings such as battery-powered wireless networks and sensor networks. The bulk of the energy is used by nodes when they are awake, i.e., when they are sending, receiving, and even just listening for messages. On the other hand, when a node is sleeping, it does not perform any communication and thus spends very little energy. Several recent works have addressed the problem of designing energy-efficient distributed algorithms for various fundamental problems. These algorithms operate by minimizing the number of rounds in which any node is awake, also called the (worst-case) awake complexity. An intriguing open question is whether one can design a distributed MIS algorithm that has significantly smaller awake complexity compared to existing algorithms. In particular, the question of obtaining a distributed MIS algorithm with o(log n) awake complexity was left open in [Chatterjee, Gmyr, Pandurangan, PODC 2020]. Our main contribution is to show that MIS can be computed in awake complexity that is exponentially better compared to the best known round complexity of O(log n) and also bypassing its fundamental [EQUATION] round complexity lower bound exponentially. Specifically, we show that MIS can be computed by a randomized distributed (Monte Carlo) algorithm in O(log log n) awake complexity with high probability.1 However, this algorithm has a round complexity that is O(poly(n)). We then show how to drastically improve the round complexity at the cost of a slight increase in awake complexity by presenting a randomized distributed (Monte Carlo) algorithm for MIS that, with high probability computes an MIS in O((log log n) log* n) awake complexity and O((log3 n)(log log n) log* n) round complexity. Our algorithms work in the CONGEST model where messages of size O(log n) bits can be sent per edge per round.

Citation

Dufoulon, F., Moses Jr., W. K., & Pandurangan, G. (2023, June). Distributed MIS in O(log log n) Awake Complexity. Presented at PODC '23: 2023 ACM Symposium on Principles of Distributed Computing, Orlando, Florida

• Presentation Conference Type: Conference Paper (published)
• Conference Name: PODC '23: 2023 ACM Symposium on Principles of Distributed Computing
• Start Date: Jun 19, 2023
• End Date: Jun 23, 2023
• Acceptance Date: Mar 26, 2023
• Online Publication Date: Jun 16, 2023
• Publication Date: 2023-06
• Deposit Date: Jun 19, 2023
• Publicly Available Date: Jun 19, 2023
• Pages: 135-145
• ISBN: 9798400701214
• DOI: https://doi.org/10.1145/3583668.3594574
• Public URL: https://durham-repository.worktribe.com/output/1134089