跳到主要內容

臺灣博碩士論文加值系統

(44.200.77.92) 您好!臺灣時間:2024/02/24 15:22
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:賀振昌
研究生(外文):Cheng-Chang Hoh
論文名稱:隨意式無線網路中利用群體智慧為基礎及具跨層設計之點對點檔案分享系統
論文名稱(外文):P2P File Sharing System over MANET based on Swarm Intelligence: A Cross-layer Design
指導教授:黃仁竑黃仁竑引用關係
指導教授(外文):Ren-Hung Hwang
學位類別:碩士
校院名稱:國立中正大學
系所名稱:資訊工程所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
畢業學年度:94
語文別:英文
論文頁數:46
中文關鍵詞:隨意式無線網路檔案分享系統點對點網路
外文關鍵詞:swarm intelligenceMANETP2Pfile sharing
相關次數:
  • 被引用被引用:0
  • 點閱點閱:151
  • 評分評分:
  • 下載下載:15
  • 收藏至我的研究室書目清單書目收藏:1
在隨意無線網路下, 由於可攜式裝置會移動特性使得設計有效率點對點檔案分享系統存在釵h新的挑戰.通常在移動式環境下透過氾濫法來找尋檔案資訊是最有效率且快速的方法, 但是此方法造成頻寬使用上極沒效率且會造成擴充性的問題. 在本篇論文中, 為了解決上述的問題而提出了名為P2PSI的點對點檔案分享系統. 此系統主要利用群體智慧為基礎來模仿真實世界中螞蟻尋找食物的特性來有效找尋檔案資訊. 此外此論文還提出跨層設計架構來減少多餘的訊息傳遞和檔案取回時間進而增強P2PSI的效能. 根據模擬結果顯示跨層式設計架構的P2PSI表現優於傳統階層是設計架構. 此外我們也將跨層式設計架構的P2PSI和跨層式設計架構的服務探索協定, CLdsdv與CLdsr來做進一步比較.結果顯示跨層式設計架構的P2PSI在隨意無線網路中有優異的表現.
The dynamic nature of MANET causes many new challenges in designing robust and scalable P2P system. Although flooding-based techniques are shown to be robust in highly dynamic network, it leads to poor efficiency in terms of bandwidth usage and scalability problem. In this thesis, we propose an adaptive learning and scalable P2P file sharing system based on Swarm Intelligence for MANET, termed P2PSI, which applies the behavior of the real ant colonies to cope with mobility without flooding. Moreover, we also propose cross-layer architecture to optimize P2PSI, reducing the redundant message overhead and query latency. We have experimentally showed superiority of our cross-layer design P2PSI over traditional layered design P2PSI. Additionally, we also compare cross-layer design P2PSI with cross-layer design service discovery protocols, CLdsr and CLdsdv. The simulation results show that our cross-layer design P2PSI can achieve good performance in dynamic topology of MANET.
CHAPTER 1 INTRODUCTION
CHAPTER 2 RELATED WORKS
CHAPTER 3 P2PSI DESCRIPTION
3.1 ASSUMPTIONS
3.2 OVERVIEW OF P2PSI
3.3 THE CONTROL MESSAGE FORMAT
3.4 LOCAL DATA STRUCTURES
 3.4.1  PHEROMONE TABLE
 3.4.2  CACHE TABLE
3.5 ADVERTISEMENT PROCESS
3.6 DISCOVERY RROCESS
3.7 PHEROMONE TABLE MANAGEMENT
CHAPTER 4 CROSS-LAYER DESIGN
4.1 LAYERED DESIGN P2PSI APPROACH
4.2 CROSS-LAYER DESIGN P2PSI APPROACH
CHAPTER 5 PERFORMANCE EVALUATION
5.1 SIMULATION ENVIRONMENT
5.2 SIMULATION METHOD
5.3 PRELIMINARY EXPERIMENT
5.4 COMPARISON OF CORSS-LAYER AND LAYERED DESIGN P2PSI
5.5 COMPARISON CORSS-LAYER DESIGN P2PSI WITH CLDSR AND CLDSDV
CHAPTER 6 CONCLUSIONS AND FUTURE WORKS
REFERENCES
[1]The Napster home page, http://www.napster.com.
[2]Gnutella protocol specification v0.4, http://www9.limewire.com/developer/gnutella_ protocol_0.4.pdf.
[3]S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” In Proceedings of ACM SIGCOMM, pp.161-172, Aug. 2001.
[4]I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” In Proceedings of ACM SIGCOMM, pp. 149-160. Aug. 2001.
[5]A. Rowstron and P. Druschel, “Pastry: Scalable, decentralized object location, and routing for large-scale Peer-to-Peer systems,” In Proceedings of ACM International Conference on Distributed Systems Platforms, pp. 329-350, Jan. 2001.
[6]A. Klemm, C. Lindemann, and O. Waldhorst, “A Special-Purpose Peer-to-Peer File Sharing System for Mobile Ad Hoc Networks,” In Proceedings of IEEE Semiannual Vehicular Technology Conference, pp. 2758-2763, Oct. 2003.
[7]S. Rajagopalan and C.C. Shen, “ANSI: A Unicast Routing Protocol for Mobile Ad hoc Networks Using Swarm Intelligence,” In Proceedings of ICAI, pp. 104-110, Jun. 2005.
[8]M. Gunes, U. Sorges, and I. Bouazizm, “ARA-the ant-colony based routing algorithm for MANETs,” In Proceedings of IEEE International Conference on Parallel Processing (ICPP) Workshop, vol. 1, 28-30, pp. 79-85, Aug. 2002.
[9]G. Ding and B. Bhargava, “Peer-to-peer File-sharing over Mobile Ad hoc Networks,” In Proceedings of 2nd IEEE Annual Conference on Pervasive Computing and Communications Workshops, pp.104-108, Mar. 2004.
[10]A.Varshavsky, B. Reid, and E. de Lara, “A cross-layer approach to service discovery and selection in MANETs,” In Proceedings of IEEE Mobile Ad hoc and Sensor Systems Conference, pp. 459-466, Nov. 2005.
[11]E. Bonabeau, M. Dorigo, and G. Theraulaz, “Swarm Intelligence: From natural to artificial systems,” Oxford University Press, 1999.
[12]J. Broch, D.B. Johnson, and D.A. Maltz, “The Dynamic Source Routing. Protocol for Mobile Ad Hoc Networks,” IETF Internet draft, draft-ietf-manet-dsr-09.txt, Apr. 2003.
[13]C.E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,” ln Proceedings of ACM SIGCOMM, vol. 24, no. 2, pp. 234-244, Oct. 1994.
[14]Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” ln Proceedings of 16th ACM International Conference on Supercomputing, pp. 84-95, Jun. 2002.
[15]M. Papadopouli and H. Schulzrinne, “Effects of Power Conservation, Wireless Coverage and Cooperation on Data Dissemination among Mobile Devices,” In Proceedings of ACM SIGMOBILE Symposium on Mobile Ad Hoc Networking & Computing, pp. 117-127, Oct. 2001.
[16]G. Lau, M. Jaseemuddin, and G. Ravindran, “RAON: A P2P Network for MANET,” In Proceedings of 2nd IEEE International Conference on Wireless and Optical Communications Networks, pp. 316-322, Mar. 2005.
[17]C.Y. Wang, C.Y. Li, R.H. Hwang, and Y.S. Chen, “Global Connectivity for Mobile IPv6-based Ad Hoc Networks,” In Proceedings of 19th IEEE International Conference on advanced information Networking and Applications, pp. 807-812, Mar. 2005.
[18]C.F. Li, R.H. Hwang, and C.Y. Wang, “A Location-Aware P2P Information Sharing System in Bluetooth-Based Mobile Ad Hoc Network,” In Proceedings of IEEE International Conference on Wireless Networks, Communications, and Mobile Computing, pp. 1011-1016, Jun. 2005.
[19]J.A. García-Macías and D.A. Torres, “Service Discovery in Mobile Ad-Hoc Networks: Better at the Network Layer?,” In Proceedings of IEEE International Conference on Parallel Processing (ICPP) Workshops, pp. 452-457, Jun. 2005.
[20]C.E. Perkins, E.M. Belding-Royer, and S.R. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” IETF RFC 3561, Jul. 2003.
[21]E. Adar and B.A Huberman, “Free riding on Gnutella,” Technical Report, SSL-00-63, Xerox Palo Alto Research Center, Palo Alto, 2002.
[22]A. Iamnitchi, M. Ripenau, and I. Foster, “Small-World File-Sharing Communities,” In Proceedings of 23rd IEEE Conference on Communications Society (INFCOM), pp. 952-963, Mar. 2004.
[23]B.H. Bloom, “Space/Time Trade-offs in Hash Coding with Allowable Errors,” Communications of ACM, pp. 422-426, Jul. 1970.
[24]S.J. Lee, M. Gerla, and C.K. Toh, “A Simulation Study of Table-driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks,” IEEE Network Magazine, vol. 13, no. 4, pp. 48-54, Jul. 1999.
[25]Scalable Network Technologies Inc., http://www.scalable-networks.com.
[26]T. Camp, J. Boleng, and V. Davies, “A survey of mobility models for ad hoc network research,” Wireless Communications and Mobile Computing (WCMC), vol. 2, no. 5, pp. 483-502, Jun. 2002.
[27]G.K. Zipf, “Human behavior and the principle of least effort: An introduction to human ecology,” Addison-Wesley, Cambridge MA, 1949.
[28]L. Breslau, P. Cue, L. Fan, G. Phillips, and S. Shenker, “Web Caching and Zipf-like Distributions: Evidence and Implications,” In Proceedings of 23rd IEEE Conference on Communications Society (INFCOM), pp. 126-134, Mar. 1999.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top