Improved approximation algorithms for uniform connectivity problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Message-optimal connected dominating sets in 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
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
On Constructing k-Connected k-Dominating Set in Wireless Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On greedy construction of connected dominating sets in wireless networks: Research Articles
Wireless Communications & Mobile Computing - RRM for Next-Generation Wireless and Mobile Communication Systems
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
IEEE Transactions on Mobile Computing
Algorithms for minimum m-connected k-tuple dominating set problem
Theoretical Computer Science
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Trade-off scheme for fault tolerant connected dominating sets on size and diameter
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Proceedings of the 7th ACM international symposium on Mobility management and wireless access
Algorithms for minimum m-connected k-dominating set problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
On the design of bi-connected wireless mesh network infrastructure with QoS constraints
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Deploying sensor networks with guaranteed fault tolerance
IEEE/ACM Transactions on Networking (TON)
INFOCOM'10 Proceedings of the 29th conference on Information communications
Two algorithms for minimum 2-connected r-hop dominating set
Information Processing Letters
On quantifying the quality of CDS-based virtual backbones in mobile ad hoc networks
Proceedings of the 8th ACM international workshop on Mobility management and wireless access
Poly: A reliable and energy efficient topology control protocol for wireless sensor networks
Computer Communications
On the design of reliable wireless mesh network infrastructure with QoS constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the construction of k-connected m-dominating sets in wireless networks
Journal of Combinatorial Optimization
Journal of Network and Computer Applications
Relay placement for two-connectivity
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Quantifying connectivity in wireless sensor networks with grid-based deployments
Journal of Network and Computer Applications
On construction of quality fault-tolerant virtual backbone in wireless networks
IEEE/ACM Transactions on Networking (TON)
Ad hoc node connectivity improvement analysis - Why not through mesh clients?
Computers and Electrical Engineering
Hi-index | 0.01 |
Virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem in ad hoc networks. Since the nodes in the virtual backbone need to carry other node's traffic, and node and link failure are inherent in wireless networks, it is desirable that the virtual backbone is fault tolerant. In this paper, we propose a new algorithm called Connecting Dominating Set Augmentation (CDSA) to construct a 2-connected virtual backbone which can resist the failure of one wireless node. We show that CDSA has guaranteed quality by proving that the size of the CDSA constructed 2- connected backbone is within a constant factor of the optimal 2- connected virtual backbone size. Through extensive simulations, we demonstrate that in practice, CDSA can build a 2-connected virtual backbone with only small overhead.