在有線網路中P2P搜尋系統很常被整合至各種系統裡。而隨著科技的進步，無線網路的發展越來越普及，許多原本應用在有線網路上的系統，被移植至無線網路的環境中，但由於無線網路與有線網路上本質的差異，所以須針對無線網路的特性來加以修改。因此，本篇論文提出了KAdHoc這個應用在行動隨意網路上的點對點搜尋系統。點對點系統應用在行動隨意網路上所會產生的問題，如節點會電力耗盡、節點具有移動性，因此資訊容易過時，以及點對點虛擬網路上相鄰的節點在實際網路上可能是相隔非常遠的，故無線網路傳輸距離有限的狀況下，會形成問題。KAdHoc針對這些問題提出了改良的機制，並藉由模擬實驗證實KAdHoc除了有較快的查詢時間外，即使在高節點密度的狀況下亦能保持較高的成功率以及較低的總流量。而在移動速度較高的狀況下也有不錯的成功率。

P2P search system usually be integrated to many systems in wired network. As the result of technology development, wireless networks are more and more popular. Many system in wired networks are be implemented in wireless network environment, too. In virtue of diverseness between wired and wireless networks, there are some modify for characteristic of wireless network. In this paper, we demonstrate KAdHoc, a peer-to-peer search system for Mobile Ad Hoc Network (MANET).There are problems when P2P systems being used in MANET such as physical locality, power exhaustion and nodes information outdated when nodes move. KAdHoc consider these problems and design a mechanism for P2P search system in MANET. The simulation result show that KAdHoc has fewer lookup time and has high success rate and low total traffic even in High Node density. KAdHoc even has higher success rate in higher node velocity.

第一章 導論 1
1.1 前言 1
1.2 研究動機 2
1.3 論文架構 3
第二章 相關背景與研究 4
2.1 IEEE 802.11 基礎知識 4
2.1.1 IEEE 802.11 基本架構 4
2.1.1.1 基礎架構模式 4
2.1.1.2 隨意網路模式 5
2.1.2 行動隨意網路簡介 6
2.2 點對點系統簡介 7
2.2.1 集中式點對點網路 7
2.2.2 非結構化分散式點對點網路 8
2.2.3 結構化分散式點對點網路 9
2.3 AODV路由協定運作機制介紹 10
2.4 Random Landmarking運作機制介紹 11
2.5 Pastry 運作機制介紹 12
2.6 Kademlia系統運作機制介紹 13
2.6.1 路由表 13
2.6.2 Kademlia Protocol 17
2.6.3 節點查找 18
第三章 KAdHoc運作機制 21
3.1 KAdHoc系統簡介 23
3.2 群組 24
3.3 路由表 29
3.4 節點查找 34
3.5 路由機制 37
第四章 模擬結果 39
4.1 模擬環境 39
4.2 模擬結果 41
4.2.1 實驗1 41
4.2.2 實驗2 44
4.2.3 實驗3 47
4.2.4 實驗4 48
第五章 結論 49
參考文獻 50

[1] Petar Maymounkov and David Mazi`eres, “Kademlia: A Peer-to-peer Information System Based on the XOR Metric,” in the 1st International Workshop on Peer-to-Peer Systems (IPTPS'02), 2002.
[2] E. R. C.E. Perkins, 「Ad-hoc on-demand distance vector routing,」 Proc. of IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), pp.99-100, 1999.
[3] R. Winter, T. Zahn, and J. Schiller. "Random Landmarking in Mobile, Topology-Aware Peer-to-Peer Networks". In Proc. of FTDCS, May 2004.
[4] Napster, http://www.napster.com/.
[5] Adar,E .and Huberman, B., “Free riding on gnutella,” http://www.firstmonday.dk/issues/issue5_10/adar.
[6] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. "A Scalable Content-Addressable Network". In Proc. of ACM SIGCOMM, August 2001.
[7] Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM ’01 Conference, San Diego, California, August 2001.
[8] A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. Accepted for Middleware, 2001, 2001. http://research.microsoft.com/~antr/pastry/.