淡江大學機構典藏:Item 987654321/100098
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62830/95882 (66%)
Visitors : 4047803      Online Users : 583
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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/100098


    Title: A density-barrier construction algorithm with minimum total movement in mobile WSNs
    Authors: Cheng, Chien-Fu;Wu, Ting-Ying;Liao, Hsien-Chun
    Contributors: 淡江大學資訊工程學系
    Keywords: Wireless sensor network;Barrier coverage;Density-barrier;Mobile sensors
    Date: 2014-04
    Issue Date: 2015-01-28 11:07:25 (UTC+8)
    Publisher: Elsevier BV * North-Holland
    Abstract: The barrier coverage problem is one of the most important issues in wireless sensor networks (WSNs). In previous research, scholars did not consider the actual density of sensors in the area. As a result, their algorithms might require sensors to move a longer distance to form a barrier. A longer distance of movement means more energy consumption. This requirement is disadvantageous to sensors with limited energy. In this paper, we consider the actual density of sensors in solving the barrier coverage problem in an attempt to minimize the moving distances of mobile sensors and further enhance the network lifetime of the barrier. We propose a density-barrier construction algorithm that involves the following operations: First of all, a barrier that requires the minimum total moving distance for all sensors is constructed using the least squares line approach. Through recursive elimination of outlier sensors, a new barrier can be obtained. The algorithm will find the assembly points on this barrier and the optimal assembly point for each barrier member respectively. Finally, the algorithm uses the hole-handling mechanism to achieve barrier construction and improve the network lifetime. In this paper, the variation in network lifetime under different settings of the outlier value is also analyzed through simulation experiments.
    Relation: Computer Networks 62, pp.208-220
    DOI: 10.1016/j.bjp.2013.12.001
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    A density-barrier construction algorithm with minimum total movement in mobile WSNs.pdf3379KbAdobe PDF2View/Open
    index.html0KbHTML227View/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