Dnatube Scientific Videos

KHOPCA: k-hop Clustering Algorithm in Mobile Ad Hoc Networks
Clustering algorithms form hierarchical structures of an otherwise homogeneous ad hoc or sensor network. An efficient clustering process is a challenging task since the process should be completely self-organized and make use of incomplete environmental information. As result of these requirements many clustering algorithms use local information and support 1-hop sized clusters. The contribution of this paper is to show how k-hop sized clusters can be formed and maintained by solely using local neighborhood information. k-hop sized clusters are clusters where nodes are at most k-hops away from the clusterhead, i.e. with a cluster diameter of at the most of 2k. The described algorithm k-HOP takes advantage of nodes\' mobility in order to form and maintain k-hop sized clusters. While cluster formation works in static environment, we turn out in this paper that mobility of nodes massively supports self-organization of clusters. The algorithm KHOPCA works locally, asynchronously, and fully distributed. For more information and for the research paper see http://mocca.uni.lu/team/brust.html (Matthias R. Brust).
Tags // ad hoc network communication algorithm computer clustering simulation animation
Added: October 5, 2007, 11:26 am
Runtime: 139.96 | Views: 5788 | Comments:0
Not yet rated