在以公車為基底之延遲容忍網路中調適性交通路由之研究

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：32

、訪客IP：18.118.144.199

姓名

陳星光(Shing-kuang Chen) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

在以公車為基底之延遲容忍網路中調適性交通路由之研究
(Adaptive Traffic Routing in Bus-Based Delay Tolerant Network)

相關論文

★ 無線行動隨意網路上穩定品質服務路由機制之研究	★ 應用多重移動式代理人之網路管理系統
★ 應用移動式代理人之網路協同防衛系統	★ 鏈路狀態資訊不確定下QoS路由之研究
★ 以訊務觀察法改善光突發交換技術之路徑建立效能	★ 感測網路與競局理論應用於舒適性空調之研究
★ 以搜尋樹為基礎之無線感測網路繞徑演算法	★ 基於無線感測網路之行動裝置輕型定位系統
★ 多媒體導覽玩具車	★ 以Smart Floor為基礎之導覽玩具車
★ 行動社群網路服務管理系統－應用於發展遲緩兒家庭	★ 具位置感知之穿戴式行動廣告系統
★ 調適性車載廣播	★ 車載網路上具預警能力之車輛碰撞避免機制
★ 應用於無線車載網路上之合作式交通資訊傳播機制以改善車輛擁塞	★ 智慧都市中應用車載網路以改善壅塞之調適性虛擬交通號誌

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

至系統瀏覽論文 ( 永不開放)

摘要(中)

現今發展健全的網際網路架構，以及成熟的通訊協定，在某些特殊的環境下，也許並不能有好的發揮，延遲容忍網路則是一個例子。延遲容忍網路是一種網路的概念型態，其擁有高延遲以及高度不可預期性。在延遲容忍網路中，已優先假設可能會發生較長的等待、傳輸不穩定、不會有發送端至目的端完整的網路傳輸路徑。
許多偏遠的村落並沒有網際網路，然而他們可能有學生需要吸收新知，也可能需要收發電子郵件。建立以公車為基底之延遲容忍網路，是一個可行的辦法。本論文的目標為增進公車為基底之延遲容忍網路的效能，幫助偏遠村落或者是開發中地區需要幫助者，使之也能生活在資訊社會。
本論文先介紹讀者關於延遲容忍網路，以及其延遲容忍網路路由演算法。同時，也介紹其他類似的網路，以期能夠讓讀者較容易瞭解延遲容忍網路之功能。本論文提出以公車為基底之延遲容忍網路調適性交通路由演算法，來預測哪些時間可能會是公車之間能夠有傳輸機會。有了預測資訊，整體網路效能將會提升，且訊息傳送的成功率會增加。本論文提出之路由演算法，不但有較高的傳輸送達機率，同時也能夠適用於其他以公車為基底之延遲容忍網路。在本論文後段，有一系列的實驗，證明本論文提出之演算法，能夠改進以公車為基底之延遲容忍網路傳輸效率。與其他參考文獻比較，最少可提升 50% 最多可提升 326%。

摘要(英)

Under some special circumstances, today’s fully developed Internet structure may have less opportunity to operatic as it normally do. Taking Delay Tolerant Networks (DTN) for example, it is a concept of networks, recognized for its unpredictability and high delay quality. It is assumed that DTN must experience frequent, long-duration partitioning and an end-to-end contemporaneous path may never occur.
Many remote villages could not access to Internet. However, there may be students who need to read news or send e-mails. One of the solutions is to establish a Bus-Based DTN. The goal of this paper is to enhance the performance of Bus-Based DTN to help remote villages or developing areas of the world to become a part of the information society.
This paper gives a survey of DTN first. We not only introduce DTN but also the DTN routing algorithm. We also present other networks that are familiar to DTN in order to make readers understand DTN more easily. This paper proposes “Adaptive Traffic Routing Algorithm” to predict possible timing for buses to communicate with each other. If chances are provided for message to transfer among the buses, its function as DTN may have a higher efficacy. Not only does our algorithm have a high deliver rate but it is also suitable for other bus-based DTN. At the end of this paper is a series of simulations to prove that this paper’s algorithm can better the performance of Bus-Based DTN. Compare to other DTN algorithm, this paper’s algorithm can raise the efficiency from at least 50 percent up to 324 percent.

關鍵字(中)

★ 路由演算法
★ 公車為基底
★ 延遲容忍網路

關鍵字(英)

★ Bus-based
★ Routing Algorithm
★ Delay-Tolerant Networks

論文目次

摘要 i
Abstract ii
誌謝 iii
目錄 iv
圖目錄 vi
表目錄 xi
第 1 章緒論 1
1.1 研究動機 1
1.2 研究目標 2
1.3 論文架構 3
第 2 章相關研究 4
Chapter 2. 4
2.1 無線隨意網路 4
2.2 延遲容忍網路 5
2.2.1 延遲容忍網路之簡介 5
2.2.2 延遲容忍網路之實例 8
2.3 延遲容忍網路之路由 15
2.3.1 延遲容忍網路之路由議題 15
2.3.2 延遲容忍網路路由演算法策略群 17
第 3 章以公車為基底之延遲容忍網路調適性交通路由演算法 25
Chapter 3. 25
3.1 問題描述 25
3.2 環境描述與分析 26
3.2.1 環境描述 26
3.2.2 環境分析 37
3.3 環境假設 47
3.4 調適性交通路由演算法 50
3.4.1 環境物件 50
3.4.2 調適性交通路由演算法之三階段 55
3.4.3 交會時間預測演算法 60
3.4.4 交會樹建立演算法 66
3.4.5 交會樹路由演算法 67
第 4 章模擬實驗與結果 69
Chapter 4. 69
4.1 模擬環境與參數 69
4.2 模擬工具 73
4.3 模擬結果 74
4.3.1 實驗一：兩相鄰公車路線同向行進實驗 77
4.3.2 實驗二：兩相鄰公車路線對向行進實驗 83
4.3.3 實驗三：中央都市與偏遠村莊 89
4.3.4 實驗四：中央都市效能實驗 98
4.3.5 實驗五：最遠距離送達率實驗 107
4.3.6 實驗六：偏遠村落傳輸實驗 109
4.3.7 實驗七：任意發送端與目的地端實驗 118
4.3.8 實驗八：調適性交通路由演算法參數實驗 126
4.3.9 實驗九：旅行車輛對以公車為基底之延遲容忍網路探討 129
4.4 討論 134
第 5 章結論與未來展望 137
Chapter 5. 137
5.1 結論 137
5.2 未來展望 138
References 140

參考文獻

[1] K. Fall, “A delay-tolerant network architecture for challenged internets,” Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, Karlsruhe, Germany, PP. 27-34, 2003
[2] S. Jain, K. Fall, R. Patra “Routing in a delay tolerant network,” Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, Portland, Oregon, USA, PP. 145-158, 2004
[3] http://prisms.cs.umass.edu/dome/index.php?page=umassdieselnet
[4] X. Zou, B. Ramamurthy, S. Magliveras, “Routing Techniques for Wireless Ad Hoc Networks-Classification and Comparison” Proceedings of the Sixth World Multiconference on Systemics, Cybernetics, and Informatics, Orlando, Florida, USA July 14-18, 2002,
[5] http://w3.antd.nist.gov/wahn_home.shtml
[6] X. Chen, J. H.M, J. A.D.S, “Congestion-Aware Routing Protocol for Mobile Ad Hoc Networks” Proceedings of Vehicular Technology Conference, 2007. VTC-2007 Fall. 2007,” Australian Nat. Univ., Canberra, pp 21-25, Oct, 2007
[7] J. Wu, S. Yang, F. Dai, “Logarithmic Store-Carry-Forward Routing in Mobile Ad Hoc Networks,” Parallel and Distributed Systems, IEEE Transactions, vol. 18, issue. 6, pp. 735-748, June 2007
[8] J. Ott, D. Kutscher, C. Dwertmann, “Integrating DTN and MANET routing,” Proceedings of the 2006 SIGCOMM workshop on Challenged networks, Pisa, Italy, pp. 221 – 228, 2006
[9] E. Oliver, H. Falaki, “Performance evaluation and analysis of delay tolerant networking,” Proceedings of the 1st international workshop on System evaluation for mobile platforms. San Juan, Puerto Rico, pp. 1-6, 2007
[10] H.-Y. Huang, P.-E. Luo, M. Li, D. Li, X. Li, W. Shu, M.-Y. Wu, “Performance Evaluation of SUVnet With Real-Time Traffic Data,” Vehicular Technology, IEEE Transactions, vol. 56, issue 6, pp. 3381-3396 Nov, 2007
[11] P. Luo, H. Huang, W. Shu, M. Li, M.-Y. Wu, “Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models,” Proceedings of Wireless Communications and Networking Conference, 2008. WCNC 2008, Vegas, NV, pp. 2206-2211, Apr, 2008
[12] X. Zhang, J. Kurose, B. N. Levine, D. Towsley, H. Zhang, “Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing” Proceedings of the 13th annual ACM international conference on Mobile computing and networking, Montréal, Québec, Canada, pp. 195-206, 2007
[13] http://www.dtnrg.org/
[14] http://transit-dieselnet.admin.umass.edu/
[15] N. Banerjee, M.D. Corner, B.N. Levine, “An Energy-Efficient Architecture for DTN Throwboxes,” Proceedings of INFOCOM 2007. 26th IEEE International Conference on Computer Communications, Anchorage, Alaska, USA, pp 776-784, May, 2007
[16] http://www.strawberry-fair.org.uk
[17] Y. Gong, Y. Xiong, Q. Zhang, Z. Zhang, W. Wang, Z. Xu, “Anycast Routing in Delay Tolerant Networks,” Proceedings of the GLOBECOM '06. IEEE, San Francisco, CA, USA, pp1-5, Nov, 2006
[18] S. Jing, G. Ashvin, d. L. Eyal, “An Empirical Evaluation of the Student-Net Delay Tolerant Network” Proceedings of Mobile and Ubiquitous Systems: Networking & Services, 2006 Third Annual International Conference on, pp. 1-10, July 2006
[19] S. Thrasyvoulos, P, Konstantinos, R. C. S, “Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility” Proceedings of Pervasive Computing and Communications Workshops, 2007. PerCom Workshops '07. Fifth Annual IEEE International Conference, White Plains, NY, pp. 79-85, Mar, 2007
[20] T. Spyropoulos, K. Psounis, C. S. Raghavendra, “Spray and wait: an efficient routing scheme for intermittently connected mobile networks,” Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, Philadelphia, Pennsylvania, USA, pp. 252–259, 2005
[21] A. Balasubramanian, B, Levine, A. Venkataramani, “DTN routing as a resource allocation problem,” Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications, Kyoto, Japan, pp. 373-384, 2007
[22] A.D. Nicolo, P. Giaccone, “Performance limits of real delay tolerant networks,” Proceedings of Mobile and Ubiquitous Systems: Networking & Services, 2006 Third Annual International pp. 1-10, July, 2006
[23] E. P. C. Jones, L. Li, P. A. S. Ward, “Practical routing in delay-tolerant networks” Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking Philadelphia, Pennsylvania, USA, pp. 237-243, 2005
[24] J. Burgess, B. Gallagher, D. Jensen, B. N. Levine,” MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks,” Proceedings of INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Barcelona, Spain, pp1-11, April, 2006
[25] http://www.cs.utexas.edu/users/EWD/
[26] P. Jacquet, P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum, L. Viennot, “Optimized link state routing protocol for ad hoc networks,” Proceedings of IEEE INMIC 2001 Technology for the 21st Century. Le Chesnay, France, pp. 62 – 68, Dec. 2001
[27] C.E. Perkins, P. Bhagwat. “Highly Dynamic Destination Sequenced Distance Vector Routing,” Proceedings of ACM SIGCOMM’94, London, UK, pp 234-244, Sep, 1994
[28] D.B. Johnson, “Mobile Computing” vol. 353, pp. 153-181, 1966
[29] C.E. Perkins, E.M. Royer. “Ad hoc On Demand Distance Vector Routing” Proceedings of Mobile Computing Systems and Applications. WMCSA '99. New Orleans, LA, USA, pp 90-100, Feb, 1999
[30] M. Demmer, K. Fall, “DTLSR: delay tolerant routing for developing regions,” Proceedings of the 2007 workshop on Networked systems for developing regions, Kyoto, Japan, no.5, 2007
[31] http://www.ietf.org/html.charters/ospf-charter.html
[32] E. P. C. Jones, P. A. S. Ward. “Routing strategies for delay-tolerant networks.” Proceedings of ACM SIGCOMM, 2004
[33] A. Vahdat, D. Becker, “Epidemic Routing for Partially-Connected Ad Hoc Networks,” Duke University Technical Report CS-200006, April 2000
[34] A. Lindgren, A. Doria, O. Schel´en, “Probabilistic Routing in Intermittently Connected Networks,” Proceedings of First International Workshop, SAPIR 2004, Fortaleza, Brazil, pp. 239-254, August, 2004
[35] J. Leguay, T. Friedman, V. Conan, “DTN routing in a mobility pattern space,” Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking Philadelphia, Pennsylvania, USA, pp. 276-283, 2005
[36] http://www.netlab.tkk.fi/~jo/dtn/index.html
[37] A. Keränen, J. Ott, “Increasing Reality for DTN Protocol Simulations,” Technical Report, Helsinki University of Technology, Networking Laboratory. July 2007
[38] A. Keränen, “Opportunistic Network Environment simulator,” Special Assignment, Helsinki University of Technology, Networking Laboratory. May 2008
[39] F. Ekman, A. Keränen, J. Karvo, J. Ott, “Working Day Movement Model,” Proceedings of 1st SIGMOBILE Workshop on Mobility Models for Networking Research, Hong Kong, May 2008
[40] http://openjump.org/wiki/show/HomePage

指導教授

周立德(Li-der Chou)

審核日期

2009-2-2

推文