EMAC:能量有效的多目标关联覆盖空洞补偿算法

EMAC:energy efficient multi-target associate coverage holes compensation algorithm

覆盖问题是无线传感器网络研究的基本问题。节点数量以及覆盖范围直接影响到网络性能和网络服务质量。因此,为了更好研究覆盖问题,提出了一种能量均衡的多目标关联覆盖空洞算法(Energy Efficient Multi-target Associate Coverage Holes Compensation Algorithm,EMAC),该算法利用节点间关联性和动态分组调整覆盖区域。在覆盖区域内,利用贪心算法对覆盖区域进行优化,并给了空洞存在时的必要条件以及移动目标拟合函数的收敛条件,保证了所关注目标节点被传感器节点均匀覆盖的同时又优化了网络资源。在每个周期内采用唤醒部分传感器节点,使之轮流工作,确保了整个网络体系能量的均衡,从而延长了网络生命周期。实验结果表明,在满足一定覆盖率的前提下,该算法不仅可以有效地抵制节点能量的快速消耗,而且具有更好的适应性和有效性。

The problem of coverage is a basic problem in the field of Wireless Sensor Network（WSN）. The number of nodes and coverage area directly affect the network performance and quality of service. Therefore, in order to better research coverage problem, an energy efficient multi-target associate coverage holes compensation algorithm（EMAC） is proposed. This method uses the correlation among nodes and dynamic grouping to adjust coverage area. In the area of coverage, the greedy algorithm is used to optimize the coverage area and the requirement condition of existing the cavity and the convergence condition of the moving target fitting function is proposed, which ensures that the target node is covered uniformly by sensor nodes and meanwhile the network resources are optimized. In each cycle, the part of nodes are awakened to take turns to work, which ensures the balance of energy of wireless sensor network and prolongs the network life cycle. The experimental results show that under the premise of coverage rate, the algorithm can effectively reduce the network energy consumption and has better adaptability and effectiveness.