论文部分内容阅读
利用最少数量的感知节点来覆盖最大数目的目标位置(MCMS)一直是有向感知网络中的重要问题.为了保证覆盖和对相关事件的及时汇报,针对该问题提出一种基于分簇的目标位置覆盖算法(TCCA).通过所有节点自组织进行分簇并且在各个簇内为成员节点分配相应的感知扇区,TCCA算法能够在保证网络生命周期的前提下有效解决该问题.与其他已有算法相比,仿真结果很好地验证了所提出TCCA算法的有效性.
It has always been an important issue in Directed Perception Network to cover the maximum number of target locations (MCMS) with a minimum number of sensing nodes.In order to ensure coverage and timely reporting of related events, a clustering-based target location Covering algorithm (TCCA) .At the same time, TCCA algorithm can effectively solve this problem under the premise of network life cycle by clustering all nodes and allocating corresponding sensing sectors to member nodes in each cluster.Comparing with other existing algorithms Compared with the simulation results, the validity of the proposed TCCA algorithm is well verified.