91 search results - page 1 / 19 » Sizes of Minimum Connected Dominating Sets of a Class of Wir... |
ICC
2008
IEEE
13 years 10 months ago
2008
IEEE
— We consider an important performance measure of wireless sensor networks, namely, the least number of nodes, N, required to facilitate routing between any pair of nodes, allowi...
JCO
2008
13 years 4 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
ICDCS
2008
IEEE
13 years 10 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
JCIT
2008
13 years 4 months ago
2008
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
MOBIHOC
2002
ACM
14 years 3 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...