Leader election in SINR model with arbitrary power control
From MaRDI portal
Publication:5919419
DOI10.1016/j.tcs.2019.01.024zbMath1437.68024OpenAlexW2779566130WikidataQ128508969 ScholiaQ128508969MaRDI QIDQ5919419
Stephan Holzer, Magnús M. Halldórsson, Nancy A. Lynch, Evangelia Anna Markatou
Publication date: 13 February 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.01.024
Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Leader election in shared spectrum radio networks
- Tree algorithms for packet broadcast channels
- Wireless Link Scheduling With Power Control and SINR Constraints
- The price of being near-sighted
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- A perspective on multiaccess channels
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- Contention Resolution on a Fading Channel
- Radio Network Lower Bounds Made Easy
This page was built for publication: Leader election in SINR model with arbitrary power control