Sciweavers

Share
ADHOC
2007

Bounded-distance multi-clusterhead formation in wireless ad hoc networks

11 years 5 months ago
Bounded-distance multi-clusterhead formation in wireless ad hoc networks
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the maximum distance from nodes to their cluster-heads. This problem is similar to computing a (k,r)-dominating set, (k,r)-DS, of the network. (k,r)-DS is defined as the problem of selecting a minimum cardinality vertex set D of the network such that every vertex u not in D is at a distance smaller than or equal to r from at least k vertices in D. In mobile ad hoc networks (MANETs), clusters should be computed distributively, because the topology may change frequently. We present the first centralized and distributed solutions to the (k,r)-DS problem for arbitrary topologies. The centralized algorithm computes a (k Æ lnD)-approximation, where D is the largest cardinality among all r-hop neighborhoods in the network. The distributed approach is extended for clustering applications, while the centralized is used a...
Marco Aurélio Spohn, J. J. Garcia-Luna-Acev
Added 08 Dec 2010
Updated 08 Dec 2010
Type Journal
Year 2007
Where ADHOC
Authors Marco Aurélio Spohn, J. J. Garcia-Luna-Aceves
Comments (0)
books