44 search results - page 6 / 9 » Distributed low-cost backbone formation for wireless ad hoc ... |
ICDCS
2008
IEEE
14 years 4 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...
ICPP
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper presents a distributed algorithm called LREMiT for extending the lifetime of a source-based multicast tree in wireless ad hoc networks (WANET). The lifetime of a multic...
MOBIHOC
2001
ACM
14 years 10 months ago
2001
ACM
A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternets. The constraints and properties of Bluetooth scatternets present special challenges in formin...
ICPP
2000
IEEE
14 years 2 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...
MOBIHOC
2002
ACM
14 years 10 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...