The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Multicast tree construction and flooding in wireless ad hoc networks
Open accessAbstract
In an ad hoc network, each host assumes the role of a router and relays packets toward final destinations. This paper studies efficient routing mechanisms for multicast and broadcast in ad hoc wireless networks. Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. In this paper, we point out that the number of packet forwarding is the more important cost factor than the number of links in the ad hoc network. After we show constructing minimum cost multicast tree is hard, we propose two new flooding methods, self pruning and dominant pruning. Both methods utilize neighbor information to reduce redundant transmissions. Performance analysis shows that both methods perform significantly better than blind flooding. Especially, dominant pruning performs close to the practically achievable best performance limit.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Ad-hoc on-demand distance vector routing
Perkins, C. E., & Royer, E. M. (1999) · Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.1999.749281 · Cited by 10,313
Dynamic Source Routing in Ad Hoc Wireless Networks
Johnson, D. B., & Maltz, D. A. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_5 · Cited by 8,518
The broadcast storm problem in a mobile ad hoc network
Ni, S.-Y., Tseng, Y.-C., Chen, Y.-S., & Sheu, J.-P. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313525 · Cited by 3,144
A highly adaptive distributed routing algorithm for mobile wireless networks
Park, V. D., & Corson, M. S. (2002) · Proceedings of INFOCOM '97 · doi:10.1109/infcom.1997.631180 · Cited by 2,234
Even, S. (1979) · Cited by 1,280
On the ratio of optimal integral and fractional covers
Lovász, L. (1975) · Discrete Mathematics · doi:10.1016/0012-365x(75)90058-8 · Cited by 1,114
Planar Formulae and Their Uses
Lichtenstein, D. (1982) · SIAM Journal on Computing · doi:10.1137/0211025 · Cited by 769
On-demand multicast routing protocol
Lee, S.-J., Gerla, M., & Chiang, C. (2003) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.1999.796947 · Cited by 716
A new routing protocol for the reconfigurable wireless networks
Haas, Z. J. (2002) · IEEE International Conference on Universal Personal Communications (ICUPC) · doi:10.1109/icupc.1997.627227 · Cited by 695
Cited by
Comparison of broadcasting techniques for mobile ad hoc networks
Williams, B., & Camp, T. (2002) · Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/513800.513825 · Cited by 1,262
Probabilistic broadcast for flooding in wireless mobile ad hoc networks
Sasson, Y., Cavin, D., & Schiper, A. (2004) · 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003. · doi:10.1109/wcnc.2003.1200529 · Cited by 461
Efficient and Reliable Broadcast in Intervehicle Communication Networks: A Cross-Layer Approach
Bi, Y., Cai, L. X., Shen, X., & Zhao, H. (2010) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2010.2044905 · Cited by 82
“1) simple flooding [12], [13], in which a node rebroadcasts a new message until it reaches all connected nodes in the network; 2) probability-based methods [14], in which protocols can be further divided into two subclasses: a) a node rebroadcasts a message according to a predefined probability, and this scheme become…”
Method
Metadata
- Authors
- Lim, H., & Kim, C.
- Venue
- Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
- Publisher
- ACM
- Published
- 2000-08-11
- Pages
- 61-68
- OpenAlex
- W1969317826
- Cited by
- 433
- References
- 11
- FWCI
- 4.69
- Type
- conference paper
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.