| 无线传感器网络连通k覆盖问题及其解决方案综述 |
| |
| 引用本文： | 伍勇安,殷建平,李敏.无线传感器网络连通k覆盖问题及其解决方案综述[J].计算机工程与科学,2008,30(11). |
| |
| 作者姓名： | 伍勇安 殷建平 李敏 |
| |
| 作者单位： | 国防科技大学计算机学院,湖南,长沙,410073 |
| |
| 基金项目： | 国家自然科学基金，湖南省自然科学基金 |
| |
| 摘 要： | 覆盖控制是无线传感器网络的一个基本问题,通过对网络空间资源的优化分配,来更好地完成环境感知和有效传输等任务。作为覆盖控制理论的研究热点之一,连通k覆盖问题研究如何从随机部署的大量传感器节点中选择一部分节点激活,使得任意监测目标都被至少k个不同的活跃节点同时覆盖,而且所有活跃节点都是通信连通的。本文分析了无线传感器网络中连通k覆盖问题的系统模型和算法评价指标,介绍了一些典型的近似算法并对其进行了分析和比较,最后进行了总结和展望。
|
| 关 键 词： | 无线传感器网络 连通k覆盖 近似算法 |
A Survey on the Connected k-Coverage Problem and the Solutions in Wireless Sensor Networks |
| |
| WU Yong-an,YIN Jian-ping,LI Min.A Survey on the Connected k-Coverage Problem and the Solutions in Wireless Sensor Networks[J].Computer Engineering & Science,2008,30(11). |
| |
| Authors: | WU Yong-an YIN Jian-ping LI Min |
| |
| Abstract: | One fundamental issue in wireless sensor networks is coverage control.Using coverage control,the space resources of networks are optimally utilized,and the monitoring and transfer are done better.As one of the hotspots in coverage control,the connected k-coverage problem involves how to activate some connected sensors from lots of randomly deployed ones to k-cover all the targets,where each target point should be within the sensing range of k or more activated sensors.In this paper,the system model and evaluation metrics of the connected k-coverage scheme are analyzed.And some classic approximation algorithms are introduced and compared.Finally,some future directions of the connected k-coverage problem are pointed out. |
| |
| Keywords: | wireless sensor network connected k-coverage approximation algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
