Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Conference paper
Title: Random hierarchies that facilitate self-organization
Author: Harwood, A.
Shen, H.
Citation: Proceedings of the International Symposium on Parrallel Architectures, Algorithms and Networks (ISPAN'02), Manilla, Phillippines, 2002, pp. 111-116
Publisher: IEEE Computer Society
Publisher Place: Washington, DC
Issue Date: 2002
ISBN: 0769515797
Conference Name: International Symposium on Parallel Architectures, Algorithms and Networks (6th : 2002 : Manila, Phillipines)
Statement of
Aaron Harwood, Hong Shen
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(\Delta-1)\Delta^{i-1} nodes have rank i, where \Delta 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 \Delta 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.
Description: ©2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
RMID: 0020065651
DOI: 10.1109/ISPAN.2002.1004269
Appears in Collections:Computer Science publications

Files in This Item:
File Description SizeFormat 
hdl_36898.pdf253.39 kBPublisher's PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.