由於在隨意型網路的拓樸是不斷的變化，因此選擇一條穩定路徑來提供可靠的資料傳遞是必要的。目前有一些以穩定度為基礎的路由協定被提出來，這些路由協定都是藉著尋找穩定的路徑來避免路徑中斷的次數增加。在本論文裡，我們提出了一個以訊號變異係數為基礎的方式來估算路徑連結的穩定程度。接著利用該觀念來發展一套可以有效的運用在隨意型網路的路由協定。某路徑連結穩定值是透過週期性收到beacon的訊號來計算。而一條穩定的路徑則是由這些連結所構成。另外，為了讓尋找路徑過程中，避免因為封包廣播的關係而造成封包氾濫，因此我們提出了兩個方法來改善這種情況。最後，透過模擬的結果，我們發現本路由協定能夠比以最短路徑為基礎的路由協定提供了多30%的連線時間。

CHAPTER 1. INTRODUCTION 1
CHAPTER 2. BACKGROUND AND RELATED WORK 3
2.1 ASSOCIATIVITY BASED ROUTING (ABR) PROTOCOL 4
2.2 SIGNAL STABILITY BASED ADAPTIVE ROUTING (SSA) PROTOCOL 5
2.3 ROUTE-LIFETIME ASSESSMENT BASED ROUTING (RABR) PROTOCOL 6
2.4 LINK LIFE BASED ROUTING (LBR) PROTOCOL 7
CHAPTER 3. LINK STABILITY ESTIMATION 9
CHAPTER 4. SIGNAL COEFFICIENT-OF-VARIANCE BASED ROUTING (CVR) PROTOCOL 14
4.1 ROUTE DISCOVERY 14
4.2 ROUTE MAINTENANCE 16
4.3 EXAMPLES 18
CHAPTER 5. IMPROVEMENT OF THE ALGORITHM 21
CHAPTER 6. SIMULATION RESULTS 24
CHAPTER 7. CONCLUSIONS AND FUTURE WORK 31
REFERENCES 33

[1] E. Royer and C.-K. Toh, “A review of current routing protocols for Ad-Hoc mobile wireless networks,” IEEE Personal Communications Magazine, April 1999, pp. 46-55.
[2] Shree Murthy, and J.J. Garcla-Luna-Aveces, “Distributed Bellman-Ford routing protocol (DBF),” Proc. ACM International Conference on Mobile Computing and Networking, Nov. 1995, pp. 86-95.
[3] C. E. Perkins and P. Bhagwat, “Higly Dynamic Destination-Sequenced Distance Vector (DSDV) for Mobile Computers,” Computer Communication Review, Oct. 1994, pp. 234-244.
[4] Alan O'nell Hongyi Li, “Hierarchical State Routing Protocol,” Internet Draft, draft-oneill-li-hsr-00.txt
[5] C. Perkins, E. Royer, and S. Das, “Ad-hoc On-demand Distance Vector (AODV) Lifetime Routing,” Proc. 2nd IEEE Workshop on Mobile Computing Systems and Applications, Feb. 1999, pp. 90-100.
[6] V. Park and S. Corson, “Temporally-Ordered Routing Algorithm (TORA),” Internet Draft, draft-ietf-manet-tora-spec- 03.txt, work in progress, June 2001.
[7] D. B. Johnson, D. Maltz, and Y-C. Hu, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR),” Internet Draft, draft-ietf-manet-dsr-09.txt, work in progress, Apr. 2003.
[8] C.-K. Toh. “Associativity Based Routing For Ad Hoc Mobile Networks,” Wireless Personal Communications, vol. 4, no. 2, Mar. 1997, pp.1-36.
[9] R. Dube, C. D. Rais, K. Wang, and S. K. Tripathi, “Signal stability based adaptive routing (SSA) for ad hoc mobile networks,“ IEEE Personal Communication, Feb. 1997.
[10] S. Agarwal, A. Ahuja, J.P. Singh, and R. Shorey, “Route-Lifetime Assessment Based Routing (RABR) Protocol for Mobile Ad-Hoc Networks,” Proc. IEEE International Conference on Communications (ICC), June 2000, pp. 1697-1701.
[11] B. S. Manoj, R. Ananthapadmanabha, and C. Siva Ram Murthy, “Link life Based Routing Protocol for Ad-hoc Wireless Networks,” Proc. 10th IEEE International Conference on Computer Communications 2001 (IC3N 2001), Oct. 2001.
[12] T. S. Pappaport, Wireless Communications Principles and Practice, Prentice Hall PTR, New Jersey, 1996.
[13] S. Murthy and J.J. Garcia-Luna-Aveces, “An Efficient Routing Protocol for Wireless Networks,” ACM Mobile Networks and Applications Journal, Oct. 1996, pp. 183-197.
[14] V. Park ann S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. INFOCOM ’97, Apr. 1997.