跳到主要內容

臺灣博碩士論文加值系統

(18.97.9.169) 您好!臺灣時間:2024/12/11 15:08
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:蕭翊光
研究生(外文):Yi-Guang Siao
論文名稱:在車載隨意行動網路上利用線性回歸之延遲時間限制的繞徑協定
論文名稱(外文):A Delay-Bounded Routing Protocol with Linear Regression in VANET
指導教授:陳裕賢陳裕賢引用關係
指導教授(外文):Yuh-Shyan Chen
學位類別:碩士
校院名稱:國立臺北大學
系所名稱:通訊工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2009
畢業學年度:97
語文別:英文
論文頁數:35
中文關鍵詞:車載網路車間通訊繞徑線性回歸延遲時間限制
外文關鍵詞:VANETvehicular networkinter-vehicle communicationlinear regressiondelay bounded
相關次數:
  • 被引用被引用:0
  • 點閱點閱:239
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
現在繞徑協定再車載行動隨意網路吸引很多的注意,大部分的研究強調最小化點對點延遲且並沒有注意在減少無線資源的使用上。此篇論文注重在限制延遲繞徑,目標在傳遞訊息到目的地在使用者限制的延遲時間內且最小化無線資源使用率。訊息可以被傳遞到目的地經由混合的方式在經由車子攜帶或無線傳輸。在現存的協定上,車子只有交換傳送策略在十字路口時,根據可用的分配時間在下一個路段上。為了增強之前的研究,我們的協定使用線性回歸來預測可用時間經由移動的距離,如此車子就可以交替合適的傳遞方式在合適的時間。所以我們的協定可以減少頻率在資料傳遞且減少無線資源使用率。我們的協定包含兩個策略,本地的方式和集中的策略。本地的策略只使用車子本身的速度來預測可用的時間且決定何時交換傳遞方式。集中式的策略使用統計的資訊來做決定。模擬結果顯示我們的協定效果比教好比現存的協定。
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 Introduction 1
2 Related Works 4
3 Preliminary 7
3.1 SystemModel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
3.2 Basic Idea and Challenges . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
4 Delay-Bounded Routing Protocol with Linear Regression 12
4.1 Reducing Control Packet Size . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
4.2 Delay-Bounded Greedy Forwarding with Linear Regression (LR-Greedy) . . . 14
4.3 Delay-Bounded Centralized Forwarding with Linear Regression (LR-Centralized) 18
5 Simulation results 24
5.1 Delivery Ratio . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
5.2 Transmitted Bytes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
5.3 Average Delivery Delay . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
5.4 Resvering time . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
6 Conclusions
[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,
2000.
[2] 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.
[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
, pp. 338-346, 24-26 Oct. 1987.
[4] R. Guensler H. Wu, R. Fujimoto and M. Hunter. ”Mddv: a mobility-centric data dissemination
algorithm for vehicular networks”. In VANET 04:Proceedings of the 1st ACM
international workshop on Vehicular ad hoc networks, Philadelphia, PA, USA, pp. 47-56,
01 October 2004.
[5] A. Eskandarian J. Blum and L. Hoffman. ”Challenges of Intervehicle Ad Hoc Networks”.
IEEE Transction on Intelligent Transportation Systems, pp. 347-351, Dec. 2004.
[6] D. Ghosal J. LeBrun, C.-N. Chuah and M. Zhang. ”Knowledge-based opportunistic
forwarding in vehicular wireless ad hoc networks”. Vehicular Technology Conference,
2005. VTC 2005-Spring. 2005 IEEE 61st, pp. 2289- 2293 Vol.4, 30 May-1 June 2005.
[7] 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.
[8] 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.
[9] S. Kotsiantis. ”Local Averaging of Heterogeneous Regression Models”. International
Journal of Hybrid Intelligent Systems, Volume 3, Number 2, pp. 99-107, 2006.
[10] J. Luo and J.-P. Hubaux. ”A Survey of Inter-Vehicle Communication”. EPFL Technical
Report IC, Switzerland, 24 March 2004.
[11] R. Meraihi Y. Ghamri-Doudane M. Jerbi, S.-M. Seouci. ”An Improved Vehicular Ad Hoc
Routing Protocol for City Environments”. IEEE International Conference on Communications
, (ICC 2007), Glasgow, Scotland, pp. 3972-3979, 24-28 June 2007.
[12] J.S. Parikh O.K. Tonguz, N.Wisitpongphan and F. Bai. ”On the broadcast storm problem
in ad hoc wireless networks.”. International Conference on Broadband Communications,
Networks and Systems,3rd , pp. 1V11, 1-5 Oct. 2006.
[13] M. Migliavacca P. Costa, D. Frey and L. Mottola. ”Towards lightweight information
dissemination in inter-vehicular networks”. In VANET 06: Proceedings of the 3rd international
workshop on Vehicular ad hoc networks, Los Angeles, USA, pp. 20-29, 29
September 2006.
[14] A. Skordylis and N. Trigoni. ”Delay Bounded Routing in Vehicular Ad Hoc Networks”.
ACM International Symposium on Mobile Ad Hoc Networking and Computing , (MOBIHOC
2008), Hong Kong, China, pp. 341-350, 27-30 May 2008.

[15] J. Boleng T. Camp and V. Davies. ”A survey of mobility models for ad hoc network
research.”. Wireless Communication and Mobile Computing (WCMC): Special Issue on
Mobile Ad Hoc Networking Research, Trends and Applications, Vol. 2, No. 5, pp. 483-502,
2002.
[16] A. Vahdat and D. Becker. ”Epidemic Routing for Partially-connected Ad Hoc Networks”.
Duke University Technical Report CS-200006, April 2000.
[17] M. Ammar W. Zhao and E. Zegura. ”A message ferrying approach for data delivery in
sparse mobile ad hoc networks.”. In ACM international symposium on Mobile ad hoc
networking and computing (MobiHoc), Tokyo, Japan, pp. 187V198, 24 - 26 May 2004.
[18] S.Y. Wang and C.L. Chou. ”NCTUns Tool for Wireless Vehicular Communication Network
Researches”. Simulation Modelling Practice and Theory), 2009.
[19] K. Makki Z. Mo, H. Zhu and N. Pissinou. ”MURU: A Multi-Hop Routing Protocol for
Urban Vehicular Ad Hoc Networks”. International Conference on Mobile and Ubiquitous
Systems , (MobiQuitous 2006), San Jose, California, USA, pp. 1-8, 17-21 July 2006.
[20] J. Zhao and G. Cao. ”VADD: Vehicle-Assisted Data Delivery in in Vehicular Ad Hoc
Networks”. IEEE International Conference on Computer Communications, (INFOCOM
2006), Barcelona, Caralunya,
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top