Abstract:

This paper proposes a central construction algorithm of weakly connected dominating sets in wireless networks by constructing edge dominating sets，simultaneously gives two pruning strategies to reduce the size of the produced set.The time complexity of the algorithm is O（|N|+|E|）.It proves the correctness of the algorithm and shows the effectiveness of the algorithm.Compared to existed results，the algorithm proposed produces weakly dominating sets with smaller size.

Key words: wireless networks, weakly connected dominating set, edge dominating set

摘要： 通过构造边支配集，提出了求解无线网络中弱连通支配集的集中式构造算法，该算法的时间复杂度为O（|N|+|E|）。同时在保证支配集的支配性和弱连通性不变的情况下，给出了两种修剪策略，以减小所求弱连通支配集的规模。从理论上证明了本算法的正确性，并通过仿真验证了算法的有效性。与已有结果相比，该算法可以产生规模更小的弱连通支配集。

关键词: 无线网络, 弱连通支配集, 边支配集