Journal article · 2018
An Optimal Routing Algorithm for Interconnection of Heterogeneous Ad Hoc Networks
IEICE Technical Report; IEICE Tech. Rep., 117(460), 219–224 · Published 22 February 2018
In brief
“An Optimal Routing Algorithm for Interconnection of Heterogeneous Ad Hoc Networks” is a 2018 journal article by Taichi Miya and 3 co-authors, published in IEICE Technical Report; IEICE Tech. Rep.. 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
- 4
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Miya, T., Ohshima, K., Kitaguchi, Y., & Yamaoka, K. (2018). An Optimal Routing Algorithm for Interconnection of Heterogeneous Ad Hoc Networks. IEICE Technical Report; IEICE Tech. Rep., 117(460), 219–224. https://www.ieice.org/ken/paper/20180302O1Di/eng/
MLA 9
Miya, Taichi, et al. “An Optimal Routing Algorithm for Interconnection of Heterogeneous Ad Hoc Networks.” IEICE Technical Report; IEICE Tech. Rep., vol. 117, no. 460, 2018, pp. 219–224. https://www.ieice.org/ken/paper/20180302O1Di/eng/.
Chicago
Miya, Taichi, Kohta Ohshima, Yoshiaki Kitaguchi, and K. Yamaoka. 2018. “An Optimal Routing Algorithm for Interconnection of Heterogeneous Ad Hoc Networks.” IEICE Technical Report; IEICE Tech. Rep. 117 (460): 219–224. https://www.ieice.org/ken/paper/20180302O1Di/eng/.
Harvard
Miya, T. et al. (2018) ‘An Optimal Routing Algorithm for Interconnection of Heterogeneous Ad Hoc Networks’, IEICE Technical Report; IEICE Tech. Rep., 117(460), pp. 219–224. Available at: https://www.ieice.org/ken/paper/20180302O1Di/eng/.
IEEE
T. Miya, K. Ohshima, Y. Kitaguchi, and K. Yamaoka, “An Optimal Routing Algorithm for Interconnection of Heterogeneous Ad Hoc Networks,” IEICE Technical Report; IEICE Tech. Rep., vol. 117, no. 460, pp. 219–224, 2018.
BibTeX
@article{miya2018optimal,
title = {{An Optimal Routing Algorithm for Interconnection of Heterogeneous Ad Hoc Networks}},
author = {Miya, Taichi and Ohshima, Kohta and Kitaguchi, Yoshiaki and Yamaoka, K.},
journal = {IEICE Technical Report; IEICE Tech. Rep.},
year = {2018},
volume = {117},
number = {460},
pages = {219--224},
url = {https://www.ieice.org/ken/paper/20180302O1Di/eng/}
}
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
- optimal routing algorithm
- heterogeneous ad hoc networks
- network interconnection
- multi-hop routing
- mobile ad hoc networks
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?
Miya, T., Ohshima, K., Kitaguchi, Y., & Yamaoka, K. (2018). An Optimal Routing Algorithm for Interconnection of Heterogeneous Ad Hoc Networks. IEICE Technical Report; IEICE Tech. Rep., 117(460), 219–224. https://www.ieice.org/ken/paper/20180302O1Di/eng/
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?
Taichi Miya, Kohta Ohshima, Yoshiaki Kitaguchi, K. Yamaoka.
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.