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

• Published in: IEEE communications letters Vol. 12; no. 3; pp. 176 - 178
• Main Authors: Xin Guo, Xin Guo, Wenchao Ma, Wenchao Ma, Zihua Guo, Zihua Guo, Xuemin Shen, Xuemin Shen, Zifeng Hou, Zifeng Hou
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.03.2008; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Adaptive scheduling; Algorithms; Applied sciences; Approximation; Approximation algorithms; Exact sciences and technology; Mathematical analysis; Multimedia; Multimedia systems; Network topology; Operation, maintenance, reliability; Relay networks; Relays; Reuse; Scheduling; Scheduling algorithm; Sorting; Spread spectrum communication; Systems, networks and services of telecommunications; Telecommunications; Telecommunications and information theory; Throughput; Wireless communication; Wireless networks; Relay; NP-hard; Wireless telecommunication; Scheduling; approximation algorithms; multicoloring; Multimedia communication; Algorithm; Multihop network; multimedia services; Simulation; NP hard problem; Relay networks; Service quality
• ISSN: 1089-7798; 1558-2558
• DOI: 10.1109/LCOMM.2008.071743

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.