Access Restriction

Author Liping Wang ♦ Yusheng Ji ♦ Fuqiang Liu
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2008
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science ♦ Technology ♦ Engineering & allied operations
Subject Keyword fairness ♦ relay-enhanced ♦ Throughput ♦ Scheduling ♦ Indexes ♦ Scheduling algorithm ♦ Delay ♦ resource allocation ♦ scheduling ♦ Filling ♦ OFDMA ♦ throughput ♦ Resource management
Abstract OFDMA-based relay-enhanced cellular systems have been proposed as a promising solution for the next-generation wireless communications. The deployment of relay stations (RS) in cellular networks makes resource scheduling a more crucial and challenging task. In this paper, a novel centralized scheduling scheme called centralized scheduling with void filling (CS-VF) is proposed for two-hop relay-enhanced networks. In CS-VF, the remaining slots in the RS-subframe are filled with packets destined to users who directly communicate with the base station (BS). Moreover, based on our CS-VF scheduling scheme, four representative single-hop scheduling algorithms: round-robin, max C/I, max-min fairness, and proportional fairness, are extended to multihop scenarios. Simulation results indicate that when compared with the existing centralized scheduling scheme, which does not consider void filling, our proposed CS-VF scheme is more adaptable to different traffic distributions caused by dynamic network topology and user mobility. And it enhances not only the system throughput but also the fairness among users.
Description Author affiliation: Dept. of Inf., Grad. Univ. for Adv. Studies, Tokyo (Liping Wang) || Nat. Inst. of Inf., Tokyo (Yusheng Ji) || Dept. of Inf. & Commun. Eng., Tongji Univ., Shanghai (Fuqiang Liu)
ISBN 9780769533933
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2008-10-12
Publisher Place France
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 428.75 kB
Page Count 6
Starting Page 113
Ending Page 118

Source: IEEE Xplore Digital Library