• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Iterative group splitting algorithm for opportunistic scheduling systems

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Nam, Haewoon
    Alouini, Mohamed-Slim cc
    KAUST Department
    Electrical Engineering Program
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Communication Theory Lab
    Date
    2014-05
    Permanent link to this record
    http://hdl.handle.net/10754/563528
    
    Metadata
    Show full item record
    Abstract
    An 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.
    Citation
    Haewoon 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
    Sponsors
    This 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.
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    IEEE Transactions on Mobile Computing
    DOI
    10.1109/TMC.2013.103
    ae974a485f413a2113503eed53cd6c53
    10.1109/TMC.2013.103
    Scopus Count
    Collections
    Articles; Electrical and Computer Engineering Program; Communication Theory Lab; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2022  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.