Objective function
The rule set that translates neighbor evidence into rank and preferred-parent decisions inside one RPL Instance.
Compare how OF0 and MRHOF-style evidence changes preferred-parent selection in RPL
Change the scenario and objective lens to see why the same DIO neighborhood can produce a different preferred parent. The workbench keeps rank, ETX path cost, hysteresis, and loop checks visible together.
The rule set that translates neighbor evidence into rank and preferred-parent decisions inside one RPL Instance.
A scalar distance from the DODAG root. Rank must progress away from the root so packets can avoid routing loops.
Expected transmissions can be added along a path. A lower ETX path usually means fewer retransmissions.
MRHOF can keep the current parent unless the better path improves by enough to avoid constant parent switching.
Start with the stable network, then try the lossy shortcut and hysteresis scenarios. The selected parent changes only when the objective lens and thresholds justify it.
N5 has heard DIO messages from nearby routers. It must choose one preferred parent for upward traffic toward the root.
Compare the evidence each DIO gives N5 before it chooses a preferred parent.
| Candidate | Rank evidence | ETX path cost | Guard | Decision |
|---|
Objective Function Zero seeks a nearby grounded root and uses rank increase from the selected parent. This page uses a fixed rank-stretch teaching model for visibility.
Minimum Rank with Hysteresis Objective Function selects lower additive path cost, commonly ETX, while avoiding excessive churn.
DIO messages carry DODAG configuration, including the Objective Code Point, rank, and metric-container context used by the instance.
A tempting low-cost neighbor is not usable if it is a descendant, lacks a valid path to the root, or violates implementation constraints.
The OF0 view here uses a fixed `parent rank + 256` stretch so learners can see a hop-like decision. RFC 6552 allows the step of rank to reflect link properties, so OF0 is not always a pure hop-count algorithm.
The MRHOF view uses additive ETX as the selected metric. The full RFC also defines parent-set behavior, rank conversion, maximum path cost, and several implementation constants.
Rank approximates distance from the DODAG root and supports loop avoidance. Exact rank values depend on RPL configuration, objective function, MinHopRankIncrease, and local policy.