[ACM Press the 4th ACM international sym
β
Dubois-Ferriere, Henri; Grossglauser, Matthias; Vetterli, Martin
π
Article
π
2003
π
ACM Press
β 448 KB
We propose FResher Encounter SearcH (FRESH), a simple algorithm for efficient route discovery in mobile ad hoc networks. Nodes keep a record of their most recent encounter times with all other nodes. Instead of searching for the destination, the source node searches for any intermediate node that en