Bounded-Contention Coding for wireless networks in the high SNR regime
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 pap...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://hdl.handle.net/1721.1/100844 https://orcid.org/0000-0003-3045-265X https://orcid.org/0000-0003-4059-407X |
| _version_ | 1826201845059551232 |
|---|---|
| author | Censor-Hillel, Keren Haeupler, Bernhard Lynch, Nancy Ann Medard, Muriel |
| author2 | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
| author_facet | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Censor-Hillel, Keren Haeupler, Bernhard Lynch, Nancy Ann Medard, Muriel |
| author_sort | Censor-Hillel, Keren |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T11:58:01Z |
| format | Article |
| id | mit-1721.1/100844 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T11:58:01Z |
| publishDate | 2016 |
| record_format | dspace |
| spelling | mit-1721.1/1008442022-10-01T07:20:05Z Bounded-Contention Coding for wireless networks in the high SNR regime Bounded-Contention Coding for the additive network model Censor-Hillel, Keren Haeupler, Bernhard Lynch, Nancy Ann Medard, Muriel 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 Lynch, Nancy Ann Medard, Muriel 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. Israel Science Foundation (Grant 1696/14) United States. Air Force Office of Scientific Research (Contract FA9550-13-1-0042) United States. Air Force Office of Scientific Research (Contract FA9550-14-1-0403) National Science Foundation (U.S.) (Award 0939370-CCF) Simons Foundation (Postdoctoral Fellows Program) 2016-01-15T02:11:47Z 2016-01-15T02:11:47Z 2015-04 2014-03 Article http://purl.org/eprint/type/JournalArticle 0178-2770 1432-0452 http://hdl.handle.net/1721.1/100844 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. https://orcid.org/0000-0003-3045-265X https://orcid.org/0000-0003-4059-407X en_US http://dx.doi.org/10.1007/s00446-015-0244-9 Distributed Computing Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf MIT web domain |
| spellingShingle | Censor-Hillel, Keren Haeupler, Bernhard Lynch, Nancy Ann Medard, Muriel Bounded-Contention Coding for wireless networks in the high SNR regime |
| title | Bounded-Contention Coding for wireless networks in the high SNR regime |
| title_full | Bounded-Contention Coding for wireless networks in the high SNR regime |
| title_fullStr | Bounded-Contention Coding for wireless networks in the high SNR regime |
| title_full_unstemmed | Bounded-Contention Coding for wireless networks in the high SNR regime |
| title_short | Bounded-Contention Coding for wireless networks in the high SNR regime |
| title_sort | bounded contention coding for wireless networks in the high snr regime |
| url | http://hdl.handle.net/1721.1/100844 https://orcid.org/0000-0003-3045-265X https://orcid.org/0000-0003-4059-407X |
| work_keys_str_mv | AT censorhillelkeren boundedcontentioncodingforwirelessnetworksinthehighsnrregime AT haeuplerbernhard boundedcontentioncodingforwirelessnetworksinthehighsnrregime AT lynchnancyann boundedcontentioncodingforwirelessnetworksinthehighsnrregime AT medardmuriel boundedcontentioncodingforwirelessnetworksinthehighsnrregime AT censorhillelkeren boundedcontentioncodingfortheadditivenetworkmodel AT haeuplerbernhard boundedcontentioncodingfortheadditivenetworkmodel AT lynchnancyann boundedcontentioncodingfortheadditivenetworkmodel AT medardmuriel boundedcontentioncodingfortheadditivenetworkmodel |