Abstract
To improve the spectral efficiency and extend the coverage of next-generation cellular networks, several technologies are proposed, and one of such technologies is mobile relay stations (MRSs). In the system with MRSs, some of mobile stations (MSs) can act as relay stations (RSs) that forward other MSs data from/to the base station (BS). Compared with the fixed RSs, MRSs have several advantages such as low deployment costs and high flexibility. In this paper, we study an opportunistic subchannel scheduling in orthogonal frequency division multiple access (OFDMA) cellular networks with MRSs. We formulate a stochastic optimization problem to maximize the sum-rate of the system with MRSs while satisfying the minimum average data rate requirement for each MS, and then develop an optimal opportunistic subchannel scheduling algorithm by solving it. Through simulation results, we show the performances of our algorithm.
| Original language | English |
|---|---|
| Title of host publication | International Conference on ICT Convergence |
| Publisher | IEEE Computer Society |
| Pages | 401-406 |
| Number of pages | 6 |
| ISBN (Electronic) | 9781479967865 |
| DOIs | |
| Publication status | Published - 2014 Dec 11 |
| Event | 5th International Conference on Information and Communication Technology Convergence, ICTC 2014 - Busan, Korea, Republic of Duration: 2014 Oct 22 → 2014 Oct 24 |
Publication series
| Name | International Conference on ICT Convergence |
|---|---|
| ISSN (Print) | 2162-1233 |
| ISSN (Electronic) | 2162-1241 |
Other
| Other | 5th International Conference on Information and Communication Technology Convergence, ICTC 2014 |
|---|---|
| Country | Korea, Republic of |
| City | Busan |
| Period | 14/10/22 → 14/10/24 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Networks and Communications
Cite this
}
Opportunistic scheduling for OFDMA networks with mobile relay stations. / Song, Jee Hun; Roh, Hee Tae; Lee, Jang Won.
International Conference on ICT Convergence. IEEE Computer Society, 2014. p. 401-406 6983168 (International Conference on ICT Convergence).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Opportunistic scheduling for OFDMA networks with mobile relay stations
AU - Song, Jee Hun
AU - Roh, Hee Tae
AU - Lee, Jang Won
PY - 2014/12/11
Y1 - 2014/12/11
N2 - To improve the spectral efficiency and extend the coverage of next-generation cellular networks, several technologies are proposed, and one of such technologies is mobile relay stations (MRSs). In the system with MRSs, some of mobile stations (MSs) can act as relay stations (RSs) that forward other MSs data from/to the base station (BS). Compared with the fixed RSs, MRSs have several advantages such as low deployment costs and high flexibility. In this paper, we study an opportunistic subchannel scheduling in orthogonal frequency division multiple access (OFDMA) cellular networks with MRSs. We formulate a stochastic optimization problem to maximize the sum-rate of the system with MRSs while satisfying the minimum average data rate requirement for each MS, and then develop an optimal opportunistic subchannel scheduling algorithm by solving it. Through simulation results, we show the performances of our algorithm.
AB - To improve the spectral efficiency and extend the coverage of next-generation cellular networks, several technologies are proposed, and one of such technologies is mobile relay stations (MRSs). In the system with MRSs, some of mobile stations (MSs) can act as relay stations (RSs) that forward other MSs data from/to the base station (BS). Compared with the fixed RSs, MRSs have several advantages such as low deployment costs and high flexibility. In this paper, we study an opportunistic subchannel scheduling in orthogonal frequency division multiple access (OFDMA) cellular networks with MRSs. We formulate a stochastic optimization problem to maximize the sum-rate of the system with MRSs while satisfying the minimum average data rate requirement for each MS, and then develop an optimal opportunistic subchannel scheduling algorithm by solving it. Through simulation results, we show the performances of our algorithm.
UR - http://www.scopus.com/inward/record.url?scp=84920186714&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84920186714&partnerID=8YFLogxK
U2 - 10.1109/ICTC.2014.6983168
DO - 10.1109/ICTC.2014.6983168
M3 - Conference contribution
AN - SCOPUS:84920186714
T3 - International Conference on ICT Convergence
SP - 401
EP - 406
BT - International Conference on ICT Convergence
PB - IEEE Computer Society
ER -