The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
ARA-the ant-colony based routing algorithm for MANETs
Abstract
A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These kind of networks are very flexible, thus they do not require any existing infrastructure or central administration. Therefore, mobile ad-hoc networks are suitable for temporary communication links. The biggest challenge in this kind of networks is to find a path between the communication end points, what is aggravated through the node mobility. In this paper we present a new on-demand routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence and especially on the ant colony based meta heuristic. These approaches try to map the solution capability of swarms to mathematical and engineering problems. The introduced routing protocol is highly adaptive, efficient and scalable. The main goal in the design of the protocol was to reduce the overhead for routing. We refer to the protocol as the ant-colony-based routing algorithm (ARA).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ad hoc On-Demand Distance Vector (AODV) Routing
Perkins, C., Belding-Royer, E., & Das, S. (2003) · doi:10.17487/rfc3561 · Cited by 10,686
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190336 · Cited by 6,678
Swarm Intelligence: From Natural to Artificial Systems
Bonabeau, E., Dorigo, M., & Theraulaz, G. (1999) · Oxford University Press eBooks · doi:10.1093/oso/9780195131581.001.0001 · Cited by 6,435
A performance comparison of multi-hop wireless ad hoc network routing protocols
Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y.-C., & Jetcheva, J. (1998) · Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/288235.288256 · Cited by 4,673
Ant colony optimization: a new meta-heuristic
Dorigo, M., & Di Caro, G. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.782657 · Cited by 2,137
Perkins, C. E. (2008) · Cited by 1,889
The Ant Colony Optimization Metaheuristic
(2004) · Ant Colony Optimization · doi:10.7551/mitpress/1290.003.0004 · Cited by 1,406
Ad hoc mobile wireless networks : protocols and systems
Toh, C.-K. (2002) · International Linear Collider · Cited by 1,022
Cited by
A survey of swarm intelligence for dynamic optimization: Algorithms and applications
Mavrovouniotis, M., Li, C., & Yang, S. (2017) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2016.12.005 · Cited by 585
AntHocNet: an adaptive nature‐inspired algorithm for routing in mobile ad hoc networks
Di Caro, G., Ducatelle, F., & Gambardella, L. M. (2005) · European Transactions on Telecommunications · doi:10.1002/ett.1062 · Cited by 579
Hu, T., & Fei, Y. (2010) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2010.28 · Cited by 405
Metadata
- Authors
- Gunes, M., Sorges, U., & Bouazizi, I.
- Venue
- Proceedings. International Conference on Parallel Processing Workshop
- Publisher
- IEEE
- Published
- 2002
- Pages
- 79-85
- ISSN
- 1530-2016 (ISSN-L)
- OpenAlex
- W2160739098
- Cited by
- 599
- References
- 8
- FWCI
- 10.01
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: ARA-the ant-colony based routing algorithm for MANETs. https://app.cochat.ai/papers/10.1109/icppw.2002.1039715
- The paper
- Gunes, M., Sorges, U., & Bouazizi, I. (2002). ARA-the ant-colony based routing algorithm for MANETs. Proceedings. International Conference on Parallel Processing Workshop. https://doi.org/10.1109/icppw.2002.1039715
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.