The DOI matches its Crossref record.
A reliable, efficient topology broadcast protocol for dynamic networks
Abstract
We present, prove correctness for, and evaluate a protocol for the reliable broadcast of topology and link-state information in a multihop communication network with a dynamic topology, such as a wireless network with mobile nodes. The protocol is called topology broadcast based on reverse path forwarding (TBRPF), and uses the concept of reverse-path forwarding (RPF) to broadcast link-state updates in the reverse direction along the spanning tree formed by the minimum-hop paths from all nodes to the source of the update TBRPF uses the topology information received along the broadcast trees to compute the minimum-hop paths that form the trees themselves, and is the first topology broadcast protocol based on RPF with this property. The use of minimum-hop trees instead of shortest-path trees (based on link costs) results in less frequent changes to the broadcast trees and therefore less communication cost to maintain the trees. Simulations show that TBRPF achieves up to a 98% reduction in communication cost compared to flooding in a 20-node network.
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
Cited by
Packet leashes: a defense against wormhole attacks in wireless networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1209219 · Cited by 1,513
Flying Ad-Hoc Networks (FANETs): A survey
Bekmezci, İ., Sahingoz, O. K., & Temel, Ş. (2013) · Ad Hoc Networks · doi:10.1016/j.adhoc.2012.12.004 · Cited by 1,510
Ariadne: a secure on-demand routing protocol for ad hoc networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2002) · Proceedings of the 8th annual international conference on Mobile computing and networking · doi:10.1145/570645.570648 · Cited by 1,298
Energy-Efficient Routing Protocols in Wireless Sensor Networks: A Survey
Pantazis, N. A., Nikolidakis, S. A., & Vergados, D. D. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.062612.00084 · Cited by 1,286
Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2005) · Wireless Networks · doi:10.1007/s11276-004-4744-y · Cited by 1,033
SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks
Hu, Y.-C., Johnson, D. B., & Perrig, A. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00019-2 · Cited by 830
Wormhole attacks in wireless networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861394 · Cited by 660
SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks
Hu, Y.-C., Johnson, D. B., & Perrig, A. (2003) · Proceedings Fourth IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.2002.1017480 · Cited by 636
A survey of secure wireless ad hoc routing
Yih-Chun, H., & Perrig, A. (2004) · IEEE Security & Privacy Magazine · doi:10.1109/msp.2004.1 · Cited by 542
LITEWORP: A Lightweight Countermeasure for the Wormhole Attack in Multihop Wireless Networks
Khalil, I., Bagchi, S., & Shroff, N. B. (2005) · 2005 International Conference on Dependable Systems and Networks (DSN'05) · doi:10.1109/dsn.2005.58 · Cited by 284
Raza, M., Aslam, N., Le-Minh, H., Hussain, S., Cao, Y., & Khan, N. M. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2759725 · Cited by 261
UCoin: An Efficient Privacy Preserving Scheme for Cryptocurrencies
Nosouhi, M. R., Yu, S., Sood, K., Grobler, M., Jurdak, R., Dorri, A., & Shen, S. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3130952 · Cited by 32
“We assume that the N peers in the group communicate through a reliable broadcast communication protocol [37], [38].”
BackgroundMethod
Metadata
- Authors
- Bellur, B., & Ogier, R. G.
- Venue
- IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)
- Publisher
- IEEE
- Published
- 1999
- Pages
- 178-186 vol.1
- OpenAlex
- W2088595192
- Cited by
- 184
- References
- 0
- FWCI
- 2.60
- Type
- conference paper
- Language
- en
- Open access
- closed
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.