Competitive throughput in multi-hop wireless networks despite adaptive jamming
From MaRDI portal
Publication:360275
DOI10.1007/s00446-012-0180-xzbMath1271.68071OpenAlexW2066660493MaRDI QIDQ360275
Christian Scheideler, Stefan Schmid, Jin Zhang, Andréa W. Richa
Publication date: 26 August 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-012-0180-x
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (6)
Measuring the impact of adversarial errors on packet scheduling strategies ⋮ Packet latency of deterministic broadcasting in adversarial multiple access channels ⋮ Online Packet Scheduling Under Adversarial Jamming ⋮ Interactive communication with unknown noise rate ⋮ Windowed backoff algorithms for WiFi: theory and performance under batched arrivals ⋮ Efficient and competitive broadcast in multi-channel radio networks
Cites Work
- Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks
- A jamming-resistant MAC protocol for single-hop wireless networks
- Secure communication over radio channels
- Gossiping in a Multi-channel Radio Network
- Stochastic Contention Resolution With Short Delays
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Analysis of Backoff Protocols for Multiple Access Channels
- The wireless synchronization problem
- Feasibility and complexity of broadcasting with random transmission failures
- Adversarial queuing on the multiple-access channel
- Reliable broadcast in radio networks
- Wired/Wireless Internet Communications
- Algorithms – ESA 2004
- Contention resolution with constant expected delay
- Broadcasting algorithms in radio networks with unknown topology
This page was built for publication: Competitive throughput in multi-hop wireless networks despite adaptive jamming
