English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 94201/94201 (100%)
造訪人次 : 81602207      線上人數 : 4012
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/106380


    題名: BAHG: Back-bone-assisted hop greedy routing for VANET's city environments
    作者: 吳曉光;Sahu, P. K.;Wu, E. H.;Sahoo, J.;Gerla, M.
    貢獻者: 資訊電機學院資訊工程學系
    關鍵詞: Bones;Cities and towns;Destination discovery;greedy routing;Roads;Routing;Routing protocols;Studies;unicast routing;Vehicles;vehicular ad hoc network (VANET)
    日期: 2013-01-01
    上傳時間: 2026-04-23 13:19:13 (UTC+8)
    出版者: Institute of Electrical and Electronics Engineers Inc.;New York: IEEE
    摘要: 摘要: Using advanced wireless local area network technologies, vehicular ad hoc networks (VANETs) have become viable and valuable for their wide variety of novel applications, such as road safety, multimedia content sharing, commerce on wheels, etc. Multihop information dissemination in VANETs is constrained by the high mobility of vehicles and the frequent disconnections. Currently, geographic routing protocols are widely adopted for VANETs as they do not require route construction and route maintenance phases. Again, with connectivity awareness, they perform well in terms of reliable delivery. To obtain destination position, some protocols use flooding, which can be detrimental in city environments. Further, in the case of sparse and void regions, frequent use of the recovery strategy elevates hop count. Some geographic routing protocols adopt the minimum weighted algorithm based on distance or connectivity to select intermediate intersections. However, the shortest path or the path with higher connectivity may include numerous intermediate intersections. As a result, these protocols yield routing paths with higher hop count. In this paper, we propose a hop greedy routing scheme that yields a routing path with the minimum number of intermediate intersection nodes while taking connectivity into consideration. Moreover, we introduce back-bone nodes that play a key role in providing connectivity status around an intersection. Apart from this, by tracking the movement of source as well as destination, the back-bone nodes enable a packet to be forwarded in the changed direction. Simulation results signify the benefits of the proposed routing strategy in terms of high packet delivery ratio and shorter end-to-end delay.
    其他題名: TITS
    出版者: New York: IEEE
    出版日期: 2013-03-01
    出處: IEEE transactions on intelligent transportation systems, 2013-03, Vol.14 (1), p.199-213
    資源來源: IEEE Electronic Library (IEL)
    版權: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 2013
    識別號: ISSN: 1524-9050
    識別號: EISSN: 1558-0016
    識別號: DOI: 10.1109/TITS.2012.2212189
    識別號: CODEN: ITISFG
    顯示於類別:[資訊工程學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML13檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明