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
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
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
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and 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
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
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
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
On construction of quality fault-tolerant virtual backbone in wireless networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Connected dominating sets (CDS) that serve as a virtual backbone are now widely used to facilitate routing in wireless networks. A k-connected m-dominating set (kmCDS) is necessary for fault tolerance and routing flexibility. In order to construct a kmCDS with the minimum size, some approximation algorithms have been proposed in literature. However, the proposed algorithms either only consider some special cases where k=1, 2 or k驴m, or not easy to implement, or cannot provide performance ratio. In this paper, we propose a centralized heuristic algorithm, CSAA, which is easy to implement, and two distributed algorithms, DDA and DPA, which are deterministic and probabilistic methods respectively, to construct a kmCDS for general k and m. Theoretical analysis and simulation results indicate that our algorithms are efficient and effective.