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

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

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113318/144297 (79%)
Visitors : 51082768 Online Users : 918

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/54464

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

Title:	用於混合式耐延遲網路之適地性服務資料搜尋方法 Location-based content search approach in hybrid delay tolerant networks
Authors:	李欣諦 Lee, Hsin Ti
Contributors:	蔡子傑 Tsai, Tzu Chieh 李欣諦 Lee, Hsin Ti
Keywords:	耐延遲網路適地性服務內容查詢路由協定 Delay Tolerant Networks Location-based Content Query Routing protocol
Date:	2011
Issue Date:	2012-10-30 11:07:50 (UTC+8)
Abstract:	在耐延遲網路上，離線的使用者，可以透過節點的相遇，以點對點之特定訊息繞送方法，將資訊傳遞至目的地。如此解決了使用者暫時無法上網時欲傳遞資訊之困難。因此，在本研究中，當使用者在某一地區，欲查詢該地區相關之資訊，但又一時無法連上網際網路時，則可透過耐延遲網路之特性，尋求其它同樣使用本服務之使用者幫忙以達到查詢之目的。本論文提出一適地性服務之資料搜尋方法，以三層式區域概念，及混合式節點型態，並透過資料訊息複製、查詢訊息複製、資料回覆及資料同步等四項策略來達成使用者查詢之目的。特別在訊息傳遞方面，提出一訊息佇列選擇演算法，賦予優先權概念於每一訊息中，使得較為重要之訊息得以優先傳送，藉此提高查詢之成功率及減少查詢之延遲時間。最後，我們將本論文方法與其它查詢方法比較評估效能，其模擬結果顯示我們提出的方法有較優的查詢效率與延遲。 In Delay Tolerant Networks (DTNs), the offline users can, through the encountering nodes, use the specific peer-to-peer message routing approach to deliver messages to the destination. Thus, it solves the problem that users have the demands to deliver messages while they are temporarily not able to connect to Internet. Therefore, by the characteristics of DTNs, people who are not online can still query some location based information, with the help of users using the same service in the nearby area. In this thesis, we proposed a Location-based content search approach. Based on the concept of three-tier area and hybrid node types, we presented four strategies to solve the query problem. They are Data Replication, Query Replication, Data Reply and Data synchronization strategies. Especially in message transferring, we proposed a Message Queue Selection algorithm. We set the priority concept to every message such that the most important one could be sent first. In this way, it can increase the query success ratio and reduce the query delay time. Finally, we evaluated our approach, and compared with other routing schemes. The simulation results showed that our proposed approach had better query efficiency and shorter delay.
Reference:	[1] V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall and H. Weiss, “Delay-Tolerant Networking Architecture”, RFC4838, April 2007, [Online]. Available: http://www.ietf.org/rfc/rfc4838.txt [2] K. Fall, “A Delay-Tolerant Network Architecture for Challenged Internets”, In Proc. SIGCOMM, August 2003. [3] A. Vahdat and D. Becker, “Epidemic routing for partially-connected ad hoc networks,” Tech. Rep. CS-2000-06, Duke University, July 2000. [4] T. Spyropoulos, K. Psounis, C.S. Raqhavendra, “Spray and wait: an efficient routing scheme for intermittently connected mobile networks”, EE, USC, USA, In Proc. SIGCOMM, August 2005. [5] T. Spyropoulos, K. Psounis, C.S. Raqhavendra, “Spray and Focus: Efﬁcient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility”, USC, EECS, USA, In Proc. PERCOM, March 2007. [6] A.Lindgren, A.Doria, and O. Schel’en, “Probabilistic Routing in Intermittently Connected Networks”, LUT, Sweden, In Proc. SIGMOBILE, vol. 7-3, July 2003. [7] D.K. Cho, C.W. Chang, M.H. Tsai, M. Gerla, “Networked medical monitoring in the battlefield”, CS, UCLA, USA, In Proc. MILCOM, November 2008. [8] C. Caini, P. Cornice, R. Firrincieli, D. Lacamera, S. Tamagnini, “A DTN Approach to Satellite Communications”, DEIS/ ARCES, University of Bologna, Italy, In Proc. IEEE Journal on Selected Areas in Communications, vol. 26-5, June 2008. [9] Y. Sasaki, Y. Shibata, “Distributed Disaster Information System in DTN Based Mobile Communication Environment”, Japan, In Proc. BWCCA, November 2010. [10] P. Jinag, J. Bigham, E. Bodanese, “Adaptive Service Provisioning for Emergency Communications with DTN”, EECS, Queen Mary University of London, UK, In Proc. WCNC, March 2011. [11] Nathanael Thompson, Riccardo Crepaldi and Robin Kravets, “Locus: A Location-based Data Overlay for Disruption-tolerant Networks”, CS, University of Illinois Urbana-Champaign, USA, In Proc. CHANTS, September 2010. [12] P. Yang, M.C. Chuah, “Performance evaluations of data-centric information retrieval schemes for DTNs”, CSE, Lehigh University, USA, In Proc. MILCOM, November 2008. [13] Cong Liu, Jie Wu, Xin Guan and Li Chen, “Cooperative File Sharing in Hybrid Delay Tolerant Networks”, In Proc. ICDCSW, June 2011. [14] Mikko Pitk¨anen, Teemu K¨arkk¨ainen, Janico Greifenberg, and J¨org Ott, “Searching for Content in Mobile DTNs”, Helsinki University of Technology, Finland, In Proc. PERCOM, March 2009. [15] S.C. Nelson, M. Bakht, R. Kravets, “Encounter–Based Routing in DTNs”, CS, University of Illinois at Urbana-Champaign, USA, In Proc. INFOCOM, April 2009. [16] E.C.R de Oliveria, C.V.N. de Albuquerque, “NECTAR: A DTN Routing Protocol Based on Neighborhood Contact History”, Universidade Federal Fluminense, Brasil, In Proc. SAC, March 2009 [17] J. LeBrun, C.N. Chuah, D. Ghosal, M. Zhang, “Knowledge-Based Opportunistic Forwarding in Vehicular Wireless Ad Hoc Networks”, UC Davis, USA, In Proc. VTC, May 2005. [18] P. Hui, J. Crowcroft, E. Yoneki, “BUBBLE Rap: Social-based Forwarding in Delay Tolerant Networks”, University of Cambridge, UK, In Proc. MobiHoc, May 2008. [19] P. Juang, H. Oki, Y. Wang, M. Martonosi, L.S. Peh, D. Rubenstein, “Energy-Efﬁcient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet”, Princeton University, USA, In Proc. ASPLOS-X, October 2002. [20] G. Sollazzo, M. Musolesi, C. Mascolo, “TACO-DTN: a time-aware content-based dissemination system for delay tolerant networks”, CS, University College London, UK, In Proc. MobiOpp, June 2007. [21] S. Carrilho, G. Valadon, H. Esaki, “Hikari: DTN message distribute system”, The University of Tokyo, Japan, IPSJ SIG Technical Report, January 2009. [22] C.E. Palazzi, A. Bujari, “A Delay/Disruption Tolerant Solution for Mobile-to-Mobile File Sharing”, University of Padova, Italy, Wireless Day, In Proc. IFIP, October 2010. [23] B. Cohen, “Incentives Build Robustness in BitTorrent”, May 2003 [24] “InMobi Mobile Market 2011 Review: Explosive Growth in Mobile, Tablet Impressions Increase 771%*”, InMobi, January 2012. Available: http://www.inmobi.com/press-releases/ [25] “Steve Jobs Declares Post-PC Era”, InformationWeek, June 2010. Available: http://www.informationweek.com/news/software/productivity_apps/225300193 [26] T. Vincenty, “Direct and Inverse Solutions of Geodesics on the Ellipsoid with application of nested equations”, Survey Review, Vol.23, 1975. [27] Ari Keränen, Jörg Ott, Teemu Kärkkäinen, “The ONE Simulator for DTN Protocol Evaluation”, In Proc. SimuTools, March 2009. [28] Sicai Lin, Tzu-Chieh Tsai, Shindi Lee, Sheng-Chih Chen, "Location-Based Mobile Collaborative Digital Narrative Platform", In Proc. The Third International Conference on Creative Content Technologies (CONTENT 2011), Sep 2011.
Description:	碩士國立政治大學資訊科學學系 99753010 100
Source URI:	http://thesis.lib.nccu.edu.tw/record/#G0099753010
Data Type:	thesis
Appears in Collections:	[Department of Computer Science ] Theses

Files in This Item:

File	Size	Format
301001.pdf	2379Kb	Adobe PDF2	312	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