English  |  正體中文  |  简体中文  |  Items with full text/Total items : 55217/89514 (62%)
Visitors : 10718439      Online Users : 28
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/54973


    Title: Mixing Greedy and Predictive approaches to Improve Geographic Routing for VANET
    Authors: Wu, Tin-Yu;Wang, Yan-Bo;Lee, Wei-Tsong
    Contributors: 淡江大學電機工程學系
    Keywords: VANET;geographic position-based routing protocol;greedy perimeter stateless routing;GSPI
    Date: 2012-03
    Issue Date: 2011-08-05 13:25:35 (UTC+8)
    Publisher: Oxford: John Wiley & Sons Ltd.
    Abstract: In recent years, thanks to the development and popularization of wireless network technologies, the issue of vehicular ad hoc network (VANET) has received great attention, and more and more VANET-related researches have been brought up. Generally speaking, the biggest difference between VANET and traditional ad hoc network is the velocity of carriers because in VANET, the velocity of vehicles, the carriers, is much higher than those in traditional ad hoc. Therefore, it would be a great challenge to forward data efficiently in VANETs and many researches proposed have focused on the development of routing protocols. The current proposed routing protocols are all assumed to simulate in a distributed and ideal environment. As for the complex geographic environments, such as urban scenarios, extra amendments must be needed to improve the efficiency of the routing protocols. Thus, the main purpose of this paper is to design a suitable routing protocol for urban scenarios with better performance and adaptability. For this reason, greedy on straight roads and predictive at the intersections (GSPI) routing protocol is proposed to use greedy mode on straight roads and to use predictive mode at the intersections. In greedy mode, we choose the next hop according to the weight value that combines the distances and multi-rate. In predictive mode, we predict the directions of the vehicles to determine the next hop. The simulation results reveal that our proposed algorithm indeed proves its feasibility.
    Relation: Wireless Communications and Mobile Computing 12(4), pp.367–378
    DOI: 10.1002/wcm.1033
    Appears in Collections:[Graduate Institute & Department of Electrical Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML327View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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