中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/107057
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81629784      Online Users : 4801
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: https://ir.lib.ncu.edu.tw/handle/987654321/107057


    Title: MR-Chord: Improved Chord Lookup Performance in Structured Mobile P2P Networks
    Authors: 周立德;Woungang, Isaac;Tseng, Fan-Hsun;Lin, Yi-Hsuan;Chou, Li-Der;Chao, Han-Chieh;Obaidat, Mohammad S.
    Contributors: 資訊電機學院資訊工程學系
    Keywords: Ad hoc on-demand distance vector (AODV) routing;distributed hash table (DHT);dynamic source routing (DSR);lookup;Mobile communication;Mobile computing;Peer to peer computing;peer-to-peer (P2P);Product introduction;Protocols;Real-time systems;Routing;Servers;Wireless networks
    Date: 2015-09-01
    Issue Date: 2026-04-23 13:54:51 (UTC+8)
    Publisher: Institute of Electrical and Electronics Engineers Inc.;New York: IEEE
    Abstract: 摘要: Peer-to-peer (P2P) networks are becoming very popular since various applications such as media streaming and voice over IP use these networks in different environment settings without the need for a client-server structure. P2P protocols have been originally designed for traditional wired networks, and when deployed in wireless network environments, several challenges are encountered. For instance, P2P clients may depart or join the network frequently, raising the issue of identification and retrieval of data items in an efficient manner. In this scenario, the routing information in P2P clients may become overdue, leading to lookup failures. This paper continues the investigation of our recently proposed solution for Chord lookup in mobile P2P networks [so-called mobile robust Chord (MR-Chord)]. MR-Chord was designed to maintain and update the finger table using a modified distributed hash table-based protocol, so that the necessary lookup services in the network are provided. Our contribution consists in studying the effects of node mobility on the performance of MR-Chord. Simulation results show that in the presence of node mobility, MR-Chord outperforms the original Chord protocol in terms of lookup success rate, overlay consistency, lookup delay time, lookup hot count, and total network load, chosen as performance metrics.
    其他題名: JSYST
    出版者: New York: IEEE
    出版日期: 2015-09-01
    出處: IEEE systems journal, 2015-09, Vol.9 (3), p.743-751
    資源來源: IEEE Electronic Library (IEL)
    版權: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2015
    識別號: ISSN: 1932-8184
    識別號: EISSN: 1937-9234
    識別號: DOI: 10.1109/JSYST.2014.2306147
    識別號: CODEN: ISJEB2
    Appears in Collections:[Department of Computer Science and information Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML18View/Open


    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 ©   - 隱私權政策聲明