English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6481/11653
Visitors : 23402641      Online Users : 299
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/10651

Title: Efficient VANET Unicast Routing using Historical and Real-Time Traffic Information
Authors: Chang, Ing-Chau;Wang, Yuan-Fen;Chou, Cheng-Fu
Contributors: 資訊工程系
Keywords: Historical traffic statistics;Intersection graph;Real-time traffic information;Unicast routing protocol;VANET
Date: 2011-12
Issue Date: 2012-05-25T07:52:14Z
Abstract: In this paper, we propose an intersection graph-based vehicular ad hoc network (VANET) architecture. Using the available electronic MAP and historical traffic statistics from public traffic databases, we create an intersection graph (IG) consisting of all connected road segments, which have shorter average inter-vehicle distances than the wireless transmission range, as its edges and intersections of these road segments as its vertices. We then calculate the least cost routing path in the IG. Hence, the source vehicle leverages the proposed IG and IG bypass routing protocols to greedily forward unicast packets to the destination vehicle via each intermediate intersection on the least cost IG path. Further, we also propose the IG routing path recovery process to handle the broken IG path in real-time. Finally, we execute NS2 simulations to exhibit that the IG and IG bypass routing protocols significantly outperform four wellknown VANET ones in terms of the average packet delivery ratio, end-to-end delay and hop count.
Relation: 17th IEEE International Conference on Parallel and Distributed Systems (ICPADS 2011), Tainan, Taiwan, Dec. 7-9, 2011: 458-464
Appears in Collections:[資訊工程學系] 會議論文

Files in This Item:

File SizeFormat
index.html0KbHTML579View/Open


All items in NCUEIR are protected by copyright, with all rights reserved.

 


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback