TY - GEN
T1 - Opportunistic packet scheduling algorithm for load balancing in a multi-hop relay-enhanced Cellular OFDMA-TDD system
AU - Kim, Tae W.
AU - Min, Tae Young
AU - Kang, Chung G.
PY - 2008
Y1 - 2008
N2 - In this paper, we consider a multi-hop relayenhanced cellular OFDMA-TDD system with the full frequency-reuse capability, in which a TDD frame can be asymmetrically divided into two different intervals, one for access link to mobile stations and the other for relay link to base station (BS)-relay station (RS) communication, while the same radio resource is fully reused by every RS in the cell. Since a single common boundary between access and relay links is employed for the system, some access link associated with an individual RS can be either overloaded or under-loaded when traffic load is non-uniformly distributed, which causes an inefficient resource allocation. This paper proposes a load-balancing opportunistic (LoBO) scheduling algorithm that improves the overall system throughput in a weighted proportional fairness manner while balancing the traffic load over the access link to be shared by all RS's. The proposed algorithm dynamically determines the common access-torelay interval boundary as a part of packet scheduling, which has been shown to outperform the conventional system in which the boundary selection and packet scheduling are implemented as the separate processes. copyright
AB - In this paper, we consider a multi-hop relayenhanced cellular OFDMA-TDD system with the full frequency-reuse capability, in which a TDD frame can be asymmetrically divided into two different intervals, one for access link to mobile stations and the other for relay link to base station (BS)-relay station (RS) communication, while the same radio resource is fully reused by every RS in the cell. Since a single common boundary between access and relay links is employed for the system, some access link associated with an individual RS can be either overloaded or under-loaded when traffic load is non-uniformly distributed, which causes an inefficient resource allocation. This paper proposes a load-balancing opportunistic (LoBO) scheduling algorithm that improves the overall system throughput in a weighted proportional fairness manner while balancing the traffic load over the access link to be shared by all RS's. The proposed algorithm dynamically determines the common access-torelay interval boundary as a part of packet scheduling, which has been shown to outperform the conventional system in which the boundary selection and packet scheduling are implemented as the separate processes. copyright
UR - http://www.scopus.com/inward/record.url?scp=66149100839&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=66149100839&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:66149100839
SN - 4885522323
SN - 9784885522321
T3 - 2008 14th Asia-Pacific Conference on Communications, APCC 2008
BT - 2008 14th Asia-Pacific Conference on Communications, APCC 2008
T2 - 2008 14th Asia-Pacific Conference on Communications, APCC 2008
Y2 - 14 October 2008 through 16 October 2008
ER -