Channel access delay and buffer distribution of two-user opportunistic scheduling schemes in wireless networks

Handle URI:
http://hdl.handle.net/10754/561495
Title:
Channel access delay and buffer distribution of two-user opportunistic scheduling schemes in wireless networks
Authors:
Hossain, Md Jahangir; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 ) ; Bhargava, Vijay K.
Abstract:
In our earlier works, we proposed rate adaptive hierarchical modulation-assisted two-best user opportunistic scheduling (TBS) and hybrid two-user scheduling (HTS) schemes. The proposed schemes are innovative in the sense that they include a second user in the transmission opportunistically using hierarchical modulations. As such the frequency of information access of the users increases without any degradation of the system spectral efficiency (SSE) compared to the classical opportunistic scheduling scheme. In this paper, we analyze channel access delay of an incoming packet at the base station (BS) buffer when our proposed TBS and HTS schemes are employed at the BS. Specifically, using a queuing analytic model we derive channel access delay as well as buffer distribution of the packets that wait at BS buffer for down-link (DL) transmission. We compare performance of the TBS and HTS schemes with that of the classical single user opportunistic schemes namely, absolute carrier-to-noise ratio (CNR)-based single user scheduling (ASS) and normalized CNR-based single user scheduling (NSS). For an independent and identically distributed (i.i.d.) fading environment, our proposed scheme can improve packet's access delay performance compared to the ASS. Selected numerical results in an independent but non-identically distributed (i.n.d.) fading environment show that our proposed HTS achieves overall good channel access delay performance. © 2010 IEEE.
KAUST Department:
Electrical Engineering Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Communication Theory Lab
Publisher:
Institute of Electrical and Electronics Engineers
Journal:
IEEE Transactions on Communications
Issue Date:
Jul-2010
DOI:
10.1109/TCOMM.2010.07.080500
Type:
Article
ISSN:
00906778
Sponsors:
It is supported in part by the Li Tze Fong memorial Fellowship; and in part by the Natural Sciences and Engineering Council of Canada (NSERC) Canada and in part by the Qatar foundation for Education, Science, and Community Development.The authors like to acknowledge the support from Li Tze Fong memorial Fellowship at UBC. Authors also like to thank Mohammad Mamunur Rashid for his help and discussion regarding queuing analysis.
Appears in Collections:
Articles; Electrical Engineering Program; Communication Theory Lab; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorHossain, Md Jahangiren
dc.contributor.authorAlouini, Mohamed-Slimen
dc.contributor.authorBhargava, Vijay K.en
dc.date.accessioned2015-08-02T09:12:46Zen
dc.date.available2015-08-02T09:12:46Zen
dc.date.issued2010-07en
dc.identifier.issn00906778en
dc.identifier.doi10.1109/TCOMM.2010.07.080500en
dc.identifier.urihttp://hdl.handle.net/10754/561495en
dc.description.abstractIn our earlier works, we proposed rate adaptive hierarchical modulation-assisted two-best user opportunistic scheduling (TBS) and hybrid two-user scheduling (HTS) schemes. The proposed schemes are innovative in the sense that they include a second user in the transmission opportunistically using hierarchical modulations. As such the frequency of information access of the users increases without any degradation of the system spectral efficiency (SSE) compared to the classical opportunistic scheduling scheme. In this paper, we analyze channel access delay of an incoming packet at the base station (BS) buffer when our proposed TBS and HTS schemes are employed at the BS. Specifically, using a queuing analytic model we derive channel access delay as well as buffer distribution of the packets that wait at BS buffer for down-link (DL) transmission. We compare performance of the TBS and HTS schemes with that of the classical single user opportunistic schemes namely, absolute carrier-to-noise ratio (CNR)-based single user scheduling (ASS) and normalized CNR-based single user scheduling (NSS). For an independent and identically distributed (i.i.d.) fading environment, our proposed scheme can improve packet's access delay performance compared to the ASS. Selected numerical results in an independent but non-identically distributed (i.n.d.) fading environment show that our proposed HTS achieves overall good channel access delay performance. © 2010 IEEE.en
dc.description.sponsorshipIt is supported in part by the Li Tze Fong memorial Fellowship; and in part by the Natural Sciences and Engineering Council of Canada (NSERC) Canada and in part by the Qatar foundation for Education, Science, and Community Development.The authors like to acknowledge the support from Li Tze Fong memorial Fellowship at UBC. Authors also like to thank Mohammad Mamunur Rashid for his help and discussion regarding queuing analysis.en
dc.publisherInstitute of Electrical and Electronics Engineersen
dc.subjectDelay statisticen
dc.subjecthierarchical modulationsen
dc.subjectmultiuser diversityen
dc.subjectopportunistic schedulingen
dc.subjectqueuing analysisen
dc.titleChannel access delay and buffer distribution of two-user opportunistic scheduling schemes in wireless networksen
dc.typeArticleen
dc.contributor.departmentElectrical Engineering Programen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentCommunication Theory Laben
dc.identifier.journalIEEE Transactions on Communicationsen
dc.contributor.institutionInstitut National de la Recherche Scientifique, INRS-EMT, 800, Gauchetiere W. Suite, 6900 Montreal, H5A 1K6, Canadaen
dc.contributor.institutionDepartment of Electrical and Computer Engineering, University of British Columbia, Vancouver, Canadaen
kaust.authorAlouini, Mohamed-Slimen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.