Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2007-06-07
Computer Science
Distributed, Parallel, and Cluster Computing
The Third International Conference on Wireless and Mobile Communications 2007
Scientific paper
Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. In a dynamic environment-in terms of node mobility as well as in terms of steadily changing device parameters-the clusterhead election process has to be re-invoked according to a suitable update policy. Cluster re-organization causes additional message exchanges and computational complexity and it execution has to be optimized. Our investigations focus on the problem of minimizing clusterhead re-elections by considering stability criteria. These criteria are based on topological characteristics as well as on device parameters. This paper presents a weighted clustering algorithm optimized to avoid needless clusterhead re-elections for stable clusters in mobile ad-hoc networks. The proposed localized algorithm deals with mobility, but does not require geographical, speed or distances information.
Andronache Adrian
Brust Matthias R.
Rothkugel Steffen
No associations
LandOfFree
WACA: A Hierarchical Weighted Clustering Algorithm optimized for Mobile Hybrid Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with WACA: A Hierarchical Weighted Clustering Algorithm optimized for Mobile Hybrid Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and WACA: A Hierarchical Weighted Clustering Algorithm optimized for Mobile Hybrid Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-652136