Distributed MIS with Low Energy and Time Complexities

DOI10.1145/3583668.3594587MaRDI QIDQ6202237zbMATH OpenWikidataFDO

Authors Mohsen Ghaffari

Publication date 26 March 2024

Published in Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2305.11639

zbMATH Keywords

distributed algorithmsmaximal independent setenergy-efficiencyround complexityenergy complexityMISawake complexitysleeping modelworst-case energy complexity

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Abstract: We present randomized distributed algorithms for the maximal independent set problem (MIS) that, while keeping the time complexity nearly matching the best known, reduce the energy complexity substantially. These algorithms work in the standard CONGEST model of distributed message passing with $O(logn)$ bit messages. The time complexity measures the number of rounds in the algorithm. The energy complexity measures the number of rounds each node is awake; during other rounds, the node sleeps and cannot perform any computation or communications. Our first algorithm has an energy complexity of $O(loglogn)$ and a time complexity of $O(lo{g}^{2}n)$. Our second algorithm is faster but slightly less energy-efficient: it achieves an energy complexity of $O(lo{g}^{2}logn)$ and a time complexity of $O(logncdotloglogncdotlo{g}^{\ast }n)$. Thus, this algorithm nearly matches the $O(logn)$ time complexity of the state-of-the-art MIS algorithms while significantly reducing their energy complexity from $O(logn)$ to $O(lo{g}^{2}logn)$.

Cites work

• scientific article; zbMATH DE number 2089983 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A fast and simple randomized parallel algorithm for the maximal independent set problem
• An Improved Distributed Algorithm for Maximal Independent Set
• Distributed Computing: A Locality-Sensitive Approach
• Distributed Maximal Independent Set using Small Messages
• Efficient algorithms for leader election in radio networks
• Exponential separations in the energy complexity of leader election
• Local computation: lower and upper bounds
• Locality in Distributed Graph Algorithms
• Lower Bounds for Maximal Matchings and Maximal Independent Sets
• Polylogarithmic-time deterministic network decomposition and distributed derandomization
• Sleeping is Efficient: MIS in O (1)-rounds Node-averaged Awake Complexity
• The Energy Complexity of BFS in Radio Networks
• The energy complexity of broadcast
• The locality of distributed symmetry breaking

This page was built for publication: Distributed MIS with Low Energy and Time Complexities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202237)