透過整合蜂巢式網路(cellular networks)與無線隨意網路(ad hoc networks)來克服蜂巢式網路中侷限性(頻寬資源有限)問題。在先前研究指出,對於一個群播組而言透過混合式網路(hybrid networks)來提高頻寬資源的利用,但沒有考慮當有多個群組存在時將會造成ad hoc mode鏈結頻寬資源不足的問題。 當ad hoc網路無法允許所有的群播組時,必須選擇對於基地台和ad hoc網路下能夠達到最佳頻寬資源利用的一些群組,並透過群組選擇機制來達到對於基地台頻寬資源的最大限度利用。在本論文中由於最佳化群組選擇方法(ILP)並不適合用於當群組是採取動態方式進出於網路系統時,且對於群組選擇上必須花費較高複雜度,所以將透過動態演算法(Dynamic algorithm)來克服最佳化所產生的問題。且在本論文主要是探討在混合式網路架構下透過不同群組選擇方式來達到更有效減輕基地台流量負荷目的。最後由模擬結果可知,動態演算法在各種不同環境下能夠逼近最佳化結果。
Integrate cellular networks and ad hoc networks to overcome the limitations (Limited bandwidth) of cellular networks. In previous research, used the hybrid networks to improve the performance of individual multicast group, but didn’t consider the capacity problem of the ad hoc channels when multiple groups are present. When an ad hoc network can’t accommodate all the groups, we must select the subset of groups to optimize its bandwidth savings and maximize the utilization of the ad hoc network. In this thesis, we use the dynamic algorithm for online system when groups dynamically join and leave. We investigate how to select the groups to reduce multicast traffic load on BSs. Simulation results indicate that the dynamic algorithm is able to achieve near-optimal solutions under various conditions.