250 search results - page 4 / 50 » Distributed Algorithms for Coloring and Domination in Wirele... |
IMCSIT
2010
13 years 4 months ago
2010
In our work we present a new approach to the problem of channel assignment in Wireless Ad Hoc Network. We introduce a new algorithm which works in distributed model of computations...
ISAAC
2009
Springer
14 years 24 days 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 11 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...
TMC
2008
13 years 6 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
2003
ACM
14 years 5 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...