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

    Filter by Category

    AuthorAlnuweiri, Hussein M. (1)
    Alouini, Mohamed-Slim (1)
    Shaqfeh, Mohammad (1)Zafar, Ammar (1)Department
    Communication Theory Lab (1)
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division (1)Electrical Engineering Program (1)Journal
    IEEE Transactions on Communications (1)
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE) (1)
    Subject
    achievable rate region (1)
    block-fading channels (1)joint user-and-hop scheduling (1)Optimal resource allocation (1)relay with a buffer (1)View MoreTypeArticle (1)Year (Issue Date)
    2014 (1)
    Item Availability
    Metadata Only (1)

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CommunityIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics
     

    Search

    Show Advanced FiltersHide Advanced Filters

    Filters

    Now showing items 1-1 of 1

    • List view
    • Grid view
    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Submit Date Asc
    • Submit Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100

    • 1CSV
    • 1RefMan
    • 1EndNote
    • 1BibTex
    • Selective Export
    • Select All
    • Help
    Thumbnail

    Resource allocation for two source-destination pairs sharing a single relay with a buffer

    Zafar, Ammar; Shaqfeh, Mohammad; Alouini, Mohamed-Slim; Alnuweiri, Hussein M. (IEEE Transactions on Communications, Institute of Electrical and Electronics Engineers (IEEE), 2014-05) [Article]
    In this paper, we obtain the optimal resource allocation scheme in order to maximize the achievable rate region in a dual-hop system that consists of two independent source-destination pairs sharing a single half-duplex relay. The relay decodes the received information and possesses buffers to enable storing the information temporarily before forwarding it to the respective destination. We consider both non-orthogonal transmission with successive interference cancellation at the receivers and orthogonal transmission. Also, we consider Gaussian block-fading channels and we assume that the channel state information is known and that no delay constraints are required. We show that, with the aid of buffering at the relay, joint user-and-hop scheduling is optimal and can enhance the achievable rate significantly. This is due to the joint exploitation of multiuser diversity and multihop diversity in the system. We provide closed-form expressions to characterize the average achievable rates in a generic form as functions of the statistical model of the channels. Furthermore, we consider sub-optimal schemes that exploit the diversity in the system partially and we provide numerical results to compare the different schemes and demonstrate the gains of the optimal one. © 2014 IEEE.
    DSpace software copyright © 2002-2019  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.