Results 1 
2 of
2
Maximizing Lifetime of ConnectedDominatingSet in Cognitive Radio Networks
"... Abstract. Connecteddominatingset (CDS) is a representative technique for constructing a virtual backbone of wireless networks. Most of existing works on CDS aim at minimizing the size of the CDS, i.e., constructing the minimum CDS (MCDS), so as to reduce the communication overhead over the CDS. Ho ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Connecteddominatingset (CDS) is a representative technique for constructing a virtual backbone of wireless networks. Most of existing works on CDS aim at minimizing the size of the CDS, i.e., constructing the minimum CDS (MCDS), so as to reduce the communication overhead over the CDS. However, MCDS may not work well in cognitive radio networks (CRNs) where communication links are prone to failure due to the unpredictable activities of primary users. A MCDS without consideration of stochastic activities of primary users easily becomes invalid when the primary users reclaim the licensed spectrum. In this work, we assume that the activities of primary users follow the exponential distribution. Our problem is to maximize the lifetime of the CDS while minimizing the size of the CDS, where the lifetime of a CDS is defined as the expected duration that the CDS is maintained valid. We show that the problem is NPhard and propose a threephase algorithm. Our basic idea is to apply a pruningbased approach to maximize the lifetime of the CDS. Given a CRN, we prove that our algorithm can compute a CDS such that i) the lifetime of the CDS is maximized (optimal); and ii) the size of the CDS is upperbounded. To the best of our knowledge, it is the first time in the literature that CDS in CRNs is studied and an effective algorithm is proposed.
Applications of Dominating Set of Graph in Computer Networks
, 2014
"... The aim of the paper is to impart the importance of graph theoretical concepts and the applications of domination in graphs to various real life situations in the areas of science and engineering. In a graph G = (V, E), a set S ⊆ V(G) is said to be a dominating set of G if every vertex in V–S is adj ..."
Abstract
 Add to MetaCart
The aim of the paper is to impart the importance of graph theoretical concepts and the applications of domination in graphs to various real life situations in the areas of science and engineering. In a graph G = (V, E), a set S ⊆ V(G) is said to be a dominating set of G if every vertex in V–S is adjacent to atleast one vertex in S. A set S ⊆ V(G) is said to be a connected dominating set of G if S is dominating set and also the subgraph <S> induced by S is connected. The research has been carried out extensively in various types of dominating sets. This paper explores mainly on the applications of dominating sets in computer networks.