English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113648/144635 (79%)
Visitors : 51612414      Online Users : 552
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU 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
    政大機構典藏 > 資訊學院 > 資訊科學系 > 期刊論文 >  Item 140.119/75877
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/75877


    Title: Moving Direction Based Greedy routing algorithm for VANET
    Authors: Jang, Hung-chin;Huang, Hsiang-Te
    張宏慶
    Contributors: 資科系
    Date: 2010
    Issue Date: 2015-06-17 15:02:29 (UTC+8)
    Abstract: Packets transmission over VANET is intermittent due to rapid change of network topology. This comes from both high mobility of mobile nodes and limitation of roads. Intermittent transmission causes inefficient packet delivery. Those routing protocols applicable to MANET might not be suitable for VANET. In this paper, we propose a Moving Direction Based Greedy (MDBG) routing algorithm for VANET that is used to enhance routing decision in packet delivery. MDBG algorithm is based on the geographical information collected by GPS. In MDBG, the source vehicle uses "hello message", Destination REQuest (DREQ) and Destination REPly (DREP) messages together with its own moving direction information to establish a stable routing path by selecting appropriate neighbor vehicles. AODV algorithm has been proved to have good performance when both the source vehicle and target vehicle have the same moving direction. MDBG algorithm is proposed to leverage the problem while source vehicle and target vehicle move far apart in opposite directions. Simulation results show that MDBG outperforms both AODV and DSR in packet arrival rate, throughput and average end-to-end delay.
    Relation: Computer Symposium (ICS), 2010 International pp535 - 540
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1109/COMPSYM.2010.5685455
    DOI: 10.1109/COMPSYM.2010.5685455
    Appears in Collections:[資訊科學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML2955View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback