淡江大學機構典藏:Item 987654321/121037
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 64191/96979 (66%)
造訪人次 : 8570002      線上人數 : 8209
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/121037


    題名: Allocation of Roadside Units for Certificate Update in Vehicular Ad Hoc Network Environments
    作者: Wang, Sheng-Wei
    關鍵詞: Roadside units allocation;VANET;certificate update;privacy conservation;NP-complete
    日期: 2015-06
    上傳時間: 2021-08-25 12:11:54 (UTC+8)
    摘要: The roadside unit (RSU) plays an important role
    in VANET environments for privacy preservation. In order to
    conserve the privacy of a vehicle, the issued certificate must be
    updated frequently via RSUs. If a certificate expires without
    being updated, the services for the vehicle will be terminated.
    Therefore, deploying as more as possible RSUs ensures that the
    certificate can be updated before it expires. However, the cost for
    allocating an RSU is very high. In this paper, we consider the
    roadside unit allocating problem such that the certificates can
    be updated before it expired. Previous researches focus on the
    roadside unit placement problem in a small city in which for any
    origination-destination pair the certificate is limited to update at
    most once. The RSU placement problem in which more than once
    certificate updates are required is discussed in this paper. The
    RSU allocation problem is formulated and the decision problem
    of the RSUs allocation problem is proved as an NP-complete
    problem. We proposed three roadside unit placement algorithms
    which works well for a large city. In order to reduce the number
    of required RSUs for certificate update, we also proposed three
    backward removing methods to remove the intersections found
    by the RSU allocation methods. Simulation results show that the
    proposed algorithms yields lower number of required RSUs than
    the simple method named the most driving routes first method.
    One backward removing method named the least driving routes
    first backward removing method was shown to be able to further
    reduce the number of required RSUs.
    關聯: International Journal of Advanced Computer Science and Applications,6(3),p.114–121
    DOI: 10.14569/IJACSA.2015.060317
    顯示於類別:[資訊工程學系暨研究所] 期刊論文

    文件中的檔案:

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

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

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