Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks
复制标题
无线传感器网络中最大寿命目标覆盖的参数化复杂度
DOI:
10.1016/j.tcs.2013.06.008
复制
发表时间:
2014
影响因子:
1.1
通讯作者:
Jianer Chen
中科院分区:
文献类型:
--
作者:
Weizhong Luo;Jianxin Wang;Jiong Guo;Jianer Chen
Max-lifetime Target Coverage can be viewed as a family of problems where the task is to partition the sensors into groups and assign their time-slots such that the coverage lifetime is maximized while satisfying some coverage requirement. Unfortunately, these problems are NP-hard. To gain insight into the source of the complexity, we initiate a systematic parameterized complexity study of two types of Max-lifetime Target Coverage: Max–min Target Coverage and Max-individual Target Coverage. We first prove that both problems remain NP-hard even in the special cases where each target is covered by at most two sensors or each sensor can cover at most two targets. By contrast, restricting the number of targets reduces the complexity of the considered problems. In other words, they are both fixed parameter tractable (FPT) with respect to the parameter “number of targets”. Moreover, we extend our studies to the structural parameter “numberkof sensors covering at least two targets”. Positively, both problems are in FPT with respect tok. Finally, we show that Max–min Target Coverage is in FPT with respect to the combined parameters “number of groups” and “number of targets covered by each group”.
登录
查看更多内容
DOI:
--
发表时间:
1994-03
期刊:
Nord. J. Comput.
影响因子:
--
作者:
J. A. Telle
通讯作者:
J. A. Telle
DOI:
--
发表时间:
2007-01
期刊:
--
影响因子:
--
作者:
Jianer Chen;Songjian Lu;S. Sze;Fenghui Zhang
通讯作者:
Jianer Chen;Songjian Lu;S. Sze;Fenghui Zhang
DOI:
10.1016/j.cosrev.2007.09.001
发表时间:
2007-12
期刊:
Comput. Sci. Rev.
影响因子:
--
作者:
D. Thilikos
通讯作者:
D. Thilikos
影响因子:
3
作者:
Cardei, M;Du, DZ
通讯作者:
Du, DZ
影响因子:
1.8
作者:
M. Cheng;Xuan Gong
通讯作者:
M. Cheng;Xuan Gong