250 search results - page 3 / 50 » Distributed Algorithms for Coloring and Domination in Wirele... |
MOBIHOC
2002
ACM
14 years 5 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...
BROADNETS
2005
IEEE
13 years 11 months ago
2005
IEEE
—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...
ICDCS
2008
IEEE
13 years 12 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...
ISPAN
2002
IEEE
13 years 10 months ago
2002
IEEE
Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in...
PDPTA
2004
13 years 6 months ago
2004
In this paper, we propose an adaptive self- stabilizing algorithm for producing a d-hop connected d-hop dominating set. In the algorithm, the set is cumulatively built with commun...