English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 55242/89549 (62%)
造访人次 : 10730768      在线人数 : 24
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/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
    显示于类别:[電機工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML662检视/开启
    index.html0KbHTML199检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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