Ant nest · Protocol · swarm-routing/ARA
ARA
The Ant-Colony-Based Routing Algorithm: reactive ants, data that reinforces its own path.
Locked: Phase 3: waits on swarm-core
What it does
ARA (Güneş, Sorges & Bouazizi, 2002) is the lean ancestor in the family. Route discovery floods a forward ant (FANT) from the source; every node it reaches records pheromone back towards the source. The destination answers with a backward ant (BANT), which sets up pheromone towards the destination on the way back.
After discovery there are no maintenance ants: data packets themselves reinforce the pheromone of the links they use, and pheromone evaporates over time, so unused routes fade. Duplicate packets are detected by sequence number to stop loops, and a broken link makes the node try another next hop before reporting a route error upstream.
Here ARA becomes a standalone protocol on the org's hexagonal pattern: a fresh simulator-agnostic core/ on swarm-core, the ns-3 module ara, a fidelity sheet citing the paper for every parameter, then the three comparator gates. It replaces AntHocNet's ara comparator arm.
Diagrams
opt, loop, alt). Drawn from the paper; the repository's fidelity sheet is the authority once written.core/ includes no simulator header; time, randomness, neighbours and timers arrive through ports, and every adapter only carries out the core's decisions. Dashed: planned.core to GPL-only code. Dashed outlines: planned.Package structure
The repository's layout, its licence per directory (LICENSING.md) and what exists today.
| Path | What | Licence | State |
|---|---|---|---|
core/ | simulator-agnostic algorithm + unit tests (no ns-3 headers) | MIT OR GPL-2.0-only | planned |
ns3/ | contrib module ara: header codec, adapter, helper, examples, test suite | GPL-2.0-only | planned |
docs/fidelity.md | paper section -> implementation, every parameter sourced | GPL-2.0-only | planned |
.github/workflows/ | reusable-ns3-ci with swarm-core as a dependency | GPL-2.0-only | present |
Where it sits in the colony
Quests
- Open: Fidelity sheet: every parameter sourced or marked repo choice / unknown
- Open: Module green in CI; same seed, byte-identical output
- Open: Anchor verdict recorded in benchmarks (PASS, or a written infeasibility verdict)
Sources
- M. Güneş, U. Sorges, I. Bouazizi, ARA: the ant-colony based routing algorithm for MANETs, Proc. ICPP Workshops (ICPPW), 2002.
Facts as of 2026-11-08, from the repository's AGENTS.md and the org ROADMAP.