250 search results - page 2 / 50 » Distributed Algorithms for Coloring and Domination in Wirele... |
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...
ICPP
2000
IEEE
13 years 9 months ago
2000
IEEE
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...
ICDCS
2008
IEEE
13 years 11 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
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...
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...