Ad-hoc network

[dhhtr]

Good day everyone,

Just wondering whether anyone knows the sort of algorithms are used in Ad-Hoc networks in determining the best optimal paths for the new deployed basestation/node to the gateway in a LOS backhaul network (tree topology configuration).

I've looked at graph theory and read up on dijkstra's algorithm, prim's algorithm, solon's algorithm, minimum spanning tree and although I believe I'm headed in the right track, I don't think these are the types used for an ad-hoc network. If anyone could help, that would be greatly appreciated.

Thank you kindly.

 

[IRstuff]

Seems to me that this would be better asked at Tek-Tips.com

TTFN
faq731-376

Need help writing a question or understanding a reply? forum1529


Of course I can. I can do anything. I can do absolutely anything. I'm an expert!
There is a homework forum hosted by engineering.com:

http://www.engineering.com/AskForum/aff/32.aspx