Interference is not noise
Name
Shah_Interference is not noise.pdf
Size
185.58 KB
Format
Adobe PDF
Checksum (MD5)
85d226ff54df8c4c2464cc3b21e61d57
Author(s)
Bodas, Shreeshankar
Shah, Devavrat
Wischik, Damon
Date Issued
January 2012
Journal
49th Annual Allerton Conference on Communication, Control, and Computing 2011 (Allerton)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Bodas, Shreeshankar, Devavrat Shah, and Damon Wischik. “Interference Is Not Noise.” 49th Annual Allerton Conference on Communication, Control, and Computing 2011 (Allerton). 119–126.
Version
Author's final manuscript
Abstract
This paper looks at the problem of designing wireless medium access algorithms. Inter-user interference at the receivers is an important characteristic of wireless networks. We show that decoding (or canceling) this interference results in significant improvement in the system performance over protocols that either treat interference as noise, or explicitly avoid interference at the receivers by allowing at most one of the transmitters in its range to transmit. This improvement in performance is realized by means of a medium access algorithm with: (a) polynomial computational complexity per timeslot, (b) polynomially bounded expected queue-length at the transmitters, and (c) a throughput region that is at least a polylogarithmic fraction of the largest possible throughput-region under any algorithm operating using that treats interference as noise. Thus, the hardness of low-delay network scheduling (a result by Shah, Tse and Tsitsiklis [1]) is an artifact of explicitly avoiding interference, or treating it as noise and can be overcome by a rather simple medium access algorithm that does not require information theoretic "block codes".
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/Allerton.2011.6120158
