WSN中有效的最小单位圆集覆盖算法*

针对具有不同传输半径的无线传感器网络覆盖与广播数据转发问题，提出了一种以最小单位圆覆盖集作为广播数据转发集的算法。该算法能有效计算出覆盖范围的轮廓集，具有最优的时间复杂度O(n log n)。对每个节点，该算法以其最少数量的邻居节点子集实现所有邻居节点的覆盖，并证明了该算法找到的最小单位圆覆盖集与其轮廓集是相等的。详细的仿真实验及与现有算法的比较表明，提出的覆盖算法不仅以最少数量的节点实现了网络覆盖与广播数据转发，同时延长了网络生命期。

Efficient minimum unit disks set coverage algorithm in wireless sensor networks

To overcome coverage and broadcasting data forwarding problems in wireless sensor networks with different transmission radius nodes,this paper proposed a novel algorithm based on minimum unit disks cover set to forward broadcasting data, which could calculate skyline set efficiently with the optimal time complexity O(n log n).The proposed algorithm covered each node with minimum unit disk cover set, and the minimum unit disk cover set of a node was equivalent to its skyline set. Detailed simulation results and comparisons with existed algorithms prove that the proposed algorithm not only covers all nodes with minimum nodes, but also prolongs the network lifetime.