32 search results - page 1 / 7 » Distributed Algorithm for Efficient Construction and Mainten... |
TMC
2008
13 years 4 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
MOBIHOC
2002
ACM
14 years 4 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
DCOSS
2011
Springer
12 years 4 months ago
2011
Springer
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
GLOBECOM
2006
IEEE
13 years 10 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...