Analysis of Backoff Protocols for Mulitiple AccessChannels
SIAM Journal on Computing
Distributed packet switching in arbitrary networks
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Adaptive packet routing for bursty adversarial traffic
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Balls and bins: a study in negative dependence
Random Structures & Algorithms
Stochastic Contention Resolution With Short Delays
SIAM Journal on Computing
Contention resolution with constant expected delay
Journal of the ACM (JACM)
Journal of the ACM (JACM)
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
SIAM Journal on Computing
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Universal stability results for greedy contention-resolution protocols
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Routing and scheduling in multihop wireless networks with time-varying channels
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Adversarial contention resolution for simple channels
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A jamming-resistant MAC protocol for single-hop wireless networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Oblivious interference scheduling
Proceedings of the 28th ACM symposium on Principles of distributed computing
Stability of the multiple-access channel under maximum broadcast loads
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Broadcasting in unreliable radio networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Bounds on stability and latency in wireless communication
IEEE Communications Letters
Distributed contention resolution in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
A jamming-resistant MAC protocol for multi-hop wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Improved algorithms for latency minimization in wireless networks
Theoretical Computer Science
Approximation algorithms for secondary spectrum auctions
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Nearly optimal bounds for distributed wireless scheduling in the SINR model
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Adversarial Queuing on the Multiple Access Channel
ACM Transactions on Algorithms (TALG)
Wireless capacity with oblivious power in general metrics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Secondary spectrum auctions for symmetric and submodular bidders
Proceedings of the 13th ACM Conference on Electronic Commerce
Low-complexity scheduling for wireless networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Scheduling in wireless networks with rayleigh-fading interference
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Brief announcement: distributed algorithms for throughput performance in wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Distributed deterministic broadcasting in uniform-power ad hoc wireless networks
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Hi-index | 0.00 |
We consider protocols that serve communication requests arising over time in a wireless network that is subject to interference. Unlike previous approaches, we take the geometry of the network and power control into account, both allowing to increase the network's performance significantly. We introduce a stochastic and an adversarial model to bound the packet injection. Although taken as the primary motivation, this approach is not only suitable for models based on the signal-to-interference-plus-noise ratio (SINR). It also covers virtually all other common interference models, for example the multiple-access channel, the protocol model, the radio-network model, and distance-2 matching. Packet-routing networks allowing each edge or each node to transmit or receive one packet at a time can be modeled as well. Starting from an algorithm for the respective scheduling problem with static transmission requests, we build distributed stable protocols. This is more involved than in previous, similar approaches because the algorithms we consider do not necessarily scale linearly when scaling the input instance. We can guarantee a throughput that is as large as the one of the original static algorithm. In particular, for SINR models the competitive ratios of the protocol in comparison to optimal ones in the respective model are between constant and O(log2 m) for a network of size m.