Constructing efficient rotating backbones in wireless sensor networks using graph coloring

Authors:
Dhia Mahjoub;David W. Matula
Affiliations:
Bobby B. Lyle School of Engineering, Southern Methodist University, Dallas, TX 75275-0122, USA;Bobby B. Lyle School of Engineering, Southern Methodist University, Dallas, TX 75275-0122, USA
Venue:
Computer Communications
Year:
2012

Citing 22
Cited 0

Geometric Spanners for Wireless Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Geometric ad-hoc routing: of theory and practice

Proceedings of the twenty-second annual symposium on Principles of distributed computing
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
Localized algorithms for energy efficient topology in wireless ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
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
Protocols and Architectures for Wireless Sensor Networks

Protocols and Architectures for Wireless Sensor Networks
Energy conservation via domatic partitions

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and 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)
Testing bipartiteness of geometric intersection graphs

ACM Transactions on Algorithms (TALG)
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
Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms

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
Energy-efficient coverage problems in wireless ad-hoc sensor networks

Computer Communications
Energy-efficient data acquisition using a distributed and self-organizing scheduling algorithm for wireless sensor networks

DCOSS'07 Proceedings of the 3rd 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
Building (1-ε) dominating sets partition as backbones in wireless sensor networks using distributed graph coloring

DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
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
Geometric spanners for routing in mobile networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

For a dense deployment of sensors modeled as a random geometric graph of minimum degree @d, we introduce efficient algorithms both centralized and distributed for selecting (@d+1) backbones with disjoint node sets that are each independent and fully (or nearly) dominating. The backbone sets are initialized by graph coloring employing either topology or geometry. To support efficient routing, each set is extended to constitute a connected, constant density, planar backbone by using localized 2-hop relay and Gabriel Graph rules. The novel concept of a bipartite backbone is introduced with derivation of a planarity, bounded degree, and domination properties. Two algorithms for selecting (@d+1)/2 disjoint bipartite backbones are introduced and analyzed. One employs coloring and independent set pairing with dominating and relay sets of the pair each determined separately to serve the other. A second algorithm sequentially selects bipartite backbones focusing on the domination property of a primary part and the relay property of the second part to optimize the topological properties of each bipartite backbone. Extensive experimental results are presented to demonstrate the properties of the resulting backbone partitions.