Minimizing the total cost of barrier coverage in a linear domain

被引:2
作者
Zhang, Xiao [1 ]
Fan, Haosheng [2 ]
Lee, Victor C. S. [1 ]
Li, Minming [1 ]
Zhao, Yingchao [3 ]
Liu, Chuang [4 ]
机构
[1] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China
[2] Hong Kong Univ Sci & Technol, Dept Mkt, Hong Kong, Peoples R China
[3] Caritas Inst Higher Educ, Dept Comp Sci, Hong Kong, Peoples R China
[4] Harbin Inst Technol, Dept Comp Sci & Technol, Shenzhen Key Lab Internet Informat Collaborat, Shenzhen Grad Sch, Shenzhen, Peoples R China
基金
中国国家自然科学基金;
关键词
Wireless sensor networks; Barrier coverage; Range assignment; Approximation algorithm; WIRELESS; NETWORKS; SENSORS;
D O I
10.1007/s10878-018-0306-6
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Barrier coverage, as one of the most important applications of wireless sensor network (WSNs), is to provide coverage for the boundary of a target region. We study the barrier coverage problem by using a set of n sensors with adjustable coverage radii deployed along a line interval or circle. Our goal is to determine a range assignment of sensors such that the line interval or circle is fully covered and its total cost is minimized. For the line interval case, we formulate the barrier coverage problem of line-based offsets deployment, and present two approximation algorithms to solve it. One is an approximation algorithm of ratio 4 / 3 runs in time, while the other is a fully polynomial time approximation scheme (FPTAS) of computational complexity . For the circle case, we optimally solve it when and present a -approximation algorithm when . Besides, we propose an integer linear programming (ILP) to minimize the total cost of the barrier coverage problem such that each point of the line interval is covered by at least k sensors.
引用
收藏
页码:434 / 457
页数:24
相关论文
共 50 条
[21]   A survey on barrier coverage with sensors [J].
Wu, Fan ;
Gui, Yang ;
Wang, Zhibo ;
Gao, Xiaofeng ;
Chen, Guihai .
FRONTIERS OF COMPUTER SCIENCE, 2016, 10 (06) :968-984
[22]   Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane [J].
Zou, Wenjie ;
Guo, Longkun ;
Hao, Chunlin ;
Liu, Lei .
THEORETICAL COMPUTER SCIENCE, 2023, 941 :121-130
[23]   Barrier Coverage [J].
Balister, Paul ;
Bollobas, Bela ;
Sarkar, Amites .
RANDOM STRUCTURES & ALGORITHMS, 2016, 49 (03) :429-478
[24]   Barrier Coverage by Sensors with Adjustable Ranges [J].
Fan, Haosheng ;
Li, Minming ;
Sun, Xianwei ;
Wan, Peng-Jun ;
Zhao, Yingchao .
ACM TRANSACTIONS ON SENSOR NETWORKS, 2014, 11 (01)
[25]   Barrier Coverage Mechanism Using Adaptive Sensing Range for Renewable WSNs [J].
Dong, Zaixiu ;
Shang, Cuijuan ;
Chang, Chih-Yung ;
Roy, Diptendu Sinha .
IEEE ACCESS, 2020, 8 (08) :86065-86080
[26]   Efficient Algorithm for K-Barrier Coverage Based on Integer Linear Programming [J].
Yanhua Zhang ;
Xingming Sun ;
Baowei Wang .
中国通信, 2016, 13 (07) :16-23
[27]   Efficient Algorithm for K-Barrier Coverage Based on Integer Linear Programming [J].
Zhang, Yanhua ;
Sun, Xingming ;
Wang, Baowei .
CHINA COMMUNICATIONS, 2016, 13 (07) :16-23
[28]   The Barrier-Breach Problem of Barrier Coverage in Wireless Sensor Networks [J].
Cheng, Chien-Fu ;
Wang, Chen-Wei .
IEEE COMMUNICATIONS LETTERS, 2017, 21 (10) :2262-2265
[29]   Minimizing the Aggregate Movements for Interval Coverage [J].
Andrews, Aaron M. ;
Wang, Haitao .
ALGORITHMICA, 2017, 78 (01) :47-85
[30]   Minimizing the Aggregate Movements for Interval Coverage [J].
Aaron M. Andrews ;
Haitao Wang .
Algorithmica, 2017, 78 :47-85