隨意無線網路中具及時性的多重路由協定

Abstract

在隨意無線網路的單條路由協定中, 最佳路徑乃採用能抵達終點的最短路徑.然而,這策略並不能讓網路各行動節點的流量達到平衡,且易可能形成壅塞區域.這些壅塞區域會令路由協定的效能大幅衰落. 早先的研究已證明可利用多重路徑的繞由協定來改善資料傳輸的穩定性以及負載平衡.不過, 由於它們乃利用同一個路由請求封包去獲得多重路徑, 而備用路徑相較而言缺乏及時性. 此外, 在估計傳輸路徑的流量所使用的測量方法較不精準, 且不能及時反映出網路現況. 於這篇論文, 我們提出一個新的多重路由機制, 以精確的估計方法計算路徑的傳輸量, 並於適當的時機取得備用路徑. 最後經由實驗模擬可展現出此機制顯著的穩固性, 反應性和有效性.

Routing protocols for wireless ad-hoc networks consider the path with the minimum number of hops as the optimal path to any given destination. However, this strategy does not balance the traffic load among the mobile network nodes, and may create congested areas. These congested areas greatly degrade the performance of the routing protocols. Prior research in routing for wireless ad hoc networks has shown that multipath routing can enhance data delivery reliability and provide load balancing. Nevertheless, they obtain the backup route at the earlier moment based on the rough route load metric. In this paper, we propose a novel routing scheme that balance the load over the network by selecting a path based on traffic load at the opportune moment. We present a simulation study to demonstrate the significant improvements on robustness, responsiveness, and effectiveness of the proposed scheme.