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
Fast algorithms for k-shredders and k-node connectivity augmentation
Journal of Algorithms
Introduction to Algorithms
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
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
Virtual backbone construction in multihop ad hoc wireless networks: Research Articles
Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
On approximation algorithms of k-connected m-dominating sets in disk graphs
Theoretical Computer Science
On the construction of 2-connected virtual backbone in wireless networks
IEEE Transactions on Wireless Communications
Algorithms for minimum m-connected k-dominating set problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
NPART - node placement algorithm for realistic topologies in wireless multihop network simulation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Proceedings of the 7th ACM international symposium on Mobility management and wireless access
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the scalability of expanding ring search for dense wireless sensor networks
Journal of Parallel and Distributed Computing
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
Self-stabilizing (k,r)-clustering in wireless ad-hoc networks with multiple paths
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Efficient multi-hop broadcasting in wireless networks using k-shortest path pruning
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
A new pruning method for efficient broadcasting in ad hoc networks
International Journal of Mobile Network Design and Innovation
The fundamental limits of broadcasting in dense wireless mobile networks
Wireless Networks
Self-stabilizing (k,r)-clustering in clock rate-limited systems
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
Theoretical Computer Science
On construction of quality fault-tolerant virtual backbone in wireless networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a k-Connected m-Dominating Set (kmCDS) is necessary for fault tolerance and routing flexibility. Some approximation algorithms have been proposed to construct a kmCDS. However, most of them only consider some special cases where k = 1,2 or k ≤ m, or are not easy to implement, or have high message complexity. In this paper, we propose a novel distributed algorithm LDA with low message complexity to construct a kmCDS for general k and m whose size is guaranteed to be within a small constant factor of the optimal solution when the maximum node degree is a constant. We also propose one centralized algorithm ICGA with a constant performance ratio to construct a kmCDS. Theoretical analysis as well as simulation results are shown to evaluate the proposed algorithms.