English  |  正體中文  |  简体中文  |  Items with full text/Total items : 75533/75533 (100%)
Visitors : 27364043      Online Users : 500
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/8907

    Title: 在行動對等式網路中以興趣為基礎的資源搜尋協定;An Interest-Based Lookup Protocol in Mobile Peer-to-Peer Networks
    Authors: 陳貽中;Yi-Chung Chen
    Contributors: 資訊工程研究所
    Keywords: 行動隨意網路;對等式;檔案共享;查詢協定;file sharing;lookup protocol;mobile ad hoc network (MANET);peer-to-peer
    Date: 2004-07-09
    Issue Date: 2009-09-22 11:37:28 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 對等式網路(peer-to-peer network)近年來被提出為一個全新的資源分享架構。不同於client/server架構,在對等式網路中每個參與者(peer)都同時扮演著server與client的角色,資源分享就直接藉由對等式網路中各個參與者所提供。對等式網路與無線隨意網路(mobile ad hoc network)都擁有自我組成(self-organization)、分散式(decentralization)與動態的網路拓樸(dynamic topology)的特性。因此,對等式網路技術也非常適合應用於無線隨意網路中。資源搜尋協定是對等式運算中最重要的議題之一。在本篇論文中,我們提出應用於無線隨意網路中以興趣為基礎的有效節省頻寬的資源搜尋協定。當其中一個參與者希望搜尋檔案時,就廣播一個含有依本身興趣就決定的一組關鍵字的查詢訊息。位於此參與者傳輸範圍內的鄰居們收到這封查詢訊息時,如果也對此查詢有興趣才幫忙繼續傳遞此查詢訊息。模擬的結果顯示我們的提出的方法有較高的查詢成功率、系統擴充性、網路利用的有效性,並且較有回應性。最後,我們提出的方法還可避免自私的行為發生。 Peer-to-peer networks and mobile ad hoc networks (MANETs) share the same characteristics of self-organization, decentralization, and dynamic topology. Therefore, it is natural to apply peer-to-peer techniques to MANETs. A lookup protocol, one of the most important issues in a peer-to-peer computing, is an essential component for resource searching. In this thesis, we propose interest-based bandwidth-efficient lookup protocols, simple lookup protocol and advanced lookup protocol, for a mobile environment. A peer willing to search files broadcasts a query message with keywords relevant to its interests to its neighbors in the transmission range, and only those neighbors also interested in the query forward. Simulation results show that our protocols have higher success rate and raise the scalability and bandwidth efficiency comparing to the previous work. Besides, our protocols are more responsive. Finally, our protocols can avoid selfish behaviors, since the behavior of forwarding queries benefits not only the source node but also the forwarding node.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明