7 search results - page 1 / 2 » Fast distributed algorithms for (weakly) connected dominatin... |
SODA
2003
ACM
13 years 6 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
GLOBECOM
2006
IEEE
13 years 11 months ago
2006
IEEE
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
JPDC
2007
13 years 4 months ago
2007
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
JPDC
2007
13 years 4 months ago
2007
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...