跳到主要內容

簡易檢索 / 詳目顯示

研究生: 陳郁文
Yu-wen Chen
論文名稱: 在車用無線網路中利用虛擬地標的封包繞徑協定
Virtual Landmark assisted routing protocol in Vehicular Ad hoc Networks
指導教授: 許健平
Jang-Ping Sheu
張貴雲
Guey-Yun Chang
口試委員:
學位類別: 碩士
Master
系所名稱: 資訊電機學院 - 資訊工程學系
Department of Computer Science & Information Engineering
畢業學年度: 97
語文別: 英文
論文頁數: 29
中文關鍵詞: 無線車用網路封包繞徑虛擬地標傳遞延遲
外文關鍵詞: Vehicular Ad hoc Networks (VANETs), packet routing protocol, VirtualLandmark (VL), delivery delay
相關次數: 點閱:20下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 在無線車用網路(VANETs)中,如何快速且可靠的進行封包傳輸的繞徑是一個很重要的議題。由於車用網路快速的移動性導致車輛間通訊拓樸的連結容易隨著時間產生高度的變動,因此在處理封包繞徑的這個問題時,所面臨的挑戰將與以往的隨意行動網路(MANETs)有著很大的不同。在此篇論文中,我們提出了一個利用虛擬地標(VLs)的構想,來讓封包在車輛間進行繞徑的傳遞時,能夠有辦法得到較有根據的資料,來朝目的地前進,即使身處道路拓樸複雜、車輛密度分佈不均的環境,依舊可以找到相對有效率的路徑,且不會產生大量的封包增加網路的負擔。除此之外,我們的方法除了可以快速的將封包送達目的地,靠著虛擬地標以及通知封包的設計,也可以進行將封包從目的地送回至原發送車輛的任務,提供在車用無線網路中兩個不同位置完整的封包交換機制。


    How to route packets efficiently and reliably is an important issue in Vehicular Ad hoc Networks (VANET). Due to the high mobility of vehicles, the communication topology of vehicles in VANET changes rapidly. Therefore, routing problem in VANET is very different to that in MANET environment. In this thesis, a Virtual Landmarks-based approach is suggested. Under the assistant of Virtual Landmarks, an efficient path is guaranteed even if the roads topology is complex. Our approach is applicable to routing packets between an vehicle and static destination. Simulation results shows that in comparison with previous work, our approach has much lowest
    communication cost and guarantees a stable path (a path with high vehicle density).

    Chapter 1 Introduction............................ 1 Chapter 2 Related Works........................... 5 Chapter 3 The purposed protocol .................. 8 Chapter 4 Simulation Results .................... 18 Chapter 5 Conclusions............................ 29

    [1] The Network Simulator ns-2, http://www.isi.edu/nsnam/ns/
    [2] The Vehicular Mobility Simulator, http://vanet.eurecom.fr/
    [3] Z.D. Chen, H. Kung, and D. CPah, “Ad Hoc Relay Wireless Networks
    over Moving Vehicles on Highways,” In Proceeding of Mobile ad hoc
    networking and computing, pp. 247-250, 2001.
    [4] M.D. Dikaiakos, A. Florides, T. Nadeem, and L. Iftode, “Location-Aware
    Services over Vehicular Ad-Hoc Networks using Car-to-Car
    Communication,” In Proceedings of Selected Areas in Communications,
    pp. 1590-1602, 2007.
    [5] D. Hadaller, S. Keshav, and T. brecht, et.al. “Vehicular opportunistic
    communication under the microscope,” In Proceedings of Mobile Systems,
    Applications, and Services (MobiSys''07), pp. 206-219, 2007.
    [6] B. Hull and V. Bychkovsky, Y. Zhang, et.al. “Cartel: a distributed mobile
    sensor computing system,” In Proceedings of Embedded networked sensor
    systems (SenSys ), pp. 125-138, 2006.
    [7] B. Karp and H. Kung, “Greedy Perimeter Stateless Routing for Wireless
    Networks,” In Proceedings of ACM/IEEE International Conference on
    Mobile Computing and Networking (MobiCom), pp. 243–254, 2000.
    [8] B.N. Karp, “Challenges in geographic routing: Sparse networks,
    Obstacles, and Traffic provisioning,”, In Proceeding of the DIMACS
    Workshop on Pervasive networking, 2001
    [9] Y. J. Kim, R. Govindan, B. Karp, and S. Shenker, “Geographic Routing
    Made Practical,” In Proceedings of Networked Systems Design andImplementation (NSDI), pp. 217-230, 2005.
    [10] J. Li, J. Janotti, D. D. Coutu, and R. M. D. Karger, “A scalable location
    service for geographic ad hoc routing,” In Proceedings of the Sixth Annual
    ACM/IEEE International Conference on Mobile Computing and
    Networking (MobiCom), pp. 120-130, 2000.
    [11] C. Lochert, H. Hartenstein, J. Tian, H. Fuessler, D. Hermann, and M.
    Mauve, “A routing strategy for vehicular ad hoc networks in city
    environments,” In Proceeding of IEEE Intelligent Vehicles Symposium,
    pp. 156-161, 2003
    [12] C. Lochert, M. Mauve, H. Fussler, and H. Hartenstein, “Geographic
    Routing in City Scenarios,” ACM SIGMOBILE Mobile Computing and
    Communications Review, pp. 69-72, 2005.
    [13] A. Mansy, M. Ammar, and E. Zegura, “Reliable roadside-to-roadside data
    transfer using vehicular traffic,” In Proceedings of Mobile Adhoc and
    Sensor Systems (MASS), pp. 1-6, 2007.
    [14] V. Naumov and T. R. Gross, “Connectivity-Aware Routing (CAR) in
    Vehicular Ad-hoc Networks,” In Proceedings of Annual Joint Conference
    of the IEEE Computer and Communications Societies (INFOCOM), pp.
    1919-1927, 2007.
    [15] V Naumov, R Baumann, T Gross, “An evaluation of inter-vehicle ad hoc
    networks based on realistic vehicular traces,” In Proceedings of the 7th
    ACM international symposium on Mobile ad hoc networking and
    computing, pp. 108-119, 2006.
    [16] J. Ott and D. Kutscher, “Drive-thru internet: IEEE 802.11b for automobile
    users,” In Proceedings of Infocom, pp. 362-373, 2004.
    [17] B. Petit, M. Ammar, and R. Fujimoto, “Protocols for
    Roadside-to-Roadside Data Relaying over Vehicular Networks,” In
    Proceedings of WCNC, pp. 294-299, 2006.
    [18] W. Wang, F. Xie, M. Chatterjee, “TOPO: Routing in Large Scale
    Vehicular Networks,” In Proceedings of Vehicular Technology
    Conference (VTC), pp. 2106-2110, 2007.
    [19] E. Welsh, P. Murphy, and J.P. Frantz, “A mobile testbed for GPS-based
    ITS/IVC and ad hoc routing experimentation,” In Proceedings of Wireless
    Personal Multimedia Communications, pp. 796-800, 2002.
    [20] J. Zhao and G. Cao. “VADD: Vehicle-Assisted Data Delivery in Vehicular
    Ad Hoc Networks,” In Proceedings of Annual Joint Conference of the
    IEEE Computer and Communications Societies (INFOCOM), pp.1-12,
    2006.

    QR CODE
    :::