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

A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in:, Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300.

Download
Restricted 623-PODC-2012_01.pdf 210.38 KB
Conference Paper
Author
; ; ;
Abstract
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.
Publishing Year
Proceedings Title
Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)
Page
291-300
LibreCat-ID

Cite this

Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput for co-existing networks under adversarial interference. In: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC).; 2012:291-300. doi:10.1145/2332432.2332488.
Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2012). Competitive and fair throughput for co-existing networks under adversarial interference. In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC) (pp. 291–300). http://doi.org/10.1145/2332432.2332488
@inbook{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and fair throughput for co-existing networks under adversarial interference}, DOI={10.1145/2332432.2332488}, booktitle={Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin }, year={2012}, pages={291–300}}
Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 291–300, 2012. doi:10.1145/2332432.2332488.
A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair throughput for co-existing networks under adversarial interference,” in Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300.
Richa, Andrea W. et al. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC). N.p., 2012. 291–300. Web.
Main File(s)
File Name
623-PODC-2012_01.pdf 210.38 KB
Access Level
Restricted Closed Access
Last Uploaded
2018-03-15T06:45:25Z


Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar