Journal article · 2010 · Open access
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs
International Journal of Ad hoc Sensor & Ubiquitous Computing, 1(3), 72–83 · Published 30 September 2010 · DOI 10.5121/ijasuc.2010.1306
In brief
“A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs” is a 2010 journal article by Sankar Sharmila and Venkadachalam Sankaranarayanan, published in International Journal of Ad hoc Sensor & Ubiquitous Computing. OpenAlex counts 3 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 3
- Most cited in
- 2015 (1)
- Field-weighted impact
- 0.36
- References
- 16
- Authors
- 2
Abstract
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols which broadcasts control packets to discover routes to the destination nodes, generate a high number of broadcast packets in a larger networks causing contention and collision. We propose an efficient route discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique. The simulation results show that the proposed probabilistic flooding decreases the number of control packets floating in the network during route discovery phase, without lowering the success ratio of path discoveries. Furthermore, the proposed method adapts to the normal network conditions. The results show that up to 70% of control packet traffic is saved in route discovery phase when the network is denser.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Sharmila, S., & Sankaranarayanan, V. (2010). A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs. International Journal of Ad hoc Sensor & Ubiquitous Computing, 1(3), 72–83. https://doi.org/10.5121/ijasuc.2010.1306
MLA 9
Sharmila, Sankar, and Venkadachalam Sankaranarayanan. “A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs.” International Journal of Ad hoc Sensor & Ubiquitous Computing, vol. 1, no. 3, 2010, pp. 72–83. https://doi.org/10.5121/ijasuc.2010.1306.
Chicago
Sharmila, Sankar and Venkadachalam Sankaranarayanan. 2010. “A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs.” International Journal of Ad hoc Sensor & Ubiquitous Computing 1 (3): 72–83. https://doi.org/10.5121/ijasuc.2010.1306.
Harvard
Sharmila, S. and Sankaranarayanan, V. (2010) ‘A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs’, International Journal of Ad hoc Sensor & Ubiquitous Computing, 1(3), pp. 72–83. doi:10.5121/ijasuc.2010.1306.
IEEE
S. Sharmila and V. Sankaranarayanan, “A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs,” International Journal of Ad hoc Sensor & Ubiquitous Computing, vol. 1, no. 3, pp. 72–83, 2010, doi: 10.5121/ijasuc.2010.1306.
BibTeX
@article{sharmila2010overhead,
title = {{A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs}},
author = {Sharmila, Sankar and Sankaranarayanan, Venkadachalam},
journal = {International Journal of Ad hoc Sensor \& Ubiquitous Computing},
year = {2010},
volume = {1},
number = {3},
pages = {72--83},
doi = {10.5121/ijasuc.2010.1306},
url = {https://doi.org/10.5121/ijasuc.2010.1306}
}
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
- mobile ad hoc networks
- route discovery
- dense networks
- controlled flooding
- probabilistic flooding
- control packet overhead
- on-demand routing
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?
Sharmila, S., & Sankaranarayanan, V. (2010). A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs. International Journal of Ad hoc Sensor & Ubiquitous Computing, 1(3), 72–83. https://doi.org/10.5121/ijasuc.2010.1306
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 arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Sankar Sharmila, Venkadachalam Sankaranarayanan.
What is the DOI of this paper?
10.5121/ijasuc.2010.1306, permanently at https://doi.org/10.5121/ijasuc.2010.1306. Sign in and open it from this page.
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.