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
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
CARD: a contact-based architecture for resource discovery in wireless ad hoc networks
Mobile Networks and Applications
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
Statistical model of lossy links in wireless sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
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
Opportunity-Based Topology Control in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Message ferries as generalized dominating sets in intermittently connected mobile networks
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
IEEE Transactions on Evolutionary Computation - Special issue on preference-based multiobjective evolutionary algorithms
Practical unicast and convergecast scheduling schemes for cognitive radio networks
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
Minimum Connected Dominating Sets (MCDSs) are used as virtual backbones for efficient routing and broadcasting in wireless networks extensively. However, the MCDS problem is NP-Complete even in Unit Disk Graphs. Therefore, many heuristic-based approximation algorithms have been proposed recently. In these approaches, networks are deterministic where two nodes are assumed either connected or disconnected. In most real applications, however, there are many intermittently connected wireless links called lossy links, which only provide probabilistic connectivity. For wireless networks with lossy links, we propose a Probabilistic Network Model (PNM). Under this model, we measure the quality of Connected Dominating Sets (CDSs) using CDS reliability defined as the minimum upper limit of the node-to-node delivery ratio between any pair of dominators in a CDS. We attempt to construct a MCDS while its reliability is above a preset application-specified threshold, called Reliable MCDS (RMCDS). We claim that constructing a RMCDS is NP-Hard under the PNM model. We propose a novel Genetic Algorithm (GA) called RMCDS-GA to solve the RMCDS problem. To evaluate the performance of RMCDS-GA, we conduct comprehensive simulations. The simulation results show that compared with the traditional MCDS algorithms, RMCDS-GA can construct a more reliable CDS without increasing the size of a CDS.