• Login
    View Item 
    •   Home
    • Theses and Dissertations
    • Theses
    • View Item
    •   Home
    • Theses and Dissertations
    • Theses
    • 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 LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    Low-Feedback Opportunistic Scheduling Schemes for Wireless Networks with Heterogenous Users

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Faraan Rashid_Final Thesis.pdf
    Size:
    913.3Kb
    Format:
    PDF
    Description:
    PDF file
    Download
    Type
    Thesis
    Authors
    Rashid, Faraan
    Advisors
    Alouini, Mohamed-Slim cc
    Committee members
    Al-Naffouri, Tareq Y. cc
    Moshkov, Mikhail cc
    Program
    Electrical Engineering
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Date
    2012-07
    Permanent link to this record
    http://hdl.handle.net/10754/237211
    
    Metadata
    Show full item record
    Abstract
    Efficient implementation of resource sharing strategies in a multi-user wireless environment can improve the performance of a network significantly. In this thesis we study various scheduling strategies for wireless networks and handle the problem of opportunistically scheduling transmissions using channel aware schemes. First we propose a scheme that can handle users with asymmetric channel conditions and is opportunistic in the sense that it exploits the multi-user diversity of the network. The scheme requires the users to have a priori knowledge of their channel distributions. The associated overhead is limited meaning it offers reduced feedback load, that does not scale with the increasing number of users. The main technique used to shrink the feedback load is the contention based distributed implementation of a splitting algorithm that does not require explicit feedback to the scheduler from every user. The users find the best among themselves, in a distributed manner, while requiring just a ternary broadcast feedback from the scheduler at the end of each mini-slot. In addition, it can also handle fairness constraints in time and throughput to various degrees. Next we propose another opportunistic scheduler that offers most of the benefits of the previously proposed scheme but is more practical because it can also handle heterogenous users whose channel distributions are unknown. This new scheme actually reduces the complexity and is also more robust for changing traffic patterns. Finally we extend both these schemes to the scenario where there are fixed thresholds, this enables us to handle opportunistic scheduling in practical systems that can only transmit over finite number of discrete rates with the additional benefit that full feedback session, even from the selected user, is never required.
    Citation
    Rashid, F. (2012). Low-Feedback Opportunistic Scheduling Schemes for Wireless Networks with Heterogenous Users. KAUST Research Repository. https://doi.org/10.25781/KAUST-81920
    DOI
    10.25781/KAUST-81920
    ae974a485f413a2113503eed53cd6c53
    10.25781/KAUST-81920
    Scopus Count
    Collections
    Theses; Electrical Engineering Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2021  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    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.