Solving Connected Dominating Set Problem in Unit Disk Graphs by Genetic Algorithms
نویسندگان
چکیده
In this paper, we use Genetic Algorithms to find the Minimum Connected Dominating Set (MCDS) of Unit Disk Graphs (UDG). UDGs are used for modeling ad-hoc networks and finding MCDS in such graphs is a promising approach to construct an efficient virtual backbone in wireless ad-hoc networks. The MCDS problem is proved to be NP-complete. The simulation results show that the proposed algorithm outperforms the existing CDS-based backbone formation algorithms in terms of the backbone size. KeywordsWireless ad-hoc networks, Backbone formation, Genetic algorithm, Connected dominating set
منابع مشابه
Impact of Locality on Location Aware Unit Disk Graphs
Due to their importance for studies oi wireless networks, recent years have seen a surge of activity on the design of local algorithms for the solution of a variety of network tasks. We study the behaviour of algorithms with very low localities. Despite of this restriction we propose local constant ratio approximation algorithms for solving minimum dominating and connected dominating set, maxim...
متن کاملDistributed Approximation Algorithms in Unit-Disk Graphs
We will give distributed approximation schemes for the maximum matching problem and the minimum connected dominating set problem in unit-disk graphs. The algorithms are deterministic, run in a poly-logarithmic number of rounds in the message passing model and the approximation error can be made O(1/ log |G|) where |G| is the order of the graph and k is a positive integer.
متن کاملApproximation Algorithms for Unit Disk Graphs
Mobile ad hoc networks are frequently modeled by unit disk graphs. We consider several classical graph theoretic problems on unit disk graphs (Maximum Independent Set, Minimum Vertex Cover, and Minimum (Connected) Dominating Set), which are relevant to such networks. We propose two new notions for unit disk graphs: thickness and density. The thickness of a graph is the number of disk centers in...
متن کامل(6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
It was a long-standing open problem whether the minimum weight dominating set in unit disk graphs has a polynomial-time constant-approximation. In 2006, Ambühl et al solved this problem by presenting a 72-approximation for the minimum weight dominating set and also a 89-approximation for the minimum weight connected dominating set in unit disk graphs. In this paper, we improve their results by ...
متن کاملConstant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs
Given an undirected graph on a node set V and positive integers k and m, a k-connected m-dominating set ((k,m)-CDS) is defined as a subset S of V such that each node in V \ S has at least m neighbors in S, and a k-connected subgraph is induced by S. The weighted (k,m)-CDS problem is to find a minimum weight (k,m)-CDS in a given node-weighted graph. The problem is called the unweighted (k,m)-CDS...
متن کامل