40 search results - page 4 / 8 » Efficient Construction of Weakly-Connected Dominating Set fo... |
FSTTCS
2004
Springer
14 years 1 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...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
JPDC
2006
13 years 7 months ago
2006
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
MOBIHOC
2003
ACM
14 years 7 months ago
2003
ACM
The efficiency of a communication network depends not only on its control protocols, but also on its topology. We propose a distributed topology management algorithm that construc...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
-- In cluster-based routing protocol (CBRP), two-level hierarchical structure is successfully used to reduce over-flooding in wireless ad hoc networks. As it is vulnerable to a sin...