Adaptive Resource Reuse Scheduling for Multihop Relay Wireless Network Based on Multicoloring

Author

Xin Guo ; Wenchao Ma ; Zihua Guo ; Xuemin Shen ; Zifeng Hou

Author_Institution

Univ. of Sci. & Technol. of China, Hefei

Volume

12

Issue

3

fYear

2008

fDate

3/1/2008 12:00:00 AM

Firstpage

176

Lastpage

178

Abstract

In this paper, an adaptive resource reuse scheduling (ARRS) algorithm is presented with the goal of enhancing the system capacity for relay networks, which supports arbitrary topology and relay stations (RSs) mobility. Since one key step in ARRS is modeled as graph multicoloring, a fast [%p-]- approximation algorithm named dual sorting greedy (DSG) is provided for the problem. Simulation results show that ARRS achieves high system capacity and hence satisfies the multimedia service QoS requirements of relay networks efficiently.

Keywords

mobile radio; quality of service; telecommunication network topology; adaptive resource reuse scheduling algorithm; arbitrary topology; dual sorting greedy; fast approximation algorithm; graph multicoloring; multihop relay wireless network; multimedia service QoS requirements; quality of service; relay stations mobility; Adaptive scheduling; Approximation algorithms; Multimedia systems; Network topology; Relays; Scheduling algorithm; Sorting; Spread spectrum communication; Throughput; Wireless networks;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2008.071743

Filename

4471953