Longest-queue-first scheduling under SINR interference model

Long Bao Le, Eytan Modiano, Changhee Joo, Ness B. Shroff

Research output: Chapter in Book/Report/Conference proceedingConference contribution

51 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationMobiCom'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
PublisherAssociation for Computing Machinery
Pages41-50
Number of pages10
ISBN (Print)9781450301831
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event11th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2010 - Chicago, IL, United States
Duration: 2010 Sep 202010 Sep 24

Publication series

NameProceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Other

Other11th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2010
Country/TerritoryUnited States
CityChicago, IL
Period10/9/2010/9/24

Keywords

  • Binary interference model
  • Greedy maximal scheduling
  • Longest-queue-first scheduling
  • SINR interference model
  • Throughput region
  • Wireless scheduling

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Longest-queue-first scheduling under SINR interference model'. Together they form a unique fingerprint.

Cite this