routing in hierarchy

[netuser786]

hi,
i am doing some projects in networking. For these i have to do an analysis of asymptotic behaviour of hierarchical routing in adhoc networks on an abstract level. I have searched on internet, i believe that there would be alot of information but unfortunately i was not able to find alot. I have to analyze the asymptotic behaviour of a simple network with N nodes ( N is large) for k groups. For a protocol with F(N) overhead, a single group will have overhead of k.F(N/k)

If we go to the next level of hierarchy, where the clusters at the previous levels are represented as a node, and if they exceed a certain threshold they are again clustered into super groups and the overhead is represented as:
N/k*k F(N/k*k)

And this process continues until the numbers of nodes are below a certain threshold and they in the end form a single group which is represented as a single node with constant overhead.
If i want to add complexity at different levels how can i do it. Can someone please provide any document in which i can learn this stuff.

thanks

 

[ScottMac]

Didn't we do this already a couple weeks ago?

Wireless networks aren't great for large user counts per AP. Large constellations of APs, properly managed don't suck too much from a user perspective.

Ad hoc are the worst of the worst and usually aren't good for more than a couple users with apps that don't require much interaction.

 

[netuser786]

hi,
yes u r right. But if i want to do the analysis i am just asking for a document or some help how to do it. My point is to learn how to do asymptotic analysis of hierarchical networks. and i feel these networks are a good start . I respect your opinion, i understand it.

thanks

 

[Ghiedo27]

I think your best bet is going to be Google. Not very many people who actually put their hands on network equipment are going to spend time on theoretical models when practical guidelines get the job done as best possible (or as close to best possible as to be indistinguishable from best).