Opportunistic Mobile Relaying Scheme in Two-hop Cellular Networks
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Since the capacity and fairness usually have a trade-off relationship, increasing the capacity may deteriorate the fairness, and vice versa. This paper investigates the possibility to improve the capacity and fairness at the same time in two-hop cellular networks. First, we show that an achievable average throughput region can be enlarged by using cooperative relaying. In order to achieve a certain point in this enlarged throughput region, an appropriate scheduling algorithm is necessary. Thus, secondly we propose a generalized scheduling algorithm for cooperative relaying. At the expense of cooperation among users, the proposed scheduling algorithm can improve both capacity and fairness. Furthermore, we propose a limited feedback mechanism to reduce the total amount of feedback. Extensive simulations demonstrate that opportunistic mobile relaying can surpass the trade-off relationship and can alleviate the unfairness problem among users in the heterogeneous channel condition as well.
Abstract
Since the capacity and fairness usually have a trade-off relationship, increasing the capacity may deteriorate the fairness, and vice versa. This paper investigates the possibility to improve the capacity and fairness at the same time in two-hop cellular networks. First, we show that an achievable average throughput region can be enlarged by using cooperative relaying. In order to achieve a certain point in this enlarged throughput region, an appropriate scheduling algorithm is necessary. Thus, secondly we propose a generalized scheduling algorithm for cooperative relaying. At the expense of cooperation among users, the proposed scheduling algorithm can improve both capacity and fairness. Furthermore, we propose a limited feedback mechanism to reduce the total amount of feedback. Extensive simulations demonstrate that opportunistic mobile relaying can surpass the trade-off relationship and can alleviate the unfairness problem among users in the heterogeneous channel condition as well.
참고문헌 (11)
- R. Knopp, "Information capacity and power control in single-cell multiuser communications", in Proc. IEEE ICC 1995, pp.18~22 (1995)
- X. Liu, "A framework for opportunistic scheduling in wireless networks", Computer Networks, 41(4), pp.451~474 (2003)
- A. Jalali, "Data throughput of cdma-hdr a high efficiency-high data rate personal communication wireless system", in Proc. IEEE VTC Spring 2000 (2000)
- S. Borst, "Dynamic rate control algorithms for hdr throughput optimization", in Proc. IEEE Infocom 2001, pp.976~985 (2001)
- R. Pabst, "Relay-based deployment concepts for wireless and mobile broadband radio", IEEE Communications Magazine, 42(9), pp.80~89 (2004)
- J. Cho, "'On the Throughput Enhancement of the Downstream Channel in Cellular Radio Networks Through Multihop Relaying", IEEE J. Select. Areas Commun, 22(7), pp.1206~1209 (2004)
- J. N. Laneman, "Cooperative diversity in wireless networks: efficient protocols and outage behavior", IEEE Trans. Inform. Theory, 50(12), pp.3062~3080 (2004)
- Y. Liang, "Gaussian orthogonal relay channel: optimal resource allocation and capacity", IEEE Trans. Inform. Theory, 51(9), pp.3284~3289 (2005)
- H. J. Kushner, "Convergence of proportional-fair sharing algorithms under general conditions", IEEE Trans. Wireless Commun, 3(4), pp.1250~1259 (2004)
- J. Mo, "Fair end-to-end window-based congestion control", IEEE, 2000, pp.8(5), 556~567
- J. Y. L. Boudec, "Rate performance objectives of multihop wireless networks", in Proc. IEEE Infocom 2004, pp.1916~1927 (2004)