Radio Network Lower Bounds Made Easy
From MaRDI portal
Publication:5498700
DOI10.1007/978-3-662-45174-8_18zbMath1373.68051arXiv1405.7300OpenAlexW1512353078MaRDI QIDQ5498700
Publication date: 10 February 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.7300
Network design and communication in computer systems (68M10) Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)
Related Items (7)
Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Contention resolution on a fading channel ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses ⋮ Leader election in SINR model with arbitrary power control ⋮ The cost of global broadcast in dynamic radio networks ⋮ On simple back-off in unreliable radio networks ⋮ Approximate Neighbor Counting in Radio Networks
This page was built for publication: Radio Network Lower Bounds Made Easy
