Smallest-last ordering and clustering and graph coloring algorithms
Journal of the ACM (JACM)
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Experimental analysis of simple, distributed vertex coloring algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the Domatic Number
SIAM Journal on Computing
Linear Orderings of Random Geometric Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Constant density spanners for wireless ad-hoc networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Energy conservation via domatic partitions
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A tight bound for online colouring of disk graphs
Theoretical Computer Science
A log-star distributed maximal independent set algorithm for growth-bounded graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Efficient clusterhead rotation via domatic partition in self-organizing sensor networks
Wireless Communications & Mobile Computing
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
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
Local Algorithms: Self-stabilization on Speed
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Location oblivious distributed unit disk graph coloring
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Infrastructure-establishment from scratch in wireless sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Distributed algorithms for coloring and domination in wireless ad hoc networks
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
A coloring based backbone construction algorithm in wireless ad hoc network
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Constructing efficient rotating backbones in wireless sensor networks using graph coloring
Computer Communications
Domatic partition in homogeneous wireless sensor networks
Journal of Network and Computer Applications
Hi-index | 0.00 |
We recently proposed in [19,20] to use sequential graph coloring as a systematic algorithmic method to build (1−ε) dominating sets partition in Wireless Sensor Networks (WSN) modeled as Random Geometric Graphs (RGG). The resulting partition of the network into dominating and almost dominating sets can be used as a series of rotating backbones in a WSN to prolong the network lifetime for the benefit of various applications. Graph coloring algorithms in RGGs offer proven constant approximation guarantees on the chromatic number. In this paper, we demonstrate that by combining a local vertex ordering with the greedy color selection strategy, we can in practice, minimize the number of colors used to color an RGG within a very narrow window of the chromatic number and concurrently also obtain a domatic partition size within a competitive factor of the domatic number. We also show that the minimal number of colors results in the first (δ+1) color classes being provably dense enough to form independent sets that are (1−ε) dominating. The resulting first (δ+1) independent sets, where δ is the minimum degree of the graph, are shown to cover typically over 99% of the nodes (e.g. εε) dominating sets partition problem. These algorithms are both topology and geometry-based and yield O(1) times the chromatic number. They are also shown to be inherently localized with running times in O(Δ) where Δ is the maximum degree of the graph.