English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 109952/140891 (78%)
Visitors : 46234770      Online Users : 1038
RC Version 6.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
    政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 >  Item 140.119/147034
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/147034

    Title: 以資料為中心延遲中斷網路架構下參考興趣的路由機制
    Information Centric Disruption Tolerant Network Interest-based Routing
    Authors: 陳羿丞
    Chen, Yi-Cheng
    Contributors: 蔡子傑
    Chen, Yi-Cheng
    Keywords: 內容中心延遲中斷容忍網路
    Information Centric DTN
    Date: 2023
    Issue Date: 2023-09-01 15:24:50 (UTC+8)
    Abstract: 隨著軟硬體技術的進步與成熟,智慧服務已經在日常生活中大幅的擴展,發展出巨量資料、邊緣運算等科技應用,而上述這些智慧服務的應用,低延遲即為關鍵的特性之一,而如何更有效率地傳遞訊息,以及節省時間成本,成為一個值得關注的議題。
    基於彈性及快速部署的考量,我們假設網路環境是在連線不穩定、節點容易斷線的情境。因此本篇論文結合內容中心概念並以內容中心延遲中斷容忍網路(ICDTN:Information Centric Disruption Tolerant Network )為基礎,設計出根據節點興趣取向與封包主題內容的路由演算法,並且提出利用延遲中斷容忍網路(DTN)既有的緩衝區實作內容中心的命名資料網路(NDN)的快取功能的方法。
    With the advancement and maturity of software and hardware technology, smart services have been greatly expanded in daily life, and technological applications such as huge amounts of data and edge computing have been developed. Low latency is one of the key features of the above-mentioned smart service applications. However, how to transmit information more efficiently and save time and cost has become an issue worthy of attention.

    Considerably flexibility and fast deployment, we assume that the network environment is unstable where nodes are prone to disconnection. This thesis combines the concept of the data center, with the Information Centric Disruption Tolerant Network (ICDTN) and proposes a routing algorithm based on node interest orientation and packet subject content. This method also uses DTN`s existing buffer to implement Information Centric Name Data Networking(NDN) cache function.
    The application scenario of this research is based on the smart business circle, with the edge computing and distributed computing architecture, to verify the routing enhancement and incentive mechanism solutions proposed in this research. It is expected to improve the efficiency of message transmission and node cooperation, which will help in the business circle, better service experience and resource utilization are realized.
    Reference: [1] Van Jacobson, Diana K Smetters, James D Thornton, Michael F Plass, Nicholas H
    Briggs, and Rebecca L Braynard. Networking named content. In Proceedings of the
    5th international conference on Emerging networking experiments and technologies,
    pages 1–12, 2009.
    [2] Aruna Balasubramanian, Brian Levine, and Arun Venkataramani. Dtn routing as
    a resource allocation problem. In Proceedings of the 2007 conference on Applications,
    technologies, architectures, and protocols for computer communications,
    pages 373–384, 2007.
    [3] Evan PC Jones, Lily Li, and Paul AS Ward. Practical routing in delay-tolerant networks.
    In Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant
    networking, pages 237–243, 2005.
    [4] Kevin Fall. A delay-tolerant network architecture for challenged internets. In Proceedings
    of the 2003 conference on Applications, technologies, architectures, and
    protocols for computer communications, pages 27–34, 2003.
    [5] CC Sobin, Vaskar Raychoudhury, Gustavo Marfia, and Ankita Singla. A survey of
    routing and data dissemination in delay tolerant networks. Journal of Network and
    Computer Applications, 67:128–146, 2016.
    [6] Gareth Tyson, John Bigham, and Eliane Bodanese. Towards an information-centric
    delay-tolerant network. In 2013 IEEE Conference on Computer Communications
    Workshops (INFOCOM WKSHPS), pages 387–392, 2013.
    [7] Waldir Moreira and Paulo Mendes. Survey on opportunistic routing for de-lay/disruption tolerant networks. Dept. Inform. Syst. Technol., Univ. Lusófona, Lisbon,
    Portugal, Tech. Rep. SITI-TR-11-02, 2011.
    [8] Amin Vahdat, David Becker, et al. Epidemic routing for partially connected ad hoc
    networks, 2000.
    [9] Anders Lindgren, Avri Doria, and Olov Schelén. Probabilistic routing in intermittently
    connected networks. ACM SIGMOBILE mobile computing and communications
    review, 7(3):19–20, 2003.
    [10] John Burgess, Brian Gallagher, David D Jensen, Brian Neil Levine, et al. Maxprop:
    Routing for vehicle-based disruption-tolerant networks. In Infocom, volume 6.
    Barcelona, Spain, 2006.
    [11] Prateek K. Singh, Koushik Kar, and Charles Kamhoua. Reputation routing in manets.
    In 2017 IEEE 86th Vehicular Technology Conference (VTC-Fall), pages 1–7, 2017.
    [12] You Lu, Mario Gerla, Tuan Le, Vince Rabsatt, and Haik Kalantarian. Community
    aware content retrieval in disruption-tolerant networks. In 2014 13th Annual
    Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET), pages 172–179.
    IEEE, 2014.
    [13] George Xylomenos, Christopher N Ververidis, Vasilios A Siris, Nikos Fotiou, Christos
    Tsilopoulos, Xenofon Vasilakos, Konstantinos V Katsaros, and George C Polyzos.
    A survey of information-centric networking research. IEEE communications
    surveys & tutorials, 16(2):1024–1049, 2013.
    [14] Ying Zhu, Bin Xu, Xinghua Shi, and Yu Wang. A survey of social-based routing in
    delay tolerant networks: Positive and negative social effects. IEEE Communications
    Surveys & Tutorials, 15(1):387–401, 2012.
    [15] Himanshu Jethawa and Sanjay Madria. Reputation and credit based incentive mechanism
    for data-centric message delivery in dtns. In 2018 19th IEEE international
    conference on mobile data management (MDM), pages 207–216. IEEE, 2018.
    [16] LINE Corporation. 搜客經濟. https://linecorp.com/zh-hant/pr/news/zh-hant/
    [17] Eric Chiejina, Hannan Xiao, and Bruce Christianson. A dynamic reputation management
    system for mobile ad hoc networks. Computers, 4(2):87–112, 2015.
    [18] Teng Liang, Ju Pan, Md Ashiqur Rahman, Junxiao Shi, Davide Pesavento, Alexander
    Afanasyev, and Beichuan Zhang. Enabling named data networking forwarder to
    work out-of-the-box at edge networks. In 2020 IEEE International Conference on
    Communications Workshops (ICC Workshops), pages 1–6, 2020.
    [19] Douglas McGeehan, Dan Lin, and Sanjay Madria. Chitchat: An effective message
    delivery method in sparse pocket-switched networks. In 2016 IEEE 36th International
    Conference on Distributed Computing Systems (ICDCS), pages 457–466.
    IEEE, 2016.
    [20] Ari Keränen, Jörg Ott, and Teemu Kärkkäinen. The one simulator for dtn protocol
    evaluation. In Proceedings of the 2nd international conference on simulation tools
    and techniques, pages 1–10, 2009.
    [21] Mordechai Haklay and Patrick Weber. Openstreetmap: User-generated street maps.
    volume 7, pages 12–18, 2008.
    Description: 碩士
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0110753138
    Data Type: thesis
    Appears in Collections:[資訊科學系] 學位論文

    Files in This Item:

    File Description SizeFormat
    313801.pdf6038KbAdobe PDF20View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    著作權政策宣告 Copyright Announcement
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback