论文部分内容阅读
提出两个基于二跳独立邻居覆盖的无线传感器网络极小连通支配集构造算法.在两个构造算法中,已选择的支配节点推举新的支配节点,并要求新推举的支配节点完全覆盖该支配节点的二跳独立邻居节点.第一个算法不考虑能量因子,以被推举节点的一跳和部分二跳独立邻居节点集合大小之和最大作为新支配节点推举依据;第二个算法以被推举节点剩余能量与其覆盖的二跳独立邻居节点个数之商最大化作为推举依据.所提出的算法具有较好的时间复杂度和消息复杂度,且均为O(n),第一个算法的性能比为O(n~(1/2)).仿真结果表明,本文提出的算法可构造较小规模的连通支配集以及延长网络生命时间.
Two algorithms are proposed for the construction of the minimal connected dominating set of WSNs based on two-hop independent neighbor coverage. In the two construction algorithms, the selected dominating node proposes a new dominating node and requires that the newly elected dominating node completely cover the dominance Hop independent neighbors of the node.The first algorithm does not consider the energy factor and is based on the sum of the hop size of the node being elected and the size of the set of independent hop nodes of two independent hops as the new dominating node. The maximum of the quotient of the remaining energy of nodes and the number of nodes with two hops that are covered by them is used as the basis for the recommendation. The proposed algorithm has better time complexity and message complexity, both of which are O (n) And the performance ratio is O (n ~ (1/2)). The simulation results show that the proposed algorithm can construct smaller-scale connected dominating set and extend network lifetime.