摘要
覆盖控制作为无线传感器网络的一个基本问题,对网络的生存时间、部署策略、通信协议和组网等问题的解决具有重要影响。在传感器节点随机冗余部署方式下,传统的方式是在保证覆盖要求和通信连通的前提下仅将最少量的节点投入活跃工作状态,从而降低网络能耗。但是,若频繁地激活同一批节点,会造成这些节点由于能耗过快而较早失效,使整个网络的冗余程度降低。然而,冗余度是传感器网络在单个节点性能有限的情况下提高整个网络的可靠性、容错性、精确性等的基础。为此,本文提出了一个能耗均衡ECB的覆盖问题,指出它是NP完全的,并给出了一个集中式近似算法。该算法根据节点的剩余能量赋于每个节点非负权,再基于Voronoi划分和贪心边方法,在保证覆盖要求的同时选择权和最小的节点激活。仿真实验结果表明,ECB算法求得的活跃节点集小,可以达到有效覆盖,并且可以保持网络的冗余度。
One of the most fundamental problems in wireless sensor networks is the coverage control problem. It is very important to network lifetime, deployment strategy, communication protocol and sensor networking. When a large sensor population is deployed in the drop zone, the traditional approach to conserving system energy is to keep only a minimal number of sensors active, which maintains the communication cormectivity and covers the target region completely. However, if some nodes burn energy more frequently so as to be disabled, the whole network redundancy that is the basis to improve reliability, fault-tolerance and accuracy will decline. Therefore, an energy-cost-balancing (ECB) coverage control algorithm is proposed in this paper. It weighs every node according to its power availablity and topology, activates some nodes with the minimum weight sum through centralized Voronoi tessellation and greedy edges to ensure coverage. Experimental results show that the activated nodes set that ECB constructs is small and can cover the target area besides maintaining network redundancy.
出处
《计算机工程与科学》
CSCD
2008年第12期15-18,共4页
Computer Engineering & Science
基金
国家973计划资助项目(613610202)