A unified approach to domination problems on interval graphs
Information Processing Letters
Approximating the Domatic Number
SIAM Journal on Computing
Selecting forwarding neighbors in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Energy conservation via domatic partitions
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
Efficient clusterhead rotation via domatic partition in self-organizing sensor networks
Wireless Communications & Mobile Computing
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
| Hi-index | 0.00 |
In wireless sensor networks, rotating dominating sets periodically is an important technique, for balancing energy consumption of nodes and hence maximizing the lifetime of the networks. This technique can be abstracted as the domatic partition problem, which partitions the set of nodes in networks into disjoint dominating sets. Through rotating each dominating set in the domatic partition periodically, the energy consumption of nodes can be greatly balanced and the lifetime of the network can be prolonged. In order to solve the domatic partition problem, 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 new constant-factor approximation algorithm for domatic partition using the property of the skyline of uniform radius disks. The algorithm is called distributed nucleus algorithm (DNA). In addition, we show that DNA can be implemented in constant rounds in the congest model.