English  |  正體中文  |  简体中文  |  Items with full text/Total items : 64191/96979 (66%)
Visitors : 8153419      Online Users : 7664
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/115919


    Title: QoS guaranteed surveillance algorithms for directional wireless sensor networks
    Authors: C. Y. Chang;C. Y. Hsiao;C. T. Chang
    Keywords: Surveillance;QoS;k-Barrier coverage;Wireless sensor networks (WSNs)
    Date: 2018-12
    Issue Date: 2019-03-09 12:10:58 (UTC+8)
    Publisher: Elsevier
    Abstract: 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.
    Relation: Ad Hoc Networks 81, p.71-85
    DOI: 10.1016/j.adhoc.2018.06.007
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML245View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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