臺灣博碩士論文加值系統

無線網路的技術和同儕網路技術的快速興起，使得在這兩方面結合的運用不斷地有新議題出現。兩者的研究運用在近幾年裡開始慢慢發展，如何找到一套方法適用在兩者上將是重要議題。而在同儕網路中則以分散式的同儕網路，沒有用戶端和伺服器端的架構最適合套用在 mobile ad hoc network上。而移動式的同儕網路系統(mobile peer to peer)，節點的移動會有一些像是電力的消耗限制，和網路拓樸改變等這些問題。
而本論文提出了一個以階層式叢聚的方法(Clustering Method)， 希望在移動的同儕網路上，能做到有效的檔案搜尋和達到有效的階層式檔案管理工作。我們一開始先將實體網路直接對應到 overlay network上，使用了CAN (Content-Addressable Network)的架構和其檔案經過雜湊函數後，能達到負載平衡的特性，來調整網路的拓樸形狀。我們並且在每個區塊內選出一個領導者來管理此區塊內的檔案和其他節點，還周期性的使用了coverage method解決空區塊的問題，使得節點在移動的環境下也能有很好的檔案搜尋方式，使得搜尋效率能更快速。最後模擬結果顯示我們所提出的階層式叢聚的檔案管理方式，使用在無線網路上能達到有效的搜尋目的。

With the quick advancement of both the ad hoc network technology and peer to peer technology, there have been are applications slowly emerging which try to combine those two aspects in the same existing network. It is important to find a suitable method for it. A distributed peer-to-peer network architecture without network client and server seems best suited for execution on a mobile ad hoc network. However, mobile peers suffer from some problems such as limited power capacity and dynamic topology change caused by the mobility of nodes.
In this paper, we proposed a hierarchical clustering mechanism for mobile peers to do effective file sharing and management that provided a good performance in a mobile environment. We mapped the overlay network directly to the physical network, and use the Content-Addressable Network (CAN) architecture to do adaptive topology adjustment. Empty blocks were periodically detected and covered by nodes in a neighboring block to keep the system stabilized. Simulation results showed that the hierarchical clustering method could achieve a good performance in mobile peer-to-peer networks.

Chapter 1 Introduction..............................................................................1 1.1 Ad hoc Network........................................................................2
1.2 Peer-to-Peer Network ............................................................... 5
1.3 Ad Hoc Peer-to-Peer System..................................................10
Chapter 2 Related Work...........................................................................14
Chapter 3 Mobile Peer-to-Peer Cluster System.....................................18
3.1 Architecture Concept......................................................................18
3.2 Mobile Node’s Management Method.............................................20
3.2.1 Partitioning And Leader Selection........................................21
3.2.2 Node Mobility.......................................................................23
3.2.3 Coverage Method..................................................................24
3.2.4 Search Process......................................................................26
Chapter 4 Performance Evaluation.........................................................28
4.1 Simulation Environment.................................................................28
4.2 Simulation Results..........................................................................29
Chapter 5 Conclusion..................................................................................38
References...................................................................................................40

[1] C.E. Perkins and P. Bhagwat, “Highly dynamic destination sequenced distance vector routing (DSDV) for mobile computers”, Proceedings of ACM SIGCOMM''94, pp. 234-244, 1994.
[2] D.B. Johnson and D.A. Maltz, “Dynamic source routing in ad hoc wireless networking”, Mobile Computing, pp.153-181, 1996.
[3] C.E. Perkins, E.M. Belding-Royer and S.R. Das, “Ad hoc on-demand distance vector (AODV) routing”, IETF RFC 3561, Feb. 2003.
[4] I. Stoica, et.al., “Chord: A salable peer-to-peer lookup protocol for internet applications”, IEEE/ACM Transactions on Networking, vol.11, no.1, Feb 2003.
[5] A. Rowstron and P. Druschel, “Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems”, 18th IFIP/ACM International Conference on Distributed Systems Platforms, Nov.2001.
[6] B. Zhao, J. Kubiatowicz, and A. Joseph, “Tapestry: An infrastructure for fault-tolerant wide-area location and routing”, Technical Report UCB/CSD-01-1141, U.C.Berkeley, April 2001.
[7] S. Ratnasamy, P.　Francis, M.　Handley, and R.　Karp, “A scalable content-addressable network”, Proc. Of ACM SIGCOMM Conference, 2001.
[8] D. Doval and D. O’Mahony, “Overlay networks”, IEEE Internet Computing, pp. 79-82, July/August 2003.
[9] Y. Huang and B. Jin, “Topology mismatching aware p2p overlay construction in wireless ad hoc networks”,
Available at: http://huangyu.rocklv.net/huangyufiles/paper2005/dtaoc.pdf
[10] Y. Huang, B. Jin, and J. Cao, “A distributed approach to construction of topology mismatching aware p2p overlays in wireless ad hoc networks”, Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, pp.15-17, Feb. 2006.
[11] R. Winter, T. Zahn, and J. Schiller, “Random landmarking in mobile, topology-aware peer-to-peer networks”, Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, vol. 26-28, pp.319 – 324, May 2004.
[12] T. Zahn, R. Winter, and J. Schiller, “Simple, efficient peer-to-peer overlay clustering in Mobile, ad-hoc networks”, Proceedings. 12th IEEE International Conference on Networks, 2004. (ICON 2004), vol.2, pp.16-19, Nov.2004.
[13] S. Ren, L. Guo, S. Jiang, and X. Zhang, “Sat-match a self-adaptive topology matching method to achieve low lookup latency in structured p2p overlay networks”, Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International, pp.26-30, April 2004.
[14] T. Heer, S. Gotz, S. Rieche, and K. Wehrle, “Adapting distributed hash tables for mobile ad hoc networks”, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, 2006. pp.13-17, March 2006.
[15] X. Zhichen, T. Chunqiang, and Z. Zheng, “Building topology-aware overlays using global soft-state”, Proceedings. 23rd International Conference on Distributed Computing Systems, 2003, pp.19-22, May 2003.
[16] J. Li, J. Jannotti, D.S.J. De Couto, D.R. Karger, and R. Morris, “A scalable location service for geographic ad hoc routing”, Proceedings of the 6th International conference on Mobile computing and Networking, pp.120-130, 2000.
[17] T. Matthias , F. Holger, W. Jörg, M. Martin, and E.Wolfgang “A hierarchical approach to position-based multicast for mobile ad-hoc networks”, Wireless Networks, vol.13, pp. 447-460, 15 June 2006, Springer Netherlands.
[18] R. Lakshmish, B. Gedik, and L. Liu, “Connectivity based node clustering in decentralized peer-to-peer networks”, Proceedings. Third International Conference on Peer-to-Peer Computing, 2003, pp.66 – 73, Sept. 2003.
[19] C. Bettstetter “The cluster density of a distributed clustering algorithm in ad hoc networks ”, 2004 IEEE International Conference on Communications, vol.7, pp. 20-24, June 2004.
[20] X. Zhichen, T. Chunqiang, and Z. Zheng, “Building topology-aware overlays using global soft-state”, Proceedings. 23rd International Conference on Distributed Computing Systems, 2003, pp.19-22, May 2003.