Competitive and fair throughput for co-existing networks under adversarial interference
From MaRDI portal
Publication:2933804
DOI10.1145/2332432.2332488zbMath1301.68045OpenAlexW2131128575MaRDI QIDQ2933804
Jin Zhang, Stefan Schmid, Andréa W. Richa, Christian Scheideler
Publication date: 5 December 2014
Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2332432.2332488
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Packet latency of deterministic broadcasting in adversarial multiple access channels, Sade: competitive MAC under adversarial SINR, Interactive communication with unknown noise rate, Adaptive Scheduling Over a Wireless Channel Under Constrained Jamming, Adaptive packet scheduling over a wireless channel under constrained jamming, Windowed backoff algorithms for WiFi: theory and performance under batched arrivals, Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses, A resource-competitive jamming defense, Singletons for simpletons revisiting windowed backoff with Chernoff bounds
