TY - GEN
T1 - Longest-queue-first scheduling under SINR interference model
AU - Le, Long Bao
AU - Modiano, Eytan
AU - Joo, Changhee
AU - Shroff, Ness B.
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
KW - Binary interference model
KW - Greedy maximal scheduling
KW - Longest-queue-first scheduling
KW - SINR interference model
KW - Throughput region
KW - Wireless scheduling
UR - http://www.scopus.com/inward/record.url?scp=78649309858&partnerID=8YFLogxK
U2 - 10.1145/1860093.1860100
DO - 10.1145/1860093.1860100
M3 - Conference contribution
AN - SCOPUS:78649309858
SN - 9781450301831
T3 - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
SP - 41
EP - 50
BT - MobiCom'10 and MobiHoc'10 - Proceedings of the 16th Annual International Conference on Mobile Computing and Networking and 11th ACM International Symposium on Mobile Ad Hoc Networking and Computing
PB - Association for Computing Machinery
T2 - 11th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2010
Y2 - 20 September 2010 through 24 September 2010
ER -