### 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 |

### All Science Journal Classification (ASJC) codes

- Engineering(all)

## Fingerprint Dive into the research topics of 'Routing algorithm for a clustered network'. Together they form a unique fingerprint.

## Cite this

*World Academy of Science, Engineering and Technology*,

*46*, 821-829.