3 Ad-Hoc Multi-Hop Routing
3.1 Start Simple
Start with devices that have to pass useful data before any fixed network is guaranteed. In Ad-Hoc Multi-Hop Routing, the first question is not the protocol name; it is which neighbors, routes, failure signals, and degraded behaviors you would trust in the field.
3.2 Start With a Route That Has to Be Earned
Ad-hoc routing is different from ordinary routing because the path is not a stable fact. Devices move, batteries fade, links appear and disappear, and a route has to be discovered, refreshed, or repaired using evidence from the network itself.
Start with one source, one destination, and no fixed infrastructure. The routing family you choose should explain how the source learns a path, how stale paths are detected, and how much control traffic the field can afford.
3.3 Routing Without Fixed Paths
In an ad-hoc network, a packet may need to cross several peer devices before it reaches the destination or a gateway. That relay behavior extends coverage beyond one radio hop, but it also consumes shared airtime, battery energy, memory, and trust in intermediate nodes.
The first routing decision is not a protocol acronym. It is whether the network benefits more from routes that are already known, routes discovered only when needed, or a mixture of local route knowledge and on-demand discovery for distant destinations.
That choice should be tied to the first failure the application cannot tolerate. A fire-ground status network may value fast local delivery after setup, even if it spends more periodic control traffic. A wildlife tracker may value low idle energy and accept discovery delay. A vehicle warning flow may value freshness so strongly that a stale route is worse than a dropped message.
Multi-hop reach is therefore not "free range extension." Each extra relay can improve coverage while also increasing contention, retry probability, queueing delay, and the number of devices that must be trusted to forward correctly. The routing family is the policy for paying those costs.
A useful overview names the traffic shape before the protocol family: periodic telemetry, burst alarms, command messages, location beacons, or bulk logs. Each shape stresses a different mix of ready routes, discovery delay, repair behavior, and relay duty.
Proactive routing
Nodes maintain route tables before data appears. This reduces first-packet delay, but the control traffic continues even when little application data is moving.
Reactive routing
Nodes discover a route when a packet needs one. This can save idle overhead, but discovery delay and flood traffic appear at the start of a flow.
Hybrid routing
Nodes keep nearby routes ready and discover farther routes on demand. The design trades local responsiveness against zone-maintenance cost.
Use the routing family that matches the evidence: traffic pattern, mobility, node density, energy budget, link stability, memory limits, and the consequence of the first packet being delayed.
3.4 Evidence-Based Routing Family
A routing selection record should describe what the network needs before naming DSDV, DSR, ZRP, or any other implementation. The record is a compact contract: how often nodes talk, how quickly the first packet must move, how much topology changes, how much energy can be spent on control traffic, and who validates route failures in the field.
Make the comparison in operational units, not slogans. For a proactive candidate such as DSDV, record update interval, sequence-number freshness, table size, and control duty cycle. For a reactive candidate such as DSR or AODV, record route-request scope, discovery latency, route-cache or route-error behavior, and retry limits. For a hybrid candidate such as ZRP, record zone radius, intra-zone maintenance cost, and inter-zone discovery delay.
Approval steps
- Write the service requirement: latency, delivery tolerance, traffic cadence, and coverage boundary.
- Record topology evidence: node density, mobility, expected link changes, and gateway placement.
- Compare proactive, reactive, and hybrid behavior against that evidence.
- Pilot the chosen family with route repair, node loss, weak links, and traffic bursts.
- Approve only when the field trace matches the selection record.
Do not approve a routing choice only because a simulator delivered one packet. The field gate should include route setup, repair, stale route handling, and the energy cost paid by relays.
3.5 Control Traffic vs Data Traffic
Every routing family spends control traffic differently. Proactive protocols spend it continuously to keep tables fresh. Reactive protocols spend it when discovery or repair is needed. Hybrid protocols spend it locally all the time and farther away only on demand. The right model counts control packets, retransmissions, overhearing, memory pressure, and route invalidation behavior, not just data-packet delivery.
Proactive designs usually rely on freshness metadata so nodes can reject older routes. DSDV, for example, uses destination sequence numbers to prefer fresh information and avoid loops, but the table-update cadence still consumes airtime and memory. OLSR uses a different optimization: each node selects multipoint relays, or MPRs, so only selected neighbors rebroadcast topology information while still covering the two-hop neighborhood. That reduces broadcast overhead compared with every node flooding every update, but it also makes the MPR choice part of the evidence: weak or overloaded relays can save control traffic on paper while concentrating battery, forwarding, and resilience risk in the field. The field question is whether the application benefits enough from ready paths to pay that continuing cost.
Reactive designs move cost to the moment a route is needed. Route requests, route replies, cached source routes, or route errors can keep idle overhead low, but they create delay and bursty control traffic at flow start or repair time. A quiet demo may miss the worst case: many nodes discovering or repairing routes at once after movement, obstruction, or gateway loss.
Hybrid designs add another tuning knob. A zone that is too small behaves like reactive routing for too many destinations; a zone that is too large spends proactive control traffic across links that rarely carry useful data. The zone radius is not a decorative parameter; it is a claim about local traffic patterns and topology stability.
Acceptance testing should therefore capture route lifetime, control bytes per delivered payload byte, duplicate route discoveries, route-error rate, relay energy, and time from link break to application-visible recovery. Those measurements reveal loops, black holes, stale caches, and overworked relays before they become field incidents.
Freshness
Tables can become stale when nodes move, batteries die, or interference changes links. Freshness mechanisms reduce stale routes but add overhead.
Discovery scope
Flooding can find a route without prior knowledge, but broad floods consume airtime and can collide with useful traffic.
Loop and failure handling
Sequence numbers, route errors, cached-path expiry, and repair rules exist because old path information can create loops or black holes.
Worked reasoning pattern
For a static industrial mesh with frequent monitoring traffic, proactive maintenance may be acceptable because the network buys low first-packet latency. For a mobile emergency team with sparse event traffic, reactive discovery may be more defensible because idle overhead matters and topology changes often. For a large mixed deployment, hybrid routing may be useful when local traffic is common but distant traffic is occasional.
The important test is not whether the family name sounds efficient. It is whether measured control traffic, route repair time, relay energy, and delivery behavior match the service requirement under representative field movement and interference.
3.6 Summary
- Multi-hop routing extends range by forwarding through peers, but every relay hop consumes airtime, energy, buffer space, and operational trust.
- Proactive routing keeps routes ready and can reduce first-packet delay, at the cost of continuing control traffic.
- Reactive routing discovers paths on demand and can reduce idle overhead, at the cost of discovery delay and repair floods.
- Hybrid routing keeps local routes ready and discovers farther routes when needed, but zone maintenance is still a real cost.
- A defensible selection record includes traffic pattern, mobility, relay energy, route repair, and field validation evidence.
3.7 Key Takeaway
Choose ad-hoc routing from the service evidence. The best protocol family is the one whose control overhead, repair behavior, latency, and relay energy match the field requirement, not the one that wins a quiet single-packet demo.
3.8 See Also
- Ad-Hoc Network Concepts - infrastructure-free operation, peer forwarding, and topology change.
- DSDV Proactive Routing - route-table maintenance and proactive trade-offs.
- DSR Fundamentals and Route Discovery - on-demand discovery, cached paths, and repair behavior.
- Ad Hoc Routing: Hybrid (ZRP) - local zones and inter-zone discovery.