摘要
提出了低轨卫星通信系统(LEO)中两种支持快速终端的切换算法,详细介绍了系统模型的结构,以全球星系统和铱系统为例,通过仿真,分别对“最短路径优先”和“最长覆盖时间”2种算法下快速终端的切换时延情况进行统计和比较,得到了有一定参考价值的结果。
A LEO communication system supporting fast-moving terminals was studied. Based on this system, two handover algorithms were proposed： the maximum covered-time algorithm and the shortest-path-first algorithm in the case of Globalstar and Iridium. In order to find out their different effects on the system capability in different environment, the two handover algorithms are calculated and compared through simulation and analysis.
出处
《通信学报》
EI
CSCD
北大核心
2006年第5期120-125,129,共7页
Journal on Communications
关键词
卫星通信
快速终端
低轨
切换
satellite communication
fast-moving
terminal
LEO
handover
