Domatic partition in homogeneous wireless sensor networks

Abstract

In wireless sensor networks, for balancing energy consumption of nodes and hence maximizing the lifetime of the networks, an important technique is to rotate dominating sets periodically. This technique can be abstracted as domatic partition (DP) problem, which is the problem of partitioning the set of nodes in networks into disjoint dominating sets. Through rotating each dominating set of DP periodically, the energy consumption of nodes can be greatly balanced and the lifetime of the networks can be prolonged in turn. In this paper, for homogenous wireless sensor networks, we present a Cell Structure which is constructed as follows. Firstly, the network is divided into clusters, and then a clique is constructed in each cluster. Based on the Cell Structure, we propose a centralized nucleus algorithm for DP, which is called centralized nucleus domatic partition (CNDP) algorithm. We show that the algorithm balances the energy consumption by adopting sleep scheduling and maximizes the lifetime of the networks based on the domatic number. Through analysis, the domatic number of the algorithm is N/6, where N is the number of nodes in the clique.