| 摘要: |
| 基于生成最小覆盖的k集合覆盖启发式算法,提出了分簇结构下解决簇内观测区域可靠覆盖问题的高效节能方案,即可靠覆盖方案.最小覆盖是一个可以完全覆盖观测区域的传感器节点最小集合,可靠覆盖方案使用的1-损毁最小覆盖拓扑结构是两个最小覆盖的迭加.通过1-损毁最小覆盖间的轮流工作延长网络可用时间,体现节能效果;通过增加一个冗余最小覆盖,屏蔽来自单个最小覆盖的节点失效,体现容错效果.在该方案中,介绍簇头节点和簇内成员的交互协议,并使用快速覆盖替换算法处理可能的节点失效.仿真实验显示,该方案能够高效地利用有限的能量,显著延长网络工作时间,同时将由节点失效而产生的漏测次数保持在较低值. |
| 关键词: 无线传感器网络 容错 节能 k集合覆盖 可靠覆盖 1-损毁最小覆盖 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the Program for New Century Excellent Talents in University, the Ministry of Education of China under Grant No.NCET-04-0478 (国家教育部新世纪优秀人才培养计划); the “Qing-Lan” Program for Young Excellent Talents of Jiangsu Province of China (江苏省“青蓝”工程中青年学术带头人培养计划) |
|
| Solving Reliable Coverage in Fault Tolerant Energy Efficient Wireless Sensor Network |
|
XU Qiang,WANG Yun
|
| Abstract: |
| Based on the heuristic method used to solve set k cover problem, a scheme namely reliable coverage scheme is proposed to solve reliable coverage problem within the cluster in a hierarchical structured network. A minimum cover is a smallest set of sensor nodes capable of complete monitoring over the entire cluster area. 1-resistant minimum cover topology, applied in reliable coverage scheme, is the combination of two minimum covers. Round robin working of 1-resistant minimum covers prolongs network lifetime significantly. The redundant minimum cover shields nodes’ failures from a single minimum cover. In reliable coverage scheme, interaction protocol between cluster head and cluster members is introduced and instant cover replacement algorithm is applied to handle possible members’ failures. Simulations show that this scheme is able to efficiently utilize energy to prolong network lifetime while at the same time keeping missed monitoring at a low level. |
| Key words: wireless sensor network fault tolerant energy efficient set k cover reliable coverage 1-resistant minimum cover |
