Approximation algorithm based on uniform clustering for 2-domatic partition

To balance the energy consumption of nodes and maximize the lifetime of wireless sensor networks, a sleeping schedule mechanism which rotates the dominators is proposed. One abstraction considered for the sleeping schedule is the domatic partition problem, whose essence is to find some disjoint dominating sets and to achieve an energy efficient sleeping schedule by rotating them. This paper solves the 2-domatic partition problem. Based on uniform clustering, a constant-factor approximation algorithm DPUC (domatic partition by uniform clustering) is proposed for 2-domatic partition with the approximate radio of (δ+1)/4, where (is the minimum degree of nodes. The algorithm runs in a constant-rounds time and can be extended into a k-DP approximation algorithm. Meanwhile, the algorithm solves one open problem proposed by Pemmaraju and Pirwani. That is, whether a k-DP algorithm can run in a constant-rounds time using connectivity information only. Finally, the simulations demonstrate the correctness and feasibility of the DPUC algorithm. © Copyright 2011, Editorial Department of Journal of Software. All rights reserved.