LEO Satellite Networks: When Do All Shortest Distance Paths Belong to Minimum Hop Path Set?

Author:

Chen Quan1ORCID,Yang Lei1ORCID,Guo Deke1ORCID,Ren Bangbang1,Guo Jianming1ORCID,Chen Xiaoqian2ORCID

Affiliation:

1. College of Aerospace Science and Engineering, National University of Defense Technology, Changsha, China

2. National Innovation Institute of Defense Technology, Chinese Academy of Military Science, Beijing, China

Funder

National Natural Science Foundation of China

China Postdoctoral Science Foundation

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Electrical and Electronic Engineering,Aerospace Engineering

Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Shortest Path in LEO Satellite Constellation Networks: An Explicit Analytic Approach;IEEE Journal on Selected Areas in Communications;2024-05

2. Transformer-based anomaly detection in P-LEO constellations: A dynamic graph approach;Acta Astronautica;2024-05

3. Load-Balanced Collaborative Offloading for LEO Satellite Networks;IEEE Internet of Things Journal;2023-11-01

4. 一种基于业务需求与流量感知的卫星网络多路径路由算法;Frontiers of Information Technology & Electronic Engineering;2023-06

5. MFR—A Max-Flow-Based Routing for Future Interplanetary Networks;IEEE Transactions on Aerospace and Electronic Systems;2022-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3