在車載隨意行動網路上利用線性回歸之延遲時間限制的繞徑協定

A Delay-Bounded Routing Protocol with Linear Regression in VANETs

蕭翊光(Yi-Guang Siao)

指導教授 ： 陳裕賢

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

摘要

現在繞徑協定再車載行動隨意網路吸引很多的注意，大部分的研究強調最小化點對點延遲且並沒有注意在減少無線資源的使用上。此篇論文注重在限制延遲繞徑，目標在傳遞訊息到目的地在使用者限制的延遲時間內且最小化無線資源使用率。訊息可以被傳遞到目的地經由混合的方式在經由車子攜帶或無線傳輸。在現存的協定上，車子只有交換傳送策略在十字路口時，根據可用的分配時間在下一個路段上。為了增強之前的研究，我們的協定使用線性回歸來預測可用時間經由移動的距離，如此車子就可以交替合適的傳遞方式在合適的時間。所以我們的協定可以減少頻率在資料傳遞且減少無線資源使用率。我們的協定包含兩個策略，本地的方式和集中的策略。本地的策略只使用車子本身的速度來預測可用的時間且決定何時交換傳遞方式。集中式的策略使用統計的資訊來做決定。模擬結果顯示我們的協定效果比教好比現存的協定。

關鍵字

VANET ； vehicular network ； inter-vehicle communication ； routing ； linear regression ； delay bounded

並列摘要

Routing protocols for vehicular ad hoc networks (VANETs) have attracted a lot of attentions recently. Most of the researches emphasize on minimizing the end-to-end delay without paying attention to reduce the usage of radio. This paper focuses on bounded delay routing, whose goal is to deliver messages to the destination within user-defined delay and minimize the usage of radio. The messages can be delivered to the destination by the hybrid of data muling (carried by the vehicle) and forwarding (transmitted through radio). In the existing protocol, a vehicle may only switch the delivery way (muling or forwarding) at an intersection according to the available time of the next block. To improve previous works, our protocol uses linear regression to predict the available time and the traveling distance and thus the vehicle can switch to a proper delivery way at a proper moment. Therefore, our protocol can reduce the frequency of data forwarding and thus reduces the usage of radio. Our protocol contains two schemes: the localized and centralized schemes. The localized scheme uses only the local vehicle's speed to predict the available time and to decide when to switch the delivery way; while the centralized scheme uses the global statistical information to make the decision. Simulation results show that our protocol performs better than the existing protocol.

並列關鍵字

車載網路 ； 車間通訊 ； 繞徑 ； 線性回歸 ； 延遲時間限制

參考文獻

[1] A.Ouksel B. Xu and O. Wolfson. ”Opportunistic Resource Exchange in Inter-vehicle AdhocNetworks”.

IEEE International Conference on Mobile Data Management, pp. 4-12,

for Cooperative Vehicular Systems”. in Proceedings of IEEE Vehicular Technology

[3] M. L. Fredman and R. E. Tarjan. ”Fibonacci heaps and their uses in improved network

optimization algorithms”. 25th Annual Symposium on Foundations of Computer Science