Routing algorithm for a clustered network

A. R. Hemanth Kumar, G. Sudhakara, B. S. Satyanarayana

Research output: Contribution to journalArticle

Abstract

The Cluster Dimension of a network is defined as, which is the minimum cardinality of a subset S of the set of nodes having the property that for any two distinct nodes x and y, there exist the node s1, s2 (need not be distinct) in S such that {pipe}d(x:,s1) - d(y, s1){pipe} ≥ 1 and d(x,S2) < d(x,s) for all s {small element of} S - {s2}. In this paper, strictly non overlap- ping clusters are constructed. The concept of LandMarks for Unique Addressing and Clustering (LMUAC) routing scheme is developed. With the help of LMUAC routing scheme, It is shown that path length (upper bound)PLN,d < PLD, Maximum memory space requirement for the networkMSlmuac(Δi) < MSLMUAC < MSH3L < MSnc and Maximum Link utilization factor MLLMUAC(i=j) < MLLMUAC(i≠j) < MLC < MLnc.

Original languageEnglish
Pages (from-to)821-829
Number of pages9
JournalWorld Academy of Science, Engineering and Technology
Volume46
Publication statusPublished - 01-12-2010

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this