PDF HTML阅读 XML下载 导出引用 引用提醒 移动无线传感器网络k-栅栏覆盖构建算法 DOI: 10.3724/SP.J.1001.2011.03877 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: 国家自然科学基金(60603061, 60603064, 60903223) Constructing k-Barrier Coverage in Mobile Wireless Sensor Networks Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:研究了节点无移动能力的静态传感器网络中的栅栏覆盖问题.考虑在传感器节点具有有限移动能力时,如何构建k-栅栏覆盖的问题:首先定义了1-栅栏覆盖最小移动距离和问题(1-barrier coverage min-sum of movingdistance,简称1-BCMS).在网格划分模型情况下,将1-BCMS 问题近似为1-网格栅栏最小移动距离和问题(1-gridbarrier min-sum of moving distance,简称1-GBMS).给出了1-GBMS 问题的整数线性规划描述, Abstract:This paper focuses on the energy efficient construction of a k-barrier coverage in mobile sensor networks. First, this paper formulates 1-BCMS (1-barrier coverage min-sum of moving distance) problem for constructing 1-barrier coverage energy efficiently, reduces the 1-BCMS problem to 1-GBMS (1-grid barrier min-sum of moving distance) problem based on grid model, and present the reduced problem’s Linear Programming Model and prove it to be NP-hard. Secondly, this paper presents a CBGB (constructing baseline grid barrier) algorithm to construct 1-barrier coverage energy efficiently. CBGB is an approximation algorithm for 1-GBMS problem and the solution of CBGB is close to the optimal solution. Finally, a Divide-and-Conquer algorithm is proposed to construct k-barrier coverage. This algorithm significantly reduces communication overhead and computation cost compared to other algorithms. Simulation demonstrates the effectiveness of the proposed algorithm in constructing k-barrier coverage. 参考文献 相似文献 引证文献