Smallest-last ordering and clustering and graph coloring algorithms
Journal of the ACM (JACM)
Approximating the Domatic Number
SIAM Journal on Computing
Random Geometric Problems on [0, 1]²
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
GS3: scalable self-configuration and self-healing in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
Low-coordination topologies for redundancy in sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
ExScal: Elements of an Extreme Scale Wireless Sensor Network
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Energy conservation via domatic partitions
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A point-distribution index and its application to sensor-grouping in wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Layered Diffusion based Coverage Control in Wireless Sensor Networks
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
Algorithms for Sensor and Ad Hoc Networks: Advanced Lectures (Lecture Notes in Computer Science)
Algorithms for Sensor and Ad Hoc Networks: Advanced Lectures (Lecture Notes in Computer Science)
Review: Coverage and connectivity issues in wireless sensor networks: A survey
Pervasive and Mobile Computing
Sleep scheduling for wireless sensor networks via network flow model
Computer Communications
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Constructing efficient rotating backbones in wireless sensor networks using graph coloring
Computer Communications
| Hi-index | 0.00 |
The domatic partition problem seeks to maximize the partitioning of the nodes of the network into disjoint dominating sets. These sets represent a series of virtual backbones for wireless sensor networks to be activated successively, resulting in more balanced energy consumption and increased network robustness. In this study, we address the domatic partition problem in random geometric graphs by investigating several vertex coloring algorithms both topology and geometry-aware, color-adaptive and randomized. Graph coloring produces color classes with each class representing an independent set of vertices. The disjoint maximal independent sets constitute a collection of disjoint dominating sets that offer good network coverage. Furthermore, if we relax the full domination constraint then we obtain a partitioning of the network into disjoint dominating and nearly-dominating sets of nearly equal size, providing better redundancy and a near-perfect node coverage yield. In addition, these independent sets can be the basis for clustering a very large sensor network with minimal overlap between the clusters leading to increased efficiency in routing, wireless transmission scheduling and data-aggregation. We also observe that in dense random deployments, certain coloring algorithms yield a packing of the nodes into independent sets each of which is relatively close to the perfect placement in the triangular lattice.