250 search results - page 6 / 50 » Distributed Algorithms for Coloring and Domination in Wirele... |
MASCOTS
2007
13 years 10 months ago
2007
— We propose a hierarchical Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is an extension of our previous Connec...
IPPS
2005
IEEE
14 years 2 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...
ICDCS
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
ICDCIT
2007
Springer
14 years 2 months ago
2007
Springer
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
SIGMETRICS
2010
ACM
14 years 1 months ago
2010
ACM
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...