在車載隨意行動網路中以對角交叉路口為基礎之繞徑協定

DIR：Diagonal-Intersection-Based Routing Protocol for Urban Vehicular Ad Hoc Networks

潘其毅(Ci-Yi Pan)

指導教授 ： 陳裕賢

國立臺北大學/電機資訊學院/通訊工程研究所/碩士(2008年)

摘要

在本篇論文中我們提出一個在車載隨意行動網路 (Vehicular Ad Hoc Networks，VANETs)中以對角交叉路口為基礎之繞徑協定 (DIR protocol)，DIR protocol是由起始車輛到目標車輛以數個對角交叉路口所構成的。基於地理資訊繞徑協定 (geographic routing protocol)，起始車輛利用地理位置資訊將資料傳送至第一個交叉路口，第二個交叉路口，直到最後一個交叉路口為止，再將資料傳送給目標車輛。在兩個相鄰的對角交叉路口中，存在兩條或兩條以上的子路徑；而DIR protocol有著自動調整路徑的特性，透過這樣的特性從兩個相鄰的對角交叉路口中，動態選擇一條低延遲時間的路徑來傳送資料。DIR protocol 提供在 VANETs 環境中，支援起始車輛與目標車輛皆可移動的情況；由實驗結果顯示DIR protocol 在資料傳送率或是資料時間延遲都勝過目前現有的方法。

關鍵字

對角交叉路口, 繞徑協定, 無線網路, 智慧型運輸系統, 車載隨意行動網路

並列摘要

In this thesis, we present a diagonal-intersection-based routing (DIR) protocol for urban vehicular ad hoc networks. The DIR protocol constructs a series of diagonal intersections between the source and destination vehicles. The DIR protocol is a geographic routing protocol. Based on the geographic routing protocol, source vehicle geographically forwards data packet toward the first diagonal intersection, second diagonal intersection, and so on, until the last diagonal intersection, and finally geographically reach to the destination vehicle. For given a pair of neighboring diagonal intersections, two or more disjoint sub-paths exist between them. The novel property of DIR protocol is the auto-adjustability, while the auto-adjustability is achieved that one sub-path with low data packet delay, between two neighboring diagonal intersections, is dynamically selected to forward data packets. To reduce the data packet delay, the route is automatically re-routed by the selected sub-path with lowest delay. The proposed DIR protocol allows the mobile source and destination vehicles in the urban VANETs. Experimental results show that the DIR protocol outperforms existing solutions in terms of packet delivery ratio and
data packet delay.

並列關鍵字

Diagonal-intersection, routing protocol, wireless network, intelligent transportation system, vehicular ad hoc networks.

參考文獻

USA, pp. 246-255, 25-28 September 2006.

[14] V. Naumov and T. Gross. ”Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks”. IEEE International Conference on Computer Communications (INFOCOM 2007),

Anchorage, Alaska, USA, pp. 1919-1927, 6-12 May 2007.

[15] C. E. Perkins and E. M. Royer. ”Ad hoc On-Demand Distance Vector Routing”. IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), New Orleans, LA, USA, pp. 90-100, February 1999.

[16] C.L. Robinson, L. Caminiti, D. Caveney, and K. Laberteaux. ”Efficient Coordination and Transmission of Data for Cooperative Vehicular Safety Applications”. International Workshop on Vehicular ad hoc Networks , (VANET 2006), Los Angeles, California, USA, pp. 10-19, 29