Low-complexity distributed scheduling algorithms for wireless networks

Abhinav Gupta, Xiaojun Lin, Rayadurgam Srikant

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

Abstract

We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules, but which require low complexity due to the fact that they do not necessarily attempt to find maximal schedules. The first algorithm requires each link to collect local queue-length information in its neighborhood, and its complexity is independent of the size and topology of the network. The second algorithm is presented for the node-exclusive interference model, does not require nodes to collect queue-length information even in their local neighborhoods, and its complexity depends only on the maximum node degree in the network.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM 2007
Subtitle of host publication26th IEEE International Conference on Computer Communications
Pages1631-1639
Number of pages9
DOIs
StatePublished - Sep 4 2007
EventIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications - Anchorage, AK, United States
Duration: May 6 2007May 12 2007

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Other

OtherIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
CountryUnited States
CityAnchorage, AK
Period5/6/075/12/07

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Gupta, A., Lin, X., & Srikant, R. (2007). Low-complexity distributed scheduling algorithms for wireless networks. In Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications (pp. 1631-1639). [4215773] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2007.191