TY - GEN
T1 - Opportunistic subchannel scheduling for OFDMA networks with network coding at relay stations
AU - Kim, Byung Gook
AU - Lee, Jang Won
PY - 2010
Y1 - 2010
N2 - In this paper, we study an opportunistic subchannel scheduling problem for the relay-based OFDMA cellular network where relay stations (RSs) can perform opportunistic network coding with downlink and uplink sessions of a mobile station (MS). In wireless networks, network coding is one of promising techniques to improve network performance in various aspects. However, previous studies did not provide optimal opportunistic resource allocation solutions for the OFDMA networks with network coding-aware RSs as well as they did not consider practical duplexing schemes for the transmission of network coded data. In this paper, to allow network coding with downlink and uplink sessions at RSs, we consider a time-division duplexing (TDD) based time-slot structure. We formulate a stochastic optimization problem to maximize the average weighted-sum rate for both downlink and uplink sessions. Then, by solving the problem, we provide an optimal opportunistic subchannel scheduling algorithm that can opportunistically use network coding with considering time-varying channel states.
AB - In this paper, we study an opportunistic subchannel scheduling problem for the relay-based OFDMA cellular network where relay stations (RSs) can perform opportunistic network coding with downlink and uplink sessions of a mobile station (MS). In wireless networks, network coding is one of promising techniques to improve network performance in various aspects. However, previous studies did not provide optimal opportunistic resource allocation solutions for the OFDMA networks with network coding-aware RSs as well as they did not consider practical duplexing schemes for the transmission of network coded data. In this paper, to allow network coding with downlink and uplink sessions at RSs, we consider a time-division duplexing (TDD) based time-slot structure. We formulate a stochastic optimization problem to maximize the average weighted-sum rate for both downlink and uplink sessions. Then, by solving the problem, we provide an optimal opportunistic subchannel scheduling algorithm that can opportunistically use network coding with considering time-varying channel states.
UR - http://www.scopus.com/inward/record.url?scp=79551625933&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79551625933&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2010.5683679
DO - 10.1109/GLOCOM.2010.5683679
M3 - Conference contribution
AN - SCOPUS:79551625933
SN - 9781424456383
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
T2 - 53rd IEEE Global Communications Conference, GLOBECOM 2010
Y2 - 6 December 2010 through 10 December 2010
ER -