On approximation algorithms of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-connected <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>m</mml:mi></mml:math>-dominating sets in disk graphs

Thai, My T.; Zhang, Ning; Tiwari, Ravi; Xu, Xin

doi:10.1016/j.tcs.2007.05.025

Cited by 77 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, it also makes the maintenance of the virtual backbone easier. For this reason, most research studies in this area focus on reducing the size of a CDS (Thai et al, 2007a;2007b;Funke et al, 2006;Zeng et al, 2006). Unfortunately, the problem of determining the minimum connected dominating set in an undirected graph is NP-complete.…”

Section: Jcsmentioning

confidence: 99%

Construction of Strategic Connected Dominating Set for Mobile Ad Hoc Networks

Sharmila¹

2014

Journal of Computer Science

View full text Add to dashboard Cite

Connected Dominating Sets (CDSs) can serve as virtual backbones for wireless networks. A smaller virtual backbone (minimum size CDS) incurs less communication overhead. Unfortunately, computing a minimum size CDS is NP-hard and thus many algorithms were developed which concentrates on how to construct smaller CDSs. Aiming for minimum number of nodes in CDS, results in CDSs that are highly unstable. Here we present four CDS algorithms which are constructed based on strategy, density, Threshold Neighborhood Distance Ratio (TNDR) and velocity. Any node in the network can be a strategic node depending upon the application and need and will be selected as the starting node instead of the node with highest density which concentrates on minimum size CDS. Simulation methods are used to establish the efficiency of the proposed algorithm.

show abstract

Section: Jcsmentioning

confidence: 99%

Construction of Strategic Connected Dominating Set for Mobile Ad Hoc Networks

Sharmila¹

2014

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…Dai and Wu [18] firstly introduced two greedy algorithms to computer the MCDS in a general G ; both of them were polynomial time algorithms. Some works [18–20, 22] focused on constructing k -connected m -dominating sets for fault tolerance, and most of these works used a UDG as their network model. Wu et al [23] proposed a CDS construction algorithm using an energy model which was also adopted in other works [24, 25].…”

Section: Related Workmentioning

confidence: 99%

“…Then, each dominator node noticed the dominate nodes in this subgraph to join the CDS. FT-CDS-CA [36] studied the problem of constructing fault-tolerant CDS and proposed a constant factor polynomial time approximation algorithm to compute (3, m )-CDS, which was similar to the method used in [22]. SSC [37] was the first self-stabilizing distributed ( k , r ) algorithm, which used synchronous multiple paths to improve security, availability, and fault tolerance of the algorithm.…”

Section: Related Workmentioning

confidence: 99%

Constructing a CDS-Based Network Backbone for Data Collection in Wireless Sensor Networks

Kui

Sheng

et al. 2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Data collection is one of the most important operations in wireless sensor networks. Currently, many researches focus on using a connected dominating set to construct a virtual backbone for data collection in WSNs. Most researchers concentrate on how to construct a minimum connected dominating set because a small virtual backbone incurs less maintenance. Unfortunately, computing a minimum size CDS is NP-hard, and the minimum connected dominating sets may result in unbalanced energy consumption among nodes. In this paper, we investigate the problem of constructing an energy-balanced CDS to effectively preserve the energy of nodes in order to extend the network lifetime in data collection. An energy-balanced connected dominating set scheme named DGA-EBCDS is proposed, and each node in the network can effectively transmit its data to the sink through the virtual backbone. When constructing the virtual backbone in DGA-EBCDS, we prioritize selecting those nodes with higher energy and larger degree. This method makes the energy consumption among nodes more balanced. Furthermore, the routing decision in DGA-EBCDS considers both the path length and the remaining energy of nodes in the path; it further prolongs the lifetime of nodes in the backbone. Our conclusions are verified by extensive simulation results.

show abstract

“…That is, if each node in D constructs a routing table in H, every node can communicate with each other via routing in H since D is a connected twin dominating set. Recently, the construction of a connected dominating set in a network have been extensively studied in the literature [8,12,13,16]. …”

Section: Introductionmentioning

confidence: 99%

Connected k-tuple twin domination in de Bruijn and Kautz digraphs

Araki

2009

Discrete Mathematics

View full text Add to dashboard Cite

a b s t r a c tFor a digraph G, a k-tuple twin dominating set D of G for some fixed k ≥ 1 is a set of vertices such that every vertex is adjacent to at least k vertices in D, and also every vertex is adjacent from at least k vertices in D. If the subgraph of G induced by D is strongly connected, then D is called a connected k-tuple twin dominating set of G. In this paper, we give constructions of minimal connected k-tuple twin dominating sets for de Bruijn digraphs and Kautz digraphs.

show abstract

On approximation algorithms of k-connected m-dominating sets in disk graphs

Cited by 77 publications

References 13 publications

Construction of Strategic Connected Dominating Set for Mobile Ad Hoc Networks

Construction of Strategic Connected Dominating Set for Mobile Ad Hoc Networks

Constructing a CDS-Based Network Backbone for Data Collection in Wireless Sensor Networks

Connected k-tuple twin domination in de Bruijn and Kautz digraphs

Contact Info

Product

Resources

About