KHOPCA Clustering Algorithm: Rule (1)

The video shows 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 most 2k. The presented k-hop clustering algorithm, called KHOPCA, takes advantage of nodes' mobility in order to form and maintain k-hop sized clusters. This video illustrates rule 1 of the KHOPCA clustering algorithm.

References:
Brust, M. R., H. Frey, et al. (2008). Dynamic Multi-Hop Clustering for Mobile Hybrid Wireless Networks The Second International Conference on Ubiquitous Information Management and Communication (ACM ICUIMC 2008), Suwon, Korea, ACM Press.

Brust, M. R., H. Frey, et al. (2007). Adaptive Multi-hop Clustering in Mobile Networks. 4th International Conference on Mobile Technology, Applications and Systems (MOBILITY 2007), Singapore Polytechnic, Singapore, The Singapore Chapter of the Association for Computing Machinery (ACM).

Links:
http://doi.acm.org/10.1145/1352793.1352820 http://mocca.uni.lu/team/brust.html
(Author: Matthias R. Brust)

Category:

Science & Technology

Tags:

• Clustering
• Algorithm
• Clusterhead
• Topology
• Control
• Ad
• hoc
• Sensor
• Network
• Wireless
• Communication
• Routing
• KHOPCA