Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links

Du, Ding‐Zhu; Thai, My T.; Li, Yingshu; Liú, Dan; Zhu, Shiwei

doi:10.1007/11610113_2

Cited by 33 publications

(18 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Because the concept of dominating sets is highly related to the clustering in wireless networks such as routing and virtual backbone, there has been many work proposed in literature [6,7,9,10,11,12]. One of the standard problems is to find the minimum dominating set of a given graph.…”

Section: Dominating Sets Problemmentioning

confidence: 99%

O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks

Thai

Yingshu

Wang

2007

2007 IEEE International Performance, Computing, and Communications Conference

Self Cite

View full text Add to dashboard Cite

In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. Many centralized algorithms have been proposed to solve this problem. A very few distributed versions have also been presented but none of them obtains a good approximation ratio. In this paper, we propose two O(log n) localized algorithms. In particular, we first reduce the MTC problem to the domatic number problem in directed graphs. This relation shows that a feasible solution to the domatic number problem is also a feasible solution to the MTC problem. We next prove the lower and upper bounds of this domatic number. Based on this proof, we present two O(log n)-localized algorithms to solve the MTC problem.

show abstract

Section: Dominating Sets Problemmentioning

confidence: 99%

O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks

Thai

Yingshu

Wang

2007

2007 IEEE International Performance, Computing, and Communications Conference

Self Cite

View full text Add to dashboard Cite

show abstract

“…So far, the only exact algorithm is the trivial brute-force enumeration. The only work on SCDAS has thus far focused on heuristic approaches that target time-efficiency, knowing that constant-factor approximations are hard to obtain [1], [2], [3], [4], [5], [6]. We present a new heuristic algorithm that favors high-degree vertices when selecting members of the target dominating set.…”

Section: Scdas Is Np-complete By a Simple Reduction Frommentioning

confidence: 99%

A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks

Markarian¹,

Abu-Khzam²

2012

2012 International Conference on Innovations in Information Technology (IIT)

View full text Add to dashboard Cite

Virtual backbones of asymmetric wireless networks are special sub-nets through which routing can be performed. Such backbone must be as small as possible, and must be able to receive and transmit messages from/to each and every node in the network. The corresponding graph theoretic problem takes a directed graph as input and seeks a strongly connected dominating-absorbent set of smallest possible cardinality. We introduce a hybrid heuristic for this problem, in which we combine low-degree vertex elimination and high-degree vertex selection. This simple and efficient method yields very promising experimental results, outperforming known heuristic algorithms.

show abstract

“…Although the CDS problem has been extensively studied [7][8][9][10][11][12][13][14][15], little research has been done on the fault tolerant CDS problem. Dai and Wu addressed the problem of constructing k-Connected k-Dominating Set (k-CDS) [3].…”

Section: Related Workmentioning

confidence: 99%

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

Thai

Zhang

Tiwari

et al. 2007

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

Connected Dominating Set (CDS) has been proposed as the virtual backbone to alleviate the broadcasting storm in wireless ad hoc networks. Most recent research has extensively focused on the construction of 1-Connected 1-Dominating Set (1-CDS) in homogeneous networks. However, the nodes in the CDS need to carry other node's traffic and nodes in wireless networks are subject to failure. Therefore, it is desirable to construct a fault tolerant CDS. In this paper, we study a general fault tolerant CDS problem, called k-Connected m-Dominating Set (k-m-CDS), in heterogeneous networks. We first present two approximation algorithms for 1-m-CDS and k-k-CDS problems. Using disk graphs to model heterogeneous networks, we show that our algorithms have a constant approximation ratio. Based on these two algorithms, we further develop a general algorithm for k-m-CDS. We also provide an interesting analysis for a special case of k-m-CDS, where k = m + 1.

show abstract

Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links

Cited by 33 publications

References 7 publications

O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks

O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks

A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks

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

Contact Info

Product

Resources

About