522 search results - page 32 / 105 » Connected k-Hop Clustering in Ad Hoc Networks |
WIOPT
2006
IEEE
14 years 1 months ago
2006
IEEE
— We introduce and discuss a novel link model that incorporates both uncertainty in the fading coefficients and the node distances for ad hoc networks with randomly placed nodes...
JNW
2007
13 years 7 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
ICDCS
2006
IEEE
14 years 1 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...
MWCN
2004
Springer
14 years 1 months ago
2004
Springer
: We propose a location-service to assist location-based routing protocols, realised through our Associativity-Based Clustering protocol. The main goal of our scheme, which employs...
ICDCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Clustering in Mobile Ad Hoc Networks (MANETs) has shown to be a promising technique to ensure the scalability and efficiency of various communication protocols. Since stations in...