Iterative group splitting algorithm for opportunistic scheduling systems
KAUST DepartmentElectrical Engineering Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Communication Theory Lab
Permanent link to this recordhttp://hdl.handle.net/10754/563528
MetadataShow full item record
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.
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
SponsorsThis 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.