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

9 Citations (Scopus)

Abstract

The performance of scheduling schemes in multihop 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, an important characteristic in many multi-hop scenarios is the need for distributed algorithms that operate on local information. Thus, in this paper we develop a constant-time random access distributed algorithm for scheduling in multihop wireless networks. An important feature of this scheme is that it achieves a 2-approximation efficiency ratio and can be implemented in an entirely distributed manner with low overhead.

Original languageEnglish
Title of host publicationConference Record of the 40th Asilomar Conference on Signals, Systems and Computers, ACSSC '06
Pages1937-1941
Number of pages5
DOIs
Publication statusPublished - 2006
Externally publishedYes
Event40th Asilomar Conference on Signals, Systems, and Computers, ACSSC '06 - Pacific Grove, CA, United States
Duration: 2006 Oct 292006 Nov 1

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)1058-6393

Conference

Conference40th Asilomar Conference on Signals, Systems, and Computers, ACSSC '06
Country/TerritoryUnited States
CityPacific Grove, CA
Period06/10/2906/11/1

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

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