TY - GEN
T1 - Competitive and fair throughput for co-existing networks under adversarial interference
AU - Richa, Andrea
AU - Scheideler, Christian
AU - Schmid, Stefan
AU - Zhang, Jin
PY - 2012/8/20
Y1 - 2012/8/20
N2 - 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.
AB - 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.
KW - jamming
KW - mac protocols
KW - wireless ad-hoc networks
UR - http://www.scopus.com/inward/record.url?scp=84865010298&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84865010298&partnerID=8YFLogxK
U2 - 10.1145/2332432.2332488
DO - 10.1145/2332432.2332488
M3 - Conference contribution
AN - SCOPUS:84865010298
SN - 9781450314503
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 291
EP - 300
BT - PODC'12 - Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing
T2 - 2012 ACM Symposium on Principles of Distributed Computing, PODC'12
Y2 - 16 July 2012 through 18 July 2012
ER -