Distributed Greedy approximation to Maximum Weighted Independent Set for scheduling with fading channels

Changhee Joo, Xiaojun Lin, Jiho Ryu, Ness B. Shroff

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

23 Citations (Scopus)

Abstract

Developing scheduling mechanisms that can simultaneously achieve throughput optimality and good delay performance often require solving the Maximum Independent Weighted Set (MWIS) problem. However, under most realistic network settings, the MWIS problem can be shown to be NPhard. In non-fading environments, low-complexity scheduling algorithms have been provided that converge either to the MWIS solution in time or to a solution that achieves at least a provable fraction of the achievable throughput. However, in more practical systems the channel conditions can vary at faster time-scales than convergence occurs in these lower-complexity algorithms. Hence, these algorithms cannot take advantage of the opportunistic gain, and may no longer guarantee good performance. In this paper, we propose a low-complexity scheduling scheme that performs provably well under fading channels and is amenable to implement in a distributed manner. To the best of our knowledge, this is the first scheduling scheme under fading environments that requires only local information, has a low complexity that grows logarithmically with the network size, and achieves provable performance guarantees (which is arbitrarily close to that of the well-known centralized Greedy Maximal Scheduler). Through simulations we verify that both the throughput and the delay under our proposed distributed scheduling scheme are close to that of the optimal solution to MWIS. Further, we implement a preliminary version of our algorithm in a testbed by modifying the existing IEEE 802.11 DCF. The preliminary experiment results show that our implementation successfully accounts for wireless fading, and attains the opportunistic gains in practice, and hence substantially outperforms IEEE 802.11 DCF.

Original languageEnglish
Title of host publicationMobiHoc 2013 - Proceedings of the 14th ACM International Symposium on Mobile Ad Hoc Networking and Computing
Pages89-97
Number of pages9
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event14th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2013 - Bangalore, India
Duration: 2013 Jul 292013 Aug 1

Publication series

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

Conference

Conference14th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2013
Country/TerritoryIndia
CityBangalore
Period13/7/2913/8/1

Keywords

  • Distributed algorithm
  • Maximum weighted independent set
  • Wireless scheduling

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Distributed Greedy approximation to Maximum Weighted Independent Set for scheduling with fading channels'. Together they form a unique fingerprint.

Cite this