Modified Minimum Connected Dominating Set formation for Wireless Adhoc Networks
نویسندگان
چکیده
Nodes of minimum connected dominating set (MCDS) form a virtual backbone in a wireless adhoc network. In this paper, a modified approach is presented to determine MCDS of an underlying graph of a Wireless Adhoc network. Simulation results for a variety of graphs indicate that the approach is efficient in determining the MCDS as compared to other existing techniques.
منابع مشابه
A Dominating-set-based Routing Scheme in Ad Hoc Wireless Networks 1
E cient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad-hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the searching space for a route is reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, we p...
متن کاملA polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
A connected dominating set in a graph is a subset of vertices such that every vertex is either in the subset or adjacent to a vertex in the subset and the subgraph induced by the subset is connected. A minimum-connected dominating set is such a vertex subset with minimum cardinality. An application in ad hoc wireless networks requires the study of the minimum-connected dominating set in unit-di...
متن کاملTotal dominating set based algorithm for connected dominating set in Ad hoc wireless networks
In an efficient design of routing protocols in ad hoc wireless networks, the connected dominating set (CDS) is widely used as a virtual backbone. To construct the CDS with its size as minimum, many heuristic, meta-heuristic, greedy, approximation and distributed algorithmic approaches have been proposed in the recent years. These approaches mostly concentrated on deriving independent set and th...
متن کامل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 outp...
متن کاملOn minimum connected dominating set problem in unit-ball graphs
Given a graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D such that its induced subgraph is connected and each vertex outside D has at least one neighbor in D. Approximations of minimum connected dominating sets are often used to represent a virtual routing backbone in wireless networks. This paper proposes a constant-ratio approximation a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0912.4323 شماره
صفحات -
تاریخ انتشار 2009