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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Virtual backbone construction in multihop ad hoc wireless networks: Research Articles
Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
Middleware: Middleware Challenges and Approaches for Wireless Sensor Networks
IEEE Distributed Systems Online
Minimum connected dominating sets and maximal independent sets in unit disk graphs
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
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
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
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
A linearization framework for unconstrained quadratic (0-1) problems
Discrete Applied Mathematics
Minimum-latency aggregation scheduling in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Load-balanced CDS construction in wireless sensor networks via genetic algorithm
International Journal of Sensor Networks
Optimal Distributed Data Collection for Asynchronous Cognitive Radio Networks
ICDCS '12 Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems
Continuous Data Collection Capacity of Dual-Radio Multichannel Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 5.23 |
Inspired by the backbone concept in wired networks, a Virtual Backbone (VB) is expected to benefit routing in Wireless Sensor Networks (WSNs). A Connected Dominating Set (CDS) based VB is a competitive approach among the existing methods used to establish VBs in WSNs. Most existing works focus on constructing a Minimum-sized CDS (MCDS), a k-connected m-dominating CDS, a minimum routing cost CDS or a bounded-diameter CDS. However, few works consider the load-balance factor. In this work, the size and the load-balance factors are both taken into account when constructing a VB in WSNs. Specifically, three NP-hard problems are investigated in the paper, namely, the MinMax Degree Maximal Independent Set (MDMIS) problem, the Load-Balanced Virtual Backbone (LBVB) problem, and the MinMax Valid-degree non-Backbone node Allocation (MVBA) problem. Furthermore, their approximation algorithms and comprehensive theoretical analysis of the approximation factors are presented. Finally, our theoretical analysis and the simulation results indicate that the proposed algorithms outperform the existing state-of-the-art approaches.