A greedy algorithm for the minimum $$2$$ 2 -connected $$m$$ m -fold dominating set problem

Yishuo Shi, Yaping Zhang, Zhao Zhang () and Weili Wu
Additional contact information
Yishuo Shi: Xinjiang University
Yaping Zhang: Xinjiang University
Zhao Zhang: Xinjiang University
Weili Wu: University of Texas at Dallas

Journal of Combinatorial Optimization, 2016, vol. 31, issue 1, No 11, 136-151

Abstract: Abstract To save energy and alleviate interference in a wireless sensor network, connected dominating set (CDS) has been proposed as the virtual backbone. Since nodes may fail due to accidental damage or energy depletion, it is desirable to construct a fault tolerant CDS, which can be modeled as a $$k$$ k -connected $$m$$ m -fold dominating set $$((k,m)$$ ( ( k , m ) -CDS for short): a subset of nodes $$C\subseteq V(G)$$ C ⊆ V ( G ) is a $$(k,m)$$ ( k , m ) -CDS of $$G$$ G if every node in $$V(G)\setminus C$$ V ( G ) \ C is adjacent with at least $$m$$ m nodes in $$C$$ C and the subgraph of $$G$$ G induced by $$C$$ C is $$k$$ k -connected.In this paper, we present an approximation algorithm for the minimum $$(2,m)$$ ( 2 , m ) -CDS problem with $$m\ge 2$$ m ≥ 2 . Based on a $$(1,m)$$ ( 1 , m ) -CDS, the algorithm greedily merges blocks until the connectivity is raised to two. The most difficult problem in the analysis is that the potential function used in the greedy algorithm is not submodular. By proving that an optimal solution has a specific decomposition, we managed to prove that the approximation ratio is $$\alpha +2(1+\ln \alpha )$$ α + 2 ( 1 + ln α ) , where $$\alpha $$ α is the approximation ratio for the minimum $$(1,m)$$ ( 1 , m ) -CDS problem. This improves on previous approximation ratios for the minimum $$(2,m)$$ ( 2 , m ) -CDS problem, both in general graphs and in unit disk graphs.

Keywords: Fault-tolerant connected dominating set; Greedy algorithm; Non-submodular potential function (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9720-6 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:31:y:2016:i:1:d:10.1007_s10878-014-9720-6

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

DOI: 10.1007/s10878-014-9720-6

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 ().