LEO卫星中模拟实时通信量确保保护信道的分配

计算机工程与应用 ›› 2012, Vol. 48 ›› Issue (7): 77-80.

LEO卫星中模拟实时通信量确保保护信道的分配

肖英1，唐菀2，周浩淼1

1.中国计量学院信息工程学院，杭州 310018
2.中南民族大学计算机科学学院，武汉 430074

收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2012-03-01 发布日期:2012-03-01

Simulating real-time communication to determine allocation of guard channel in LEO satellite

XIAO Ying1, TANG Wan2, ZHOU Haomiao1

1.College of Information Engineering, China Jiliang University, Hangzhou 310018, China
2.College of Computer Science, South-Central University for Nationalities, Wuhan 430074, China

Received:1900-01-01 Revised:1900-01-01 Online:2012-03-01 Published:2012-03-01

摘要/Abstract

摘要： 由于LEO（Low Earth Orbit）卫星网络中不断变化的点波束小区实时通信量负载无法估计，提出了一种根据系统仿真过程中当前通信量状态优化动态保护信道算法（ODGCS）。该分配策略引入呼叫间隔时间和切换呼叫中断间隔时间来获悉系统的实时性能状态，由仿真中通信量状态预测当前系统切换呼叫的中断概率，根据比较计算的呼叫中断概率和预先设定的QoS（Quality of Service）值，动态调整预留给切换呼叫使用的保护信道数。仿真结果表明，与传统的静态预留保护信道的算法相比，该算法能有效提高LEO卫星系统的性能稳定性。在负载较轻时，ODGCS算法保证切换呼叫QoS的同时，降低了新呼叫阻塞概率。

Abstract: For LEO satellite networks, it is impossible to estimate the real-time traffic load in mobile spot-beam, a new mechanism is proposed to optimize dynamic guard channel scheme based on the current traffic changing states during system simulation procedure. This strategy uses a call interval time and handover call dropping interval time to learn about real-time states of system traffic and estimate the call dropping probability based on real-time traffic load by simulation. Compared the calculated call dropping probability with the predefined QoS（Quality of Service）, the number of guard channels is changed dynamically. Simulation results show that the proposed mechanism can improve the system stability efficiently. When traffic load is not heavy, ODGCS can guarantee the QoS of handoff call and decrease the new call blocking probability compared with the traditional guard channel scheme.

肖英1，唐菀2，周浩淼1. LEO卫星中模拟实时通信量确保保护信道的分配[J]. 计算机工程与应用, 2012, 48(7): 77-80.

XIAO Ying1, TANG Wan2, ZHOU Haomiao1. Simulating real-time communication to determine allocation of guard channel in LEO satellite[J]. Computer Engineering and Applications, 2012, 48(7): 77-80.