臺灣博碩士論文加值系統

現今無線通訊技術的蓬勃發展，使得越來越多的可攜式行動設備擁有無線上網的能力，讓使用者能更便利的使用網際網路上廣大的資源。近年來點對點檔案分享服務(Peer to Peer File sharing)一直是一個很熱門的議題，這個議題目前大多數在有線網路上討論。但可以預期的是，當無線上網的使用者日趨增多，使用者要求的服務將會更多樣化，使得點對點資訊分享在可移動式無線網路上變成是一個重要的趨勢，也就是使用者透過同儕運算的方式在無線可移動的環境下分享或獲得所需的資訊。本篇提出兩個以蟲群智慧為基礎的點對點檔案分享架構，達到在有限的頻寬、有限的電源、節點可移動的無線網路環境(MANET)中，能夠快速且有效率的達到資訊分享服務。最後我們也經由模擬結果來驗證我們架構的各項效能。

The wireless communication technology is developed vigorously and rapidly so that more and more portable mobile devices possess internet access capabilities by wireless. Users now can utilize huge resources of the internet more conveniently. In the recent years, peer to peer file-sharing is a hot issue which is discussed and debated extensively in the wired network. We can expect that, with the growth of number of users who connect internet through wireless system, users’ requests will become more multiform and various. The peer to peer file-sharing in Mobile Ad hoc Network (MANET) will also become a worldwide trend. In the future, users utilize multi-hop wireless communication technology through other users to share or get resources and information in MANET. We propose two Swarm Intelligence based peer to peer file-sharing structures to have information be shared quickly and efficiently in MANET in which the bandwidth and power are limited and nodes can move at will. At the end, a simulation will be performed to prove the perspective.

第一章 序論 1
第1.1節 背景簡介 1
第1.2節 研究動機 4
第1.3節 論文架構 6
第二章 相關文獻探討 7
第2.1節 有線網路分享系統 7
第2.1.1節 中央集權式的點對點分享架構 7
第2.1.1.1節 Napster 7
第2.1.2節 非中央集權式且非結構性的點對點分享架構 9
第2.1.2.1節 Gnutella 9
第2.1.2.2節 Gnutella2 11
第2.1.3節 非中央集權式但結構性的點對點分享架構 12
第2.1.3.1節 Chord 12
第2.1.3.2節 Pastry 14
第2.1.3.3節 CAN 15
第2.2節 隨意移動式無線網路點對點分享系統 16
第2.2.1節 7DS (Seven Degrees of Separation) 17
第2.2.2節 PDI(Passive Distributed Indexing) 18
第2.2.3節 ORION 20
第2.2.4節 P2P BlueTree具隨意移動和位置知覺的點對點樹狀藍芽資訊分享聯網系統 22
第2.3節 現存資訊分享系統遭遇的主要問題 26
第2.3.1節 擴充性 26
第2.3.2節 Free Riding 26
第三章 在隨意無線網路上以蟲群智慧為基礎之點對點檔案分享系統 27
第3.1節 問題定義 27
第3.1.1節 目標環境 27
第3.1.2節 Bloom filter 28
第3.2節 蟲群智慧(swarm intelligence) 29
第3.3節 系統架構 32
第3.3.1節 香味散發階段 35
第3.3.2節 搜尋食物階段---Simple Layered Design(SLD) 36
第3.3.3節 搜尋食物階段---Hybrid Layered Design 37
第3.3.4節 食物搬回階段 37
第四章 模擬與分析 38
第4.1節 模擬環境與模擬參數 38
第4.2節 模擬結果與討論 39
第五章 結論與未來研究方向 44
參考文獻 45

[1]The Napster home page, 2000. http://www.napster.com/.
[2]The Gnutella home page, 2000. http://www.gnutella.wego.com.
[3]The Gnutella2 file-sharing protocol, 2002. http://www.gnutella2.com.
[4]I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” in Proceedings of ACM SIGCOMM, 2001.
[5]A. Rowstron and P. Druschel, “Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,“ in Proceedings of ACM International Conference on Distributed Systems Platforms, Heidelberg, pages 329-350, November 2001.
[6]S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, “A Scalable Content-Addressable Network,” in Proceedings of ACM SIGCOMM, 2001.
[7]M. Papadopouli, H. Schulzrinne, “Seven Degrees of Separation in Mobile Ad Hoc Networks,” in Proceedings of IEEE Global Telecommunications Conference, 2000.
[8]C. Lindemann, O. P. Waldhorst, “A Distribution Search Service for Peer-to-Peer File Sharing in Mobile Applications,” in Proceedings of the Second International Conference on Peer-to-Peer Computing, 2002.
[9]A. Klemm, C. Lindemann, and O. P. Waldhorst, “A Special-Purpose Peer-to-Peer File Sharing System for Mobile Ad Hoc Networks,” in Workshop on Mobile Ad Hoc Networking and Computing, 2003.
[10]Chia-Feng Li and Ren-Hung Hwang. “A Location-Aware P2P Information Sharing System in Bluetooth-Based Mobile Ad Hoc Network,” in Proceedings of Active Networking Workshop, 2004.
[11]Yu-Chee Tseng, Sze-Yao Ni, Yuh-Shyan Chen and Jang-Ping Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” in Proceedings of ACM MobiCom, August 1999.
[12]R. Porter and Y. Shoham, “Addressing the Free-Rider Problem in File-Sharing Systems: A Mechanism-Design Approach,” In Proceedings of 5th ACM Conference on Electronic Commerce, 2004.
[13]B. H. Bloom, “Space/Time Trade-offs in Hash coding with allowable errors,” Communications of the ACM, 1970.
[14]Marco Dorigo, Member, IEEE, Vittorio Maniezzo, and Alberto Colorni, “The Ant System:Optimization by a colony of cooperating agents,” IEEE Transactions on Systems, 1996.
[15]E. Bonabeau, M. Dorigo, and G. Theraulaz, “Swarm Intelligence: From natural to artificial systems,” Oxford University Press, 1999.
[16]C. Perkins, E. Royer, and S. Das, “Ad hoc On-Demand Distance Vector(AODV) Routing,” IETF Internet Draft(work in progress), June 2002.
[17]M. A. Landers, “An Overview of Peer-to-Peer Network Topologies,” 2004.
[18]QualNet network simulator, http://www.scalable-networks.com/.
[19]D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. panigrahy, “Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web,” in the proceedings of ACM symposium on Theory of Computing, 1997.
[20]D. lewin, “Consistent hashing and random trees: Algorithms for caching in distributed networks,” Master’s thesis, Department of EECS, MIT, 1998. Available at the MIT Library, http://thesis,mit.edu/.
[21]E. Adar and B.A Huberman, “Free riding on Gnutella,” Technical Report, SSL-00-63, Internet Ecologies Area Xerox Palo Alto Research Center, Palo Alto, 2002.
[22]M. Roth and S. Wicker, “Termite: Ad-Hoc Networking with Stigmergy.,” in Proceedings of Global Telecommunications Conference, Dec. 2003.
[23]S. Rajagopalan and C.C. Shen, “ANSI: A Unicast Routing Protocol for Mobile Ad hoc Networks Using Swarm Intelligence,” In Proceedings of the ICAI, 2005.
[24]T. Camp, J. Boleng, and V. Davies, “A survey of mobility models for ad hoc network research,” Wireless Communications and Mobile Computing (WCMC), 2002.
[25]Chien-Chung Shen，“NeTS-NR：A Salutogenic Approach to Robust Peer-to-Peer Systems over Mobile Ad hoc Networks,” 2004.