Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks

Authors:
Manki Min;Hongwei Du;Xiaohua Jia;Christina Xiao Huang;Scott C.-H. Huang;Weili Wu
Affiliations:
Department of Computer Science and Engineering, University of Minnesota, Minneapolis, USA 55455;Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong;Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong;3M Center, USA 55144;Department of Computer Science and Engineering, University of Minnesota, Minneapolis, USA 55455;Department of Computer Science, University of Texas at Dallas, Richardson 75083
Venue:
Journal of Global Optimization
Year:
2006

Citing 12
Cited 22

MBONE: the multicast backbone

Communications of the ACM
An architecture for wide-area multicast routing

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Steiner tree problem with minimum number of Steiner points and bounded edge-length

Information Processing Letters
On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Message-optimal connected dominating sets in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Approximations for Steiner Trees with Minimum Number of Steiner Points

Journal of Global Optimization
Power Efficient Topologies for Wireless Sensor Networks

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Internal Nodes based Broadcasting in Wireless Networks

HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Minimizing the Number of Optical Amplifiers Needed to Support a Multi-Wavelength Optical LAN/MAN

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A greedy approximation for minimum connected dominating sets

Theoretical Computer Science
Approximation Algorithms for Connected Dominating Sets

Algorithmica

Energy-efficient broadcasting in wireless ad hoc networks: performance benchmarking and distributed algorithms based on network connectivity characterization

MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Minimum connected dominating sets and maximal independent sets in unit disk graphs

Theoretical Computer Science
Energy efficient distributed connected dominating sets construction in wireless sensor networks

Proceedings of the 2006 international conference on Wireless communications and mobile computing
A distributed algorithm for constructing energy-balanced connected dominating set in wireless sensor networks

International Journal of Sensor Networks
Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Construction of virtual backbone on growth-bounded graph with variable transmission range

WSEAS Transactions on Computers
PTAS for Minimum Connected Dominating Set in Unit Ball Graph

WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
A Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph

WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Construction of strongly connected dominating sets in asymmetric multihop wireless networks

Theoretical Computer Science
A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks

Journal of Global Optimization
A neural network model to minimize the connected dominating set for self-configuration of wireless sensor networks

IEEE Transactions on Neural Networks
A power-preserving broadcast protocol for wireless sensor networks

International Journal of Sensor Networks
A self-stabilizing distributed algorithm for minimum connected dominating sets in wireless sensor networks with different transmission ranges

ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Connectivity and coverage maintenance in wireless sensor networks

The Journal of Supercomputing
Managing a dynamic broadcast infrastructure in mobile ad hoc networks through distributed and asynchronous update of a virtual backbone

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Interference-aware, fully-distributed virtual backbone construction and its application in multi-hop wireless networks

IEEE Transactions on Communications
A maximal independent set based giant component formation in random unit-disk graphs

WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
A convex-hull based algorithm to connect the maximal independent set in unit-disk graphs

WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Constructing minimum interference connected dominating set for multi-channel multi-radio multi-hop wireless network

International Journal of Sensor Networks
Algorithms for the minimum weight k-fold (connected) dominating set problem

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The connected dominating set plays an important role in ad hoc wireless networking. Many constructions for approximating the minimum connected dominating set have been proposed in the literature. In this paper, we propose a new one with Steiner tree, which produces approximation solution within a factor of 6.8 from optimal. This approximation algorithm can also be implemented distributedly.