The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
A distributed routing algorithm for datagram traffic in LEO satellite networks
Abstract
Satellite networks provide global coverage and support a wide range of services, low Earth orbit (LEO) satellites provide short round-trip delays and are becoming increasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algorithms. In this work, a datagram routing algorithm for LEO satellite networks is introduced. The algorithm generates minimum propagation delay paths. The performance of the algorithm is evaluated through simulations. The robustness issues of the algorithm are also discussed.
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
ATM-based routing in LEO/MEO satellite networks with intersatellite links
Werner, M., Delucchi, C., Vogel, H.-J., Maral, G., & De Ridder, J.-J. (1997) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.553679 · Cited by 219
Datagram routing algorithm for LEO satellite networks
Ekici, E., Akyildiz, I. F., & Bender, M. D. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832223 · Cited by 89
Self-citationUzunalioğlu, H., Akyildiz, I. F., & Bender, M. D. (2000) · Wireless Networks · doi:10.1023/a:1019133429805 · Cited by 50
Self-citationPerformance of optimized routing in LEO intersatellite link networks
Werner, M., Berndl, G., & Edmaier, B. (2002) · IEEE Vehicular Technology Conference (VTC) · doi:10.1109/vetec.1997.596357 · Cited by 41
Satellite-constellation design
Lo, M. W. (1999) · Computing in Science & Engineering · doi:10.1109/5992.743623 · Cited by 37
Cited by
A Survey on Space-Air-Ground-Sea Integrated Network Security in 6G
Guo, H., Li, J., Liu, J., Tian, N., & Kato, N. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3131332 · Cited by 529
Analysis of Inter-Satellite Link Paths for LEO Mega-Constellation Networks
Chen, Q., Giambene, G., Yang, L., Fan, C., & Chen, X. (2021) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2021.3058126 · Cited by 335
Metadata
- Authors
- Ekici, E., Akyildiz, I. F., & Bender, M. D.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2001-04
- Volume
- 9
- Issue
- 2
- Pages
- 137-147
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2109495845
- Cited by
- 438
- References
- 5
- FWCI
- 26.08
- Type
- journal article
- 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.