Show simple item record

dc.contributor.authorNam, Haewoon
dc.contributor.authorAlouini, Mohamed-Slim
dc.date.accessioned2015-08-03T11:53:43Z
dc.date.available2015-08-03T11:53:43Z
dc.date.issued2014-05
dc.identifier.citationHaewoon Nam, & Alouini, M.-S. (2014). Iterative Group Splitting Algorithm for Opportunistic Scheduling Systems. IEEE Transactions on Mobile Computing, 13(5), 1076–1089. doi:10.1109/tmc.2013.103
dc.identifier.issn15361233
dc.identifier.doi10.1109/TMC.2013.103
dc.identifier.urihttp://hdl.handle.net/10754/563528
dc.description.abstractAn efficient feedback algorithm for opportunistic scheduling systems based on iterative group splitting is proposed in this paper. Similar to the opportunistic splitting algorithm, the proposed algorithm adjusts (or lowers) the feedback threshold during a guard period if no user sends a feedback. However, when a feedback collision occurs at any point of time, the proposed algorithm no longer updates the threshold but narrows down the user search space by dividing the users into multiple groups iteratively, whereas the opportunistic splitting algorithm keeps adjusting the threshold until a single user is found. Since the threshold is only updated when no user sends a feedback, it is shown that the proposed algorithm significantly alleviates the signaling overhead for the threshold distribution to the users by the scheduler. More importantly, the proposed algorithm requires a less number of mini-slots than the opportunistic splitting algorithm to make a user selection with a given level of scheduling outage probability or provides a higher ergodic capacity given a certain number of mini-slots. © 2013 IEEE.
dc.description.sponsorshipThis work was supported by the research fund of Hanyang University (HY-2012-N). The authors are grateful to the associate editor and the anonymous reviewers for fruitful comments.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectAlgorithm/protocol design and analysis
dc.subjectMobile communication systems
dc.subjectWireless
dc.titleIterative group splitting algorithm for opportunistic scheduling systems
dc.typeArticle
dc.contributor.departmentElectrical Engineering Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentCommunication Theory Lab
dc.identifier.journalIEEE Transactions on Mobile Computing
dc.contributor.institutionDepartment of Electronics and Communication Engineering, Hanyang University, Ansan 426-791, South Korea
kaust.personAlouini, Mohamed-Slim


This item appears in the following Collection(s)

Show simple item record