114 search results - page 3 / 23 » Clustering wireless ad hoc networks with weakly connected do... |
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 5 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...
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...
ISAAC
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
ICDCS
2002
IEEE
13 years 10 months ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...