A stabilizing algorithm for clustering of line networks

Authors:
Mehmet Hakan Karaata
Affiliations:
Department of Computer Engineering, Kuwait University, Safat, Kuwait
Venue:
EURASIP Journal on Wireless Communications and Networking
Year:
2008

Citing 6
Cited 0

Distributed algorithms for finding centers and medians in networks

ACM Transactions on Programming Languages and Systems (TOPLAS)
Improved complexity bounds for center location problems on networks by using dynamic data structures

SIAM Journal on Discrete Mathematics
Clusterhead Controlled Token for Virtual Base Station On-Demand in MANETs

ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy

Distributed Computing
Stabilizing ring clustering

Journal of Systems Architecture: the EUROMICRO Journal
Self-Stabilizing Clustering of Tree Networks

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a stabilizing algorithm for finding clustering of path (line) networks on a distributed model of computation. Clustering is defined as covering of nodes of a network by subpaths (sublines) such that the intersection of any two subpaths (sublines) is at most a single node and the difference between the sizes of the largest and the smallest clusters is minimal. The proposed algorithm evenly partitions the network into nearly the same size clusters and places resources and services for each cluster at its center to minimize the cost of sharing resources and using the services within the cluster. Due to being stabilizing, the algorithm can withstand transient faults and does not require initialization. We expect that this stabilizing algorithm will shed light on stabilizing solutions to the problem for other topologies such as grids, hypercubes, and so on.