A Multi-Path Routing supported Scheduling Algorithm for Multi-Channel Single-Transceiver Wireless Mesh Network

碩士論文[[abstract]]在無線網狀網路中，資料傳輸的排程是一個相當重要的研究議題。在以往相關研究中，大部份的排程演算法都是在樹狀路由拓樸結構上進行排程，並且使用Single-Channel來進行資料傳輸。但是其缺點為固定的樹狀結構將會大大的限制通訊路由的選擇，並在某些節點產生通訊壅塞的情形。另一方面，使用Single-Channel 進行傳輸將會減少同時傳輸的連結數，無法在相同時間內達到最大的效益。為了提高網路資源的使用效率，本文提出一個可支援Multi-Channel Single-Transceiver 的多重路由路徑排程演算法。透過SS以彈性的方式選擇其他鄰近的SS 來進行資料代傳，可增加Next-Hop 更多的選擇性。另一方面，為了提高可同時傳輸的連結數，本文採用Multi-Channel Single-Transceiver 的方式來進行資料傳輸以較低的硬體成本來減少Secondary Interference 問題的發生。並且進一步透過在BS 上配置Multi-transceiver 來解決BS 鄰近端通訊瓶頸的問題。根據實驗和分析結果，我們所提出的排程演算法比以往的排程演算法能夠擁有較多同時進行傳輸的連結數，並且有效降低封包延遲以及縮短排程時間。[[abstract]]The scheduling of data transmission is a very important research issue in a wireless mesh network. However, IEEE 802.16 standard does not provide any scheduling mechanism for a wireless mesh network. In this paper, a multi-path routing supported scheduling algorithm for multi-channel single-transceiver IEEE 802.16 mesh networks is proposed. Instead of using a fixed routing tree, the proposed scheduling algorithm gives subscriber station (SS) freedom to choose a neighboring SS in an elastic way such that parallel link transmission can be maximized. In order to raise the number of, the Multi-Channel Single-Transceiver model is adopted to maximize the data through and resolve the problems caused by secondary interference. To mitigate the traffic bottleneck near BS, it is assumed that BS equips with multi-transceiver to avoid problems with the low neighboring BS transmissions. According to the experiment results, the proposed scheduling algorithm has higher amount of parallel transmission links, lower packet delay, and is more efficient than fixed routing tree scheduling algorithm