有向感知网络中分簇目标覆盖算法

Clustering based target coverage in directional sensor networks

利用最少数量的感知节点来覆盖最大数目的目标位置(MCMS)一直是有向感知网络中的重要问题.为了保证覆盖和对相关事件的及时汇报,针对该问题提出一种基于分簇的目标位置覆盖算法(TCCA).通过所有节点自组织进行分簇并且在各个簇内为成员节点分配相应的感知扇区,TCCA算法能够在保证网络生命周期的前提下有效解决该问题.与其他已有算法相比,仿真结果很好地验证了所提出TCCA算法的有效性.

The maximum target coverage with the minimum number of directional sensor nodes, known as maximum coverage with minimum sensors（MCMS） problem, is an important problem in directional sensor networks. In order to ensure the network coverage and event reporting, the target coverage algorithm（TCCA） based on clustering is proposed.By self-organizing clustering and sensing sector assignments in each cluster, the TCCA algorithm can solve this problem and enhance the network lifetime in an energy-efficient way. Comparing to the existing algorithms, the simulation results show the effectiveness of TCCA.