Journal article · 2011 · Open access
Multiple Feasible Paths in Ant Colony Algorithm for mobile Adhoc Networks with Minimum Overhead
Global Journal of Computer Science and Technology · Published 3 March 2011
In brief
“Multiple Feasible Paths in Ant Colony Algorithm for mobile Adhoc Networks with Minimum Overhead” is a 2011 journal article by Shweta Modi and Jitendra Prithviraj, published in Global Journal of Computer Science and Technology. OpenAlex counts 3 citations as of 19 November 2026. It is open access: the full text is free to read at Global Journal of Computer Science and Technology.
- Citations
- 3
- Most cited in
- 2012 (1)
- Field-weighted impact
- 0.36
- Authors
- 2
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Modi, S., & Prithviraj, J. (2011). Multiple Feasible Paths in Ant Colony Algorithm for mobile Adhoc Networks with Minimum Overhead. Global Journal of Computer Science and Technology. http://computerresearch.org/index.php/computer/article/view/705
MLA 9
Modi, Shweta, and Jitendra Prithviraj. “Multiple Feasible Paths in Ant Colony Algorithm for mobile Adhoc Networks with Minimum Overhead.” Global Journal of Computer Science and Technology, 2011. http://computerresearch.org/index.php/computer/article/view/705.
Chicago
Modi, Shweta and Jitendra Prithviraj. 2011. “Multiple Feasible Paths in Ant Colony Algorithm for mobile Adhoc Networks with Minimum Overhead.” Global Journal of Computer Science and Technology. http://computerresearch.org/index.php/computer/article/view/705.
Harvard
Modi, S. and Prithviraj, J. (2011) ‘Multiple Feasible Paths in Ant Colony Algorithm for mobile Adhoc Networks with Minimum Overhead’, Global Journal of Computer Science and Technology. Available at: http://computerresearch.org/index.php/computer/article/view/705.
IEEE
S. Modi and J. Prithviraj, “Multiple Feasible Paths in Ant Colony Algorithm for mobile Adhoc Networks with Minimum Overhead,” Global Journal of Computer Science and Technology, 2011.
BibTeX
@article{modi2011multiple,
title = {{Multiple Feasible Paths in Ant Colony Algorithm for mobile Adhoc Networks with Minimum Overhead}},
author = {Modi, Shweta and Prithviraj, Jitendra},
journal = {Global Journal of Computer Science and Technology},
year = {2011},
url = {http://computerresearch.org/index.php/computer/article/view/705}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2012 | 1 | |
| 2015 | 1 | |
| 2023 | 1 |
Its field-weighted citation impact is 0.36: it has been cited 0.36 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Ad Hoc Networks
- ant colony optimization
- mobile ad hoc networks
- routing overhead reduction
- path discovery
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?
Modi, S., & Prithviraj, J. (2011). Multiple Feasible Paths in Ant Colony Algorithm for mobile Adhoc Networks with Minimum Overhead. Global Journal of Computer Science and Technology. http://computerresearch.org/index.php/computer/article/view/705
How many times has this paper been cited?
3 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?
Yes. It is open access at Global Journal of Computer Science and Technology: sign in and open the full text from this page.
Who wrote this paper?
Shweta Modi, Jitendra Prithviraj.
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.