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

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

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文筆數/總筆數 : 113656/144643 (79%)
造訪人次 : 51723605 線上人數 : 331

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

搜尋範圍

查詢小技巧：

您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果

若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料

進階搜尋

主頁 ‧ 登入 ‧ 上傳 ‧ 說明 ‧ 關於政大典藏 ‧ 管理

到手機版

政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 > Item 140.119/60261

請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/60261

題名:	混合階層式路由於公車基底之耐延遲網路 A hybrid hierarchy routing in bus-based delay tolerant networks
作者:	陳志宏 Chen, Chih Hung
貢獻者:	蔡子傑 Tsai, Tzu-Chieh 陳志宏 Chen, Chih Hung
關鍵詞:	耐延遲網路混合階層式市區公車基底路由協定 Delay Tolerant Network hybrid hierarchy urban areas bus-based routing protocol
日期:	2010
上傳時間:	2013-09-04 17:10:14 (UTC+8)
摘要:	在耐延遲網路(Delay Tolerant Network)中，因為節點具有移動性，因此找不到穩定且持續的點對點資料傳送路徑。常見的路由協定可分為機會路由、基於預測的路由以及調度路由，然而這些路由協定使用在市區環境中，有著些許不足與不適用，因此本論文提出一個適用在市區資料傳送的演算法。本論文提出之混合階層式路由演算法，是在市區環境中建立一個以公車為基礎的資料傳送架構，包含行人與公車兩種節點。我們建立節點與節點相遇時資料交換傳送規則，例如行人與行人相遇、行人與公車相遇或是公車與公車相遇時各自有不同的資料傳送判斷與限制。實驗結果也證明所提出之混合階層式演算法，除了可以有效地減少傳送延遲時間並提高訊息傳送成功率，並且在給定節點一定的移動速度與緩衝區大小下，我們的演算法有著最突出的效能。 In Delay Tolerant Networks (DTNs), there is no guarantee that a stable connected path between source and destination nodes always exists because of high node mobility. The current DTN routing protocols can be summarized into three categories: opportunistic, prediction-based and scheduling protocols. However, these routing protocols have some deficiencies and are not specifically focused on the urban areas which have primarily two hierarchical nodes, namely pedestrian and bus nodes. We proposed a Hybrid Hierarchy Routing Protocol, a bus-based architecture for urban areas. We established the rules of data transmission when one node contacts other nodes. More specifically, Ped-to-Ped, Ped-to-Bus and Bus-to-Bus contacts, have different judgments and restrictions for data forwarding. The simulation results demonstrate that the Hybrid Hierarchy Routing Protocol can effectively reduce the delivery delay and improve the successful delivery rate. And in given certain speed and buffer sizes, our algorithm has the most prominent performance.
參考文獻:	[1] Shaoge Yan, Yanbin Qian, Daowen Hua, and Xuehui Du, “A DTN Routing Protocol base on Hierarchy Forwarding and Control Cluster,” Computational Intelligence and Security, International Conference, pp. 397-401, December 2009. [2] P. Jacquet, B. Mans, and G. Rodolakis, “Information Propagation Speed in Mobile and Delay Tolerant Networks,” Information Theory, IEEE Transactions , vol. 56, pp. 5001-5015, Oct. 2010. [3] Mooi Choo Chuah and Wen-Bin Ma, “Integrated Buffer and Route Management in a DTN with Message Ferry,” Military Communications Conference, pp. 1-7, October 2006. [4] Alan Demers, Carl Hauser, Dan Greene, John Larson, and Wes Irish, “Epidemic algorithms for replicated database maintenance,” Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, pp. 1-12, August 1987. [5] Vahdat A and Becker D, “Epidemic routing for partially connected ad hoc networks,” Technical report, Duke University, 2000. [6] Cauligi S. Raghavendra, Konstantinos Psounis, and Thrasyvoulos Spyropoulos, “Spray and wait: an efficient routing scheme for intermittently connected mobile networks,” Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, pp. 252–259, August 2005. [7] Spyropoulos T, Psounis K, and Raghavendra CS, “Spray and focus: efficient mobility-assisted routing for heterogeneous and correlated mobility,” In: PERCOMW ’07. Washington, DC, USA, pp. 79–85, 2007. [8] R.H. Frenkiel, B.R. Badrinath, J. Borres, and R.D. Yates, “The infostations challenge: Balancing cost and ubiquity in delivering wireless data,” Personal Communications, IEEE, vol. 7, pp. 66-71, Apr 2000. [9] J. LeBrun, Chen-Nee Chuah, and M. Zhang, “Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks,” Vehicular Technology Conference, Vol. 4, pp. 2289-2293, June 2005. [10] M. Mauve, A. Widmer, and H. Hartenstein, “A Survey on Position-Based Routing in Mobile Ad Hoc Networks,” Network, IEEE, vol. 15, pp. 30-39, Nov/Dec 2001. [11] Silvia Giordano, Alessandro Puiatti, and Hoang Anh Nguyen, “Probabilistic routing in intermittently connected networks,” A World of Wireless, Mobile and Multimedia Networks, International Symposium, pp. 1-6, June 2007. [12] Etienne C. R. de Oliveira and Célio V. N. de Albuquerque, “NECTAR: A DTN Routing Protocol Based on Neighborhood Contact History,” Proceedings of the 2009 ACM symposium on Applied Computing, 2009. [13] Daniel Rubenstein, Hidekazu Oki, Li Shiuan Peh, Margaret Martonosi, Philo Juang, and Yong Wang, “Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet,” Tenth international conference on architectural support for programming languages and operating systems on Proceedings of the 10th international conference on architectural support for programming languages and operating systems (ASPLOS-X) (ASPLOS `02) , pp. 205-209, October 2002. [14] J. Han, P. Yang, and M. Chuah, “A message ferrying approach for data delivery in sparse mobile ad hoc networks,” Mobile and Ubiquitous Systems, Annual International Conference, pp. 1-8, August 2007. [15] Elizabeth M. Daly and Mads Haahr, “Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs,” IEEE Transactions on Mobile Computing, pp. 606-621, May 2009. [16] Elizabeth M. Daly and Mads Haahr, “Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs,” IEEE Transactions on Mobile Computing, pp. 606-621, May 2009. [17] Small Dynamic World：http://en.wikipedia.org/wiki/Six_degrees_of_separation
描述:	碩士國立政治大學資訊科學學系 98971013 99
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0098971013
資料類型:	thesis
顯示於類別:	[資訊科學系] 學位論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
101301.pdf	1698Kb	Adobe PDF2	249	檢視/開啟

在政大典藏中所有的資料項目都受到原著作權保護.

社群 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 © - 回饋