Conference paper · 2002
An All-to-All Multicast Routing Decreasing Channel Overheads in Wireless Ad Hoc Networks.
Computers and Their Applications, 228–231 · Published 1 January 2002
In brief
“An All-to-All Multicast Routing Decreasing Channel Overheads in Wireless Ad Hoc Networks.” is a 2002 conference paper by Zhonghua Zhou and Seong-Moo Yoo, published in Computers and Their Applications. 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
- 2
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Zhou, Z., & Yoo, S.-M. (2002). An All-to-All Multicast Routing Decreasing Channel Overheads in Wireless Ad Hoc Networks. Computers and Their Applications, 228–231. https://dblp.uni-trier.de/db/conf/cata/cata2002.html#ZhouY02
MLA 9
Zhou, Zhonghua, and Seong-Moo Yoo. “An All-to-All Multicast Routing Decreasing Channel Overheads in Wireless Ad Hoc Networks.” Computers and Their Applications, 2002, pp. 228–231. https://dblp.uni-trier.de/db/conf/cata/cata2002.html#ZhouY02.
Chicago
Zhou, Zhonghua and Seong-Moo Yoo. 2002. “An All-to-All Multicast Routing Decreasing Channel Overheads in Wireless Ad Hoc Networks.” Computers and Their Applications: 228–231. https://dblp.uni-trier.de/db/conf/cata/cata2002.html#ZhouY02.
Harvard
Zhou, Z. and Yoo, S.-M. (2002) ‘An All-to-All Multicast Routing Decreasing Channel Overheads in Wireless Ad Hoc Networks.’, Computers and Their Applications, pp. 228–231. Available at: https://dblp.uni-trier.de/db/conf/cata/cata2002.html#ZhouY02.
IEEE
Z. Zhou and S.-M. Yoo, “An All-to-All Multicast Routing Decreasing Channel Overheads in Wireless Ad Hoc Networks.,” Computers and Their Applications, pp. 228–231, 2002.
BibTeX
@inproceedings{zhou2002multicast,
title = {{An All-to-All Multicast Routing Decreasing Channel Overheads in Wireless Ad Hoc Networks.}},
author = {Zhou, Zhonghua and Yoo, Seong-Moo},
booktitle = {Computers and Their Applications},
year = {2002},
pages = {228--231},
url = {https://dblp.uni-trier.de/db/conf/cata/cata2002.html#ZhouY02}
}
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
- multicast routing
- wireless ad hoc networks
- routing protocols
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?
Zhou, Z., & Yoo, S.-M. (2002). An All-to-All Multicast Routing Decreasing Channel Overheads in Wireless Ad Hoc Networks. Computers and Their Applications, 228–231. https://dblp.uni-trier.de/db/conf/cata/cata2002.html#ZhouY02
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?
Zhonghua Zhou, Seong-Moo Yoo.
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.