• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • 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

    Efficient scheduling request algorithm for opportunistic wireless access

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Conference Paper
    Authors
    Nam, Haewoon
    Alouini, Mohamed-Slim cc
    KAUST Department
    Communication Theory Lab
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Electrical Engineering Program
    Physical Science and Engineering (PSE) Division
    Date
    2011-08
    Permanent link to this record
    http://hdl.handle.net/10754/564407
    
    Metadata
    Show full item record
    Abstract
    An efficient scheduling request algorithm for opportunistic wireless access based on user grouping is proposed in this paper. Similar to the well-known opportunistic splitting algorithm, the proposed algorithm initially adjusts (or lowers) the threshold during a guard period if no user sends a scheduling request. However, if multiple users make requests simultaneously and therefore a collision occurs, the proposed algorithm no longer updates the threshold but narrows down the user search space by splitting 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 request, it is shown that the proposed algorithm significantly alleviates the burden of the signaling for the threshold distribution to the users by the scheduler. More importantly, the proposed algorithm requires a less number of mini-slots to make a user selection given a certain scheduling outage probability. © 2011 IEEE.
    Citation
    Nam, H., & Alouini, M.-S. (2011). Efficient scheduling request algorithm for opportunistic wireless access. 2011 IEEE MTT-S International Microwave Workshop Series on Intelligent Radio for Future Personal Terminals. doi:10.1109/imws2.2011.6027178
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    2011 IEEE MTT-S International Microwave Workshop Series on Intelligent Radio for Future Personal Terminals
    Conference/Event name
    2011 IEEE MTT-S International Microwave Workshop Series on Intelligent Radio for Future Personal Terminals, IMWS-IRFPT 2011
    ISBN
    9781457709630
    DOI
    10.1109/IMWS2.2011.6027178
    ae974a485f413a2113503eed53cd6c53
    10.1109/IMWS2.2011.6027178
    Scopus Count
    Collections
    Conference Papers; Physical Science and Engineering (PSE) Division; 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.