Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: connected dominating set

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

A simple linear algorithm for the connected domination problem in circular-arc graphs

100%

Hung R.-W., Chang M.-S.

Discussiones Mathematicae Graph Theory

2004

tom 24

nr 1

137-145

A connected dominating set of a graph G = (V,E) is a subset of vertices CD ⊆ V such that every vertex not in CD is adjacent to at least one vertex in CD, and the subgraph induced by CD is connected. We show that, given an arc family F with endpoints sorted, a minimum-cardinality connected dominating set of the circular-arc graph constructed from F can be computed in O(|F|) time.

An efficient connected dominating set algorithm in wsns based on the induced tree of the crossed cube

88%

Zhang J., Xu L., Zhou S.-m., Wu W., Ye X.

International Journal of Applied Mathematics and Computer Science

2015

tom 25

nr 2

295-309

The connected dominating set (CDS) has become a well-known approach for constructing a virtual backbone in wireless sensor networks. Then traffic can forwarded by the virtual backbone and other nodes turn off their radios to save energy. Furthermore, a smaller CDS incurs fewer interference problems. However, constructing a minimum CDS is an NP-hard problem, and thus most researchers concentrate on how to derive approximate algorithms. In this paper, a novel algorithm based on the induced tree of the crossed cube (ITCC) is presented. The ITCC is to find a maximal independent set (MIS), which is based on building an induced tree of the crossed cube network, and then to connect the MIS nodes to form a CDS. The priority of an induced tree is determined according to a new parameter, the degree of the node in the square of a graph. This paper presents the proof that the ITCC generates a CDS with a lower approximation ratio. Furthermore, it is proved that the cardinality of the induced trees is a Fibonacci sequence, and an upper bound to the number of the dominating set is established. The simulations show that the algorithm provides the smallest CDS size compared with some other traditional algorithms.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 International Journal of Applied Mathematics and Computer Science

1 Chang M.-S.

1 Hung R.-W.

1 Wu W.

1 Xu L.

1 Ye X.

1 Zhang J.

1 Zhou S.-m.

1 2015

1 2004

Wyniki wyszukiwania

A simple linear algorithm for the connected domination problem in circular-arc graphs

An efficient connected dominating set algorithm in wsns based on the induced tree of the crossed cube