TY - GEN
T1 - Optimized path selection mechanism for IEEE 802.16j Multi-Hop Relay networks
AU - Chang, Jian Ming
AU - Lai, Chin Feng
AU - Chao, Han Chieh
AU - Chen, Jiann Liang
PY - 2012
Y1 - 2012
N2 - When the mobile station (MS) is far away from the base station (BS) or terrain and buildings interfere with transmission, the data rate decreases with the increased distance from the BS, and the coverage range of the BS will be shortened to only a few kilometers. The IEEE Working Group has proposed the 802.16j relay technology. This technology can be used to forward data for a BS while overcoming the signal strength attenuation. Since the cost of constructing the relay station is low, the MS will have to scan more than one signal when entering the Mobile Multi-Hop Relay (MMR) network. In this paper, we introduce a novel path selection mechanism that exploits the remaining slot and signal strength indicator (SSI). Since the signal strength will affect the Modulation and Coding Scheme (MCS) combination, we propose to use SSI integrated with the MCS, taking the hop count into account. We demonstrate that our proposed scheme is capable of producing an optimal path selection.
AB - When the mobile station (MS) is far away from the base station (BS) or terrain and buildings interfere with transmission, the data rate decreases with the increased distance from the BS, and the coverage range of the BS will be shortened to only a few kilometers. The IEEE Working Group has proposed the 802.16j relay technology. This technology can be used to forward data for a BS while overcoming the signal strength attenuation. Since the cost of constructing the relay station is low, the MS will have to scan more than one signal when entering the Mobile Multi-Hop Relay (MMR) network. In this paper, we introduce a novel path selection mechanism that exploits the remaining slot and signal strength indicator (SSI). Since the signal strength will affect the Modulation and Coding Scheme (MCS) combination, we propose to use SSI integrated with the MCS, taking the hop count into account. We demonstrate that our proposed scheme is capable of producing an optimal path selection.
UR - http://www.scopus.com/inward/record.url?scp=84871963059&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84871963059&partnerID=8YFLogxK
U2 - 10.1109/ICC.2012.6364288
DO - 10.1109/ICC.2012.6364288
M3 - Conference contribution
AN - SCOPUS:84871963059
SN - 9781457720529
T3 - IEEE International Conference on Communications
SP - 1938
EP - 1942
BT - 2012 IEEE International Conference on Communications, ICC 2012
T2 - 2012 IEEE International Conference on Communications, ICC 2012
Y2 - 10 June 2012 through 15 June 2012
ER -