Wireless Routing using Dijkstra's Shortest Path Algorithm

  •        0

Explains Dijkstra's shortest path algorithm, for wireless network routing. The users can create a random map with dynamic transmission range and choose a source and destination mobile node (by clicking) in the map and see the shortest path visually in the Silverlight output.

http://wirelessroutingdemo.codeplex.com/

Tags
Implementation
License
Platform

   

comments powered by Disqus


Related Projects