Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization
From MaRDI portal
Publication:6202265
DOI10.1145/3583668.3594595arXiv2303.16832OpenAlexW4380881513WikidataQ130964633 ScholiaQ130964633MaRDI QIDQ6202265
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/2303.16832
Cites Work
- Randomized broadcast in radio networks with collision detection
- Broadcasting in geometric radio networks
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Tight bounds for MIS in multichannel radio networks
- Leader election in multi-hop radio networks
- Broadcast in the Ad Hoc SINR Model
- Lower Bounds for Clear Transmissions in Radio Networks
- What Is the Use of Collision Detection (in Wireless Networks)?
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- An Improved Distributed Algorithm for Maximal Independent Set
- Deterministic Communication in Radio Networks
- Faster Deterministic Broadcasting in Ad Hoc Radio Networks
- Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
- Polylogarithmic-time deterministic network decomposition and distributed derandomization
- Maximal independent sets in multichannel radio networks
- Maximal independent sets in radio networks
- On selection problem in radio networks
- A Faster Distributed Radio Broadcast Primitive
- Broadcasting in udg radio networks with unknown topology
- Broadcasting algorithms in radio networks with unknown topology
- Near Optimal Leader Election in Multi-Hop Radio Networks
This page was built for publication: Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization
