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


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/115919


    题名: QoS guaranteed surveillance algorithms for directional wireless sensor networks
    作者: C. Y. Chang;C. Y. Hsiao;C. T. Chang
    关键词: Surveillance;QoS;k-Barrier coverage;Wireless sensor networks (WSNs)
    日期: 2018-12
    上传时间: 2019-03-09 12:10:58 (UTC+8)
    出版者: Elsevier
    摘要: A directional wireless sensor network (DWSN) consists of a number of directional sensors. Many types of directional sensors have been widely used in constructing a wireless sensor network for IoT applications. These types of sensors include infrared sensors, microwave sensors, ultrasonic sensors, cameras, and radar. Compared with an omni-directional sensor, a directional sensor can achieve better performance because it can additionally report the direction of an intruder. Unfortunately, most existing barrier-coverage mechanisms adopt omni-directional sensor networks. They cannot be efficiently applied to DWSNs because the sensing area of each directional sensor is fan-shaped. This paper investigates the surveillance service problem which supports the surveillance quality of k-barrier coverage in DWSNs. Three algorithms, called BA, BTA and BRA, are proposed which aim at finding a maximal number of different defense barriers, each of which supports k-coverage. Using these algorithms, at least k directional sensors can detect intruders intending to cross the monitoring area. Performance analyses of the proposed algorithms are conducted in Section 5 to verify the performance improvement from a theoretical point of view. In the performance study, the proposed algorithms are compared with other existing algorithms. The experimental study shows that the proposed k-barrier coverage algorithm achieves similar performance with the optimal solution but has fewer control packets. Furthermore, the proposed BRA achieves better performance in terms of the numbers of control packets and constructed defense barriers, as compared with existing algorithms.
    關聯: Ad Hoc Networks 81, p.71-85
    DOI: 10.1016/j.adhoc.2018.06.007
    显示于类别:[資訊工程學系暨研究所] 期刊論文

    文件中的档案:

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

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

    TAIR相关文章

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