Skip to main content

A Stabilizing Algorithm for Clustering of Line Networks

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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to MehmetHakan Karaata.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Karaata, M. A Stabilizing Algorithm for Clustering of Line Networks. J Wireless Com Network 2008, 720852 (2007). https://doi.org/10.1155/2008/720852

Download citation

  • Received:

  • Accepted:

  • Published:

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

Keywords

  • Information System
  • Size Cluster
  • System Application
  • Small Cluster
  • Share Resource