政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/147037

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/147037

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113648/144635 (79%)
Visitors : 51668904 Online Users : 648

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope

please add "double quotation mark" for query phrases to get precise results

please goto advance search for comprehansive author search

Adv. Search

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

Goto mobile version

政大典藏 > College of Informatics > Department of Computer Science > Theses > Item 140.119/147037

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/147037

Title:	基於命名資料網路在延遲容忍網路之任播機制設計 Design of Anycast Mechanism for NDN in DTN
Authors:	蘇俊憲 Su, Chun-Hsien
Contributors:	蔡子傑 Tsai, Tzu-Chieh 蘇俊憲 Su, Chun-Hsien
Keywords:	任播路由命名資料網路延遲容忍網路可達性邊緣運算無線隨意網路 Anycast NDN DTN Possibility Edge Computing Mobile ad hoc network
Date:	2023
Issue Date:	2023-09-01 15:25:35 (UTC+8)
Abstract:	從人文創新的角度，建立分散式的資料蒐集和邊緣運算平台可以更好地滿足使用者的需求，提供個性化和有效的智慧應用服務。本研究專注於設計一個適用於無線隨意網路的任播路由機制。此機制旨在滿足資料生產者或使用者能夠以更低的請求成本與更高的成功率，透過智慧移動裝置將產出的內容或推薦請求，透過無線網路將資料上傳至距離最近最好的邊緣伺服器或進行所需的推薦運算，並將結果回傳給使用者。本研究採取命名資料網路(Named Data Networking，NDN)，使用以內容為中心的路由演算法，考慮到節點稀疏可能會造成連線斷線，導入了延遲容忍網路(Delay-tolerant networking, DTN)的概念去儲存-攜帶-轉發封包，並針對 NDN 實作 DTN 的困難處提出解決方法，此外為了降低原有泛洪極度耗費成本的做法，本研究提出了一個利用可達性(Possibility)的路由演算法來幫助減少 Overhead 與達成任播的目的。最後實驗使用商圈中的地下街作為研究情境，將方法配合情境使用在任播機制上。實驗數據表明，本研究提出的方法與其他方法相比，不論在邊緣伺服器的數量或是人群的數量增減下，本研究提出的方法都能夠有效控制開銷，並且效率能夠幾乎比肩 Flooding 與 Epidemic Routing。 From a perspective of humanistic innovation, establishing a decentralized data collection and edge computing platform can better meet to user`s needs and provide personalized smart application services.As for data collection, this research focuses on designing an anycast routing mechanism applicable to wireless ad hoc networks. The mechanism aims to satisfy the requirement of data producers or users to achieve lower request costs and higher success rates. It enables the upload of content or recommendation requests generated by smart mobile devices via wireless networks to the nearest and optimal edge server that facilitates the required recommendation calculations. And sends the results back to the users. We adopt Named Data Networking (NDN) with content-centric routing algorithms. Considering the disconnections of nodes due to sparsity, we incorporate the concept of Delay-Tolerant Networking (DTN) for storing-carrying-forwarding packets. We propose solutions to address the challenges of implementing DTN within NDN. Additionally, to reduce the excessive overhead associated with flooding, we introduce a routing algorithm based on "possibility" to help minimize overhead and achieve the objectives of anycast. In our experiments, we utilize an underground mall in a commercial district as the research scenario and apply our methods to the anycast mechanism within this context. The results demonstrate that the proposed approach effectively controls costs and achieves efficiency comparable to Flooding and Epidemic Routing, regardless of variations in the number of edge servers or the size of the population.
Reference:	[1] M. Chowdhury, J. A. Khan, and L. Wang, “Leveraging content connectivity and location awareness for adaptive forwarding in ndn-based mobile ad hoc networks,” in Proceedings of the 7th ACM Conference on Information-Centric Networking, ser. ICN ’20. New York, NY, USA: Association for Computing Machinery, 2020, p.59–69. [Online]. Available:https://doi.org/10.1145/3405656.3418713 [2] “5g at the edge,” 2019, https://www.5gamericas.org/5g-at-the-edge/. [3] “ndnsim.net,” https://ndnsim.net/current/index.html. [4] L. Zhang, A. Afanasyev, J. Burke, V. Jacobson, k. claffy, P. Crowley,C. Papadopoulos, L. Wang, and B. Zhang, “Named data networking,” SIGCOMM Comput. Commun. Rev., vol. 44, no. 3, p. 66–73, jul 2014. [Online]. Available:https://doi.org/10.1145/2656877.2656887 [5] V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L.Braynard, “Networking named content,” in Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies, ser. CoNEXT’09. New York, NY, USA: Association for Computing Machinery, 2009, p. 1–12.[Online]. Available: https://doi.org/10.1145/1658939.1658941 [6] “Nsf future internet architecture project 2010,” 2010, http://www.nets-fia.net/. [7] Y. Liu, A. Dowling, and L. Huie, “Benchmarking network performance in named data networking (ndn),” in 2020 29th Wireless and Optical Communications Conference (WOCC), 2020, pp. 1–6. [8] J. A. Khan and Y. Ghamri-Doudane, “Strive: Socially-aware three-tier routing in information-centric vehicular environment,” in 2016 IEEE Global Communications Conference (GLOBECOM), 2016, pp. 1–7. [9] Y.-T. Yu, R. B. Dilmaghani, S. Calo, M. Y. Sanadidi, and M. Gerla, “Interest propagation in named data manets,” in 2013 International Conference on Computing,Networking and Communications (ICNC), 2013, pp. 1118–1122. [10] G. Grassi, D. Pesavento, G. Pau, R. Vuyyuru, R. Wakikawa, and L. Zhang, “Vanet via named data networking,” in 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2014, pp. 410–415. [11] G. Grassi, D. Pesavento, G. Pau, L. Zhang, and S. Fdida, “Navigo: Interest forwarding by geolocations in vehicular named data networking,” in 2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks(WoWMoM), 2015, pp. 1–10. [12] M. Kuai, X. Hong, and Q. Yu, “Density-aware delay-tolerant interest forwarding in vehicular named data networking,” in 2016 IEEE 84th Vehicular Technology Conference (VTC-Fall), 2016, pp. 1–5. [13] T. Yu, Z. Zhiyi, E. Newberry, A. Afanasyev, G. Pau, L. Wang, and L. Zhang, “Names to rule them all: Unifying mobile networking via named secured data,” Technical Report NDN-0072. NDN. http://named-data. net/techreports. html …, Tech. Rep.,2022. [14] T.-C. Tsai and W.-T. Teng, “A large scale cooperative localization method,” in 2012 1st IEEE International Conference on Communications in China (ICCC), 2012, pp.722–727. [15] J. Shi and B. Zhang, “Ndnlp: A link protocol for ndn,” NDN, NDN Technical Report NDN-0006, 2012. [16] S. Mastorakis, A. Afanasyev, and L. Zhang, “On the evolution of ndnsim: An open-source simulator for ndn experimentation,” SIGCOMM Comput. Commun.Rev., vol. 47, no. 3, p. 19–33, sep 2017. [Online]. Available: https://doi.org/10.1145/3138808.3138812 [17] F. Angius, M. Gerla, and G. Pau, “Bloogo: Bloom filter based gossip algorithm for wireless ndn,” in Proceedings of the 1st ACM Workshop on Emerging NameOriented Mobile Networking Design - Architecture, Algorithms, and Applications, ser. NoM ’12. New York, NY, USA: Association for Computing Machinery, 2012, p. 25–30. [Online]. Available: https://doi.org/10.1145/2248361.2248369
Description:	碩士國立政治大學資訊科學系 110753158
Source URI:	http://thesis.lib.nccu.edu.tw/record/#G0110753158
Data Type:	thesis
Appears in Collections:	[Department of Computer Science ] Theses

Files in This Item:

File	Description	Size	Format
315801.pdf		4882Kb	Adobe PDF2	0	View/Open

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

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
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.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
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