MAODV picks the path with least number of hop count from source to destination from its multicast tree. But is there some algorithm, Prim's or Dijkstra's that is used to calculate this? Where can I see this fact from the code?
And if I want to display the (randomly selected) source -> intermediate nodes -> destination, how do I do that? Appreciate your help! -- View this message in context: http://www.nabble.com/How-are-routing-decision-made-in-MAODV--tp19527760p19527760.html Sent from the ns-users mailing list archive at Nabble.com.
