@article{(Open Science Index):https://publications.waset.org/pdf/1093,
	  title     = {Routing Algorithm for a Clustered Network},
	  author    = {Hemanth KumarA.R and Sudhakara G. and  Satyanarayana B.S.},
	  country	= {},
	  institution	= {},
	  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 Si, s2 (need not be distinct) in S such that ld(x,s1) — d(y, s1)1 > 1 and d(x,s2) < d(x,$) for all s E 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(Az) < MSEmuAc < MSH3L < MSric and Maximum Link utilization factor MLLMUAC(i=3) < MLLMUAC(z03) < M Lc
},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {4},
	  number    = {10},
	  year      = {2010},
	  pages     = {1607 - 1615},
	  ee        = {https://publications.waset.org/pdf/1093},
	  url   	= {https://publications.waset.org/vol/46},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 46, 2010},
	}