Clustering Algorithms for Hierarchical Routing in Networks.

Abstract

In this paper, we present a distributed asynchronous algorithm to form overlapping clusters on a network with a dynamic topology. Properties of the algorithm are presented. It is shown that the algorithm is essentially a distributed implementation of a centralized algorithm. Also, bounds on the number or clusters formed on a network with N nodes is derived. The algorithm (DACA) is then compared with another algorithm (DHCA) for forming overlapping clusters in a dynamic environment. It is shown that in some ways, DACA is better than DHCA. The major disadvantage of DACA is that it passes more bits through the network than DHCA. Which algorithm is better depends on the particular implementation. Originator-supplied keywords: Packet radio networks, Hierarchical routing.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1984
Accession Number
ADA161372

Entities

People

  • James Rossi

Organizations

  • University of Illinois Urbana–Champaign

Tags

Communities of Interest

  • Air Platforms
  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Availability
  • Classification
  • Clustering
  • Computer Networks
  • Contracts
  • Electrical Engineering
  • Environment
  • Illinois
  • Information Theory
  • Nets
  • Network Protocols
  • Probability
  • Security
  • Simulations
  • Topology
  • Universities

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Computer Networking
  • Surface Coatings Technology.