The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
FSA-based link assignment and routing in low-earth orbit satellite networks
Abstract
We propose a new framework for the link assignment (i.e., topological design) problem that arises from the use of intersatellite links (ISL's) in low-earth orbit (LEO) satellite networks. In the proposed framework, we model an LEO satellite network as a finite state automaton (FSA), where each state corresponds to an equal-length interval in the system period of the LEO satellite network. This FSA-based framework allows the link assignment problem in LEO satellite networks to be treated as a set of link assignment problems in fixed topology networks. Within this framework, we study various link assignment and routing schemes. In particular, both regular link assignment and link assignment optimized by simulated annealing are considered. For each link assignment, both static and dynamic routing schemes are considered. Our simulation results show that the optimized link assignment combined with static routing achieves the best performance in terms of both newly initiated call blocking probability and ongoing call blocking probability. The results also show that when the link assignment is the same, static routing gives better performance than dynamic routing since the latter requires a substantial amount of time to stabilize its routing table after a state transition.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Combinatorial optimization:Algorithms and complexity
Rabiner, L. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164450 · Cited by 3,576
Data and Computer Communications
Stallings, W. (1985) · Cited by 1,152
Data and Computer Communications: Networking and Internetworking
Hura, G. S., & Singhal, M. (2001) · CRC Press eBooks · doi:10.1201/9781420041316 · Cited by 992
Simulated annealing algorithms: an overview
Rutenbar, R. A. (1989) · IEEE Circuits and Devices Magazine · doi:10.1109/101.17235 · Cited by 807
Mobile satellite communications
Wu, W. W., Miller, E. F., Pritchard, W. L., & Pickholtz, R. L. (1994) · Proceedings of the IEEE · doi:10.1109/5.317086 · Cited by 158
Analysis of system parameters for LEO/ICO-satellite communication networks
Werner, M., Jahn, Α., Lutz, E., & Böttcher, A. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.345881 · Cited by 130
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
Distributed Routing Strategy Based on Machine Learning for LEO Satellite Network
Na, Z., Pan, Z., Liu, X., Deng, Z., Gao, Z., & Guo, Q. (2018) · Wireless Communications and Mobile Computing · doi:10.1155/2018/3026405 · Cited by 60
Navigation Resource Allocation Algorithm for LEO Constellations Based on Dynamic Programming
Wang, S., Tang, X., Li, J., Huang, X., Liu, J., & Liu, J. (2024) · Remote Sensing · doi:10.3390/rs16122231 · Cited by 3
Metadata
- Authors
- Chang, H. S., Kim, B. W., Lee, C. G., Min, S. L., Choi, Y., Yang, H. S., Kim, D. N., & Kim, C. S.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 1998
- Volume
- 47
- Issue
- 3
- Pages
- 1037-1048
- ISSN
- 0018-9545 (ISSN-L)
- OpenAlex
- W2121181647
- Cited by
- 269
- References
- 8
- FWCI
- 1.07
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: FSA-based link assignment and routing in low-earth orbit satellite networks. https://app.cochat.ai/papers/10.1109/25.704858
- The paper
- Chang, H. S., Kim, B. W., Lee, C. G., Min, S. L., Choi, Y., Yang, H. S., Kim, D. N., & Kim, C. S. (1998). FSA-based link assignment and routing in low-earth orbit satellite networks. IEEE Transactions on Vehicular Technology. https://doi.org/10.1109/25.704858
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.