Coding-aware proportional-fair scheduling in ofdma relay networks

Bin Tang, Baoliu Ye, Sanglu Lu, Song Guo

Research output: Journal article publicationJournal articleAcademic researchpeer-review

8 Citations (Scopus)

Abstract

In recent years, OFDMA relay networks have become a key component in the 4G standards (e.g., IEEE 802.16j, 3GPP LTE-Advanced) for broadband wireless access. When numerous bidirectional flows pass through the relay stations in an OFDMA relay network that supports various interactive applications, plenty of network coding opportunities arise and can be leveraged to enhance the throughput. In this paper, we study the proportional-fair scheduling problem in the presence of network coding in OFDMA relay networks. Considering the tradeoff between performance and overhead, we propose two models, global approach (GA) and local approach (LA), under which the corresponding problems are shown both NP-hard. For the GA model, we show that it cannot be approximated within some constant factor. Hence, we propose a heuristic algorithm with low time complexity. For the LA model, we propose a theoretical polynomial time approximation scheme (PTAS), and also present a practical greedy algorithm with approximation factor of 1\2). Simulation results show that our algorithms can achieve significant throughput improvement over a state-of-the-art noncoding scheme.
Original languageEnglish
Article number6302129
Pages (from-to)1727-1740
Number of pages14
JournalIEEE Transactions on Parallel and Distributed Systems
Volume24
Issue number9
DOIs
Publication statusPublished - 8 Aug 2013
Externally publishedYes

Keywords

  • approximation algorithm
  • Network coding
  • OFDMA relay networks
  • proportional-fair scheduling

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this