Single-Path Greedy Packet Forwarding
Greedy routing algorithms limit forwarding decisions on information about the location of the current forwarding node, its neighbors, and the final destination. Each intermediate node applies this greedy principle until the destination, if possible, is eventually reached. The characteristics of greedy routing algorithms differ on the optimization criterion applied in each forwarding step.