A field team has a real problem to settle: Why can four short hops beat one long hop? They must decide what happens before they change equal hops on the device. Predict the direction first.
See the relationship first
The figure reads from left to right. The blue card is equal hops. The middle card uses this page's rule. The green card is hop length. Follow the arrows: set the input, use the rule, then read the result and its unit.
The audit later on checks more than one number. Here, the added model uses the baseline named below and holds every other chapter value fixed. That sentence bridges the fixtures, so the numbers do not change without a reason.
Derive the baseline in four moves
- 1
Name the input. The chapter baseline for equal hops is 4.
- 2
Name the rule. R=k(D/k)^n/D^n=k^(1-n) k=4: R(n=2)=0.250 → 6.02 dB; R(n=3)=0.0625 → 12.04 dB
- 3
Put in the chapter value. Set equal hops to 4. The page rule gives hop length as 50.0 m.
- 4
Read the result. Keep m next to the value. Use it only within the limits on this page.
Predict, then change equal hops
Try Predict what happens to hop length. Move one control, calculate, then check your idea.
Observe A larger path-loss exponent punishes the long hop more strongly, so equal subdivision buys more transmit-power saving before relay costs are added. Reset to 4 and compare hop length.
Explain Only equal hops moves here. The other chapter values stay fixed.
Check yourself
What should you do before you trust the result?
What does this small model leave out?
1. Start with the physical question
Derive the geometry-only power ratio for equal WSN hops. A reason to test multi-hop without hiding relay energy.
2. Name every algebra move
Split the distanceEach hop has length D/k.
Apply the path lawOne hop needs power proportional to (D/k)^n.
Count all transmittersMultiply the one-hop term by k.
Cancel the common distancek(D/k)^n/D^n becomes k^(1−n).
Convert the ratio to decibelsSaving=10log10(1/R).
3. Reproduce the chapter case
k=4: R(n=2)=0.250 → 6.02 dB; R(n=3)=0.0625 → 12.04 dB
The arithmetic reproduces the chapter case while keeping its assumptions explicit.
4. Try the controlling input
TryMove the control and watch every displayed result come from the shown formula.
ObserveAt four hops, each hop is 50.0 m. The geometry-only ratio is 0.250 at n=2 and 0.063 at n=3.
ExplainA larger path-loss exponent punishes the long hop more strongly, so equal subdivision buys more transmit-power saving before relay costs are added.
This compact engine isolates one relationship; it is not a deployment certificate.
- Radios
- Receive, forwarding, startup, acknowledgement, and retry energy are omitted
- Geometry
- Equal hop lengths and one shared path exponent are assumed
- Evidence
- The result does not prove delivery, latency, or battery life
Measure the real system and reopen the decision when its inputs change.
5. Put relay tax back into the decision
Measure receive and forwarding energy per relay, retry rate, traffic pressure, and idle cost. Multi-hop wins only when the geometric saving exceeds those added costs.
6. Record the route assumption
Keep total distance, hop count, per-hop distance, path exponent, radio state energy, traffic load, fade margin, result, owner, and retest trigger.
7. Check yourself
Why is each hop 50 m?
Why is the n=3 ratio 0.0625?
Does 12.04 dB prove four hops use less battery?
The worked values are traceable chapter examples or explicitly labelled teaching assumptions.
- 200 m
- Explicit illustrative corridor distance
- n=2 and n=3
- Free-space and bounded obstructed examples
- 12.04 dB
- Geometry-only transmit-power saving
Correct, not complete: field evidence still decides acceptance.
Packet Pete guides