Throughput performance of back-pressure scheduling in wireless cooperative networks

Anh Tuan Hoang, Wai Leong Yeow, Peng Yong Kong, Chen Khong Tham

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

3 Scopus citations

Abstract

It is well-known that throughput of wired multihop, multi-commodity networks can be maximized by employing back-pressure scheduling. With this approach, packets belonging to different destinations are dynamically routed/scheduled in a network based on buffer occupancies and link quality. There has been a considerable amount of research on applying back-pressure scheduling in the wireless environment; usually by abstracting each wireless channel as a point-to-point link and therefore, ignoring the fundamental wireless broadcast property. In this paper, we consider a two-hop wireless cooperative network and characterize the minimum throughput gain obtained by exploiting broadcast property in back-pressure scheduling. Numerical results are provided to support our analysis.

Original languageBritish English
Title of host publication2009 IEEE 20th Personal, Indoor and Mobile Radio Communications Symposium, PIMRC 2009
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1437-1441
Number of pages5
ISBN (Print)9781424451234
DOIs
StatePublished - 2009
Event2009 IEEE 20th Personal, Indoor and Mobile Radio Communications Symposium, PIMRC 2009 - Tokyo, Japan
Duration: 13 Sep 200916 Sep 2009

Publication series

NameIEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

Conference

Conference2009 IEEE 20th Personal, Indoor and Mobile Radio Communications Symposium, PIMRC 2009
Country/TerritoryJapan
CityTokyo
Period13/09/0916/09/09

Fingerprint

Dive into the research topics of 'Throughput performance of back-pressure scheduling in wireless cooperative networks'. Together they form a unique fingerprint.

Cite this