[1]梁俊斌,刘明.带时延约束的连通目标覆盖最大化生命周期问题[J].智能系统学报,2013,8(4):319-326.[doi:10.3969/j.issn.1673-4785.201304030]
LIANG Junbin,LIU Ming.Lifetime maximization for delay constraint connected target coverage[J].CAAI Transactions on Intelligent Systems,2013,8(4):319-326.[doi:10.3969/j.issn.1673-4785.201304030]
点击复制
《智能系统学报》[ISSN 1673-4785/CN 23-1538/TP] 卷:
8
期数:
2013年第4期
页码:
319-326
栏目:
学术论文—人工智能基础
出版日期:
2013-08-25
- Title:
-
Lifetime maximization for delay constraint connected target coverage
- 文章编号:
-
1673-4785(2013)04-319-08
- 作者:
-
梁俊斌1,2,刘明2
-
1. 广西大学 计算机与电子信息学院,广西 南宁 530004; 2. 中南大学 信息科学与工程学院,湖南 长沙 410083
- Author(s):
-
LIANG Junbin1,2, LIU Ming2
-
1.School of Computer and Electronic Information, Guangxi University, Nanning 530004, China; 2. School of Information Science and Engineering, Central South University, Changsha 410083, China
-
- 关键词:
-
无线传感器网络; 连通目标覆盖; 最大化生命周期; 时延约束; 能量有效
- Keywords:
-
wireless sensor networks; connected target coverage; lifetime maximization; delay constraint; energy efficiency
- 分类号:
-
TP393
- DOI:
-
10.3969/j.issn.1673-4785.201304030
- 文献标志码:
-
A
- 摘要:
-
在无线传感器网络中,如何确保网络服务质量(如覆盖、连通)同时最大化网络生命周期是研究的热点和难点.在延时敏感的应用(如火灾、爆炸等灾害监测)中,传感器节点必须在有限的时间内传送它们的数据到汇聚节点.为了研究这种应用下的连通目标覆盖,提出了一种带时延约束的连通目标覆盖问题(DCCTC).首先,将DCCTC建模成为限高的最大覆盖树问题(HLMCT),并证明它是NP-Complete的.然后,设计了一种快速启发式算法HLCWGC求解HLMCT问题.仿真实验和理论证明,HLCWGC在时延约束下获得的网络生命周期比已有的算法要好.具有较高的应用价值和理论意义.
- Abstract:
-
The issue of guarantying the QoS (target coverage, network connectivity, etc.), and simultaneously maximizing the lifetime in wireless sensor network is a hot topic, yet difficult subject of study. In some delay-sensitive sensor networks, sensors must transmit data to sink-node within a limited time in order to monitor the critical physical environment (fires, explosions, etc.). To study connected target coverage in such delay-sensitive sensor networks, we propose to examine the delay-constraint connected target coverage (DCCTC) problem. The study, specifically, includes of: 1) modelling DCCTC problem as a Height Limited Maximum Cover Tree (HLMCT) problem and proving it is NP-complete 2) developping a fast heuristic algorithm, named HLCWGC(height-limited communication weighted greedy cover) to solve the HLMCT problem. Simulation results and theoretical researches show that HLCWGC algorithm is better than the existing algorithms in the delay-constraint sensor networks.
更新日期/Last Update:
2013-09-25