Finding minimum weight connected dominating set in stochastic graph based on learning automata
نویسندگان
چکیده
Article history: Received 14 November 2008 Received in revised form 15 January 2012 Accepted 27 February 2012 Available online xxxx
منابع مشابه
Learning Automata-Based Algorithms for Finding Minimum Weakly Connected Dominating Set in Stochastic Graphs
A weakly connected dominating set (WCDS) of graph is a subset of so that the vertex set of the given subset and all vertices with at least one endpoint in the subset induce a connected sub‐graph of . Finding the WCDS is a new promising approach for clustering the wireless networks. The minimum WCDS (MWCDS) problem is known to be NP‐hard, and several approximation algo...
متن کاملMobility-based Multicast Routing Algorithm in Wireless Mobile Ad-Hoc Networks: A Learning Automata Approach
In this paper, we propose a distributed learning automata-based algorithm to solve the multicast routing problem in wireless mobile ad-hoc networks. The proposed algorithm estimates the expected relative mobility of each host, by sampling its movement parameters in various epochs, to realistically predict its motion behavior, and takes advantage of the Steiner connected dominating set to form t...
متن کاملDistributed Learning Automata-Based Clustering Algorithm in Wireless Ad Hoc Networks
In ad hoc networks, the performance is significantly degraded as the size of the network grows. The network clustering is a method by which the nodes are hierarchically organized on the basis of the proximity and thus the scalability problem is alleviated. Finding the weakly connected dominating set (WCDS) is a well-known approach, proposed for clustering the wireless ad hoc networks. Finding t...
متن کاملWeighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs
In this paper, we first propose three centralized learning automata-based heuristic algorithms for approximating a near optimal solution to the minimum weight Steiner connected dominating set (WSCDS) problem. Finding the Steiner connected dominating set of the network graph is a promising approach for multicast routing in wireless ad-hoc networks. Therefore, we present a distributed implementat...
متن کاملOn Hop Roman Domination in Trees
Let $G=(V,E)$ be a graph. A subset $Ssubset V$ is a hop dominating setif every vertex outside $S$ is at distance two from a vertex of$S$. A hop dominating set $S$ which induces a connected subgraph is called a connected hop dominating set of $G$. Theconnected hop domination number of $G$, $ gamma_{ch}(G)$, is the minimum cardinality of a connected hopdominating set of $G$...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Sci.
دوره 200 شماره
صفحات -
تاریخ انتشار 2012