TY - GEN
T1 - A multi-hop user admission algorithm for fixed relay stations with limited capabilities in OFDMA cellular networks
AU - Lee, Jemin
AU - Wang, Hano
AU - Lim, Sungmook
AU - Hong, Daesik
PY - 2007
Y1 - 2007
N2 - In this paper, a resource management for fixed relay stations (FRS) with the limited capability is considered in downlink OFDMA multi-hop cellular networks. All of MSs which want to use a FRS in multi-hop transmission can not be supported when the capability of the FRS is insufficient. Hence, the multi-hop user admission (MUA) is required to determine the admitted MSs to use the FRS because the gain obtained from multi-hop transmission is different to each MS. The problem of MUA is formulated to maximize the total multi-hop gain which the FRS can achieve from the admitted MSs, and this problem is proven to be NP-hard. Hence, two efficient heuristic algorithms for MUA are proposed. One is the balanced link-MUA (BL-MUA) algorithm which gives priorities of admission with attaching importance to the load balance between the BS-FRS link and the FRS-MS link. The other is the focused link-MUA (FL-MUA) algorithm which considers only the load state of the FRS-MS link in admission. Through the numerical results, it is verified that the FL-MUA algorithm obtains similar performance to the BL-MUA algorithm with less complex-ity. In addition, the total number of saved subcarriers in a FRS increases and more MSs can be supported in a cell with low blocking probability by the proposed algorithms.
AB - In this paper, a resource management for fixed relay stations (FRS) with the limited capability is considered in downlink OFDMA multi-hop cellular networks. All of MSs which want to use a FRS in multi-hop transmission can not be supported when the capability of the FRS is insufficient. Hence, the multi-hop user admission (MUA) is required to determine the admitted MSs to use the FRS because the gain obtained from multi-hop transmission is different to each MS. The problem of MUA is formulated to maximize the total multi-hop gain which the FRS can achieve from the admitted MSs, and this problem is proven to be NP-hard. Hence, two efficient heuristic algorithms for MUA are proposed. One is the balanced link-MUA (BL-MUA) algorithm which gives priorities of admission with attaching importance to the load balance between the BS-FRS link and the FRS-MS link. The other is the focused link-MUA (FL-MUA) algorithm which considers only the load state of the FRS-MS link in admission. Through the numerical results, it is verified that the FL-MUA algorithm obtains similar performance to the BL-MUA algorithm with less complex-ity. In addition, the total number of saved subcarriers in a FRS increases and more MSs can be supported in a cell with low blocking probability by the proposed algorithms.
UR - http://www.scopus.com/inward/record.url?scp=44349135573&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=44349135573&partnerID=8YFLogxK
U2 - 10.1109/PIMRC.2007.4394542
DO - 10.1109/PIMRC.2007.4394542
M3 - Conference contribution
AN - SCOPUS:44349135573
SN - 1424411440
SN - 9781424411443
T3 - IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
BT - 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'07
T2 - 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'07
Y2 - 3 September 2007 through 7 September 2007
ER -