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