1. NCCU Academic Hub
  2. Publications
  3. College of Informatics
  4. Theses
  5. Item

Publications-Theses

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 以公車亭為基礎之耐延遲車載網路封包轉發策略
A kiosk based packet forwarding strategy in vehicular delay tolerant networks
作者 陳維偵
Chen, Wei Chen
貢獻者 蔡子傑
Tsai, Tzu Chieh
陳維偵
Chen, Wei Chen
關鍵詞 耐延遲網路
耐延遲車載網路
封包轉發策略
Delay Tolerant Network
Packet Forwarding Strategy
Vehicular Delay Tolerant Network
日期 2011
上傳時間 4-Sep-2013 17:10:26 (UTC+8)
摘要 在耐延遲網路(Delay Tolerant Network)中，因節點之間的高移動性、連接的不確定性環境嚴苛限制，採用Store-And-Forward 訊息傳輸的模式提供一個可接受的網路表現。常見的路由協定可分為機會路由、基於預測的路由以及調度路由，然而這些路由協定使用在市區環境中，有些許不足的地方，因此我們提出適用在市區封包轉發策略。
我們提出的以公車亭為基礎之耐延遲車載網路封包轉發策略，是在市區環境中建立一個以公車亭為基礎的資料傳送架構，包含汽車、公車、公車站、公車轉運站四種節點。我們建立節點與節點相遇時資料傳送規則，例如汽車與汽車相遇、汽車與公車相遇、公車與公車站相遇、公車與公車轉運站相遇、公車轉運站與公車相遇、公車站與汽車相遇、汽車與目的地相遇時各自有不同的資料傳送判斷與限制。
實驗結果也證明所提出的演算法，除了可以有效地減少延遲傳送時間並提高訊息成功傳送率，及在各節點有限的緩衝區大小下，我們的封包轉發策略有著最突出的效能。
In Delay Tolerant Networks (DTNs), there does not exist an end-to-end path due to intermittent connectivity and high node mobility. Messages are stored for a period of time at network nodes and are conveyed hop-by-hop to the destination. 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.
Based on the characteristics of urban areas, we proposed a kiosk based packet forwarding strategy for vehicular delay tolerant networks. We established the rules of data transmission when one node contacts other nodes. More specifically, Car-to-Car, Car-to-Bus, Bus-to-Bus stop, Bus-to-Bus transfer station, Bus transfer station-to-Bus, Bus stop-to-Car ,Car-to-Destination contacts, have different judgments and restrictions for data forwarding.
The simulation results demonstrate that we proposed packet forwarding strategy would reduce the delivery delay, and improve the successful delivery rate. Especially with limited buffer and little overhead, our proposed strategy has the most prominent performance.
參考文獻 參考文獻
[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: ftp://ftp.rfc-editor.org/innotes/rfc4838.txt.
[2] P.Juang, H. Oki, Y. Wang, M. Martonosi, L. S. Peh, and D. Rubenstein,"Energy-efficient computing for wildlife tracking: design tradeoffs and earlyexperiences with ZebraNet," in Proc. of the 10th International Conference onArchitectural Support for Programming Languages and Operating Systems, 2002,pp. 96-107.
[3] M. Martonosi, S. Lyon, L.-S. Peh, V. Poor, and D. Rubenstein. "The ZebraNet Wildlife Tracker." Internet: http://www.princeton.edu/~mrm/zebranet.html, Retrieved on Apr. 20, 2011.
[4] S. Burleigh, A. Hooke, L. Torgerson, K. Fall, V. Cerf, B. Durst, K. Scott, and H.Weiss, "Delay-tolerant networking: an approach to interplanetary internet," IEEE Communications Magazine, vol. 41, no. 6, pp. 128-136, Jun. 2003.
[5] S. Farrell, et al. "InterPlanetary Internet." Internet: http://www.ipnsig.org/, Retrievedon Apr. 20, 2011.
[6] E. Brewer, et al. "Technology and Infrastructure for Emerging Regions (TIER)."Internet: http://tier.cs.berkeley.edu/drupal/about, Retrieved on Apr. 20, 2011.
[7] Z. Lu and J. Fan, "Delay/Disruption tolerant network and its application in military communications," in Proc. of the 2010 International Conference on Computer Design and Applications (ICCDA), 2010, pp. 231-234.
[8] Y. Sasaki and Y. Shibata, "Distributed disaster information system in DTN based mobile communication environment," in Proc. of the 2010 International Conference on Broadband, Wireless Computing, Communication and Applications, 2010, pp. 274-277.
[9] Vasco N. G. J. Soares, Joel J. P. C. Rodrigues, Paulo Salvador Ferreira, António M. D. Nogueira,”Improvement of Messages Delivery Time on Vehicular Delay-Tolerant Networks”,in International Conference on Parallel Processing Workshops,2009,pp 344-349
[10] Vahdat A, Becker D (2000) “Epidemic routing for partially connected ad hoc networks.” Technical report, Duke University
[11] Spyropoulos T, Psounis K, Raghavendra CS (2007) “Spray and focus: efficient mobility-assisted routing for heterogeneous and correlated mobility.” In: PERCOMW ’07. Washington, DC, USA, pp 79–85
[12] Ghosh J, Ngo HQ, Qiao C (2006) “Mobility profile based routing within intermittently connected mobile ad hoc networks (icman).” In: IWCMC ’06. pp 551–556
[13] Lindgren A, Doria A, Schelen O (2003) “Probabilistic routing in intermittently connected networks.” In: SIGMOBILE mobile computing communications review. July, pp 7:19–20
[14] Zhao W, Ammar M, Zegura E (2004) “A message ferrying approach for data delivery in sparse mobile ad hoc networks.” In: MobiHoc
[15] 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.
描述 碩士
國立政治大學
資訊科學學系
98971017
100
資料來源 http://thesis.lib.nccu.edu.tw/record/#G0098971017
資料類型 thesis
dc.contributor.advisor 蔡子傑zh_TW
dc.contributor.advisor Tsai, Tzu Chiehen_US
dc.contributor.author (Authors) 陳維偵zh_TW
dc.contributor.author (Authors) Chen, Wei Chenen_US
dc.creator (作者) 陳維偵zh_TW
dc.creator (作者) Chen, Wei Chenen_US
dc.date (日期) 2011en_US
dc.date.accessioned 4-Sep-2013 17:10:26 (UTC+8)-
dc.date.available 4-Sep-2013 17:10:26 (UTC+8)-
dc.date.issued (上傳時間) 4-Sep-2013 17:10:26 (UTC+8)-
dc.identifier (Other Identifiers) G0098971017en_US
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/60262-
dc.description (描述) 碩士zh_TW
dc.description (描述) 國立政治大學zh_TW
dc.description (描述) 資訊科學學系zh_TW
dc.description (描述) 98971017zh_TW
dc.description (描述) 100zh_TW
dc.description.abstract (摘要) 在耐延遲網路(Delay Tolerant Network)中，因節點之間的高移動性、連接的不確定性環境嚴苛限制，採用Store-And-Forward 訊息傳輸的模式提供一個可接受的網路表現。常見的路由協定可分為機會路由、基於預測的路由以及調度路由，然而這些路由協定使用在市區環境中，有些許不足的地方，因此我們提出適用在市區封包轉發策略。
我們提出的以公車亭為基礎之耐延遲車載網路封包轉發策略，是在市區環境中建立一個以公車亭為基礎的資料傳送架構，包含汽車、公車、公車站、公車轉運站四種節點。我們建立節點與節點相遇時資料傳送規則，例如汽車與汽車相遇、汽車與公車相遇、公車與公車站相遇、公車與公車轉運站相遇、公車轉運站與公車相遇、公車站與汽車相遇、汽車與目的地相遇時各自有不同的資料傳送判斷與限制。
實驗結果也證明所提出的演算法，除了可以有效地減少延遲傳送時間並提高訊息成功傳送率，及在各節點有限的緩衝區大小下，我們的封包轉發策略有著最突出的效能。		zh_TW
dc.description.abstract (摘要) In Delay Tolerant Networks (DTNs), there does not exist an end-to-end path due to intermittent connectivity and high node mobility. Messages are stored for a period of time at network nodes and are conveyed hop-by-hop to the destination. 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.
Based on the characteristics of urban areas, we proposed a kiosk based packet forwarding strategy for vehicular delay tolerant networks. We established the rules of data transmission when one node contacts other nodes. More specifically, Car-to-Car, Car-to-Bus, Bus-to-Bus stop, Bus-to-Bus transfer station, Bus transfer station-to-Bus, Bus stop-to-Car ,Car-to-Destination contacts, have different judgments and restrictions for data forwarding.
The simulation results demonstrate that we proposed packet forwarding strategy would reduce the delivery delay, and improve the successful delivery rate. Especially with limited buffer and little overhead, our proposed strategy has the most prominent performance.		en_US
dc.description.tableofcontents 第一章 緒論 1
1.1研究背景 1
1.2研究動機 3
1.4研究流程 4
第二章 相關研究 5
2.1Opportunistic Protocol 5
2.1.1 Epidemic Routing Protocol 5
2.1.2 Spray Routing Protocol 6
2.2 Prediction-based Protocol 6
2.2.1 Solar Routing Protocol 6
2.2.2 Prophet Routing Protocol 6
2.3 Scheduling Protocol 7
2.3.1 MF Routing Protocol 7
第三章 研究方法與系統架構 9
3.1研究方法 9
3.2系統架構 9
3.3以公車亭為基礎之耐延遲車載網路封包轉發策略 12
3.3.1汽車與汽車相遇 12
3.3.2汽車與公車相遇 13
3.3.3公車與公車站相遇 14
3.3.4公車與公車轉運站相遇 15
3.3.5公車轉運站與公車相遇 16
3.3.6公車站與汽車相遇 18
3.3.7汽車與目的地相遇 18
第四章 模擬實驗與結果分析 20
4.1效能評估 20
4.2 模擬設定 21
4.2.1公車路線設定 21
4.2.2參數設定 22
4.2.3系統畫面 24
4.3 實驗結果 26
4.3.1初始模擬結果 26
4.3.2每路線公車數量之效能評估 31
4.3.3汽車數量之效能評估 33
4.3.4汽車及公車緩衝區大小之效能評估 35
4.3.5公車速度之效能評估 37
第五章 結論與未來展望 40
5.1結論 40
5.2 未來展望 41
第六章 參考文獻 42

表目錄
表1：各節點訊息轉發表 10
表2：系統架構節點表 11
表3：挑選最適公車公式表 17
表4：以公車亭為基礎之耐延遲車載網路封包轉發策略規則表 19
表5：公車路線配置表 22
表6：公車轉運站配置表 22
表7：系統節點相關假設表 23
表8：1A實驗模擬參數設定表 23
表9：1B初始實驗模擬參數設定表 28

圖目錄
圖1：研究流程 4
圖2：以公車亭為基礎之耐延遲車載網路封包轉發策略之系統架構圖 11
圖3：以公車亭為基礎之耐延遲車載網路封包轉發策略之系統之傳送判斷流程圖 12
圖4：汽車與汽車相遇圖 13
圖5：汽車與公車相遇圖 14
圖6：公車與公車站相遇-在公車站傳輸範圍內 14
圖7：公車與公車站相遇-未在公車站傳輸範圍內 15
圖8：公車與公車轉運站相遇圖 16
圖9：子區域分割圖 17
圖10：公車轉運站挑選最適公車圖 18
圖11：公車站與汽車相遇圖 18
圖12：公車模擬路線圖 21
圖13：The ONE模擬軟體-公車路線與各節點系統畫面 25
圖14：The ONE模擬軟體系統畫面 25
圖15：1A初始模擬結果-訊息傳送率 27
圖16：1A初始模擬結果-傳送負載 27
圖17：1A初始模擬結果-延遲時間 28
圖18：1B初始模擬結果-訊息傳送率 29
圖19：1B初始模擬結果-傳送負載 30
圖20：1B初始模擬結果-延遲時間 30
圖21：每路公車數量-訊息傳送率 32
圖22：每路公車數量-傳送負載 32
圖23：每路公車數量-延遲時間 33
圖24：汽車數量-訊息傳送率 34
圖25：汽車數量-傳送負載 34
圖26：汽車數量-延遲時間 35
圖27：節點緩衝區大小-訊息傳送率 36
圖28：節點緩衝區大小-傳送負載 36
圖29：節點緩衝區大小-延遲時間 37
圖30：公車速度--訊息傳送率 38
圖31：公車速度-傳送負載 38
圖32：公車速度-延遲時間 39		zh_TW
dc.format.extent 1845731 bytes-
dc.format.mimetype application/pdf-
dc.language.iso en_US-
dc.source.uri (資料來源) http://thesis.lib.nccu.edu.tw/record/#G0098971017en_US
dc.subject (關鍵詞) 耐延遲網路zh_TW
dc.subject (關鍵詞) 耐延遲車載網路zh_TW
dc.subject (關鍵詞) 封包轉發策略zh_TW
dc.subject (關鍵詞) Delay Tolerant Networken_US
dc.subject (關鍵詞) Packet Forwarding Strategyen_US
dc.subject (關鍵詞) Vehicular Delay Tolerant Networken_US
dc.title (題名) 以公車亭為基礎之耐延遲車載網路封包轉發策略zh_TW
dc.title (題名) A kiosk based packet forwarding strategy in vehicular delay tolerant networksen_US
dc.type (資料類型) thesisen
dc.relation.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: ftp://ftp.rfc-editor.org/innotes/rfc4838.txt.
[2] P.Juang, H. Oki, Y. Wang, M. Martonosi, L. S. Peh, and D. Rubenstein,"Energy-efficient computing for wildlife tracking: design tradeoffs and earlyexperiences with ZebraNet," in Proc. of the 10th International Conference onArchitectural Support for Programming Languages and Operating Systems, 2002,pp. 96-107.
[3] M. Martonosi, S. Lyon, L.-S. Peh, V. Poor, and D. Rubenstein. "The ZebraNet Wildlife Tracker." Internet: http://www.princeton.edu/~mrm/zebranet.html, Retrieved on Apr. 20, 2011.
[4] S. Burleigh, A. Hooke, L. Torgerson, K. Fall, V. Cerf, B. Durst, K. Scott, and H.Weiss, "Delay-tolerant networking: an approach to interplanetary internet," IEEE Communications Magazine, vol. 41, no. 6, pp. 128-136, Jun. 2003.
[5] S. Farrell, et al. "InterPlanetary Internet." Internet: http://www.ipnsig.org/, Retrievedon Apr. 20, 2011.
[6] E. Brewer, et al. "Technology and Infrastructure for Emerging Regions (TIER)."Internet: http://tier.cs.berkeley.edu/drupal/about, Retrieved on Apr. 20, 2011.
[7] Z. Lu and J. Fan, "Delay/Disruption tolerant network and its application in military communications," in Proc. of the 2010 International Conference on Computer Design and Applications (ICCDA), 2010, pp. 231-234.
[8] Y. Sasaki and Y. Shibata, "Distributed disaster information system in DTN based mobile communication environment," in Proc. of the 2010 International Conference on Broadband, Wireless Computing, Communication and Applications, 2010, pp. 274-277.
[9] Vasco N. G. J. Soares, Joel J. P. C. Rodrigues, Paulo Salvador Ferreira, António M. D. Nogueira,”Improvement of Messages Delivery Time on Vehicular Delay-Tolerant Networks”,in International Conference on Parallel Processing Workshops,2009,pp 344-349
[10] Vahdat A, Becker D (2000) “Epidemic routing for partially connected ad hoc networks.” Technical report, Duke University
[11] Spyropoulos T, Psounis K, Raghavendra CS (2007) “Spray and focus: efficient mobility-assisted routing for heterogeneous and correlated mobility.” In: PERCOMW ’07. Washington, DC, USA, pp 79–85
[12] Ghosh J, Ngo HQ, Qiao C (2006) “Mobility profile based routing within intermittently connected mobile ad hoc networks (icman).” In: IWCMC ’06. pp 551–556
[13] Lindgren A, Doria A, Schelen O (2003) “Probabilistic routing in intermittently connected networks.” In: SIGMOBILE mobile computing communications review. July, pp 7:19–20
[14] Zhao W, Ammar M, Zegura E (2004) “A message ferrying approach for data delivery in sparse mobile ad hoc networks.” In: MobiHoc
[15] 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.		zh_TW