Ant nest · Protocol · swarm-routing/ARA
ARA
The Ant-Colony-Based Routing Algorithm: reactive ants, data that reinforces its own path.
Under construction: v0.1.0 released, 1 epic in progress Computed from its 1 epic · release v0.1.0, as they stood on .
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 | present |
ns3/ | contrib module ara: header codec, adapter, helper, examples, test suite | GPL-2.0-only | present |
docs/fidelity.md | paper section -> implementation, every parameter sourced | GPL-2.0-only | present |
.github/workflows/ | reusable-ns3-ci with swarm-core as a dependency | GPL-2.0-only | present |
Where it sits in the colony
Quests
The repository's epics and their sub-issues, as the issues stood on 2026-11-13: 3 of 4 sub-issues closed.
- #3 ARA as a standalone hexagonal protocol (Phase 3)
In progress · 3 / 4 sub-issues closed
Cite this project
Using ARA in a paper? Cite the project as below, and the works it rests on from its references.
Text
Joppi, Daniel Henrique (n.d.). ARA (version 0.2.0) [Computer software]. https://doi.org/10.5281/zenodo.24125198
BibTeX
@software{ara,
author = {Joppi, Daniel Henrique},
title = {ARA},
version = {0.2.0},
doi = {10.5281/zenodo.24125198},
url = {https://github.com/swarm-routing/ARA}
}- Version
- 0.2.0
- Author
- Daniel Henrique Joppi · ORCID
- Licence
- GPL-2.0-only
Read from CITATION.cff at main when this site was built.
References
The 5 works docs/references.bib lists, read at main when this site was built. Each links its DOI; a work with none links its publisher's or institution's page.
Implemented
- Gunes, Sorges & Bouazizi, ARA-the ant-colony based routing algorithm for MANETs, Proceedings. International Conference on Parallel Processing Workshop, 2002, pp. 79–85. DOI 10.1109/icppw.2002.1039715
Restates
- Arif & Rani, ACO Based Routing for MANETs, International Journal of Wireless & Mobile Networks 4(2), 2012, pp. 163–174. DOI 10.5121/ijwmn.2012.4211
- Roth, Termite: A Swarm Intelligent Routing Algorithm For Mobile Wireless Ad-Hoc Networks, PhD thesis, Cornell University, 2005. hdl.handle.net
Software it builds on
- Joppi, ns3-swarm-core, Zenodo, 2026. DOI 10.5281/zenodo.24138628
Background
- Broch et al., A performance comparison of multi-hop wireless ad hoc network routing protocols, Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking, 1998, pp. 85–97. DOI 10.1145/288235.288256
Sources
- M. Güneş, U. Sorges, I. Bouazizi, ARA: the ant-colony based routing algorithm for MANETs, Proc. ICPP Workshops (ICPPW), 2002.
The status and the quests come from the repository's issues and releases (2026-11-13); the other
facts on this page are kept by hand from its AGENTS.md (as of 2026-11-08).