Topology Broadcast based on Reverse-Path Forwarding (TBRPF) is a proactive, link-state routing protocol designed for mobile ad-hoc networks, which provides hop-by-hop routing along minimum-hop paths to each destination. Each node running TBRPF computes a source tree (providing paths to all reachable nodes) based on partial topology information stored in its topology table, using a modification of Dijkstra's algorithm. To minimize overhead, each node reports only part of its source tree to neighbors. This is in contrast to other protocols (e.g., STAR) in which each node reports its entire source tree to neighbors. TBRPF uses a combination of periodic and differential updates to keep all neighbors informed of the reportable part of its source tree. Each node also has the option to report additional topology information (up to the full topology), to provide improved robustness in highly mobile networks. TBRPF performs neighbor discovery using "differential" HELLO messages which report only changes in the status of neighbors. This results in HELLO messages that are much smaller than those of other link- state routing protocols such as OSPF and OLSR.

• Internet Draft for TBRPF
• IETF Presentation for TBRPF (Powerpoint)
• NS-2 Simulation Comparison to OLSR and AODV (Powerpoint)
• NS-2 Simulation Comparison to AODV (Powerpoint)
• Proof of Correctness for TBRPF
• Report containing correctness proof and simulation results (MS Word)
• View images of helicopters using TBRPF
• Video of helicopter using TBRPF (click on blank image)
• TBRPF Multicast (MS Word)