跳到主要內容

臺灣博碩士論文加值系統

(216.73.217.7) 您好!臺灣時間:2026/09/14 18:46
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:蔡至勇
研究生(外文):Jr-yung Tsai
論文名稱:在車載網路中基於交通資訊之路邊網路單元佈署
論文名稱(外文):Roadside Unit Deployment based on Traffic Information in VANETs
指導教授:江季翰江季翰引用關係
指導教授(外文):Ji-Han Jiang
學位類別:碩士
校院名稱:國立虎尾科技大學
系所名稱:資訊工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2011
畢業學年度:99
語文別:中文
論文頁數:45
中文關鍵詞:車載網路路邊網路設施路由協定車輛輔助封包遞送
外文關鍵詞:VANETsRoadside UnitRouting ProtocolCarry-and-Forward
相關次數:
  • 被引用被引用:0
  • 點閱點閱:306
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:1
在車載網路中,封包的傳送須依靠與車子之間利用無線網路相互通訊,或者利用車輛自行攜帶封包前進的方式來傳遞。這兩種最大的差別,就是所產生的封包延遲時間,無線網路使用無線電波是屬於光速,而車輛行駛的速度平均僅是數十公里/小時。除了通訊方式的不同之外,在車載網路的各條道路中,車流量與平均車速不盡相同。依照道路上的平均車速與車流量的關係,有的道路因車間距離短,適合使用無線網路的方式不斷傳遞封包。而有的道路而因為車間的距離長,非常仰賴由車輛自行攜帶的方式來傳遞封包。而主宰封包要進入何種類型的道路,關鍵在於十字路口,封包遞送到路口時,就決定著將進入什麼類型的道路,而傳送封包的延遲時間,也因所進入的道路類型不同而產生快慢變化。本篇論文的目的,即在使封包盡量前往無線網路傳遞多的道路,使得封包傳遞延遲時間縮短。
本論文提供一套計算方式,將道路分為傾向使用無線網路傳遞封包類型與傾向使用車輛攜帶封包前進類型。根據十字路口所連接的道路類型,將路口進行分類,研究發現當一個路口同時兼具這兩種類型的道路,代表該路口也決定著封包傳送時,會進入傳送速度極快或者傳送速度極慢的道路。因此本論文在具有此種特性的路口,架設路邊網路單元(Roadside Unit)。以Vehicle-Assisted Data Delivery(VADD)為路由協定下,本路邊網路單元的功能,在是當攜帶封包的車輛進入具有路邊網路單元的路口時,若無法將封包送往最佳方向的道路,或其他傾向使用無線網路傳遞封包的道路時,則將封包暫存於路邊網路單元中,等待良機再將封包送出,以增加無線網路的使用機會,減少車輛自行攜帶封包的情況出現。另外依據封包的持有者為車輛或路邊網路單元,封包持有者處於直路模式或路口模式,提供不同的搜尋方式,使的封包在車間或車輛與路邊網路單元間快速的傳遞,達到封包傳遞延遲時間縮短的目的。經過模擬,本文之方法,在路邊網路單元的輔助下封包到達率與封包傳遞延遲時間均有顯著的改善。

In vehicular ad hoc networks (VANETs), packets are delivered by wireless transmission or carry and forwarding. The difference is the delay time, transmitted by carry and forwarding is very slowly then wireless transmission. In addition, there are different traffic flows and average vehicle velocities on each road. Some roads are suitable for wireless communication, but others are suitable to carry and forwarding. The key point is the intersection, the packets are delivered to the next road by crossed the intersection.
In this paper, there are two kinds of the roads, one is tend to be transmitted by wireless and the other one is tend to be transmitted by carry and forwarding. Based on what kinds of roads are connected to the intersection. But when an intersection is connected by the two kinds of roads at the same time, this intersection decides the packet will transmit to which kind of roads, fast or slowly. For this reason, we add roadside unit (RSU) at those intersections, based on the Vehicle-Assisted Data Delivery (VADD) routing protocol, when the packet reaches intersection, but there are no vehicles on the best direction, RSU will store the packet for a while, and waiting for an opportunity. The RSU increases the chance to use wireless communication, decreases the chance to use carry and forwarding. In addition, based on vehicle or RSU, straight or intersection, we provide the algorithms for each condition, the packet delivery delay is decreased. In accordance with our simulation results, the packet delivery ratio and delivery delay our method has a much better performance.

中文摘要 ii
英文摘要 iv
誌謝 v
表目錄 vii
圖目錄 viii
一、 緒論 1
1.1 研究背景 1
1.2 研究動機 1
1.3 研究目標 1
1.4 論文架構 2
二、 文獻探討 3
2.1 傳統上的路由策略 3
2.2 車載網路上的路由策略 6
三、 系統設計 13
3.1 系統簡介 13
3.2 路邊網路單元佈建方式 15
3.3 路由協定 19
四、 模擬與實驗 23
4.1 模擬環境 23
4.2 實驗數據 25
五、 結論與未來工作 36
參考文獻 37

[1]Perkins, Charles E. and Bhagwat, Pravin,” Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers”, ACM SIGCOMM’94, 1994.
[2]DB Johnson, DA Maltz, “Dynamic source routing in ad hoc wireless networks”, In Mobile Computing, 1996.
[3]D. Goodman, J. Borras, N. Mandayam, and R. Yates, “INFOSTATIONS: A New System Model for Data and Messaging Services,” in IEEE VTC97, Vol. 2, 1997.
[4]C. E. Perkins and E. M. Royer, “Ad Hoc On-Demand Distance Vector Routing Protocol,” Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), 1999.
[5]L. Briesemeister and G. Hommel, “Role-Based Multicast in Highly Mobile but Sparsely Connected Ad Hoc Networks,” Workshop on Mobile Ad Hoc Networking and Computing, 2000.
[6]R.H. Frenkiel, B.R. Badrinath, J. Borras, and R. Yates, “The Infostations Challenge: Balancing Cost and Uiquity in Delivering Wireless Data,” in IEEE Personal Communications, 2000.
[7]B Karp, HT Kung,”GPSR: greedy perimeter stateless routing for wireless networks“, in MobiCom ''00: Proceedings of the 6th annual international conference on Mobile computing and networking, 2000.
[8]Q. Li and D. Rus, “Sending Messages to Mobile Users in Disconnected;Ad-hoc Wireless Networks,” ACM Mobicom, 2000.
[9]A. Vahdat and D. Becker, “Epidemic routing for partially connected ad-hoc networks,” in Technical Report CS-200006, 2000.
[10]Z. Chen, H. Kung, and D. Vlah, “Ad Hoc Relay Wireless Networks over Moving Vehicles on Highways,” Poster, ACM Mobihoc, 2001.
[11]J. Davis, A. Fagg, and B. Levine, “Wearable Computers as Packet;Transport Mechanisms in Highly-Partitioned Ad-Hoc Networks,” in;International Symposium on Wearable Computing, 2001.
[12]L. Buttyan and J. Hubaux, “Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks.,” ACM/Kluwer Mobile Networks and Applications (MONET), 2003.
[13]J. Blum, A. Eskandarian and L. Hoffman, “Challenges of Intervehicle Ad Hoc Networks,” IEEE Transaction on Intelligent Transportation Systems, Vol. 5, 2004.
[14]S. Ghandeharizadeh, S. Kapadia, and B. Krishnamachari, “PAVAN: A policy framework for content availability in vehicular ad-hoc networks,” in Proceedings of VANET, 2004.
[15]J. Hubaux, “The Security and Privacy of Smart Vehicles,” in Workshop on Embedded Security in Cars (escar), 2004.
[16]W. Zhao, M. Ammar and E. Zegura, “New Directions: A Message Ferrying;Approach for Data Delivery in Sparse Mobile Ad Hoc Networks,”;in ACM MobiHoc, 2004.
[17]Thomas Repantis, Vana Kalogeraki, “Data Dissemination in Mobile PeertoPeer Networks”, in MDM,2005
[18]Z. Mo, H. Zhu, K. Makki, and N. Pissinou, “MURU: A multi-hop routing protocol for urban vehicular ad hoc networks,” in Mobile and Ubiquitous Systems -Workshops, 2006.
[19]J. Zhao and G. Cao, “VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks,” in IEEE INFOCOM’06, 2006.
[20]Marios D. Dikaiakos, Andreas Florides, Tamer Nadeem, and Liviu Iftode, “Location-Aware Services over Vehicular Ad-Hoc Networks using Car-to-Car Communication”, Selected Areas in Communications, IEEE Journal on, Vol. 25, 2007.
[21]Yong Ding, Chen Wang and Li Xiao, "A static-node assisted adaptive routing protocol in vehicular networks," in ACM international workshop on Vehicular ad hoc networks, 2007.
[22]Feliz Kristianto Karnadi, Zhi Hai Mo, Kun-chan Lan, “Rapid Generation of Realistic Mobility Models for VANET”, in Wireless Communications and Networking Conference, 2007.
[23]Valery Naumov, Thomas R. Gross, “Connectivity-Aware Routing (CAR)” in Vehicular Ad Hoc Networks, IEEE INFOCOM,2007.
[24]J. Zhao, Y. Zhang, and G. Cao, “Data Pouring and Buffering on The Road: A New Data Dissemination Paradigm for Vehicular Ad Hoc Networks”, in IEEE Transactions on Vehicular Technology, 56(6), 2007.
[25]Google Maps, http://maps.google.com.tw/.
[26]QualNet Network Simulator. http://www.scalable-networks.com/.
[27]SUMO, http://sumo.sourceforge.net/.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊