Longest-queue-first scheduling under SINR interference model
Name
Modiano_Longest-queue.pdf
Size
208.99 KB
Format
Adobe PDF
Checksum (MD5)
7c48894b17d0921171e7ae9ab7649b73
Author(s)
Le, Long Bao
Joo, Changhee
Shroff, Ness B.
Modiano, Eytan H.
Date Issued
September 2010
Journal
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing (MobiHoc '10)
Publisher
Association for Computing Machinery (ACM)
Citation
Long Bao Le, Eytan Modiano, Changhee Joo, and Ness B. Shroff. 2010. Longest-queue-first scheduling under SINR interference model. In Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing (MobiHoc '10). ACM, New York, NY, USA, 41-50.
Version
Author's final manuscript
Abstract
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference model takes network geometry and the cumulative interference effect into account, which, therefore, capture the wireless interference more precisely than binary interference models. By employing the ρ-local pooling technique, we show that LQF scheduling achieves zero throughput in the worst case. We then propose a novel technique to localize interference which enables us to decentralize the LQF scheduling while preventing it from having vanishing throughput in all network topologies. We characterize the maximum throughput region under interference localization and present a distributed LQF scheduling algorithm. Finally, we present numerical results to illustrate the usefulness and to validate the theory developed in the paper.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/1860093.1860100
