Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Bounded-Contention Coding for wireless networks in the high SNR regime

Bounded-Contention Coding for wireless networks in the high SNR regime

Thumbnail Image
Download
Name

Lynch_Bounded-contention.pdf

Size

304.04 KB

Format

Adobe PDF

Checksum (MD5)

c2070bdff11b5ffbc866086625175177

Author(s)
Censor-Hillel, Keren
•
Haeupler, Bernhard
•
Lynch, Nancy A.
•
Medard, Muriel
Alternative Title
Bounded-Contention Coding for the additive network model
Date Issued
April 2015
Journal
Distributed Computing
Citation
Censor-Hillel, Keren, Bernhard Haeupler, Nancy Lynch, and Muriel Medard. “Bounded-Contention Coding for the Additive Network Model.” Distributed Computing 28, no. 5 (April 24, 2015): 297–308.
Version
Original manuscript
Abstract
Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in order to obtain faster algorithms for communication in such networks. This paper proposes a novel approach for wireless communication, which embraces collisions rather than avoiding them, over an additive channel. It introduces a coding technique called Bounded-Contention Coding (BCC) that allows collisions to be successfully decoded by the receiving nodes into the original transmissions and whose complexity depends on a bound on the contention among the transmitters. BCC enables deterministic local broadcast in a network with n nodes and at most a transmitters with information of ℓ bits each within O(a log n + aℓ) bits of communication with full-duplex radios, and O((a log n + aℓ)(log n)) bits, with high probability, with half-duplex radios. When combined with random linear network coding, BCC gives global broadcast within O((D + a + log n)(a log n + ℓ)) bits, with high probability. This also holds in dynamic networks that can change arbitrarily over time by a worst-case adversary. When no bound on the contention is given, it is shown how to probabilistically estimate it and obtain global broadcast that is adaptive to the true contention in the network.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/100844
DOI of Published Version
https://doi.org/10.1007/s00446-015-0244-9
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.