透過您的圖書館登入
IP:3.144.189.177
  • 期刊

隨意網路之單一頻道環境下之多重路徑繞送機制的效能分析與模擬

Performance Analyses on Multi-Path Routing Mechanisms for Single Channel-Based Mobile Ad Hoc Networks

摘要


近年來,隨意網路(Mobile Ad Hoc Networks,MANETs)的路徑繞送問題已經吸引很多的研究,很多著名的路徑繞送通訊協定已經被提出,例如DSR,AODV,DSDV等等。基本上它們都是屬於單一路徑繞送通訊協定。然而,由於隨意網路是一個網路拓樸會隨著主機的移動而不斷變化的網路,所以路徑常會因節點的移動而出現中斷的情況,這將造成封包傳送的中斷與等待新路徑搜尋完成的延遲時間。為了解決這些問題,目前已有多個路徑繞送通訊協定,例如MSR,SMR,MDSR等等,採用多重路徑繞送機制來減少路徑必須重新搜尋的機率或縮短因路徑中斷所造成的延遲時間。在本篇論文中,我們將採用數學模式來推導和分析隨意網路之單一頻道環境下之多重路徑繞送機制的效能。我們分析的項目包括:(1)單一路徑繞送機制之吞吐量,(2)多重路徑繞送機制之吞吐量,(3)多重路徑繞送機制之佇列記憶體需求,(4)多重路徑繞送機制之最佳路徑數目。我們數學分析的結果為:(1)多重路徑繞送機制的吞吐量比單一路徑繞送機制最多可高出大約33%,(2)若同時考量吞吐量和佇列記憶體需求時,當路徑數目為2時,多重路徑繞送機制可以達到最高的效能。因為這些效能之數學分析是相當複雜的,所以我們亦採用電腦模擬來做進一步的驗証。電腦模擬的結果証實我們的數學分析是相當準確的。

並列摘要


Recently, the routing problem in mobile ad hoc networks (MANETs) has attracted a lot of researches. Many well-known routing protocols, such as AODV, DSDV, and DSR, have been proposed. Basically, all of these protocols are based on single-path routing mechanisms. Since the MANET has an ever-changing network topology caused by mobile hosts, disruptions of routes may arise. Disruptions will result in transmission disruptions and delays of data packets. To solve these problems, several alternative routing protocols have been designed, including MSR, SMR, and MDSR. They adopt multi-path routing mechanisms to reduce the probability of re-searching new routes or the delay time caused by disruptions of routes. In this paper, we will analyze the performance of multi-path routing mechanisms for single channel-based MANETs by means of mathematic techniques. The performance items considered are as follows. (1) The throughput of single-path routing mechanism. (2) The throughput of multi-path routing mechanism. (3) The queueing buffer size of multi-path routing mechanism. (4) The optimal number of paths to get the best performance under the multi-path routing mechanism. The main results of our analyses are: (1) The throughput of multi-path routing mechanism is higher by about 33% in the best case than the throughput of single-path routing mechanism. (2) When the number of paths is equal to 2, the multi-path routing mechanism can achieve its best performance, i.e., it has the highest throughput and the smallest queueing buffer size. Computer simulations are conducted to verify our performance analyses. Simulation results show that our performance analyses are correct.

延伸閱讀