@inproceedings{8b19af370be14cf6acb80a60a3a6c2dc,
title = "Random hierarchies that facilitate self-organization",
abstract = "Since it is widely accepted that self-organization is difficult to achieve using constructive or centrally run algorithms, a random hierarchy is proposed that intrinsically facilitates self-organization. The random hierarchy consists of each node in the network independently choosing a rank at random such that a mean 2(Δ-1)Δi-1 nodes have rank i, where Δ is a network wide hierarchy parameter. Each node of rank i chooses the nearest node of rank i-1 as its leader which forms the hierarchy. The mean and variance of the relevant properties is derived, for example it is shown that each leader has a mean A followers. Simulations were used to demonstrate the effectiveness of the proposed hierarchy and a {"}bare-bones{"} set of procedures where provided that may be used to implement the hierarchy over a network of autonomous nodes in a robust way.",
keywords = "Circuits, Clustering algorithms, Computer science, Distributed algorithms, Internet, Network topology, Protocols, Software algorithms, Software engineering, System recovery",
author = "A. Harwood and H. Shen",
note = "Publisher Copyright: {\textcopyright} 2002 IEEE.; International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2002 ; Conference date: 22-05-2002 Through 24-05-2002",
year = "2002",
doi = "10.1109/ISPAN.2002.1004269",
language = "English",
series = "Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN",
publisher = "IEEE Computer Society",
pages = "111--116",
editor = "Hsu, \{D. Frank\} and Saldana, \{Rafael P.\} and Ibarra, \{Oscar H.\}",
booktitle = "Proceedings - International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2002",
address = "United States",
}