Journal article · 2011
A Robust and Fast Routing Mechanism in Wireless Sensor Networks
IEICE Technical Report; IEICE Tech. Rep., 110(378), 73–78 · Published 13 January 2011
In brief
“A Robust and Fast Routing Mechanism in Wireless Sensor Networks” is a 2011 journal article by Takashi Nagai and 2 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
- 3
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Nagai, T., Kamei, S., & Fujita, S. (2011). A Robust and Fast Routing Mechanism in Wireless Sensor Networks. IEICE Technical Report; IEICE Tech. Rep., 110(378), 73–78. https://www.ieice.org/ken/paper/20110120T0dp/eng/
MLA 9
Nagai, Takashi, et al. “A Robust and Fast Routing Mechanism in Wireless Sensor Networks.” IEICE Technical Report; IEICE Tech. Rep., vol. 110, no. 378, 2011, pp. 73–78. https://www.ieice.org/ken/paper/20110120T0dp/eng/.
Chicago
Nagai, Takashi, Sayaka Kamei, and Satoshi Fujita. 2011. “A Robust and Fast Routing Mechanism in Wireless Sensor Networks.” IEICE Technical Report; IEICE Tech. Rep. 110 (378): 73–78. https://www.ieice.org/ken/paper/20110120T0dp/eng/.
Harvard
Nagai, T., Kamei, S. and Fujita, S. (2011) ‘A Robust and Fast Routing Mechanism in Wireless Sensor Networks’, IEICE Technical Report; IEICE Tech. Rep., 110(378), pp. 73–78. Available at: https://www.ieice.org/ken/paper/20110120T0dp/eng/.
IEEE
T. Nagai, S. Kamei, and S. Fujita, “A Robust and Fast Routing Mechanism in Wireless Sensor Networks,” IEICE Technical Report; IEICE Tech. Rep., vol. 110, no. 378, pp. 73–78, 2011.
BibTeX
@article{nagai2011robust,
title = {{A Robust and Fast Routing Mechanism in Wireless Sensor Networks}},
author = {Nagai, Takashi and Kamei, Sayaka and Fujita, Satoshi},
journal = {IEICE Technical Report; IEICE Tech. Rep.},
year = {2011},
volume = {110},
number = {378},
pages = {73--78},
url = {https://www.ieice.org/ken/paper/20110120T0dp/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 › Energy Efficient Wireless Sensor Networks
- wireless sensor networks
- routing mechanism
- robust 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?
Nagai, T., Kamei, S., & Fujita, S. (2011). A Robust and Fast Routing Mechanism in Wireless Sensor Networks. IEICE Technical Report; IEICE Tech. Rep., 110(378), 73–78. https://www.ieice.org/ken/paper/20110120T0dp/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?
Takashi Nagai, Sayaka Kamei, Satoshi Fujita.
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.