114 search results - page 4 / 23 » Clustering wireless ad hoc networks with weakly connected do... |
ICDCS
2008
IEEE
14 years 7 days 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...
TPDS
2002
13 years 5 months ago
2002
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
FSTTCS
2004
Springer
13 years 11 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...
LCN
2003
IEEE
13 years 11 months ago
2003
IEEE
In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends th...
JPDC
2007
13 years 5 months ago
2007
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...