A greedy algorithm for the fault-tolerant connected dominating set in a general graph

Jiao Zhou, Zhao Zhang (), Weili Wu and Kai Xing
Additional contact information
Jiao Zhou: Xinjiang University
Zhao Zhang: Xinjiang University
Weili Wu: University of Texas at Dallas
Kai Xing: University of Texas at Dallas

Journal of Combinatorial Optimization, 2014, vol. 28, issue 1, No 16, 310-319

Abstract: Abstract Using a connected dominating set (CDS) to serve as the virtual backbone of a wireless network is an effective way to save energy and alleviate broadcasting storm. Since nodes may fail due to an accidental damage or energy depletion, it is desirable that the virtual backbone is fault tolerant. A node set $$C$$ C is an $$m$$ m -fold connected dominating set ( $$m$$ m -fold CDS) of graph $$G$$ G if every node in $$V(G)\setminus C$$ V ( G ) ∖ C has at least $$m$$ m neighbors in $$C$$ C and the subgraph of $$G$$ G induced by $$C$$ C is connected. In this paper, we will present a greedy algorithm to compute an $$m$$ m -fold CDS in a general graph, which has size at most $$2+\ln (\Delta +m-2)$$ 2 + ln ( Δ + m − 2 ) times that of a minimum $$m$$ m -fold CDS, where $$\Delta $$ Δ is the maximum degree of the graph. This result improves on the previous best known performance ratio of $$2H(\Delta +m-1)$$ 2 H ( Δ + m − 1 ) for this problem, where $$H(\cdot )$$ H ( · ) is the Harmonic number.

Keywords: $$m$$ m -fold connected dominating set; Non-submodular potential function; Greedy algorithm (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9638-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:28:y:2014:i:1:d:10.1007_s10878-013-9638-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9638-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().