本文選題：衛(wèi)星網絡 + 信道分配　； 參考：《系統(tǒng)仿真學報》2014年12期

【摘要】：在衛(wèi)星網絡中,針對低軌衛(wèi)星存儲容量小、與同步軌道衛(wèi)星可通時間有限等特點,提出了一種新的信道分配算法,該算法通過衛(wèi)星任務優(yōu)先級、衛(wèi)星存儲剩余量和衛(wèi)星可通時間剩余量三個因素的權重分配確定衛(wèi)星優(yōu)先級,當同步軌道衛(wèi)星無可用信道且存在低軌衛(wèi)星呼叫時,在滿足門限閾值約束條件下,高優(yōu)先級呼叫衛(wèi)星實施信道搶占。仿真數(shù)據結果表明,提出的算法保證了緊急衛(wèi)星數(shù)據的實時傳輸,有效地避免了衛(wèi)星內存溢出、數(shù)據丟失現(xiàn)象,滿足衛(wèi)星通信需求。
[Abstract]:In the satellite network, a new channel assignment algorithm is proposed to solve the problem of low storage capacity and limited access time between Leo satellite and synchronous orbit satellite, which is based on the priority of satellite task. The weight distribution of three factors, satellite storage residue and satellite passable time residue, determines the satellite priority. When the synchronous orbit satellite has no available channel and there is a Leo satellite call, the threshold threshold constraint condition is satisfied. High priority calling satellites implement channel preemption. The simulation results show that the proposed algorithm can ensure the real-time transmission of emergency satellite data, effectively avoid satellite memory overflow and data loss, and meet the needs of satellite communication.
【作者單位】： 大連大學通信與網絡重點實驗室;大連理工大學電子信息與電氣工程學部;
【基金】：國家863高技術項目(2011AAXX)
【分類號】：TN927.2
，

本文編號：1775916