Open Access

A Stabilizing Algorithm for Clustering of Line Networks

EURASIP Journal on Wireless Communications and Networking20072008:720852

https://doi.org/10.1155/2008/720852

Received: 27 March 2007

Accepted: 25 October 2007

Published: 21 November 2007

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.

Publisher note

To access the full article, please see PDF

Authors’ Affiliations

(1)
Department of Computer Engineering, Kuwait University

Copyright

© Mehmet Hakan Karaata. 2008

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.