Journal article · 2007
Research on Routing Overhead for Ad Hoc Networks
Microelectronics & Computer · Published 1 January 2007
In brief
“Research on Routing Overhead for Ad Hoc Networks” is a 2007 journal article by Yu Chao, published in Microelectronics & Computer. 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
- 1
Abstract
Systemic and in-depth research on routing overhead for Ad Hoc networks is conducted in this paper.Based on analyzing routing overhead mechanism,several typical approaches and strategy for overhead optimization are studied and summarized,including Flooding optimization techniques,multi-scope techniques,increment HELLO techniques,least-overhead routing approach and on-demand strategy,etc.then the effect brought by nodes density,traffic,mobility on routing overhead is studied by… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Chao, Y. (2007). Research on Routing Overhead for Ad Hoc Networks. Microelectronics & Computer. https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=WXYJ200707030
MLA 9
Chao, Yu. “Research on Routing Overhead for Ad Hoc Networks.” Microelectronics & Computer, 2007. https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=WXYJ200707030.
Chicago
Chao, Yu. 2007. “Research on Routing Overhead for Ad Hoc Networks.” Microelectronics & Computer. https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=WXYJ200707030.
Harvard
Chao, Y. (2007) ‘Research on Routing Overhead for Ad Hoc Networks’, Microelectronics & Computer. Available at: https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=WXYJ200707030.
IEEE
Y. Chao, “Research on Routing Overhead for Ad Hoc Networks,” Microelectronics & Computer, 2007.
BibTeX
@article{chao2007research,
title = {{Research on Routing Overhead for Ad Hoc Networks}},
author = {Chao, Yu},
journal = {Microelectronics \& Computer},
year = {2007},
url = {https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=WXYJ200707030}
}
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
- routing overhead
- ad hoc networks
- HELLO messages
- on-demand routing
- node density
- traffic load
- node mobility
- medium access control
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?
Chao, Y. (2007). Research on Routing Overhead for Ad Hoc Networks. Microelectronics & Computer. https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=WXYJ200707030
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?
Yu Chao.
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.