522 search results - page 19 / 105 » Connected k-Hop Clustering in Ad Hoc Networks |
191
click to vote
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
174
click to vote
COMSWARE
2007
IEEE
16 years 12 days ago
2007
IEEE
— In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself...
141
click to vote
CJ
2004
15 years 5 months ago
2004
We study the effects of physical layer parameters on the connectivity of fading wireless ad-hoc networks. Relying on a symbol error rate connectivity metric for wireless ad-hoc net...
142
click to vote
HPCC
2007
Springer
16 years 6 days ago
2007
Springer
In mobile-AdHoc networks (MANETs), many applications need the support of layer-structure. Clustering solution is the most widely used layerstructure and the choosing of clusterhead...
171
click to vote
SASO
2008
IEEE
16 years 13 days ago
2008
IEEE
Abstract—We present a distributed connectivity service that allows agents in a mobile ad-hoc network to move while preserving connectivity. This allows unmodified motion plannin...