Performance of random access scheduling schemes in multi-hop wireless networks

Changhee Joo, Ness B. Shroff

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

72 Citations (Scopus)

Abstract

The performance of scheduling schemes in multi-hop wireless networks has attracted significant attention in the recent literature. It is well known that optimal scheduling solutions require centralized information and lead to impractical implementations due to their enormous complexity (high-degree polynomial or NP-hard, depending on the interference scenario). Further, multi-hop networks typically require distributed algorithms that operate on local information. Thus, in this paper, we develop a constant-time distributed random access algorithm for scheduling in multi-hop wireless networks. An important feature of this scheme is that it is guaranteed to achieve a fraction (efficiency factor) of the optimal performance. We show that this scheme theoretically achieves a superior efficiency factor as well as numerically achieves a significant performance improvement over the state-of-the-art. Simulation results also confirm that the performance of this scheme is close to a greedy centralized scheme.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM 2007
Subtitle of host publication26th IEEE International Conference on Computer Communications
Pages19-27
Number of pages9
DOIs
Publication statusPublished - 2007
Externally publishedYes
EventIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications - Anchorage, AK, United States
Duration: 2007 May 62007 May 12

Publication series

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

Conference

ConferenceIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
Country/TerritoryUnited States
CityAnchorage, AK
Period07/5/607/5/12

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Performance of random access scheduling schemes in multi-hop wireless networks'. Together they form a unique fingerprint.

Cite this