IEEE 802.16j多跳中繼網路系統(Multi-hop relay network systems)提供了新型態的無線行動通訊網路架構,藉由增加中繼站(Relay Station; RS)的方式改善IEEE 802.16e的覆蓋範圍及資料傳輸速率,然而中繼站的增加造成行動台(Mobile Station; MS)頻繁的換手及掃描時間增加。在移動無線環境下如何讓行動台的移動換手掃描程序簡化是本篇論文研究的目的。當基地台(Base Station; BS)和中繼站數量增加時,行動台需要更多的時間來掃描基地台和中繼站,為加快移動換手程序並減少傳輸時的中斷情形,開發設計有效率的移動換手及掃描程序機制的相關演算策略,有其絕對的必要性。在本篇論文中提出區塊及相對夾角計算演算法,目的在於預測行動台潛在移動的路徑,考慮行動台的移動行為,選擇最有可能在行動台潛在移動路徑上的中繼站,藉以減少行動台多餘的換手次數及掃描時間。模擬結果顯示,本論文提出的方法能夠有效的改善行動台的換手次數以及掃描時間。
IEEE 802.16j Multi-hop relay network systems provide a new infrastructure of wireless mobile communication network. It improves the coverage area and data transmission rate by building relay stations (RSs) for IEEE 802.16e environment. However, increasing relay stations result in mobile station (MS) frequent handover and more overhead of the scanning procedure. The main objective of this paper is to reduce the handover scanning procedure for MSs in mobile wireless environment. When the base station (BS) and RS increase, the MS needs more time to scan the BSs and the RSs. In order to accelerate handover procedure and reduce the transmission interrupt, efficient handover scanning procedure scheme and corresponding algorithms must be developed and designed. In this paper, a section algorithm and relative angle computing algorithm are proposed to forecast the MS potential moving path. In order to reduce unnecessary handover scanning time, the MS motion behavior is considered to choice the RS which has most possible in the MS potential moving path. The simulation results show that the proposed algorithms can reduce unnecessary handover and scanning time efficiently.