透過您的圖書館登入
IP:3.135.198.49
  • 學位論文

車載隨意行動網路上延遲時間限制的群播協定

A Linear Regression-based Delay-Bounded Multicast Protocol for Vehicular Ad Hoc Network

指導教授 : 陳裕賢
若您是本文的作者,可授權文章由華藝線上圖書館中協助推廣。

摘要


本篇論文提出了一個以監聽為基礎與中繼藉由車載隨意行動網路下所制定的路由機制,車輛間會互相通知緊急事件及車禍情況。車載隨意行動網路意指在車網環境下所建立的車與車通訊溝通的網路。當目標區域有時間範圍,此時訊息只要剛好在時間附近抵達即可,我們考慮的因素則不是在以訊息越快抵達目標區域越理想,而是要將過程傳輸所耗費的無線資源成本考慮進來,所以要以如何減少無線資源且又在時間限制內抵達為改善目標。本文是以線性回歸預測方式下改變傳輸策略,將點對點的傳輸擴展到群播的路由機制。來源車輛須將相同訊息傳網多處不同區域,已通知該區域的車輛,各個不同目標區域皆有自行定義的時間範圍內需抵達,當訊息抵達目標區域時會將訊息廣播在此目標區域內。由於先前的報告只針對在一台車輛與車輛的訊息傳遞情境下討論,因而我們利用之前的路由機制再加以改善,便擴展到考慮來源端與許多不同目標端區域的溝通情境,且又可節省無線資源的浪費。我們的路由機制可以分為分散式以及集中式去討論,在集中式中,各個路口的車輛速度皆可獲知,分散式中只能獲取該路口處的四個方向車速,利用此特性我們定義出了成本公式用來決定最佳路由路徑。

並列摘要


Vehicles may inform emergent events or car accidents by using a routing protocol in vehicular ad hoc net-works (VANETs) which is a wireless ad hoc network that operates in a vehicular environment to provide communication between vehicles. Delay bounded rout-ing protocol is designed for minimizing the usage of radio within user-defined delay time. Hence, how to reduce the usage of radio has become a popular issue. This report focuses on linear regression-based de-lay-bounded multicast, whose goal is to deliver mes-sages to many destination regions within user-defined delay of each region by minimizing the usage of radio. In this scenario, when the vehicle receives the message within the targeted region, the vehicle broadcasts the message to other vehicles of the region. In our protocol, the message can be delivered to the destination regions by the hybrid of data muling (carried by a vehicle) and forwarding (delivered through radio). In the existing delay-bounded protocol, they only consider about the source to one region instead of many regions. To im-prove previous works, we propose a linear regression based delay-bounded multicast protocol for VANETs. The proposed protocol contains two schemes: the greedy and centralized schemes. In the greedy scheme, the delivered direction of the multicast message for each multicasting region is decided according to a greedy algorithm at the current intersection until the messages has reached the destination region. In the centralized scheme, a branch and bound and pruning techniques is used to search for a minimum cost mul-ticast tree. Simulation results have shown that the pro-posed multicasts protocol performs better than existed work in terms of total transmitted bytes.

參考文獻


[3] Y. W. Lin, Y. S. Chen, and S. L. Lee. “Routing Protocols in Vehicular Ah Hoc Networks: A Survey and Future Perspectives,” Journal of Information Science and Engineering, Vol. 26, No. 3, pp. 913-932, May 2010.
[1] B. Srinivasan J. Singh, N. Bambos and D. Clawin. “Wireless LAN Performance Under Varied Stress Conditions in Vehicular Traffic Scenarios”. Vehicular Technology Conference, Vol. 2, pp. 743- 747, 2002.
[4] S. B. Kotsiantis. “Local Averaging of Heterogeneous Regression Models,” International Journal of Hybrid Intelligent Systems, Volume 3, Number 2, pp. 99-107, 2006.
[5] M. Klepal A. Tabatabaei Brickley, C.Shen and D. Pesch. “A Data Dissemination Strategy for Cooperative Vehicular Systems,” in Proceedings of IEEE Vehicular Technology Conference (VTC) , pp. 2501-2505, Apr. 2007.
[6] U. Lee K. C. Lee, J. Haerri and M. Gerla. “Enhancde Perimeter Routing Geographic Forwarding Protocols in Urban Vehicular Scenarios,” IEEE Global Communications conference (GLOBECOM 2007), New Orleans, LA, USA, pp. 1-10, 26-30 November 2006.

延伸閱讀