The Wake‐Up Problem in MultiHop Radio Networks
From MaRDI portal
Publication:5422495
DOI10.1137/S0097539704442726zbMath1124.68005MaRDI QIDQ5422495
Dariusz R. Kowalski, Marek Chrobak, Leszek Gąsieniec
Publication date: 22 October 2007
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68M10: Network design and communication in computer systems
68M14: Distributed systems
68M12: Network protocols
Related Items
Deterministic Communication in Radio Networks, Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses, Coordination Problems in Ad Hoc Radio Networks, Improved lower bound for deterministic broadcasting in radio networks, Energy efficient alert in single-hop networks of extremely weak devices, Scalable wake-up of multi-channel single-hop radio networks, Design patterns in beeping algorithms: examples, emulation, and analysis, Singletons for simpletons revisiting windowed backoff with Chernoff bounds, Windowed backoff algorithms for WiFi: theory and performance under batched arrivals, Leader election in multi-hop radio networks, Contention resolution in a non-synchronized multiple access channel