[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[manet] DSR and Dijkstra's algorithm

To: manet@ietf.org
Subject: [manet] DSR and Dijkstra's algorithm
From: Noah.H.Miller@Dartmouth.EDU (Noah H. Miller)
Date: 24 Jun 2002 15:42:07 EDT
List-Id: Mobile Ad-hoc Networks <manet.ietf.org>
Reply-To: Noah.H.Miller@Dartmouth.EDU (TrustMeImTellingYouStories)
Sender: manet-admin@ietf.org

Hello,

I am porting the DSR protocol to Dartmouth College's wireless ad-hoc network simulation (SWAN).  I would like to write the Route Cache using Dijkstra's shortest-path algorithm (per Link-MaxLife specification in Appendix A of the draft).  Does anyone know 
of open source code out there using this algorithm that I could use as reference?  Either code for a DSR simulation or another similar routing protocol.

Thank you,
Noah Miller

_______________________________________________
manet mailing list
manet@ietf.org
https://www1.ietf.org/mailman/listinfo/manet

Follow-Ups:
- Re: [manet] DSR and Dijkstra's algorithm
  - From: sameer tilak
- Re: [manet] DSR and Dijkstra's algorithm
  - From: Jonas Nielsen

Prev by Date: Re: [manet] Data flow in nam or ad-hcokey? for wireless scenarios
Next by Date: Re: [manet] DSR and Dijkstra's algorithm
Previous by thread: [manet] CFP final reminder: ACM WoWMoM2002 -- submission deadline is June 25
Next by thread: Re: [manet] DSR and Dijkstra's algorithm
Index(es):
- Date
- Thread