簡易檢索 / 詳目顯示

研究生: 唐士浦
Tang, Shih-Pu
論文名稱: 在車載網路中使用協力訊息蒐集機制之混和式流量感知路由協定
A Hybrid Traffic-Aware Geographic Routing with Cooperative Traffic Information Collection Scheme in VANET
指導教授: 郭耀煌
Kuo, Yau-Hwang
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Department of Computer Science and Information Engineering
論文出版年: 2010
畢業學年度: 98
語文別: 英文
論文頁數: 56
中文關鍵詞: 車載網路地理路由繞送交通流量資訊流量感知
外文關鍵詞: VANET, geographic routing, traffic information, traffic aware
相關次數: 點閱:107下載:3
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 近年來隨著車用人口的增多,車間通訊逐漸演變成一項讓許多專家投入研究的熱門議題,尤其是在與封包繞送有關的路由協定上。由於車子高速移動以及其移動時受到道路限制的特性,使過去傳統的無線路由協定無法在車載網路中運作得非常良好。也因此,越來越多研究者把注意力投注在找出適合車載網路的路由協定。然而,目前大多數的車載網路路由協定並未考量到即時的道路狀況,像是車輛數等等。有些路由協定儘管有考慮到當時的道路狀況,卻始終還是有些無法彌補的缺陷,像是運算資源與金錢的耗費。在本篇論文中,我們提出一混合式流量感知地理路由繞送協定(HTAR), 此路由協定使用協同式資訊收集機制有效收集兩種即時交通流量資訊。第一種是道路流量資訊,主要著重在蒐集每條道路的車輛數;而第二種是網路流量資訊,它負責蒐集不同道路的通道負載。接著,HTAR就能夠根據這些已蒐集到的交通流量資訊為即將要傳送的封包計算出可靠且穩定的繞送路徑。此外,在HTAR中,我們提出了一功能性節點,稱作Junc-Tracker。Junc-Tracker不僅要負責蒐集混和式流量資訊外,還要負責決定並散佈最新的道路權重資訊給其他需要這項資訊的節點知道。之後,這些節點才可以根據最新的道路權重計算出最佳路徑。基本上,在每個路口我們都會佈置一個Junc-Tracker。但若使用固定式的裝置去佈置,那成本將會非常之高,所以我們另外又提出了一項機制去降低這項花費,也就是選擇正在道路上行駛的車輛來當我們的Junc-Tracker。在本篇最後的實驗結果顯示出,HTAR不但能夠增進整體的封包傳送成功率,還能夠降低封包被車輛帶著走而無法到達終點的機率。

    Recently, as the number of vehicles increase, inter-vehicle communication has attracted many researchers』 interest to investigate, especially in routing protocols. Owing to the high mobility and the road pattern constrains, the traditional wireless routing protocols have difficulties in making robust paths in VANETs. Hence, more and more researches have focused on developing suitable routing protocols for VANETs. However, most of these protocols do not consider the real-time traffic status when determining the routing paths, which results in the high probability of disconnection during data transmission. Although some of them have taken the real-time traffic information into consideration, they still have some problems, such as computing or costing overhead. In this thesis, we propose a routing protocol called Hybrid Traffic Aware Routing (HTAR) which utilizes a cooperative collection scheme to efficiently collect two types of up-to-date traffic information. The first one is road traffic information about the number of nodes on each road and the second one is network traffic information about the channel node of each road. According to the hybrid information, HTAR is able to compute the up-to-date weights to determine the robust routing paths. We also proposed a functional node called Junc-Tracker. The Junc-Trackers are responsible for collecting the traffic information and disseminating the determined weight information to neighbor nodes and adjacent Junc-Trackers. The Junc-Tracker is required to set one at each junction. In order to reduce the cost on setting the Junc-Tracker, we also propose a mechanism about Junc-Tracker selection to decrease the overhead. Simulation results demonstrate that HTAR improves the overall delivery ratio and reduce the probability of carry-and-forward.

    LIST OF CONTENTS I LIST OF TABLES III LIST OF FIGURES IV CHAPTER 1. INTRODUCTION 1 1.1 MOTIVATION AND PURPOSE 1 1.2 CONTRIBUTIONS 2 1.3 ORGANIZATION OF THIS PAPER 3 CHAPTER 2. BACKGROUND 4 2.1 CONCEPTS OF AD HOC NETWORKS 4 2.2 MOBILE AD HOC NETWORKS 5 2.2.1 Topology-Based Routing 5 2.2.1.1 Proactive Routing 6 2.2.1.2 Reactive Routing 8 2.2.2 Position-Based Routing 12 2.3 VEHICULAR AD HOC NETWORKS 14 CHAPTER 3. A HYBRID TRAFFIC-AWARE ROUTING PROTOCOL 19 3.1 ASSUMPTIONS 19 3.2 BASIC CONCEPT OF HTAR 20 3.2.1 Neighbor Information 20 3.2.1.1 Hello Message 20 3.2.1.2 Neighbor Information Table 21 3.2.2 Routing Process 22 3.2.3 Junc-Tracker 27 3.3 ROUTING DESIGN 28 3.3.1 Junc-Tracker Selection 28 3.3.2 Junc-Tracker Assignments 31 3.3.2.1 Traffic Information Collection 31 3.3.2.2 Road Weight Determination 36 3.3.2.3 Road Weight Information Dissemination 39 CHAPTER 4. PERFORMANCE EVALUATIONS 42 4.1 SIMULATION TOOLS 42 4.1.1 TIGER Map 42 4.1.2 SUMO 42 4.1.3 TraNs 43 4.2 SIMULATION SETUP 45 4.3 SIMULATION RESULTS AND ANALYSIS 47 CHAPTER 5. CONCLUSION AND FUTURE WORK 51 5.1 CONCLUSION 51 5.2 FUTURE WORK 52 REFERENCES 53

    [BAS98] S. Basagni, I. Chlamtac, V. R. Syrotiuk and B. A. Woodward, 「A Distance Routing Effect Algorithm for Mobility,」 International Conference in Mobile Computing and Networking, pp. 76-84, 1998.
    [CAL] California Path, http://www-path.eecs.berkeley.edu/
    [CAR] Car2Car Communication Consortium, http://www.car-2-car.org/
    [CHA02] B. A. Chambers, 「The Grid Roofnet: a Rooftop Ad Hoc Wireless Network,」 Citeseer, 2002.
    [CLA01] T. Clausen, P. Jacquet, A. Laouiti, P. Muhlethaler, A. Qayyum and L. Viennot, 「Optimized Link State Routing Protocol,」 IEEE INMIC Pakistan, 2001.
    [DIN07] Y. Ding, C. Wang and L. Xiao, 「A Static-Node Assisted Adaptive Routing Protocol in Vehicular Networks,」 Proceedings of the Fourth ACM International Workshop on Vehicular Ad Hoc Networks, pp. 59-68, Sep. 2007.
    [DSR] DSRC, http://www.standards.its.dot.gov/Documents/advisories/dsrc_advisory.htm
    [JER07] M. Jerbi et al., 「An Improved Vehicular Ad Hoc Routing Protocol for City Environments,」 IEEE International Conference on Communications, pp. 3972-3979, June 2007.
    [JOH96] D. B. Johnson and D. A. Maltz, 「Dynamic Source Routing in Ad Hoc Wireless Networks,」 In Mobile Computing, Kluwer Academic Publishers, chapter 5, pp. 153-181, 1996.
    [JUB87] J. Jubin and J. D. Tornow, 「The DARPA Packet Radio Network Protocols,」 Proceedings of the IEEE, vol. 75, issue 1, pp. 21-32, Jan. 1987.
    [KO00] Y. B. Ko and N. H. Vaidya, 「Location-Aided Routing (LAR) in Mobile Ad Hoc Networks,」 Wireless Networks, vol. 6, issue 4, pp. 307-321, July 2000.
    [KRP00] B. Karp and H. T. Kung, 「GPSR: greedy perimeter stateless routing for wireless networks,」 Proceedings of the 6th Annual international Conference on Mobile Computing and Networking, pp. 243-254, Aug. 2000.
    [LI00] J. Li, J. Jannotti, D. Decouto, D. Karger and R. Morris, 「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 2000, Aug. 2000.
    [LOC03] C. Lochert et al., 「A routing strategy for vehicular ad hoc networks in city environments,」 IEEE Intelligent Vehicles Symposium Proceedings, pp. 156-161, June 2003.
    [LOC05] C. Lochert et al., 「Geographic Routing in City Scenarios,」 ACM SIGMOBILE Mobile Computing and Communication Review, vol. 9, issue 1, pp. 69-72, Jan. 2005.
    [MO06] Z. Mo, H. Zhu, K. Makki, N. Pissinou, 「MURU: A Multi-Hop Routing Protocol for Urban Vehicular Ad Hoc Networks,」 Mobile and Ubiquitous Systems: Networking & Services, Third Annual International Conference on, pp. 1-8, July 2006
    [PER94] C. E. Perkins and P. Bhagwat, 「Highly dynamic Destination-Sequenced Distance-Vector routing for mobile computers,」 ACM SIGCOMM Computer Communication Review, vol. 24, issue 4, pp. 234-244, Oct. 1994.
    [PER99] C. E. Perkins and E. M. Royer, "Ad-hoc On-Demand Distance Vector Routing," Proceedings of the 2nd IEEE Workshop on Mobile Computer Systems and Applications, pp. 90-100, Feb. 1999.
    [SEE04] B. Seet et al., 「A-STAR: A Mobile Ad Hoc Routing Strategy for Metropolis Vehicular Communications,」 Third International IFIP-TC6 Networking Conference, pp. 989-999, May 2004.
    [SUM] SUMO (Simulation of Urban Mobility),
    http://sourceforge.net/apps/mediawiki/sumo/index.php?title=Main_Page
    [TIG] TIGER Map, http://www.census.gov/geo/www/tiger/
    [TRA] TraNS, http://trans.epfl.ch/
    [VIC] VICS, http://www.vics.or.jp/
    [WAN03] C. Y. Wan, S. B. Eisenman and A. T. Campbell, 「CODA: congestion detection and avoidance in sensor networks,」 Proceedings of the 1st international conference on Embedded networked sensor systems, pp. 266-279, Nov. 2003.

    下載圖示 校內:2012-09-08公開
    校外:2012-09-08公開
    QR CODE