By Topic

Fair Resource Allocation Toward Ubiquitous Coverage in OFDMA-Based Cellular Relay Networks With Asymmetric Traffic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Mohamed Salem ; Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada ; Abdulkareem Adinoyi ; Halim Yanikomeroglu ; David Falconer

Next-generation wireless networks are preoccupied with the provision of very high data rates in a ubiquitous and fair manner throughout the service area. Toward that end, the deployment of fixed relays by the operators has become an accepted network architecture for which orthogonal frequency-division multiple access (OFDMA) is the envisioned air interface, and efficient resource utilization is imperative. In contrast to the current literature, this paper presents a novel throughput-optimal formulation, which performs joint intracell routing and scheduling, in accordance with the emerging OFDMA-based cellular relay networks employing two-hop half-duplex relaying. Low-complexity iterative algorithms are devised to solve the formulated optimization over two consecutive subframes (the base station transmits, followed by the relay stations) using queue-length coupling. We first show that the network capacity, below which the policy is throughput optimal, has been significantly increased, compared with the previously proposed quasi-full-duplex relaying (FDR) scheme, at a slight complexity increase. Hence, throughput fairness and ubiquity have been improved at high traffic loads, aside from the substantial improvement in both queue-awareness and latency. Second, we show that, without empirical priority weights, our efficient implementation of throughput-optimal scheduling achieves a ubiquitous and fair service within each class of users (with symmetric traffic) and across classes of asymmetric traffic in a relative sense on different time scales. Load balancing among only the active relays could still be jointly realized with the resource allocation.

Published in:

IEEE Transactions on Vehicular Technology  (Volume:60 ,  Issue: 5 )