English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 63190/95884 (66%)
造訪人次 : 4637282      線上人數 : 384
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/54974

    題名: Improving RSU Service Time by Distributed Sorting Mechanism
    作者: Wu, Tin-Yu;S. Guizani;Lee, Wei-Tsong;Liao, Kuo-Hung
    貢獻者: 淡江大學電機工程學系
    關鍵詞: VANET;RSU;V2I;Distributed Sorting Mechanism (DSM)
    日期: 2012-03
    上傳時間: 2011-08-05 13:29:37 (UTC+8)
    出版者: Amsterdam: Elsevier BV
    摘要: In recent years, Vehicle Ad Hoc Networks (VANETs) have become very popular. A VANET network is mainly constructed with an infrastructure composed of mobile vehicles and fixed Road Site Units (RSUs). RSUs are usually very expensive to install, this limits their number, especially in suburbs and areas of sparse population. Therefore, RSUs are precious resource in VANET. In order to promote the utility of RSUs, we propose a novel mechanism, Distributed Sorting Mechanism (DSM), to improve the efficiency of communication between vehicles and RSUs (Vehicle to Infrastructure, V2I). In DSM, every vehicle can individually calculate its own priority of communication, and the time to compete and obtain the channel can be reduced. We further consider the vehicles moving away from the coverage of communication and adjust their priorities of communication appropriately. Moreover, DSM owns the characteristic of “Deadline First” in specific situations. Using DSM not only simplifies the handoff procedure and reduces the network overhead, but also achieves adequate utilization of RSU resources.
    關聯: Ad Hoc Networks 10(2), pp.212–221
    DOI: 10.1016/j.adhoc.2010.07.008
    顯示於類別:[電機工程學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數



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