Ad-Hoc Routing Visualizer
Ad-Hoc Routing Visualizer
Explore Dynamic Routing Protocols
SimulationEmerging paradigmsMANET routing
Ad-Hoc Routing Visualizer
Explore self-organizing wireless networks where each node acts as both host and router. Compare how discovery latency and control overhead change as the topology becomes sparse or mobile.
AODVInitial protocolStable meshInitial scenario12 nodesInitial field size150 mInitial radio range
TryChoose the first Scenario, retain the displayed Route policy, and use Step to advance from neighbor discovery.
ObserveAt each Step, Selected route, hop count, delivery estimate, and control overhead change as discovery and repair expose usable links.
ExplainRoute policy accumulates per-link cost across 1 candidate graph; topology change invalidates the old next hop and triggers a distributed choice.
Technical boundariesNode motion and link changes are scripted from fixed fixtures; propagation randomness, MAC contention, stale routing timers, battery drain, packet queues, and security attacks are not simulated.
Colour keyemerging paradigms identitycurrent / primaryreference / datasuccesscautionerror / failure
Goal
See how route discovery works when wireless nodes forward for each other.
Try
Run the guided scenarios, then use Compare Protocols on the same topology.
Watch
Compare route length, control messages, discovery delay, and failure cases.
Reflect
Which protocol would you choose for moving battery-powered sensors?
Guided Investigation
- Start with Stable Mesh and run AODV to see route request and reply behavior.
- Switch to Corridor Multi-Hop and compare AODV, DSR, and ZRP on the same path.
- Use Partition Risk, then raise radio range until the network becomes connected.
Scenario Focus
Stable Mesh gives the learner a connected baseline with several route choices.
Ready: route available
Idle Node
RREQ Flood
RREP Path
Active Route
Source/Dest
--
Hop Count
--
Control Msgs
--
Discovery (ms)
AODV (Reactive)
AODV discovers routes on-demand using RREQ flooding and RREP unicast replies. Hop-by-hop routing with sequence numbers prevents loops.
What to Notice
Run discovery, then compare whether lower delay is worth extra control traffic.
Event Log
Protocol Comparison on Current Topology
| Protocol | Route | Control Cost | Discovery Delay | Best Fit |
|---|---|---|---|---|
| Select Compare Protocols to evaluate all protocols on the same topology. | ||||