Skip to main navigation Skip to search Skip to main content

On the throughput-optimal distributed scheduling schemes with delay analysis in multi-hop wireless networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

With K-hop interference model, especially when K ≥ 2, the throughput-optimal centralized scheduler needs to solve a NP-Hard problem. It leads to the desire of a distributed, low-complexity but throughput-optimal scheduling algorithm. We generalize a randomized scheduling framework for a K-hop interference model and develop two randomized distributed scheduling algorithms which can be integrated into this framework. The delay performance of our scheme is also characterized.

Original languageEnglish
Title of host publication2010 IEEE/IFIP Network Operations and Management Symposium Workshops, NOMS 2010
Pages59-62
Number of pages4
DOIs
Publication statusPublished - 2010
Event2010 IEEE/IFIP Network Operations and Management Symposium Workshops, NOMS 2010 - Osaka, Japan
Duration: 19 Apr 201023 Apr 2010

Publication series

Name2010 IEEE/IFIP Network Operations and Management Symposium Workshops, NOMS 2010

Conference

Conference2010 IEEE/IFIP Network Operations and Management Symposium Workshops, NOMS 2010
Country/TerritoryJapan
CityOsaka
Period19/04/1023/04/10

Keywords

  • Optimal throughput
  • Resource allocation
  • Scheduling algorithms
  • Wireless networks

Fingerprint

Dive into the research topics of 'On the throughput-optimal distributed scheduling schemes with delay analysis in multi-hop wireless networks'. Together they form a unique fingerprint.

Cite this