路徑修剪這種優化機制的想法已經在無線隨意網路及地理路由中被提出多年。然而，沒有論文提出實作路徑修剪的細節。在現實中，TCP傳輸在某些情況下可能會產生重傳封包。而如果路徑修剪是在TCP的環境下實作，可能會因為重傳封包產生錯誤的路徑，導致路徑迴圈或更長的路徑。在這篇論文當中，我們提出了一種路徑修剪演算法去解決這個問題，並在無線隨意網路中進行實作及在NS-2中進行模擬以驗證方法。將路徑修剪應用於AODV路由協定中及在兩種不同的網路拓樸中模擬的結果驗證了我們提出的演算法能夠在重傳封包的情況下正確的進行路徑修剪。;The idea of path pruning has been proposed as a post-optimization mechanism for routing in mobile ad hoc networks and geographic routing for several years. However, no paper has provided the implementation details of path pruning. In reality, the source of a TCP connection may retransmit packets in certain situations. The path pruning algorithm, when used under TCP, may result in incorrect paths (e.g., longer routes or even loops) due to retransmitted packets. In this paper, we propose a path pruning algorithm to resolve this issue. The proposed path pruning algorithm has been verified in both a wireless ad hoc network prototype and NS-2. The results of path pruning on top of the AODV routing protocol obtained from the prototype as well as the simulations of two different mobile network scenarios have validated that the proposed algorithm results in correct path pruning under various packet retransmission situations.
