### 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 s_{1}, s_{2} (need not be distinct) in S such that {pipe}d(x:,s1) - d(y, s1){pipe} ≥ 1 and d(x,S_{2}) < 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)PL_{N,d} < PL_{D}, Maximum memory space requirement for the networkMSlmuac(Δ_{i}) < MS_{LMUAC} < MS_{H3L} < MS_{n}^{c} and Maximum Link utilization factor ML_{LMUAC}(i=j) < ML_{LMUAC(i≠j)} < MLC < ML_{nc}.

Original language | English |
---|---|

Pages (from-to) | 821-829 |

Number of pages | 9 |

Journal | World Academy of Science, Engineering and Technology |

Volume | 46 |

Publication status | Published - 01-12-2010 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Engineering(all)

### Cite this

*World Academy of Science, Engineering and Technology*,

*46*, 821-829.

}

*World Academy of Science, Engineering and Technology*, vol. 46, pp. 821-829.

**Routing algorithm for a clustered network.** / Hemanth Kumar, A. R.; Sudhakara, G.; Satyanarayana, B. S.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Routing algorithm for a clustered network

AU - Hemanth Kumar, A. R.

AU - Sudhakara, G.

AU - Satyanarayana, B. S.

PY - 2010/12/1

Y1 - 2010/12/1

N2 - 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.

AB - 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.

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

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

M3 - Article

AN - SCOPUS:84871449421

VL - 46

SP - 821

EP - 829

JO - World Academy of Science, Engineering and Technology

JF - World Academy of Science, Engineering and Technology

SN - 2010-376X

ER -