Performance analysis of scheduling in decode-and-forward broadcast channel with limited-feedback

Wei Ni*, Zhuo Chen, Hajime Suzuki, Iain B. Collings

*Corresponding author for this work

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

1 Citation (Scopus)

Abstract

In wireless dual-hop decode-and-forward (DF) relaying networks, multiple relay stations (RS) and users construct a DF broadcast channel (DFBC). Due to unpredictable decoding failure, scheduling in the DFBC should depend on not only channel qualities but also the availability of errorless data at individual RSs. Based on the reception qualities of RSs and channel quality information (CQI), we propose a new centralized scheduling scheme to maximize the sum rate of the DFBC. An exact closed-form expression for the sum rate is derived to analyze the new scheme. To further facilitate the analysis, the bounds of the sum rate are derived as a computationally effective alternative to the exact expression. Simulations demonstrate that the derived closed-form expression quantifies the proposed scheduling method accurately. It is also revealed that the analytical bounds are able to characterize the performance of the new scheduling method with acceptable accuracy.

Original languageEnglish
Title of host publication2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1-5
Number of pages5
ISBN (Print)9781424456383
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event53rd IEEE Global Communications Conference, GLOBECOM - 2010 - Miami, United States
Duration: 6 Dec 201010 Dec 2010

Other

Other53rd IEEE Global Communications Conference, GLOBECOM - 2010
CountryUnited States
CityMiami
Period6/12/1010/12/10

Fingerprint Dive into the research topics of 'Performance analysis of scheduling in decode-and-forward broadcast channel with limited-feedback'. Together they form a unique fingerprint.

Cite this