• Login
    View Item 
    •   Home
    • IRAC Institute for Research in Applicable Computing - to April 2016
    • Centre for Research in Distributed Technologies (CREDIT)
    • View Item
    •   Home
    • IRAC Institute for Research in Applicable Computing - to April 2016
    • Centre for Research in Distributed Technologies (CREDIT)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UOBREPCommunitiesTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournalDepartmentThis CollectionTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournalDepartment

    My Account

    LoginRegister

    About

    AboutLearning ResourcesResearch Graduate SchoolResearch InstitutesUniversity Website

    Statistics

    Display statistics

    Multiuser scheduling in high speed downlink packet access

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Authors
    Kwan, Raymond
    Aydin, Mehmet Emin
    Leung, Cyril
    Zhang, J.
    Issue Date
    2009-08
    
    Metadata
    Show full item record
    Abstract
    Multiuser scheduling is an important aspect in the performance optimisation of a wireless network as it allows multiple users to efficiently access a shared channel by exploiting multiuser diversity. For example, the 3GPP cellular standard supports multiuser scheduling in the high speed downlink packet access (HSDPA) feature. To perform efficient scheduling, channel state information (CSI) for users is required, and is obtained via their respective feedback channels. Multiuser scheduling is studied assuming the availability of perfect CSI, which would require a high bandwidth overhead. A more realistic imperfect CSI feedback in the form of a finite set of channel quality indicator values is assumed, as specified in the HSDPA standard. A global optimal approach and a simulated annealing (CSA) approach are used to solve the optimisation problem. Simulation results suggest that the performances of the two approaches are very close even though the complexity of the simulated annealing (SA) approach is much lower. The performance of a simple greedy approach is found to be significantly worse.
    Citation
    Kwan, R., Aydin, M., Leung, C. & Zhang, J. (2009) 'Multiuser scheduling in high speed downlink packet access', IET Communications, 3 (8), pp.1363-70.
    Publisher
    IET
    Journal
    IET Communications
    URI
    http://hdl.handle.net/10547/225295
    DOI
    10.1049/iet-com.2008.0340
    Additional Links
    http://link.aip.org/link/ICEOCW/v3/i8/p1363/s1&Agg=doi
    Type
    Article
    Language
    en
    ISSN
    17518628
    ae974a485f413a2113503eed53cd6c53
    10.1049/iet-com.2008.0340
    Scopus Count
    Collections
    Centre for Research in Distributed Technologies (CREDIT)

    entitlement

     
    DSpace software (copyright © 2002 - 2021)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated 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.

    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.