direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

All publications

Competitive and Fair Throughput for Co-Existing Networks Under Adversarial Interference
Citation key RSSZ-CFTCENUAI-12
Author Richa, Andreéa and Scheideler, Christian and Schmid, Stefan and Zhang, Jin
Title of Book ACM Symposium on Principles of Distributed Computing (PODC '12)
Year 2012
Location Madeira, Portugal
Month July
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.
Link to publication [1] Download Bibtex entry [2]
------ Links: ------

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Copyright TU Berlin 2008