522 search results - page 1 / 105 » Connected k-Hop Clustering in Ad Hoc Networks |
ICPP
2005
IEEE
13 years 10 months ago
2005
IEEE
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
HICSS
2002
IEEE
13 years 9 months ago
2002
IEEE
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
TMC
2008
13 years 4 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 ...
MOBICOM
2009
ACM
13 years 11 months ago
2009
ACM
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...
GLOBECOM
2007
IEEE
13 years 4 months ago
2007
IEEE
—In the context of mobile ad hoc networks (MANETs) routing, we propose a clustering algorithm called Connectivity, Energy and Mobility driven Clustering Algorithm (CEMCA). The ai...