• English
    • العربية
  • العربية
  • Login
  • QU
  • QU Library
  •  Home
  • Communities & Collections
  • Help
    • Item Submission
    • Publisher policies
    • User guides
    • FAQs
  • About QSpace
    • Vision & Mission
View Item 
  •   Qatar University Digital Hub
  • Qatar University Institutional Repository
  • Academic
  • Faculty Contributions
  • College of Engineering
  • Computer Science & Engineering
  • View Item
  • Qatar University Digital Hub
  • Qatar University Institutional Repository
  • Academic
  • Faculty Contributions
  • College of Engineering
  • Computer Science & Engineering
  • View Item
  •      
  •  
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Channel-, Queue-, and Delay-Aware Resource Allocation in Buffer-Aided Relay-Enhanced OFDMA Networks

    Thumbnail
    Date
    2016
    Author
    Hajipour, Javad
    Mohamed, Amr
    Leung, Victor C.M.
    Metadata
    Show full item record
    Abstract
    Resource allocation is an important factor in providing different varieties of services in next-generation broadband wireless systems. In this paper, we consider dynamic routing and subchannel allocation for providing quality of service (QoS) in the downlink of orthogonal frequency-division multiple-access (OFDMA) networks enhanced with buffering relays. Specifically, we consider satisfying the QoS requirements of both delay-sensitive users with the goal of meeting packet deadline constraints and delay-tolerant users who need guarantees on their average throughputs. We provide a framework for 'time-domain scheduling' and 'frequency-domain resource allocation,' and based on this, we propose novel channel-, queue-, and delay-aware policies for formulating and solving the joint routing and resource allocation problem. In particular, these policies take different approaches to decide on the set of users considered in the utility function, the delay budget division between the base station and relays, the routing path of delay-sensitive users' packets, and the computation of minimum rate requirements for serving their queues. We present an iterative algorithm to solve the resulting problems. Numerical results show significant improvements in throughput and delay performance of the proposed resource allocation mechanisms compared with existing algorithms.
    DOI/handle
    http://dx.doi.org/10.1109/TVT.2015.2424871
    http://hdl.handle.net/10576/17986
    Collections
    • Computer Science & Engineering [‎2429‎ items ]

    entitlement


    Qatar University Digital Hub is a digital collection operated and maintained by the Qatar University Library and supported by the ITS department

    Contact Us | Send Feedback
    Contact Us | Send Feedback | QU

     

     

    Home

    Submit your QU affiliated work

    Browse

    All of Digital Hub
      Communities & Collections Publication Date Author Title Subject Type Language Publisher
    This Collection
      Publication Date Author Title Subject Type Language Publisher

    My Account

    Login

    Statistics

    View Usage Statistics

    About QSpace

    Vision & Mission

    Help

    Item Submission Publisher policiesUser guides FAQs

    Qatar University Digital Hub is a digital collection operated and maintained by the Qatar University Library and supported by the ITS department

    Contact Us | Send Feedback
    Contact Us | Send Feedback | QU

     

     

    Video