FORP is an Unicast Routing Protocol. An Unicast Routing is an under control flooding of the network. If for example sender S trys to reach D will broadcasts data packet P to all its neighbors. Each node receiving packet P forwards P to its neighbors. A Sequence numbers used to avoid the possibility of forwarding the same packet more than once so that the network is clean from this packet P after a period of time. When packet P reaches destination D provided that D is reachable from sender S and node D does not forward the packet. This route will now be saved for a specific time in a routing table.

Back to FORP, when a source S needs to send data to a destination node D, it shecks its routing table for an unexpired route, if it finds one it will uses it or else it will broadcast a Flow_REQ message to find a route to D. Every node adds now his GPS data to the Flow_REQ. the destination now has to calculate the best route with the following equations:

Link Expiration Time (LET)
Route Expiration Time (RET)

LET=-((pq+rs)+(p2+r2)Tx2-(ps-qr)2)/p2+q2
Where: p=Vacos(Ta)-Vbcos(Tb)
q=Xa-Xb
r=Vasin(Ta)-Vbsin(Tb)
s=Ya-Yb
Tx: transmission range


figure 1

Critical Time Tc: is the time that the route is about to expire, when Tc reached, the destination sends a Flow-HANDOFF to source and the Source then sends a Flow-SETUP back to Destination.

Picture is from the following book:
AD-HOC Wireless Networks
Architectures and Protocols
from Murthy Manoj

Paper: FORP

"Flow-Oriented Routing Protocol" is mentioned on: Ad-Hoc Protocols (Classification) | Ad-Hoc Workshop Winter 04/05 (Termine)