Results 1  10
of
564,035
Construction Algorithms for kConnected mDominating Sets in Wireless Sensor Networks
 MOBIHOC'08
, 2008
"... A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected mDominating Set (kmCDS) is necessary for fault tolerance and routing flexibility. Some approximation algorithms have been p ..."
Abstract

Cited by 30 (2 self)
 Add to MetaCart
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected mDominating Set (kmCDS) is necessary for fault tolerance and routing flexibility. Some approximation algorithms have been
A Better Constant Approximation for Minimum 3connected mdominating Set Problem in Unit Disk Graph using Tutte Decomposition
"... Over years, virtual backbone has attracted lots of attentions as a promising approach to deal with the broadcasting storm problem in wireless networks. One popular way to construct a quality virtual backbone is to solve the minimum connected dominating set problem. However, a virtual backbone comput ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
computed in this way is not resilient against topology change since the induced graph by the connected dominating set is onevertexconnected. As a result, the minimum kconnected mdominating set problem is introduced to construct a faulttolerant virtual backbone. Currently, the best known approximation
CONSTRUCTING KCONNECTED MDOMINATING SETS IN WIRELESS SENSOR NETWORKS
"... working as a virtual backbone in a wireless sensor network is necessary for fault tolerance and routing flexibility. In order to construct a kmCDS with the minimum size, some approximation algorithms have been proposed in the literature. However, all of those algorithms only consider some special ca ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
cases where k =1, 2 or k = m. In this paper, we propose one centralized heuristic algorithm CGA and one distributed algorithms, DDA which is deterministic, to construct a kmCDS for general k and m. Simulation results are also presented to evaluate our algorithms and the results show that our algorithms
On Approximating Minimum 3connected mdominating Set Problem in Unit Disk Graph
, 2015
"... Over years, virtual backbone has attracted lots of attentions as a promising approach to deal with the broadcasting storm problem in wireless networks. Frequently, the problem of a quality virtual backbone is formulated as a variation of the minimum connected dominating set problem. However, a virtu ..."
Abstract
 Add to MetaCart
known approximation algorithm for the problem in unit disk graph by Wang et al. assumes k 3 and m 1 and its performance ratio is 280 when k = m = 3. In this paper, we use a classical result from graph theory, Tutte decomposition, to design a new approximation algorithm for the problem in unit disk
On the construction of kconnected mdominating sets in wireless networks
 J COMB OPTIM
, 2012
"... ..."
A New Constant Factor Approximation for Computing 3Connected mDominating Sets in Homogeneous Wireless Networks
"... Abstractâ€”In this paper, we study the problem of constructing quality faulttolerant Connected Dominating Sets (CDSs) in homogeneous wireless networks, which can be defined as minimum kConnected mDominating Set ((k, m)CDS) problem in Unit Disk Graphs (UDGs). We found that every existing approximat ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Abstractâ€”In this paper, we study the problem of constructing quality faulttolerant Connected Dominating Sets (CDSs) in homogeneous wireless networks, which can be defined as minimum kConnected mDominating Set ((k, m)CDS) problem in Unit Disk Graphs (UDGs). We found that every existing
A Threshold of ln n for Approximating Set Cover
 JOURNAL OF THE ACM
, 1998
"... Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NPhar ..."
Abstract

Cited by 778 (5 self)
 Add to MetaCart
Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NP
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1787 (72 self)
 Add to MetaCart
computational rule, the sumproduct algorithm operates in factor graphs to computeeither exactly or approximatelyvarious marginal functions by distributed messagepassing in the graph. A wide variety of algorithms developed in artificial intelligence, signal processing, and digital communications can
Determining the Number of Factors in Approximate Factor Models
, 2000
"... In this paper we develop some statistical theory for factor models of large dimensions. The focus is the determination of the number of factors, which is an unresolved issue in the rapidly growing literature on multifactor models. We propose a panel Cp criterion and show that the number of factors c ..."
Abstract

Cited by 538 (29 self)
 Add to MetaCart
In this paper we develop some statistical theory for factor models of large dimensions. The focus is the determination of the number of factors, which is an unresolved issue in the rapidly growing literature on multifactor models. We propose a panel Cp criterion and show that the number of factors
Results 1  10
of
564,035