English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54134/88902 (61%)
Visitors : 10552603      Online Users : 27
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: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/111896


    Title: The Target-Barrier Coverage Problem in Wireless Sensor Networks
    Authors: Cheng, Chien-Fu;Wang, Chen-Wei
    Keywords: Sensors;Wireless sensor networks;Surveillance;Mobile computing;Mobile communication;Algorithm design;analysis
    Date: 2017-08-27
    Issue Date: 2017-10-31 02:10:48 (UTC+8)
    Abstract: In this paper, we define a new type of coverage problem named target-barrier coverage problem in wireless sensor networks. A target-barrier is a continuous circular barrier formed around the target. The target-barrier has a dbound constraint that is set depending on applications and needs, where dbound is the minimum distance of the constructed barrier from the target. Target-barrier coverage is very suited for application in defense surveillance, including detection of intrusion from outside and prevention of barrier breaching from inside. For instance, in a jail scenario, sensors can be deployed to enclose a jail with the constraint of dbound to detect escape of prisoners or unauthorized entry into the jail for rescuing prisoners. We focus on how to minimize the number of members required to construct target-barriers in a distributed manner while satisfying the dbound constraint and minimizing the amount of message exchange required. In performance evaluation, we compare our solution with the solution of related work and the Brute-Force algorithm which can find the minimum number of target-barrier members required. Our experimental results show that the proposed algorithm delivers satisfactory results in terms of the number of target-barrier members required and the amount of message exchange required.
    Relation: IEEE Transactions on Mobile Computing 17(5), p.1216-1232
    DOI: 10.1109/TMC.2017.2751040
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML91View/Open
    The Target-Barrier Coverage Problem in Wireless Sensor Networks.pdf3205KbAdobe PDF0View/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