RELIABLE CLUSTERING TECHNIQUES FOR LARGE, MOBILE PACKET RADIO NETWORKS.

C. V. Ramamoorthy, Anupan Bhide, Jaideep Srivastava

Research output: Chapter in Book/Report/Conference proceedingConference contribution

38 Citations (Scopus)

Abstract

The authors have proposed a model for studying the problem of clustering in large, mobile packet radio networks (PRNET). It is a dynamic graph model in which the nodes and links fail very often. They have discussed in detail the various objectives that a general clustering algrithm may be required to fulfill and have chosen a subset of these objectives and shown how they are relevant to the PRNET environment. Three algorithms for cluster creation have been proposed each satisfying a different set of objectives. Wherever possible polynomial bounds on the objectives are derived. The authors have also discussed overlapping clusters and how the proposed algorithms can be modified to obtain them. The concept of physical redundancy has been introduced and its use in the creation of reliable clusters is described. Finally, they have given algorithms for the maintenance of clusters, i. e. , maintaining the structure of the hierarchical clustering tree when failures occur.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
Place of PublicationNew York, NY, USA
PublisherIEEE
Pages218-226
Number of pages9
ISBN (Print)0818607688
Publication statusPublished - 1987
Externally publishedYes

Fingerprint

Redundancy
Polynomials

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Ramamoorthy, C. V., Bhide, A., & Srivastava, J. (1987). RELIABLE CLUSTERING TECHNIQUES FOR LARGE, MOBILE PACKET RADIO NETWORKS. In Proceedings - IEEE INFOCOM (pp. 218-226). New York, NY, USA: IEEE.

RELIABLE CLUSTERING TECHNIQUES FOR LARGE, MOBILE PACKET RADIO NETWORKS. / Ramamoorthy, C. V.; Bhide, Anupan; Srivastava, Jaideep.

Proceedings - IEEE INFOCOM. New York, NY, USA : IEEE, 1987. p. 218-226.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ramamoorthy, CV, Bhide, A & Srivastava, J 1987, RELIABLE CLUSTERING TECHNIQUES FOR LARGE, MOBILE PACKET RADIO NETWORKS. in Proceedings - IEEE INFOCOM. IEEE, New York, NY, USA, pp. 218-226.
Ramamoorthy CV, Bhide A, Srivastava J. RELIABLE CLUSTERING TECHNIQUES FOR LARGE, MOBILE PACKET RADIO NETWORKS. In Proceedings - IEEE INFOCOM. New York, NY, USA: IEEE. 1987. p. 218-226
Ramamoorthy, C. V. ; Bhide, Anupan ; Srivastava, Jaideep. / RELIABLE CLUSTERING TECHNIQUES FOR LARGE, MOBILE PACKET RADIO NETWORKS. Proceedings - IEEE INFOCOM. New York, NY, USA : IEEE, 1987. pp. 218-226
@inproceedings{1306a33a298a49f4a7cd0a24028423da,
title = "RELIABLE CLUSTERING TECHNIQUES FOR LARGE, MOBILE PACKET RADIO NETWORKS.",
abstract = "The authors have proposed a model for studying the problem of clustering in large, mobile packet radio networks (PRNET). It is a dynamic graph model in which the nodes and links fail very often. They have discussed in detail the various objectives that a general clustering algrithm may be required to fulfill and have chosen a subset of these objectives and shown how they are relevant to the PRNET environment. Three algorithms for cluster creation have been proposed each satisfying a different set of objectives. Wherever possible polynomial bounds on the objectives are derived. The authors have also discussed overlapping clusters and how the proposed algorithms can be modified to obtain them. The concept of physical redundancy has been introduced and its use in the creation of reliable clusters is described. Finally, they have given algorithms for the maintenance of clusters, i. e. , maintaining the structure of the hierarchical clustering tree when failures occur.",
author = "Ramamoorthy, {C. V.} and Anupan Bhide and Jaideep Srivastava",
year = "1987",
language = "English",
isbn = "0818607688",
pages = "218--226",
booktitle = "Proceedings - IEEE INFOCOM",
publisher = "IEEE",

}

TY - GEN

T1 - RELIABLE CLUSTERING TECHNIQUES FOR LARGE, MOBILE PACKET RADIO NETWORKS.

AU - Ramamoorthy, C. V.

AU - Bhide, Anupan

AU - Srivastava, Jaideep

PY - 1987

Y1 - 1987

N2 - The authors have proposed a model for studying the problem of clustering in large, mobile packet radio networks (PRNET). It is a dynamic graph model in which the nodes and links fail very often. They have discussed in detail the various objectives that a general clustering algrithm may be required to fulfill and have chosen a subset of these objectives and shown how they are relevant to the PRNET environment. Three algorithms for cluster creation have been proposed each satisfying a different set of objectives. Wherever possible polynomial bounds on the objectives are derived. The authors have also discussed overlapping clusters and how the proposed algorithms can be modified to obtain them. The concept of physical redundancy has been introduced and its use in the creation of reliable clusters is described. Finally, they have given algorithms for the maintenance of clusters, i. e. , maintaining the structure of the hierarchical clustering tree when failures occur.

AB - The authors have proposed a model for studying the problem of clustering in large, mobile packet radio networks (PRNET). It is a dynamic graph model in which the nodes and links fail very often. They have discussed in detail the various objectives that a general clustering algrithm may be required to fulfill and have chosen a subset of these objectives and shown how they are relevant to the PRNET environment. Three algorithms for cluster creation have been proposed each satisfying a different set of objectives. Wherever possible polynomial bounds on the objectives are derived. The authors have also discussed overlapping clusters and how the proposed algorithms can be modified to obtain them. The concept of physical redundancy has been introduced and its use in the creation of reliable clusters is described. Finally, they have given algorithms for the maintenance of clusters, i. e. , maintaining the structure of the hierarchical clustering tree when failures occur.

UR - http://www.scopus.com/inward/record.url?scp=0023167693&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023167693&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0818607688

SP - 218

EP - 226

BT - Proceedings - IEEE INFOCOM

PB - IEEE

CY - New York, NY, USA

ER -