Energy conservation via domatic partitions

Using a dominating set as a coordinator in wireless networks has been proposed in many papers as an energy conservation technique. Since the nodes in a dominating set have the extra burden of coordination, energy resources in such nodes will drain out more quickly than in other nodes. To maximize the lifetime of nodes in the network, it has been proposed that the role of coordinators be rotated among the nodes in the network. One abstraction that has been considered for the problem of picking a collection of coordinators and cycling through them, is the domatic partition problem. This is the problem of partitioning the set of the nodes of the network into dominating sets with the aim of maximizing the number of dominating sets. In this paper, we consider the k-domatic partition problem. A k-dominating set is a subset D of nodes such that every node in the network is at distance at most k from D. The k-domatic partition problem seeks to partition the network into maximum number of k-do...

• Type: Conference
• Year: 2006
• Where: MOBIHOC
• Authors: Sriram V. Pemmaraju, Imran A. Pirwani
• Keywords: Energy Conservation Technique, Extra Burden, K-domatic Partition Problem, MOBIHOC 2006, Wireless Networks