Journal article · 2020 · Open access

AN EFFICIENT ROUTING PROTOCOL FOR SHORTEST PATH SELECTION IN MOBILE ADHOC NETWORKS

Gurjeet Gurjeet Singh

Nimitmai Review Journal, 3(1) · Published 1 January 2020

Open PDFView at the publisherCite this paper

In brief

“AN EFFICIENT ROUTING PROTOCOL FOR SHORTEST PATH SELECTION IN MOBILE ADHOC NETWORKS” is a 2020 journal article by Gurjeet Gurjeet Singh, published in Nimitmai Review Journal. OpenAlex counts 0 citations as of 19 November 2026. It is open access: the full text is free to read at Nimitmai Review Journal.

Citations
0
References
12
Authors
1

Abstract

Mobile Adhoc Network (MANET) helps us in setting up a network of mobile nodes like laptop, smart phones, tablet etc. without the need of any infrastructure. We can develop a temporary network in the battle field, forest, hilly area, meeting rooms, disaster area etc. The nodes in this network can move freely and change their position and thus the topology of the network at any time. Nodes are battery operated and resource constrained. MANET uses wireless media for data communication. In this paper we proposed an efficient routing protocol for shortest path selection in mobile adhoc networks and that is simulated with other protocols on the basis of throughput, packet loss and end to end delay.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Singh, G. G. (2020). AN EFFICIENT ROUTING PROTOCOL FOR SHORTEST PATH SELECTION IN MOBILE ADHOC NETWORKS. Nimitmai Review Journal, 3(1). https://so04.tci-thaijo.org/index.php/nmrj/article/view/248714

MLA 9

Singh, Gurjeet Gurjeet. “AN EFFICIENT ROUTING PROTOCOL FOR SHORTEST PATH SELECTION IN MOBILE ADHOC NETWORKS.” Nimitmai Review Journal, vol. 3, no. 1, 2020. https://so04.tci-thaijo.org/index.php/nmrj/article/view/248714.

Chicago

Singh, Gurjeet Gurjeet. 2020. “AN EFFICIENT ROUTING PROTOCOL FOR SHORTEST PATH SELECTION IN MOBILE ADHOC NETWORKS.” Nimitmai Review Journal 3 (1). https://so04.tci-thaijo.org/index.php/nmrj/article/view/248714.

Harvard

Singh, G. G. (2020) ‘AN EFFICIENT ROUTING PROTOCOL FOR SHORTEST PATH SELECTION IN MOBILE ADHOC NETWORKS’, Nimitmai Review Journal, 3(1). Available at: https://so04.tci-thaijo.org/index.php/nmrj/article/view/248714.

IEEE

G. G. Singh, “AN EFFICIENT ROUTING PROTOCOL FOR SHORTEST PATH SELECTION IN MOBILE ADHOC NETWORKS,” Nimitmai Review Journal, vol. 3, no. 1, 2020.

BibTeX

@article{singh2020efficient,
  title     = {{AN EFFICIENT ROUTING PROTOCOL FOR SHORTEST PATH SELECTION IN MOBILE ADHOC NETWORKS}},
  author    = {Singh, Gurjeet Gurjeet},
  journal   = {Nimitmai Review Journal},
  year      = {2020},
  volume    = {3},
  number    = {1},
  url       = {https://so04.tci-thaijo.org/index.php/nmrj/article/view/248714}
}

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
  • routing protocols
  • shortest path selection
  • dynamic topology
  • resource-constrained nodes
  • wireless communication
  • throughput
  • packet loss

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Singh, G. G. (2020). AN EFFICIENT ROUTING PROTOCOL FOR SHORTEST PATH SELECTION IN MOBILE ADHOC NETWORKS. Nimitmai Review Journal, 3(1). https://so04.tci-thaijo.org/index.php/nmrj/article/view/248714

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?

Yes. It is open access at Nimitmai Review Journal: sign in and open the PDF from this page.

Who wrote this paper?

Gurjeet Gurjeet Singh.

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.