{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T03:19:41Z","timestamp":1777346381370,"version":"3.51.4"},"reference-count":24,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T00:00:00Z","timestamp":1656892800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["62073289"],"award-info":[{"award-number":["62073289"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Low-orbit micro-satellite technology has developed rapidly in recent years due to its advantages of low time delay, low cost and short research period. However, among the existing inter-satellite routing algorithms, the classical flooding and greedy algorithms and their derivatives also have some limitations. The path delay calculated by the flooding algorithm is small but the calculation is large, while the greedy algorithm is the opposite. In this paper, a balanced inter-satellite routing algorithm based on partition routing is proposed. This paper presents the simulation experiments for the following indexes of the classic inter-satellite routing algorithms and the balanced partition routing algorithm: computation complexity, single-node computation pressure, routing path delay, path delay variance (data in Topo table satisfy \u03bc\u00a0=5, \u03c32=10). The results reveal that the balanced partition routing algorithm achieves better performance. In this paper, two optimization directions of the balanced partition routing algorithm are simulated under conditions that the data in the Topo table satisfy \u03bc\u00a0=5, \u03c32= 6, \u03c32=10 and \u03c32=15, respectively, when comparing their performance indicators. The experiments show that these two optimization methods can be adapted to various application scenarios and can further reduce the hardware cost of satellite nodes.<\/jats:p>","DOI":"10.3390\/fi14070207","type":"journal-article","created":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T11:15:05Z","timestamp":1656933305000},"page":"207","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Research on Routing Equalization Algorithm of Inter-Satellite Partition for Low-Orbit Micro-Satellites"],"prefix":"10.3390","volume":"14","author":[{"given":"Hengfei","family":"Cheng","sequence":"first","affiliation":[{"name":"Micro-Satellite Research Center, Zhejiang University, Hangzhou 310007, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaobin","family":"Xu","sequence":"additional","affiliation":[{"name":"Micro-Satellite Research Center, Zhejiang Micro-Satellite Research Laboratory, Zhejiang University, Hangzhou 310007, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoxu","family":"Guo","sequence":"additional","affiliation":[{"name":"Micro-Satellite Research Center, Zhejiang University, Hangzhou 310007, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia","family":"Yang","sequence":"additional","affiliation":[{"name":"Micro-Satellite Research Center, Zhejiang University, Hangzhou 310007, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kedi","family":"Xu","sequence":"additional","affiliation":[{"name":"Micro-Satellite Research Center, Zhejiang University, Hangzhou 310007, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuqin","family":"Liu","sequence":"additional","affiliation":[{"name":"Micro-Satellite Research Center, Zhejiang University, Hangzhou 310007, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhonghe","family":"Jin","sequence":"additional","affiliation":[{"name":"Micro-Satellite Research Center, Zhejiang Micro-Satellite Research Laboratory, Zhejiang University, Hangzhou 310007, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8804-9890","authenticated-orcid":false,"given":"Xiaojun","family":"Jin","sequence":"additional","affiliation":[{"name":"Micro-Satellite Research Center, Zhejiang Micro-Satellite Research Laboratory, Zhejiang University, Hangzhou 310007, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,7,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.jctb.2019.02.007","article-title":"On chromatic number and minimum cut","volume":"139","author":"Alishahi","year":"2019","journal-title":"J. Comb. Theory Ser. B"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","article-title":"Finding a Maximum Clique in an Arbitrary Graph","volume":"15","author":"Balas","year":"1986","journal-title":"SIAM J. Comput."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., and Murty, U.S.R. (2008). Graph Theory, Springer.","DOI":"10.1007\/978-1-84628-970-5"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.disopt.2013.07.006","article-title":"Perfectness of clustered graphs","volume":"10","author":"Bonomo","year":"2013","journal-title":"Discret. Optim."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"2508","DOI":"10.1016\/j.cor.2013.01.009","article-title":"Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex","volume":"40","author":"Kergosien","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Chen, J., Liu, S., and Zhang, Y. (2021, January 23\u201325). Inter-Satellite Token Ring Ad Hoc Network Technology for Micro-Nano Satellite Cluster Collaboration. Proceedings of the 2021 3rd International Conference on Advances in Computer Technology, Information Science and Communication (CTISC), Shanghai, China.","DOI":"10.1109\/CTISC52352.2021.00031"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"247","DOI":"10.23919\/JCC.2022.02.020","article-title":"Load balancing routing algorithm based on extended link states in LEO constellation network","volume":"19","author":"Dong","year":"2022","journal-title":"China Commun."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2743","DOI":"10.1109\/TVT.2021.3058126","article-title":"Analysis of Inter-Satellite Link Paths for LEO Mega-Constellation Networks","volume":"70","author":"Chen","year":"2021","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_9","first-page":"148","article-title":"On-demand partial topology routing algorithm in LEO satellite networks","volume":"43","author":"Weng","year":"2007","journal-title":"Comput. Eng. Appl."},{"key":"ref_10","unstructured":"Henderson, T.H., and Katz, R.H. (December, January 27). On Distributed and Geographic-Based Packet Routing for LEO Satellite Networks. Proceedings of the Globecom \u201800\u2014IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137), San Francisco, CA, USA."},{"key":"ref_11","first-page":"272","article-title":"A Distributed Routing Algorithm for Data gram Traffic in LEO Satellite Networks","volume":"22","author":"Ekici","year":"2004","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Woo, S., Ohara, M., Torrie, E., Singh, J., and Gupta, A. (1995, January 22\u201324). The SPLASH-2 programs: Characterization and methodological considerations. Proceedings of the 22nd annual international symposium on Computer architecture\u2014ISCA \u201995, Santa Margherita Ligure, Italy.","DOI":"10.1145\/223982.223990"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Bienia, C., Kumar, S., Singh, J.P., and Li, K. (2008, January 25\u201329). The Parsec Benchmark Suite: Characterization and Architectural Implications. Proceedings of the 17th International Conference on Parallel Architectures and Compilation Techniques, Toronto, ON, Canada.","DOI":"10.1145\/1454115.1454128"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Bienia, C., Kumar, S., and Li, K. (2008, January 14\u201316). PARSEC vs. SPLASH-2: A quantitative comparison of two multithreaded benchmark suites on Chip-Multiprocessors. Proceedings of the IEEE International Workshop\/Symposium on Workload Characterization, Seattle, WA, USA.","DOI":"10.1109\/IISWC.2008.4636090"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Patel, A., and Ghose, K. (2008, January 11\u201313). Energy-Efficient Mesi Cache Coherence with Pro-Active Snoop Filtering for Multicore Microprocessors. Proceedings of the 13th international symposium on Low power electronics and design, Bangalore, India.","DOI":"10.1145\/1393921.1393988"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"34975","DOI":"10.1109\/ACCESS.2021.3061736","article-title":"Failure-Tolerant and Low-Latency command in Mega-Constellations: The Redundant Multi-Path Routing","volume":"9","author":"Zeng","year":"2021","journal-title":"IEEE Access"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/1105734.1105747","article-title":"Multifacet\u2019s general execution-driven multiprocessor simulator (GEMS) toolset","volume":"33","author":"Martin","year":"2005","journal-title":"ACM SIGARCH Comput. Arch. News"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1109\/MNET.001.1900550","article-title":"Enhancing the Resilience of Low Earth Orbit Remote Sensing Satellite Networks","volume":"34","author":"Yang","year":"2020","journal-title":"IEEE Netw."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Zheng, B., Yen, K., Peng, X., and Zhang, R. (2020, January 7\u201311). Angle Partition-Based TDMA for VDES Satellite Multiuser Downlink Communications. Proceedings of the GLOBECOM 2020\u20142020 IEEE Global Communications Conference, Taipei, Taiwan.","DOI":"10.1109\/GLOBECOM42002.2020.9322170"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Yang, K., Zhang, B., and Guo, D. (2019, January 20\u201324). Controller and Gateway Partition Placement in SDN-Enabled Integrated Satellite-Terrestrial Network. Proceedings of the 2019 IEEE International Conference on Communications Workshops (ICC Workshops), Shanghai, China.","DOI":"10.1109\/ICCW.2019.8756884"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Ebrahimi, M., Daneshtalab, M., Farahnakian, F., Plosila, J., Liljeberg, P., Palesi, M., and Tenhunen, H. (2013, January 2). HARAQ: Congestion-Aware Learning Model for Highly Adaptive Routing Algorithm in On-Chip Networks. Proceedings of the 2013 ACM\/IEEE International Workshop on System Level Interconnect Prediction (SLIP), Austin, TX, USA.","DOI":"10.1109\/NOCS.2012.10"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Dehyadegari, M., Daneshtalab, M., Ebrahimi, M., Plosila, J., and Mohammadi, S. (2011, January 6\u20139). An adaptive fuzzy logic-based routing algorithm for networks-on-chip. Proceedings of the 2011 NASA\/ESA Conference on Adaptive Hardware and Systems (AHS), San Diego, CA, USA.","DOI":"10.1109\/AHS.2011.5963937"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Ebrahimi, M., Daneshtalab, M., Liljeberg, P., Plosila, J., and Tenhunen, H. (2011, January 1\u20134). Exploring partitioning methods for 3D Networks-on-Chip utilizing adaptive routing model. Proceedings of the Fifth IEEE\/ACM International Symposium on Networks on Chip, Pittsburgh, PA, USA.","DOI":"10.1145\/1999946.1999958"},{"key":"ref_24","unstructured":"Wang, L., Jin, Y., Kim, H., and Kim, E.J. (2009, January 10\u201313). Recursive partitioning multicast: A bandwidth-efficient routing for Networks-on-Chip. Proceedings of the 2009 3rd ACM\/IEEE International Symposium on Networks-on-Chip, Washington, DC, USA."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/14\/7\/207\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:42:24Z","timestamp":1760139744000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/14\/7\/207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,4]]},"references-count":24,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["fi14070207"],"URL":"https:\/\/doi.org\/10.3390\/fi14070207","relation":{},"ISSN":["1999-5903"],"issn-type":[{"value":"1999-5903","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,4]]}}}