TY - GEN
T1 - Time slot-adding algorithm for improving bottleneck link throughput in IEEE 802.16j relay networks
AU - Kitayama, Tomoya
AU - Hasegawa, Go
AU - Taniguchi, Yoshiaki
AU - Nakano, Hirotaka
PY - 2013
Y1 - 2013
N2 - IEEE 802.16j-based wireless relay networks adopt time division multiple access, where time slots are assigned to communication links as transmission opportunities. When we employ adaptive modulation and coding for data transmission on wireless links, the transmission bitrate is affected by the signal to interference and noise ratio. Therefore, algorithms that assign time slots to links are important for enhancing the performance of relay networks. When we employ relay networks to access backhaul networks, the bottleneck link is likely to be located near the gateway node, and dominates the performance of the relay network. In this paper, we propose a time slot-adding algorithm to improve bottleneck link throughput in IEEE 802.16j relay networks. Although we employ an existing method for the initial assignment of time slots to links in the network, we introduce novel algorithm to add more time slots to the bottleneck link. Performance evaluations confirm that the proposed method improves data transfer throuzhput by up to around 30%.
AB - IEEE 802.16j-based wireless relay networks adopt time division multiple access, where time slots are assigned to communication links as transmission opportunities. When we employ adaptive modulation and coding for data transmission on wireless links, the transmission bitrate is affected by the signal to interference and noise ratio. Therefore, algorithms that assign time slots to links are important for enhancing the performance of relay networks. When we employ relay networks to access backhaul networks, the bottleneck link is likely to be located near the gateway node, and dominates the performance of the relay network. In this paper, we propose a time slot-adding algorithm to improve bottleneck link throughput in IEEE 802.16j relay networks. Although we employ an existing method for the initial assignment of time slots to links in the network, we introduce novel algorithm to add more time slots to the bottleneck link. Performance evaluations confirm that the proposed method improves data transfer throuzhput by up to around 30%.
KW - IEEE 802.16j
KW - bottleneck
KW - time slot assignment
UR - http://www.scopus.com/inward/record.url?scp=84876761389&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84876761389&partnerID=8YFLogxK
U2 - 10.1109/ICOIN.2013.6496695
DO - 10.1109/ICOIN.2013.6496695
M3 - Conference contribution
AN - SCOPUS:84876761389
SN - 9781467357401
T3 - International Conference on Information Networking
SP - 606
EP - 611
BT - International Conference on Information Networking 2013, ICOIN 2013
T2 - 27th International Conference on Information Networking, ICOIN 2013
Y2 - 27 January 2013 through 30 January 2013
ER -