Competitive and fair throughput for co-existing networks under adversarial interference

DOI10.1145/2332432.2332488MaRDI QIDQ2933804zbMATH OpenOpenAlexFDO

Authors Stefan Schmid, Jin Zhang, Andrea 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

zbMATH Keywords

jammingmac protocolswireless ad-hoc networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Sade: competitive MAC under adversarial SINR
• Competitive throughput in multi-hop wireless networks despite adaptive jamming
• A jamming-resistant MAC protocol for multi-hop wireless networks
• Principles of robust medium access and an application to leader election
• A jamming-resistant MAC protocol for single-hop wireless networks

Cited in

(15)

• Packet latency of deterministic broadcasting in adversarial multiple access channels
• Sade: competitive MAC under adversarial SINR
• A resource-competitive jamming defense
• Singletons for simpletons revisiting windowed backoff with Chernoff bounds
• Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
• Achieving arbitrary throughput-fairness trade-offs in the inter-cell interference coordination with fixed transmit power problem
• Maximum throughput of multiple access channels in adversarial environments
• Adaptive packet scheduling over a wireless channel under constrained jamming
• Adaptive scheduling over a wireless channel under constrained jamming
• A jamming-resistant MAC protocol for multi-hop wireless networks
• Competitive throughput in multi-hop wireless networks despite adaptive jamming
• Contention resolution with constant throughput and log-logstar channel accesses
• Contention resolution with message deadlines
• Jamming-resistant backoff with polylogarithmic sending and listening cost
• Fully energy-efficient randomized backoff: slow feedback loops yield fast contention resolution

This page was built for publication: Competitive and fair throughput for co-existing networks under adversarial interference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933804)