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 pa...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Springer-Verlag
2014
|
| Online Access: | http://hdl.handle.net/1721.1/90330 https://orcid.org/0000-0003-3045-265X https://orcid.org/0000-0003-4059-407X https://orcid.org/0000-0003-3381-0459 |
| _version_ | 1826198717599842304 |
|---|---|
| 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(alogn + aℓ) bits of communication with full-duplex radios, and O((alogn + aℓ)(logn)) bits, with high probability, with half-duplex radios. When combined with random linear network coding, BCC gives global broadcast within O((D + a + logn)(alogn + ℓ)) 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:08:41Z |
| format | Article |
| id | mit-1721.1/90330 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T11:08:41Z |
| publishDate | 2014 |
| publisher | Springer-Verlag |
| record_format | dspace |
| spelling | mit-1721.1/903302022-09-27T17:26:24Z Bounded-Contention Coding for Wireless Networks in the High SNR Regime 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 Censor-Hillel, Keren Haeupler, Bernhard 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(alogn + aℓ) bits of communication with full-duplex radios, and O((alogn + aℓ)(logn)) bits, with high probability, with half-duplex radios. When combined with random linear network coding, BCC gives global broadcast within O((D + a + logn)(alogn + ℓ)) 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. Simons Foundation (Postdoctoral Fellows Program) National Science Foundation (U.S.) (Award 0939370-CCF) 2014-09-24T19:54:56Z 2014-09-24T19:54:56Z 2012 Article http://purl.org/eprint/type/JournalArticle 978-3-642-33650-8 978-3-642-33651-5 0302-9743 1611-3349 http://hdl.handle.net/1721.1/90330 Censor-Hillel, Keren, Bernhard Haeupler, Nancy Lynch, and Muriel Medard. “Bounded-Contention Coding for Wireless Networks in the High SNR Regime.” Lecture Notes in Computer Science (2012): 91–105. https://orcid.org/0000-0003-3045-265X https://orcid.org/0000-0003-4059-407X https://orcid.org/0000-0003-3381-0459 en_US http://dx.doi.org/10.1007/978-3-642-33651-5_7 Distributed Computing Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Springer-Verlag 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/90330 https://orcid.org/0000-0003-3045-265X https://orcid.org/0000-0003-4059-407X https://orcid.org/0000-0003-3381-0459 |
| work_keys_str_mv | AT censorhillelkeren boundedcontentioncodingforwirelessnetworksinthehighsnrregime AT haeuplerbernhard boundedcontentioncodingforwirelessnetworksinthehighsnrregime AT lynchnancyann boundedcontentioncodingforwirelessnetworksinthehighsnrregime AT medardmuriel boundedcontentioncodingforwirelessnetworksinthehighsnrregime |