Chernoff-Hoeffding Bounds for Applications with Limited Independence
SIAM Journal on Discrete Mathematics
Analysis of Backoff Protocols for Mulitiple AccessChannels
SIAM Journal on Computing
Stochastic Contention Resolution With Short Delays
SIAM Journal on Computing
Contention resolution with constant expected delay
Journal of the ACM (JACM)
Performance analysis of exponential backoff
IEEE/ACM Transactions on Networking (TON)
Feasibility and complexity of broadcasting with random transmission failures
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Adversarial contention resolution for simple channels
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Adversarial queuing on the multiple-access channel
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Reliable broadcast in radio networks: the bounded collision case
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A jamming-resistant MAC protocol for single-hop wireless networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Secure communication over radio channels
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Reliable distributed computing on unreliable radio channels
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
A jamming-resistant MAC protocol for multi-hop wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Towards characterization of wireless traffic in coexisting 802.11a/g and 802.11n network
Proceedings of the ACM CoNEXT Student Workshop
Conflict on a communication channel
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Competitive and Fair Medium Access Despite Reactive Jamming
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
Towards jamming-resistant and competitive medium access in the SINR model
S3 '11 Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students
Medium access control for adversarial channels with jamming
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Reclaiming the white spaces: spectrum efficient coexistence with primary users
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Self-stabilizing leader election for single-hop wireless networks despite jamming
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
DISC'07 Proceedings of the 21st international conference on Distributed Computing
SybilCast: broadcast on the open airwaves (extended abstract)
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Hi-index | 0.00 |
This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1 poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed.