30 search results - page 5 / 6 » Maintaining weakly-connected dominating sets for clustering ... |
INFOCOM
2000
IEEE
13 years 10 months ago
2000
IEEE
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
ISPA
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper ...
CLUSTER
2002
IEEE
13 years 5 months ago
2002
IEEE
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
ICDCS
2006
IEEE
13 years 11 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...
ISPAN
2005
IEEE
13 years 11 months ago
2005
IEEE
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...