I'm working on a new probabilistic routing protocol based-on k shortest path selection one, and I wish to test it on the simulator NS3 but there's none much literature on the way to process. I'm looking for some tips which can help to do that, I'm opening. Thx!
Hi
Dear Anselme Russel Affane Moundounga
You must first prove that your algorithm converges, This is a difficult task, so you recommend implementing your algorithm on existing basic algorithms, such as AODV and OLSR. You can use ready-made examples to do this.
Routing overview and Routing architecture
https://www.nsnam.org/docs/models/html/routing-overview.html
With respect
Hi Yashar Salami,
Nice advice! It is very astucious to exploit the existing algorithm and improve them. I'm going to try it ASAP.
Thx!
You can find the test code of the routing algorithm in the example folder.
- Badges
- Science topic
- Similar topics
- Computer Communications (Networks)
- Simulators