Journal article · 2008
Routing algorithm based on ant colony optimization
Journal of Computer Applications · Published 1 January 2008
In brief
“Routing algorithm based on ant colony optimization” is a 2008 journal article by Wansheng Tang, published in Journal of Computer Applications. OpenAlex counts 0 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 0
- Authors
- 1
Abstract
This paper presents an approach bases on ant colony optimization route algorithm of mobile Ad Hoc networks. It can effectively bear network load in Ad Hoc networks by using the self-adaptability of that ant colony algorithm. The simulations in NS-2 show that it performs very well on Ad Hoc environments, especially in throughput, average latency… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Tang, W. (2008). Routing algorithm based on ant colony optimization. Journal of Computer Applications. https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=JSJY200801005
MLA 9
Tang, Wansheng. “Routing algorithm based on ant colony optimization.” Journal of Computer Applications, 2008. https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=JSJY200801005.
Chicago
Tang, Wansheng. 2008. “Routing algorithm based on ant colony optimization.” Journal of Computer Applications. https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=JSJY200801005.
Harvard
Tang, W. (2008) ‘Routing algorithm based on ant colony optimization’, Journal of Computer Applications. Available at: https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=JSJY200801005.
IEEE
W. Tang, “Routing algorithm based on ant colony optimization,” Journal of Computer Applications, 2008.
BibTeX
@article{tang2008routing,
title = {{Routing algorithm based on ant colony optimization}},
author = {Tang, Wansheng},
journal = {Journal of Computer Applications},
year = {2008},
url = {https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=JSJY200801005}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Ad Hoc Networks
- ant colony optimization
- mobile ad hoc networks
- routing algorithms
- network load balancing
- throughput
- latency
- delivery ratio
- AODV
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Tang, W. (2008). Routing algorithm based on ant colony optimization. Journal of Computer Applications. https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=JSJY200801005
How many times has this paper been cited?
0 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Wansheng Tang.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.