论文部分内容阅读
针对传感器网络最大独立集的构造方法中并行构造算法生成的连通支配集尺寸没有明确的上界且难以确定边界节点的问题,在串行最大独立集构造算法的基础上,提出了基于权重和时序的触发式连通支配集构造算法.仿真结果表明:该算法无需构造生成树,降低了计算时延和通信开销;此外,由于最大独立集节点存在时间上的先后关系,因而使得边界节点的数量显著减少,最终求得的连通支配集存在明确的上界.
Aiming at the problem that the size of connected dominance set generated by the parallel construction algorithm in the construction method of the largest independent set of sensor networks does not have a definite upper bound and it is difficult to determine the boundary nodes, based on the algorithm of constructing the largest independent set of the sensor networks, The simulation results show that the proposed algorithm does not need to construct a spanning tree and reduces the computation delay and communication overhead. In addition, because of the time-dependent relationship among the largest independent set nodes, the number of boundary nodes is significant Reduce, finally obtain the connected dominating set there is a clear upper bound.