隨意無線網路（Ad Hoc Wireless Network），是由一群行動節點（Mobile hosts）所組成的無基地台式（Infrastructureless）無線網路架構。 由於其架構上的節點可以自由進出無線隨意網路，加上合作性的路徑搜尋演算法以及動態拓樸等因素，所以如何提供完整的安全機制是一項非常重要之研究議題。
本論文將提出一個兼具效率與安全的AODV通訊協定（ESAODV），經由對稱式加、解密演算法與非對稱式加、解密演算法，分別提供了對路由資訊及傳送資料的保護功能，並改良SAODV[1] 論文在效能上的問題。 此外，我們將分散式管理區域密碼（Session Key）的架構，改成中央管理式區域密碼架構，並提供區域密碼的更新功能，以降低區域密碼被破解的可能性。 最後經過系統模擬，顯示我們的方法可以較快的找到目的節點，提供較好的效能，並且包含完整的安全機制。

Ad hoc wireless network is an infrastructureless wireless network architecture, which consists of a group of mobile hosts. Due to the fact that each node can move into or out the network freely and the cooperative routing algorithm & dynamic topologies are quite complicated, how to provide a complete security is a very important research issue.
This thesis will propose an efficient and secure routing on the AODV protocol. Our approach can protect both the routing information and data, and improve the efficiency of SAODV paper. In addition, we will change the framework from the distributed management of session key to the centralized management and periodically update the session key to reduce the risk of cracking the session key. Finally, through the simulation, it shows that our methods can find the destination node much fast and provide the better efficiency. Most important of all, our methods could provide the complete security also.

摘要 i
英文摘要 ii
目錄 iii
圖目錄 iv
表目錄 v
1. 緒論 1
1.1 研究背景 1
1.2 研究動機與目的 1
1.3 預期目標 2
2. 相關研究 3
2.1 AODV（ Ad Hoc On-Demand Distance Vector Routing） 3
2.2 Secure Routing with the AODV Protocol 4
2.2-1 金鑰交換： 4
2.2-2 安全的路徑搜尋： 6
2.2-3 資料保護： 8
2.3 SSL（Secure Sockets Layer ） Protocol 9
3. 研究方法 11
3.1 認證： 11
3.2 安全層： 12
3.2-1 安全層運作方式： 12
3.2-2 Session Key更新： 13
3.2-3 Session Key更新會發生的問題： 15
3.2-4 Session Key更新問題解決方式： 17
3.3 資料保護： 19
3.3-1 資料保護步驟： 19
3.3-2 RREQ 跟 RREP的格式： 20
4. 模擬與分析 22
4.1 模擬環境： 22
4.2 結果與分析： 22
4.3 安全性分析： 25
5. 結論 27
6. 參考文獻 28

[1] Pirzada, A.A.; McDonald, C.” Secure Routing with the AODV Protocol”
Communications, 2005 Asia-Pacific Conference on 03-05 Oct. 2005 Page(s):57 – 61

[2] B. Dahill, B. N. Levine, E. Royer, and C. Shields, “A secure routing protocolfor ad hoc networks,” Proceedings of the International Conferenceon Network Protocols (ICNP), pp. 78–87, 2002.

[3] S. Corson and J. Macker, “Mobile ad-hoc networking (manet): Routing
protocol performance issues and evaluation considerations,” IETF
MANET, RFC 2501, 1999.

[4] C. Perkins, E. Belding-Royer, and S. Das, “Ad hoc on-demand distance
vector (aodv) routing,” IETF RFC 3591, 2003.

[5] W. Wang, Y. Lu, and B. Bhargava, “On vulnerability and protection
of ad hoc on-demand distance vector protocol,” Proceedings of the
International Conference on Telecommunication (ICT), pp. 375–382,
2003.

[6] E. Konstantinou, Y.C. Stamatiou, and C. Zaroliagis,“On the Use of Weber Polynomials in Elliptic CurveCryptography”, In Proc. European PKI Workshop 2004,LNCS 3093, Springer Verlag, June 2004, pp. 335-349.

[7] Patroklos G. Argyroudis , Raja Verma , Hitesh Tewari , Donal O’Mahony, “Performance Analysis of Cryptographic Protocols on Handheld Devices”, Networks and Telecommunications Research Group
Department of Computer Science University of Dublin, Trinity College , NCA 2004, pp. 169-174