CN107872900A - A satellite channel S-ALOHA access system and method supporting differentiated services - Google Patents

A satellite channel S-ALOHA access system and method supporting differentiated services Download PDF

Info

Publication number
CN107872900A
CN107872900A CN201711043540.8A CN201711043540A CN107872900A CN 107872900 A CN107872900 A CN 107872900A CN 201711043540 A CN201711043540 A CN 201711043540A CN 107872900 A CN107872900 A CN 107872900A
Authority
CN
China
Prior art keywords
user
mrow
time slot
priority
arrival rate
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201711043540.8A
Other languages
Chinese (zh)
Other versions
CN107872900B (en
Inventor
孙汉汶
和欣
赵哲
惠蕾放
马伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Academy of Space Technology CAST
Original Assignee
China Academy of Space Technology CAST
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Academy of Space Technology CAST filed Critical China Academy of Space Technology CAST
Priority to CN201711043540.8A priority Critical patent/CN107872900B/en
Publication of CN107872900A publication Critical patent/CN107872900A/en
Application granted granted Critical
Publication of CN107872900B publication Critical patent/CN107872900B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA
    • H04W74/0866Non-scheduled access, e.g. ALOHA using a dedicated channel for access
    • H04W74/0875Non-scheduled access, e.g. ALOHA using a dedicated channel for access with assigned priorities based access
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867Arrangements specially adapted for the transmitter end
    • H04L1/1887Scheduling and prioritising arrangements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867Arrangements specially adapted for the transmitter end
    • H04L1/189Transmission or retransmission of more than one copy of a message

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Radio Relay Systems (AREA)
  • Time-Division Multiplex Systems (AREA)

Abstract

The present invention relates to a kind of satellite channel S ALOHA access systems and method for supporting Differentiated Services, and on S ALOHA protocol basis, employing repetition sending strategy reduces the access delay of high-priority users, realizes Differentiated Services;The present invention have studied user under the conditions of the satellite channel using S ALOHA dynamic access time delay with the basis of total business arrival rate relation, improve the validation testing of user's access request, propose repetition sending strategy, i.e. user can continuously transmit multiple requests in the case of not receiving access request and confirming, Differentiated Services are realized by the control that different terminals are repeated to send with the factor.This method can simply and effectively lift Differentiated Services ability of the satellite communication system in user's access phase, provide the quantitative predication of user's access delay, be supported to ensure that the QoS of user provides aid decision.

Description

一种支持区分服务的卫星信道S-ALOHA接入系统及方法A satellite channel S-ALOHA access system and method supporting differentiated services

技术领域technical field

本发明涉及一种支持区分服务的卫星信道S-ALOHA接入系统及方法,属于通信技术领域。The invention relates to a satellite channel S-ALOHA access system and method supporting differentiated services, belonging to the technical field of communication.

背景技术Background technique

现有的卫星信道S-ALOHA接入存在如下问题:The existing satellite channel S-ALOHA access has the following problems:

(1)通常情况下,所有用户的S-ALOHA协议参数为固定配置,不能根据整个卫星通信系统的状态进行调整,导致用户在不同时间不同位置无法获得一致的接入服务质量和可预期的接入时延。(1) Under normal circumstances, the S-ALOHA protocol parameters of all users are fixed configurations, which cannot be adjusted according to the status of the entire satellite communication system, resulting in users being unable to obtain consistent access service quality and predictable access at different times and locations input delay.

(2)S-ALOHA协议本身不支持不同用户间的区分服务特性,无法满足高优先级用户在接入阶段的优先服务需求。(2) The S-ALOHA protocol itself does not support differentiated service features among different users, and cannot meet the priority service requirements of high-priority users in the access phase.

(3)通常情况下,采用S-ALOHA协议进行接入的卫星通信系统不对系统的总业务到达率进行控制,当用户数量增加时,有可能导致系统进入S-ALOHA协议的不稳定区,加重了信道冲突,严重影响用户接入效率。(3) Under normal circumstances, the satellite communication system that adopts the S-ALOHA protocol for access does not control the total service arrival rate of the system. When the number of users increases, the system may enter the unstable area of the S-ALOHA protocol, aggravating Channel conflict is caused, which seriously affects the user access efficiency.

根据上述分析,传统的S-ALOHA协议在灵活性、稳定性和支持区分服务能力方面存在短板,在广域覆盖的卫星通信系统中,传统S-ALOHA协议很难适应未来通信容量增加、用户数量增大、业务类型增多和接入服务质量要求增强的发展趋势。According to the above analysis, the traditional S-ALOHA protocol has shortcomings in terms of flexibility, stability, and ability to support differentiated services. In a satellite communication system with wide-area The development trend of increased quantity, increased business types, and enhanced access service quality requirements.

发明内容Contents of the invention

本发明的目的在于:克服现有技术的不足,提供一种支持区分服务的卫星信道S-ALOHA接入方法,利用该方法可以在确保S-ALOHA协议稳定的前提下,满足不同等级用户的区分服务接入需求。The purpose of the present invention is to: overcome the deficiencies in the prior art, provide a satellite channel S-ALOHA access method that supports differentiated services, utilize this method to satisfy the distinction of users of different levels under the premise of ensuring the stability of the S-ALOHA protocol Service access requirements.

本发明的上述目的是通过如下技术方案予以实现:一种支持区分服务的卫星信道S-ALOHA接入系统,包括:用户总业务到达率计算单元、用户优先级划分单元、时隙碰撞概率计算单元、用户接入延迟估计单元、S-ALOHA协议稳定性评估单元和迭代计算单元;The above object of the present invention is achieved by the following technical solutions: a satellite channel S-ALOHA access system that supports differentiated services, including: a user total service arrival rate calculation unit, a user priority division unit, and a time slot collision probability calculation unit , user access delay estimation unit, S-ALOHA protocol stability evaluation unit and iterative calculation unit;

用户总业务到达率计算单元:根据用户(地面用户)的新业务到达率和当前单个时隙传输的碰撞概率,计算出该用户的总业务到达率。假设用户的新业务到达率为λi,当前单个时隙的碰撞概率为1-p(0),其中p(0)为时隙成功传输概率,则用户成功传输所需要的平均尝试次数为Total user service arrival rate calculation unit: calculate the user's total service arrival rate according to the new service arrival rate of the user (ground user) and the collision probability of the current single time slot transmission. Assuming that the new service arrival rate of the user is λ i , the collision probability of the current single time slot is 1-p(0), where p(0) is the successful transmission probability of the time slot, then the average number of attempts required by the user for successful transmission is

于是,用户总业务到达率的为 Therefore, the total service arrival rate of users is

时隙成功传输是指当前时隙用户发送的信号未发生碰撞,碰撞是指不同用户在相同的时隙发送信号,即认定为发生碰撞,否则时隙失败传输。The successful transmission of a time slot means that the signals sent by users in the current time slot do not collide. Collision means that different users send signals in the same time slot, that is, a collision occurs, otherwise the time slot transmission fails.

在时间轴划分为若干个相同间隔的时间段,每一个时间段为一个时隙,每个时隙内每个用户可以发送一个消息(分组)。The time axis is divided into several time periods with equal intervals, each time period is a time slot, and each user can send a message (group) in each time slot.

第一个信息(分组)第一次被某个用户发送,成为这个用户的新业务,若该新业务未成功传输,用户在之后的某个时隙重新发送该信息,称为重传业务,总业务中包括新业务和重传业务。The first information (packet) is sent by a user for the first time and becomes the user's new service. If the new service is not successfully transmitted, the user resends the information in a later time slot, which is called a retransmission service. The total business includes new business and retransmission business.

用户优先级划分单元:对所有用户组成的集合进行划分,将不同的用户划分到不同的优先级集合中,将划分后的优先级集合进行顺序编号,编号值越大的集合所对应的优先级越高,为不同的优先级集合设定不同的重复发送因子,同时将优先级集合的重复发送因子设定为该集合的编号值。假设系统中重复发送因子的取值范围为[1,N],则经过用户优先级划分后的系统总业务到达率为User priority division unit: divide the set composed of all users, divide different users into different priority sets, number the divided priority sets sequentially, and the priority corresponding to the set with the larger number value The higher the value is, the different retransmission factors are set for different priority sets, and the retransmission factor of the priority set is set as the number value of the set. Assuming that the value range of the repeated transmission factor in the system is [1, N], the total service arrival rate of the system after user priority division is

把系统总业务到达率送给时隙碰撞概率计算单元。The system total service arrival rate is sent to the time slot collision probability calculation unit.

重复发送因子的值为重复发送的次数。The value of the repeated sending factor is the number of repeated sendings.

到达率是指单位时间内到达的业务量,单位时间包括一个多个时隙。The arrival rate refers to the traffic volume arriving per unit time, and the unit time includes one or more time slots.

时隙碰撞概率计算单元:按照系统业务到达服从泊松过程进行计算,根据系统的总业务到达率Λ可以得到单个时隙的碰撞概率p(0)=e-ΛT,再根据用户总业务到达率Λ与单个时隙的碰撞概率的关系联立方程组计算出p(0),送至用户接入延迟估计单元。T为单个时隙的持续时间。Time slot collision probability calculation unit: calculate according to the Poisson process of system service arrival, and the collision probability p(0)=e -ΛT of a single time slot can be obtained according to the total service arrival rate Λ of the system, and then according to the total service arrival rate of users The relationship between Λ and the collision probability of a single time slot is calculated by the simultaneous equations p(0), and sent to the user access delay estimation unit. T is the duration of a single time slot.

方程组如下:The equation set is as follows:

用户接入延迟估计单元:对用户的接入延迟进行估计,假设当前用户的重复发送因子为Ki,当前时隙的碰撞概率为1-p(0),则单次接入信号(分组)成功传输的概率为当前用户对应的接入信号(分组)成功传输平均尝试次数为由于用户的平均接入延迟与接入分组成功传输平均尝试次数成正比,因此用户的平均接入延迟Ti计算为将用户的平均接入延迟Ti送至迭代计算单元;User access delay estimation unit: estimate the user access delay, assuming that the repeated transmission factor of the current user is K i , and the collision probability of the current time slot is 1-p(0), then a single access signal (packet) The probability of successful transmission is The average number of successful transmission attempts of the access signal (packet) corresponding to the current user is Since the average access delay of the user is proportional to the average number of successful transmission attempts of the access packet, the average access delay T i of the user is calculated as Send the user's average access delay T i to the iterative calculation unit;

S-ALOHA协议稳定性评估单元:对优先级划分后的用户接入采用的S-ALOHA协议稳定性进行评估,若ΛT>1,则S-ALOHA协议不稳定,若ΛT≤1,则S-ALOHA协议稳定。S-ALOHA protocol stability evaluation unit: evaluate the stability of the S-ALOHA protocol adopted by the user access after priority division, if ΛT>1, then the S-ALOHA protocol is unstable, if ΛT≤1, then S- The ALOHA protocol is stable.

迭代计算单元:根据用户的平均接入延迟Ti和对接入延迟的要求,对用户优先级划分进行调整,逐步增加不满足接入时延要求用户的优先级和重复发送因子;对用户优先级划分进行调整后,当所有用户的接入时延满足需求或到达设定的调整最大次数时,将最后一次调整的用户优先级确定为最终的用户优先级。如图3所示,迭代计算的步骤如下Iterative calculation unit: according to the user's average access delay T i and the requirements for access delay, adjust the user priority division, and gradually increase the priority and repeated transmission factor of users who do not meet the access delay requirements; After the level division is adjusted, when the access delays of all users meet the requirements or reach the set maximum number of adjustments, the last adjusted user priority is determined as the final user priority. As shown in Figure 3, the steps of iterative calculation are as follows

首先将所有用户划分为编号为1的优先级集合,在这种情况下所有用户的重复发送因子为1,通过方程组计算单个时隙的碰撞概率p(0),分别对用户平均接入延迟和协议稳定性进行判定。First, all users are divided into a priority set numbered 1. In this case, the repeated transmission factor of all users is 1. The collision probability p(0) of a single time slot is calculated by the equation group, and the average access delay of the users is respectively And determine the stability of the protocol.

通过单个时隙的碰撞概率p(0)和用户的重复发送因子计算出用户接入的平均接入延迟Ti,并与该用户的平均接入延迟需求Ti′进行对比,若Ti≤T′i则表示该用户的接入时延需求得到满足。The average access delay T i of user access is calculated by the collision probability p(0) of a single time slot and the user's repeated transmission factor, and compared with the average access delay requirement T i ′ of the user, if T i ≤ T′ i indicates that the user's access delay requirement is met.

通过每个用户的新业务到达率λi和单个时隙的碰撞概率p(0)之间的关系计算出该用户的总业务到达率λ′i,进一步计算系统所有用户的总业务到达率Λ,通过所有用户的总业务到达率Λ与时隙长度T之间的乘积是否小于或等于1来判断协议是否稳定。Calculate the total service arrival rate λ′ i of each user through the relationship between the new service arrival rate λ i of each user and the collision probability p(0) of a single time slot, and further calculate the total service arrival rate Λ of all users in the system , whether the protocol is stable can be judged by whether the product of the total service arrival rate Λ of all users and the time slot length T is less than or equal to 1.

若所有用户的接入时延需求均得到满足且协议稳定,则迭代算法成功结束,将用户的优先级划分方式作为迭代计算单元的输出结果;若协议不稳定,则说明迭代计算单元无法计算出可行解,需要考虑调整用户业务到达率或接入时延需求重新进行迭代计算;若某些用户的接入时延无法得到满足,则依次将这些用户划分到比当前所在优先级集合对应的重复发送因子大1的优先级集合中,重新进行迭代计算。If the access delay requirements of all users are satisfied and the protocol is stable, the iterative algorithm ends successfully, and the user's priority division method is taken as the output result of the iterative calculation unit; if the protocol is unstable, it means that the iterative calculation unit cannot calculate Feasible solution, it is necessary to consider adjusting the user service arrival rate or access delay requirements to re-calculate iteratively; if the access delay of some users cannot be satisfied, then these users are divided into duplicates corresponding to the current priority set in turn In the priority set whose sending factor is greater than 1, re-calculate iteratively.

本发明与现有技术相比的优点在于:The advantage of the present invention compared with prior art is:

(1)本发明允许对接入时延要求较高的用户可以采用重复发送策略,即在未接收到接入应答分组的前提下可以连续发送多个接入请求分组,若用户一次性连续发送K个接入请求分组,每个分组独立传输的成功概率为P(0),则用户本次成功接入的概率为1-(1-P(0))K,K越大,单次成功接入概率越高,用户接入时延越短。将连续发送接入请求分组的数量K与用户的优先级相关以实现用户间的区分服务。(1) The present invention allows users with high requirements on access delay to adopt a repeated sending strategy, that is, multiple access request packets can be continuously sent on the premise of not receiving an access response packet. There are K access request packets, and the success probability of independent transmission of each packet is P(0), then the probability of the user's successful access this time is 1-(1-P(0)) K , the larger K is, the single success The higher the access probability, the shorter the user access delay. The number K of consecutively sent access request packets is related to the user's priority to implement differentiated services among users.

(2)本发明给出了一种支持区分服务的卫星信道S-ALOHA接入系统和方法,建立了用户业务到达率数学模型,给出了用户接入时延的估算方法。在此基础上,对用户集合进行划分形成多个优先级集合,给出了优先级集合与重复发送因子的映射关系,利用不同的重复发送因子实现不同用户的区分服务。(2) The present invention provides a satellite channel S-ALOHA access system and method supporting differentiated services, establishes a mathematical model of user service arrival rate, and provides an estimation method for user access delay. On this basis, the user set is divided to form multiple priority sets, and the mapping relationship between the priority set and the retransmission factor is given, and different retransmission factors are used to realize differentiated services for different users.

(3)本发明给出了用户优先级划分的迭代算法,将S-ALOHA协议的稳定性纳入迭代算法的判据中,迭代计算的结果需保证S-ALOHA协议的稳定性,在实际应用中确保了采用S-ALOHA协议的接入系统处于稳定状态。(3) The present invention provides the iterative algorithm of user priority division, and the stability of S-ALOHA agreement is incorporated in the criterion of iterative algorithm, and the result of iterative calculation needs to guarantee the stability of S-ALOHA agreement, in practical application It ensures that the access system using the S-ALOHA protocol is in a stable state.

附图说明Description of drawings

图1为本发明涉及到的各单元关系示意图;Fig. 1 is the schematic diagram of each unit relation involved in the present invention;

图2为迭代计算单元算法执行流程图;Fig. 2 is the execution flow chart of iterative calculation unit algorithm;

图3为采用重复发送策略的S-ALOHA接入协议重传示意图。FIG. 3 is a schematic diagram of the retransmission of the S-ALOHA access protocol using the repeated sending strategy.

具体实施方式Detailed ways

下面结合附图和具体示例对本发明做进一步介绍。The present invention will be further introduced below in conjunction with the accompanying drawings and specific examples.

本发明涉及一种支持区分服务的卫星信道S-ALOHA(时隙ALOHA)接入系统及方法,在S-ALOHA协议基础上,采用了重复发送策略降低高优先级用户的接入时延,实现区分服务;本发明研究了用户在卫星信道条件下采用S-ALOHA动态接入的时延与总业务到达率关系的基础上,改进了用户接入请求的确认方式,提出了重复发送策略,即用户可以在未收到接入请求确认情况下可连续发送多个请求,通过对不同终端重复发送因子的控制实现区分服务。这种方法可以简单有效地提升卫星通信系统在用户接入阶段时的区分服务能力,给出用户接入时延的定量估计,为保障用户的QoS提供辅助决策支持。The invention relates to a satellite channel S-ALOHA (slotted ALOHA) access system and method supporting differentiated services. On the basis of the S-ALOHA protocol, a repeated transmission strategy is used to reduce the access delay of high-priority users, and realize Differentiated services; the present invention studies the relationship between the time delay and the total service arrival rate of users using S-ALOHA dynamic access under satellite channel conditions, improves the confirmation mode of user access requests, and proposes a repeated sending strategy, namely The user can continuously send multiple requests without receiving the confirmation of the access request, and realize differentiated services by controlling the repeated sending factors of different terminals. This method can simply and effectively improve the differentiated service capability of the satellite communication system during the user access phase, provide a quantitative estimate of the user access delay, and provide auxiliary decision support for ensuring the user's QoS.

本发明支持区分服务的卫星信道S-ALOHA接入系统,包括:用户总业务到达率计算单元、用户优先级划分单元、时隙碰撞概率计算单元、用户接入延迟估计单元、S-ALOHA协议稳定性评估单元和迭代计算单元,如图1所示;The satellite channel S-ALOHA access system supporting differentiated services in the present invention includes: a user total service arrival rate calculation unit, a user priority division unit, a time slot collision probability calculation unit, a user access delay estimation unit, and a stable S-ALOHA protocol A performance evaluation unit and an iterative calculation unit, as shown in Figure 1;

用户总业务到达率计算单元:根据用户(地面用户)的新业务到达率和信号在单个时隙传输的碰撞概率,计算出该用户的总业务到达率。假设用户的新业务到达率为λi,p(0)为信号在单个时隙成功传输的概率,因此信号在单个时隙传输的碰撞概率为1-p(0),,则到信号在时隙成功传输为止,用户的平均尝试次数为Total user service arrival rate calculation unit: calculate the user's total service arrival rate according to the new service arrival rate of the user (ground user) and the collision probability of signal transmission in a single time slot. Assuming that the new service arrival rate of the user is λ i , p(0) is the probability of successful signal transmission in a single time slot, so the collision probability of signal transmission in a single time slot is 1-p(0), then the signal arrives at time The average number of attempts of the user until the slot is successfully transmitted is

于是,用户总业务到达率的为 Therefore, the total service arrival rate of users is

信号碰撞是指两个或两个以上的用户在相同的时隙进行传输,信号碰撞会导致相关用户信号传输失败。信号在时隙成功传输是指当前时隙用户发送的信号未发生碰撞。Signal collision means that two or more users transmit in the same time slot, and signal collision will cause related user signal transmission failure. The successful transmission of signals in a time slot means that the signals sent by users in the current time slot do not collide.

将时间轴划分为若干个相同的时间段,每一个时间段称为一个时隙,每个用户可以在任何一个时隙内发送至多一个消息(分组)。Divide the time axis into several equal time periods, each time period is called a time slot, and each user can send at most one message (packet) in any time slot.

用户第一次发送的信号(分组)称为该用户的新业务,若该信号(分组)未成功传输,则用户将在之后的某个时隙重新发送该信号(分组),将这些重传信号(分组)称为重传业务。用户的总业务包括新业务和重传业务。The signal (packet) sent by the user for the first time is called the user's new service. If the signal (packet) is not successfully transmitted, the user will resend the signal (packet) in a certain time slot later, and these retransmissions Signals (packets) are called retransmission traffic. The user's total business includes new business and retransmission business.

用户优先级划分单元:对所有用户组成的集合进行划分,将不同的用户划分到不同的优先级集合中,将划分后的优先级集合进行顺序编号,编号值越大的集合所对应的优先级越高,同时将优先级集合的重复发送因子设定为该集合的编号值。假设系统中重复发送因子的取值范围为[1,N],则经过用户优先级划分后的系统总业务到达率为User priority division unit: divide the set composed of all users, divide different users into different priority sets, number the divided priority sets sequentially, and the priority corresponding to the set with the larger number value The higher the value is, the repeated sending factor of the priority set is set to the number value of the set at the same time. Assuming that the value range of the repeated transmission factor in the system is [1, N], the total service arrival rate of the system after user priority division is

把系统总业务到达率送给时隙碰撞概率计算单元。The system total service arrival rate is sent to the time slot collision probability calculation unit.

重复发送因子的值为重复发送的次数。The value of the repeated sending factor is the number of repeated sendings.

到达率是指单位时间内到达的业务量,单位时间包括一个或多个时隙。The arrival rate refers to the traffic volume arriving per unit time, and the unit time includes one or more time slots.

时隙碰撞概率计算单元:按照系统业务到达服从泊松过程进行计算,根据系统的总业务到达率Λ可以得到单个时隙的碰撞概率p(0)=e-ΛT,再根据用户总业务到达率Λ与单个时隙的碰撞概率的关系联立方程组计算出p(0),送至用户接入延迟估计单元。T为单个时隙的持续时间。Time slot collision probability calculation unit: calculate according to the Poisson process of system service arrival, and the collision probability p(0)=e -ΛT of a single time slot can be obtained according to the total service arrival rate Λ of the system, and then according to the total service arrival rate of users The relationship between Λ and the collision probability of a single time slot is calculated by the simultaneous equations p(0), and sent to the user access delay estimation unit. T is the duration of a single time slot.

方程组如下:The equation set is as follows:

用户接入延迟估计单元:对用户的接入延迟进行估计,假设当前用户的重复发送因子为Ki,当前时隙的碰撞概率为1-p(0),则单次接入信号(分组)成功传输的概率为当前用户对应的接入信号(分组)成功传输平均尝试次数为由于用户的平均接入延迟与接入分组成功传输平均尝试次数成正比,因此用户的平均接入延迟Ti计算为 User access delay estimation unit: estimate the user access delay, assuming that the repeated transmission factor of the current user is K i , and the collision probability of the current time slot is 1-p(0), then a single access signal (packet) The probability of successful transmission is The average number of successful transmission attempts of the access signal (packet) corresponding to the current user is Since the average access delay of the user is proportional to the average number of successful transmission attempts of the access packet, the average access delay T i of the user is calculated as

将用户的平均接入延迟Ti送至迭代计算单元;Send the user's average access delay T i to the iterative calculation unit;

S-ALOHA协议稳定性评估单元:对优先级划分后的用户接入采用的S-ALOHA协议的稳定性进行评估,若ΛT>1,则S-ALOHA协议不稳定,若ΛT≤1,则S-ALOHA协议稳定。S-ALOHA protocol stability evaluation unit: evaluate the stability of the S-ALOHA protocol adopted by the user access after priority division, if ΛT>1, then the S-ALOHA protocol is unstable, if ΛT≤1, then S - ALOHA protocol is stable.

迭代计算单元:根据用户的平均接入延迟Ti和对接入延迟的要求,对用户优先级划分进行调整,逐步增加不满足接入时延要求用户的优先级和重复发送因子;对用户优先级划分进行调整后,当所有用户的接入时延满足需求或到达设定的调整最大次数时,将最后一次调整的用户优先级确定为最终的用户优先级。Iterative calculation unit: according to the user's average access delay T i and the requirements for access delay, adjust the user priority division, and gradually increase the priority and repeated transmission factor of users who do not meet the access delay requirements; After the level division is adjusted, when the access delays of all users meet the requirements or reach the set maximum number of adjustments, the last adjusted user priority is determined as the final user priority.

支持区分服务的卫星信道S-ALOHA接入系统通过允许部分用户采用重复发送策略以满足其对接入时延的需求。重复发送策略是指用户采用S-ALOHA协议发送信号(分组)时可以在未收到应答或反馈超时之前重复发送若干个相同的信号(分组),如图3所示,只要其中任何一个信号(分组)成功传输就意味着用户信号(分组)传输成功,在时隙碰撞概率不变的前提下,采用重复发送策略可以显著提升信号(分组)成功传输概率。考虑到在卫星通信系统中,用户和卫星之间通信信号的往返传播时延较大,由于信号(分组)碰撞后重传会显著增加用户的接入时延,而采用重复发送策略可以提升用户信号(分组)的成功传输概率,进而降低用户的接入延迟。用户的重复发送因子越大,提升效果越显著,接入延迟就越短,因此可以为不同等级的用户配置不同的重复发送因子以实现区分服务。系统采用了协议是否稳定性和用户接入时延是否得到满足为判据的迭代计算单元,确保接入系统能够在稳定的前提下满足各用户对接入延迟的需求。The satellite channel S-ALOHA access system that supports DiffServ satisfies its access delay requirements by allowing some users to use repeated transmission strategies. The repeated sending strategy means that when the user uses the S-ALOHA protocol to send a signal (packet), several identical signals (packets) can be sent repeatedly before the response is received or the feedback times out, as shown in Figure 3, as long as any one of the signals ( The successful transmission of the packet) means the successful transmission of the user signal (packet). Under the premise that the time slot collision probability remains unchanged, the repeated transmission strategy can significantly increase the probability of successful signal (packet) transmission. Considering that in the satellite communication system, the round-trip propagation delay of the communication signal between the user and the satellite is relatively large, because the retransmission of the signal (packet) after collision will significantly increase the user's access delay, and the repeated transmission strategy can improve the user's access delay. The successful transmission probability of the signal (packet), thereby reducing the user's access delay. The greater the user's repeated transmission factor, the more significant the improvement effect and the shorter the access delay. Therefore, different repeated transmission factors can be configured for different levels of users to achieve differentiated services. The system adopts an iterative calculation unit based on the stability of the protocol and whether the user access delay is satisfied, so as to ensure that the access system can meet the access delay requirements of each user under the premise of stability.

根据所有用户对接入时延的需求和S-ALOHA协议的稳定性要求,迭代计算单元得出的用户优先级划分方式有两种可能的结果。一种是优先级划分方式既能够满足用户对接入时延的需求又能够满足S-ALOHA协议的稳定性要求,为支持区分服务的卫星信道S-ALOHA接入系统所期望的结果;另一种是优先级划分方式不能满足接入时延的需求或者不能满足协议的稳定性要求,表明在当前的输入条件下无法找到合理的用户优先级划分方式,需要对系统的输入条件进行调整并重新进行迭代计算。如图3所示,具体的调整策略如下According to the requirements of all users on the access delay and the stability requirements of the S-ALOHA protocol, there are two possible results for the user priority division method obtained by the iterative calculation unit. One is that the priority division method can not only meet the user's demand for access delay but also meet the stability requirements of the S-ALOHA protocol, which is the expected result of the satellite channel S-ALOHA access system supporting differentiated services; the other The first is that the priority division method cannot meet the requirements of access delay or the stability requirements of the protocol, indicating that a reasonable user priority division method cannot be found under the current input conditions, and the input conditions of the system need to be adjusted and reset. Perform iterative calculations. As shown in Figure 3, the specific adjustment strategy is as follows

(1)降低部分用户对接入延迟的需求,使得迭代计算单元不必为这些用户配置更大的重复发送因子,从而降低系统总业务到达率,提高系统稳定裕度,同时也更容易满足用户对接入延迟的需求;(1) Reduce some users' demand for access delay, so that the iterative calculation unit does not need to configure a larger repeated transmission factor for these users, thereby reducing the total system service arrival rate, improving the system stability margin, and it is also easier to meet the user's requirements access delay requirements;

(2)降低部分用户的新业务到达率或增加用户重传发送间隔,等效于降低了这些用户对系统总业务到达率的贡献,从而降低系统总业务到达率,提高系统稳定裕度。(2) Reducing the arrival rate of new services of some users or increasing the retransmission interval of users is equivalent to reducing the contribution of these users to the total service arrival rate of the system, thereby reducing the total service arrival rate of the system and improving the system stability margin.

如图2和3所示,迭代计算单元中迭代计算的步骤如下As shown in Figures 2 and 3, the steps of iterative calculation in the iterative calculation unit are as follows

首先将所有用户划分为编号为1的优先级集合,在这种情况下所有用户的重复发送因子为1,通过方程组计算单个时隙的碰撞概率p(0),分别对用户平均接入延迟和协议稳定性进行判定。First, all users are divided into a priority set numbered 1. In this case, the repeated transmission factor of all users is 1. The collision probability p(0) of a single time slot is calculated by the equation group, and the average access delay of the users is respectively And determine the stability of the protocol.

通过单个时隙的碰撞概率p(0)和用户的重复发送因子计算出用户接入的平均接入延迟Ti,并与该用户的平均接入延迟需求T′i进行对比,若Ti≤T′i则表示该用户的接入时延需求得到满足。The average access delay T i of user access is calculated by the collision probability p(0) of a single time slot and the user's repeated transmission factor, and compared with the average access delay requirement T′ i of the user, if T i ≤ T′ i indicates that the user's access delay requirement is met.

通过每个用户的新业务到达率λi和单个时隙的碰撞概率p(0)之间的关系计算出该用户的总业务到达率λ′i,进一步计算系统所有用户的总业务到达率Λ,通过所有用户的总业务到达率Λ与时隙长度T之间的乘积是否小于或等于1来判断协议是否稳定。Calculate the total service arrival rate λ′ i of each user through the relationship between the new service arrival rate λ i of each user and the collision probability p(0) of a single time slot, and further calculate the total service arrival rate Λ of all users in the system , whether the protocol is stable can be judged by whether the product of the total service arrival rate Λ of all users and the time slot length T is less than or equal to 1.

若所有用户的接入时延需求均得到满足且协议稳定,则迭代算法成功结束,将用户的优先级划分方式作为迭代计算单元的输出结果;若协议不稳定,则说明迭代计算单元无法计算出可行解,需要考虑调整用户业务到达率或接入时延需求重新进行迭代计算;若某些用户的接入时延无法得到满足,则依次将这些用户划分到比当前所在优先级集合对应的重复发送因子大1的优先级集合中,重新进行迭代计算。If the access delay requirements of all users are satisfied and the protocol is stable, the iterative algorithm ends successfully, and the user's priority division method is taken as the output result of the iterative calculation unit; if the protocol is unstable, it means that the iterative calculation unit cannot calculate Feasible solution, it is necessary to consider adjusting the user service arrival rate or access delay requirements to re-calculate iteratively; if the access delay of some users cannot be satisfied, then these users are divided into duplicates corresponding to the current priority set in turn In the priority set whose sending factor is greater than 1, re-calculate iteratively.

优选系统中有10个用户,每个用户新业务到达率都相同,且都属于优先级集合1,归一化新业务到达率为λT=0.03,则系统所有用户新业务达到率为10λT=0.3,用p(0)表示单个时隙成功传输概率,则系统所有用户总业务到达率为根据系统所有用户总业务到达率可以计算出单个时隙成功传输概率通过求解方程p(0)lnp(0)=0.3可以解出p(0)=0.613,于是可以进一步计算出各用户接入分组成功传输所需要的平均尝试次数为系统所有用户总业务到达率为0.489,此时S-ALOHA协议稳定。There are preferably 10 users in the system, each user has the same new service arrival rate, and all belong to priority set 1, the normalized new service arrival rate λT=0.03, then the new service arrival rate of all users in the system is 10λT=0.3 , using p(0) to represent the successful transmission probability of a single time slot, then the total service arrival rate of all users in the system is According to the total service arrival rate of all users in the system, the successful transmission probability of a single time slot can be calculated By solving the equation p(0)lnp(0)=0.3, p(0)=0.613 can be solved, so it can be further calculated that the average number of attempts required for the successful transmission of each user's access packet is The total business arrival rate of all users in the system is 0.489, and the S-ALOHA protocol is stable at this time.

假设其中某个用户要求接入分组成功传输所需要的平均尝试次数不超过1.2,运行迭代算法,将该用户的划分到优先级集合2,则此时系统的归一化新业务到达率为11λT=0.33,利用方程p(0)lnp(0)=0.33求解出单个时隙成功传输概率p(0)=0.547,可以进一步计算出属于优先级集合1的用户接入分组成功传输所需要的平均尝试次数为属于优先级集合2的用户接入分组成功传输所需要的平均尝试次数为无法满足该用户的需求,按照算法流程,将该用户划分到优先级集合3。此时系统的归一化新业务到达率为12λT=0.36,利用方程p(0)lnp(0)=0.36求解出单个时隙成功传输概率p(0)=0.447,可以进一步计算出属于优先级集合1的用户接入分组成功传输所需要的平均尝试次数为属于优先级集合3的用户接入分组成功传输所需要的平均尝试次数为满足该用户需求,迭代算法正常退出。Assuming that the average number of attempts required by one of the users for the successful transmission of the access packet does not exceed 1.2, run the iterative algorithm to divide the user into the priority set 2, then the normalized new service arrival rate of the system at this time is 11λT = 0.33, use the equation p(0)lnp(0)=0.33 to solve the successful transmission probability p(0)=0.547 of a single time slot, and can further calculate the average Attempts are The average number of attempts required for the successful transmission of user access packets belonging to priority set 2 is If the user's needs cannot be met, the user is assigned to priority set 3 according to the algorithm flow. At this time, the normalized new service arrival rate of the system is 12λT=0.36, using the equation p(0)lnp(0)=0.36 to solve the probability of successful transmission of a single time slot p(0)=0.447, which can be further calculated to belong to the priority The average number of attempts required for the successful transmission of user access packets in set 1 is The average number of attempts required for the successful transmission of user access packets belonging to priority set 3 is If the user requirement is met, the iterative algorithm exits normally.

通过上述示例可以看出,支持区分服务的卫星信道S-ALOHA接入系统将其中一个用户的接入分组成功传输所需的平均尝试次数降低为1.2,由于用户的平均接入时延与平均尝试次数成正比,因此相比于传统的S-ALOHA接入系统,支持区分服务的卫星信道S-ALOHA接入系统将该用户的平均接入时延降低了36%,满足了该用户对接入时延的需求。同时,该用户的平均接入时延相比于其他用户降低了46%,实现了对该用户的区分服务。From the above example, it can be seen that the satellite channel S-ALOHA access system supporting differentiated services reduces the average number of attempts required for the successful transmission of one user's access packet to 1.2, because the average access delay of the user is different from the average number of attempts The number of times is proportional, so compared with the traditional S-ALOHA access system, the satellite channel S-ALOHA access system supporting differentiated services reduces the average access delay of the user by 36%, which meets the user's requirements for access Latency requirements. At the same time, the average access delay of this user is reduced by 46% compared with other users, realizing differentiated services for this user.

本发明说明书中未作详细描述的内容属于本领域专业技术人员的公知技术。The content that is not described in detail in the specification of the present invention belongs to the well-known technology of those skilled in the art.

Claims (10)

  1. A kind of 1. satellite channel S-ALOHA access systems for supporting Differentiated Services, it is characterised in that including:User's total business reaches Rate computing unit, User Priority division unit, time slot collision probability calculation unit, user's access delay estimation unit, S- ALOHA agreement stability assessment units and iterative calculation unit;
    User's total business arrival rate computing unit, the collision transmitted according to the new business arrival rate of user and signal in single time slot Probability, the average number of attempt of user when obtaining signal untill time slot Successful transmissions, and user's total business arrival rate;
    User Priority division unit, the set to all users composition are divided, different users are divided into different In priority set, the repetition of setting priority set sends the factor, and the repetition of priority set is sent into the factor is set as this The number value of set, then obtain the system total business arrival rate after User Priority divides;System total business arrival rate Give time slot collision probability calculation unit;
    Time slot collision probability calculation unit, reach obedience Poisson process according to system business and calculated, according to total industry of system Business arrival rate Λ can obtain the collision probability of single time slot, further according to the collision of user total business arrival rate Λ and single time slot The relation Simultaneous Equations of probability calculate the collision probability of single time slot, deliver to user's access delay estimation unit;
    User's access delay estimation unit, estimates the access delay of user, according to the collision probability of current time slots, obtains Single accesses the probability of signal Successful transmissions, the average number of attempt of access signal Successful transmissions corresponding to active user, user's Average access delay Ti;By the average access delay T of useriDeliver to iterative calculation unit;
    S-ALOHA agreement stability assessment units:User after being divided to priority accesses the stabilization of the S-ALOHA agreements used Property assessed, if the duration T of the total business arrival rate Λ of system and single time slot meet require, S-ALOHA agreements Unstable, otherwise S-ALOHA agreements are stable;
    Unit is iterated to calculate, according to the average access delay T of useriRequirement with to access delay, is partitioned into User Priority Row adjustment, it is stepped up being unsatisfactory for the priority of access delay requirement user and repeats to send the factor;User Priority is divided After being adjusted, when all users access delay meet demand or reach setting adjustment maximum times when, will last time The User Priority of adjustment is defined as final User Priority.
  2. 2. a kind of satellite channel S-ALOHA access systems for supporting Differentiated Services according to claim 1, its feature exist In:Signal collision refers to that two or more users are transmitted in identical time slot, and signal collision can cause related use Family signal bust this.
  3. 3. a kind of satellite channel S-ALOHA access systems for supporting Differentiated Services according to claim 1, its feature exist In:Untill time slot Successful transmissions, the average number of attempt M of user is signal
    <mrow> <mi>M</mi> <mo>=</mo> <msubsup> <mo>&amp;Sigma;</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>&amp;infin;</mi> </msubsup> <mi>k</mi> <msup> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mi>p</mi> <mo>(</mo> <mn>0</mn> <mo>)</mo> <mo>)</mo> </mrow> <mrow> <mi>k</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mi>p</mi> <mrow> <mo>(</mo> <mn>0</mn> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mn>1</mn> <mrow> <mi>p</mi> <mrow> <mo>(</mo> <mn>0</mn> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>;</mo> </mrow>
    In formula, k is summation variable.
  4. 4. a kind of satellite channel S-ALOHA access systems for supporting Differentiated Services according to claim 1, its feature exist In:The λ ' of user's total business arrival rateiFor:
    <mrow> <msubsup> <mi>&amp;lambda;</mi> <mi>i</mi> <mo>&amp;prime;</mo> </msubsup> <mo>=</mo> <mfrac> <msub> <mi>&amp;lambda;</mi> <mi>i</mi> </msub> <mrow> <mi>p</mi> <mrow> <mo>(</mo> <mn>0</mn> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>.</mo> </mrow>
  5. 5. a kind of satellite channel S-ALOHA access systems for supporting Differentiated Services according to claim 1, its feature exist In:Signal refers to that the signal that current time slots user sends does not collide in time slot Successful transmissions, the total business arrival rate of system The requirement that the duration T of Λ and single time slot meets is Λ T > 1.
  6. 6. a kind of satellite channel S-ALOHA access systems for supporting Differentiated Services according to claim 1, its feature exist In:Time shaft is divided into several identicals period, each period can be with office as a time slot, each user An at most message is sent in what time slot, message is to be grouped.
  7. 7. a kind of satellite channel S-ALOHA access systems for supporting Differentiated Services according to claim 1, its feature exist In:The signal that user sends for the first time is referred to as the new business of the user, if the signal transmits not successfully, user is by afterwards Some time slot resends the signal, and these re-transmission signals are referred to as into re-transmission business, and the total business of user includes new business and again Biography business.
  8. 8. a kind of satellite channel S-ALOHA access systems for supporting Differentiated Services according to claim 1, its feature exist In:Assuming that the span for repeating to send the factor in system is [1, N], then the system obtained after User Priority divides is total Business arrival rate is
    <mrow> <mi>&amp;Lambda;</mi> <mo>=</mo> <msubsup> <mo>&amp;Sigma;</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </msubsup> <mi>k</mi> <msub> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>&amp;Element;</mo> <msub> <mi>U</mi> <mi>i</mi> </msub> </mrow> </msub> <msubsup> <mi>&amp;lambda;</mi> <mi>i</mi> <mo>&amp;prime;</mo> </msubsup> <mo>,</mo> </mrow>
    In formula,λiFor the new business arrival rate of user.
  9. 9. a kind of satellite channel S-ALOHA access systems for supporting Differentiated Services according to claim 1, its feature exist In:The value for repeating to send the factor is attached most importance to the number that send of recurrence;Arrival rate refers to the portfolio reached in the unit interval, unit interval Including one or more time slots.
  10. 10. a kind of satellite channel S-ALOHA cut-in methods for supporting Differentiated Services, it is characterised in that step is as follows:
    (1) collision probability transmitted according to the new business arrival rate of user and current single time slot, total industry of the user is calculated Business reaches, it is assumed that the new business arrival rate of user is λi, the collision probability of current single time slot is 1-p (0), when wherein p (0) is Gap Successful transmissions probability, then the average number of attempt M required for user's Successful transmissions be
    <mrow> <mi>M</mi> <mo>=</mo> <msubsup> <mi>&amp;Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>&amp;infin;</mi> </msubsup> <mi>k</mi> <msup> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mi>p</mi> <mo>(</mo> <mn>0</mn> <mo>)</mo> <mo>)</mo> </mrow> <mrow> <mi>k</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mi>p</mi> <mrow> <mo>(</mo> <mn>0</mn> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mn>1</mn> <mrow> <mi>p</mi> <mrow> <mo>(</mo> <mn>0</mn> <mo>)</mo> </mrow> </mrow> </mfrac> </mrow>
    Then, user's total business arrival rate is
    Time slot Successful transmissions refer to that the signal that current time slots user sends does not collide, and collision refers to different user in identical Time slot sends signal, that is, regards as colliding, otherwise time slot failed transmission;
    The period of several same intervals is divided into time shaft, each period is a time slot, every in each time slot Individual user can send a message;
    First information is sent by some user for the first time, turns into the new business of this user, if the new business is transmitted not successfully, User resends the information in some time slot afterwards, referred to as retransmits business, and total business includes new business and retransmits business;
    (2) according to the total business arrival rate of the user of step (1), the set to all users composition divides, will be different User is divided into different priority set, and the priority set after division is carried out into serial number, the bigger collection of number value Close that corresponding priority is higher, setting different repetitions for different priority set sends the factor, while by priority set The repetition of conjunction sends the number value that the factor is set as the set, it is assumed that and the span for repeating to send the factor in system is [1, N], Then the system total business arrival rate after User Priority divides is
    <mrow> <mi>&amp;Lambda;</mi> <mo>=</mo> <msubsup> <mo>&amp;Sigma;</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </msubsup> <mi>k</mi> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>&amp;Element;</mo> <msub> <mi>U</mi> <mi>i</mi> </msub> </mrow> </munder> <msubsup> <mi>&amp;lambda;</mi> <mi>i</mi> <mo>&amp;prime;</mo> </msubsup> </mrow>
    Time slot collision probability calculation unit is given system total business arrival rate;Repeat send the factor value attach most importance to recurrence send time Number;Arrival rate refers to the portfolio reached in the unit interval, and the unit interval includes a multiple time slots;
    (3) user after being divided to priority accesses the S-ALOHA agreement stability used and assessed, if Λ T > 1, S- ALOHA agreements are unstable, carry out step (7), if Λ T≤1, S-ALOHA agreement are stable, carry out step (4);
    (4) reach obedience Poisson process according to system business to be calculated, can be obtained according to the total business arrival rate Λ of system Collision probability p (0)=e of single time slot-ΛT, further according to user total business arrival rate Λ and the pass of the collision probability of single time slot It is that Simultaneous Equations calculate p (0), T is the duration of single time slot;
    (5) access delay of user is estimated, it is assumed that it is K that the repetition of active user, which sends the factor,i, the collision of current time slots Probability is 1-p (0), then the probability of single access signal Successful transmissions isConnect corresponding to active user Entering the average number of attempt of signal Successful transmissions isBecause the average access delay of user is grouped successfully with access The average number of attempt of transmission is directly proportional, therefore the average access delay T of useriIt is calculated as
    (6) by the average access delay T of useriWith the contrast of the requirement of access delay, as the average access delay T of all usersi Respectively less than it is equal to the requirement of access delay, then exports step (3) User Priority division result, otherwise, return to step (3) is right User Priority division is adjusted;Deliver to iterative calculation unit;
    (7) according to the average access delay T of useriWith the requirement to access delay, step (3) User Priority is divided and carried out Adjustment, it is stepped up being unsatisfactory for the priority of access delay requirement user and repeats to send the factor;User Priority is partitioned into Row adjustment after, when all users access delay meet demand or reach setting adjustment maximum times when, will last time adjust Whole User Priority is defined as final User Priority output.
CN201711043540.8A 2017-10-31 2017-10-31 A satellite channel S-ALOHA access system and method supporting differentiated services Active CN107872900B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711043540.8A CN107872900B (en) 2017-10-31 2017-10-31 A satellite channel S-ALOHA access system and method supporting differentiated services

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711043540.8A CN107872900B (en) 2017-10-31 2017-10-31 A satellite channel S-ALOHA access system and method supporting differentiated services

Publications (2)

Publication Number Publication Date
CN107872900A true CN107872900A (en) 2018-04-03
CN107872900B CN107872900B (en) 2020-06-09

Family

ID=61753550

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711043540.8A Active CN107872900B (en) 2017-10-31 2017-10-31 A satellite channel S-ALOHA access system and method supporting differentiated services

Country Status (1)

Country Link
CN (1) CN107872900B (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110391956A (en) * 2019-07-23 2019-10-29 中国工商银行股份有限公司 The identification monitoring method and device of network service processes state
CN110557453A (en) * 2019-09-05 2019-12-10 广州虎牙科技有限公司 data distribution method, device, equipment and storage medium
CN112105087A (en) * 2020-09-21 2020-12-18 南京邮电大学 Asynchronous random access method based on multi-satellite cooperative beam forming technology
CN112312581A (en) * 2020-05-11 2021-02-02 北京邮电大学 An Aloha Enhanced Access Method for Low Orbit Constellation Systems
CN112637862A (en) * 2020-12-24 2021-04-09 中标慧安信息技术股份有限公司 Ground satellite communication method and system based on multiple access optimization technology
CN114826986A (en) * 2022-03-30 2022-07-29 西安电子科技大学 Performance analysis method for ALOHA protocol of priority frameless structure
CN115186013A (en) * 2022-07-25 2022-10-14 中国人民解放军陆军航空兵学院 Data acquisition and analysis method based on aviation equipment

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101986619A (en) * 2010-10-29 2011-03-16 南京丹奥科技有限公司 Bandwidth reservation-based VSAT satellite communication system bandwidth distribution method
US20110256847A1 (en) * 2006-02-03 2011-10-20 Sigram Schindler Beteiligungsgesellschaft Mbh Method for modifying the operating mode of a technical communications group platform (tcgpl) of a telecommunications network (tc network)
US20150282003A1 (en) * 2014-03-31 2015-10-01 Hughes Network Systems, Llc System and method for congestion management for downlink queues of digital processing satellites for differentiated quality-of-service (qos)
CN106059960A (en) * 2016-05-24 2016-10-26 北京交通大学 Software defined network-based space network QoS guarantee method and management center

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110256847A1 (en) * 2006-02-03 2011-10-20 Sigram Schindler Beteiligungsgesellschaft Mbh Method for modifying the operating mode of a technical communications group platform (tcgpl) of a telecommunications network (tc network)
CN101986619A (en) * 2010-10-29 2011-03-16 南京丹奥科技有限公司 Bandwidth reservation-based VSAT satellite communication system bandwidth distribution method
US20150282003A1 (en) * 2014-03-31 2015-10-01 Hughes Network Systems, Llc System and method for congestion management for downlink queues of digital processing satellites for differentiated quality-of-service (qos)
CN106059960A (en) * 2016-05-24 2016-10-26 北京交通大学 Software defined network-based space network QoS guarantee method and management center

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
SHEIKH等: ""Analysis of spatially distributed FU-FB S-ALOHA in fading channels using TUA"", 《WEB OF SCIENCE》 *
惠蕾放、马伟等: ""分布式空间系统星间通信组网技术研究综述"", 《空间电子技术》 *
陶孝锋等: ""卫星通信系统中的ALOHA技术"", 《空间电子技术》 *

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110391956A (en) * 2019-07-23 2019-10-29 中国工商银行股份有限公司 The identification monitoring method and device of network service processes state
CN110391956B (en) * 2019-07-23 2021-08-13 中国工商银行股份有限公司 Method and device for identifying and monitoring state of network service process
CN110557453A (en) * 2019-09-05 2019-12-10 广州虎牙科技有限公司 data distribution method, device, equipment and storage medium
CN110557453B (en) * 2019-09-05 2022-10-04 广州虎牙科技有限公司 Data distribution method, device, equipment and storage medium
CN112312581A (en) * 2020-05-11 2021-02-02 北京邮电大学 An Aloha Enhanced Access Method for Low Orbit Constellation Systems
CN112105087A (en) * 2020-09-21 2020-12-18 南京邮电大学 Asynchronous random access method based on multi-satellite cooperative beam forming technology
CN112105087B (en) * 2020-09-21 2022-08-02 南京邮电大学 An asynchronous random access method based on multi-satellite cooperative beamforming technology
CN112637862A (en) * 2020-12-24 2021-04-09 中标慧安信息技术股份有限公司 Ground satellite communication method and system based on multiple access optimization technology
CN112637862B (en) * 2020-12-24 2021-08-31 中标慧安信息技术股份有限公司 Ground satellite communication method and system based on multiple access optimization technology
CN114826986A (en) * 2022-03-30 2022-07-29 西安电子科技大学 Performance analysis method for ALOHA protocol of priority frameless structure
CN114826986B (en) * 2022-03-30 2023-11-03 西安电子科技大学 A performance analysis method for ALOHA protocol with priority frameless structure
CN115186013A (en) * 2022-07-25 2022-10-14 中国人民解放军陆军航空兵学院 Data acquisition and analysis method based on aviation equipment

Also Published As

Publication number Publication date
CN107872900B (en) 2020-06-09

Similar Documents

Publication Publication Date Title
CN107872900A (en) A satellite channel S-ALOHA access system and method supporting differentiated services
Kliazovich et al. Cross-layer congestion control in ad hoc wireless networks
JP4495721B2 (en) Differentiating service quality in wireless networks
CN104661260B (en) A kind of Wireless Mesh intelligent grid method for routing of QoS perception and load balancing
TWI487389B (en) A method for avoiding network congestion and an apparatus thereof
CN114731710A (en) Replication of RTA packets in time and frequency
CN103457871B (en) Based on the increasing window method of the congestion avoidance phase of deferred constraint in DCN
CN102724706B (en) Two-stage frame aggregation method
CN104796959B (en) A kind of mixed type MAC protocol method of clustering architecture multicarrier water sound sensor network
CN106954229A (en) Hybrid channel load statistics method based on SPMA
CN103929777B (en) Vehicle network data distribution jamming control method based on congestion game
CN102204363A (en) Power saving method in mobile communication network
Jia et al. Improving the uplink performance of drive-thru Internet via platoon-based cooperative retransmission
CN103795643A (en) Method for processing synchronous priority bursty flow in data center network
JP2008270854A (en) Radio communication method and radio communication system
Wu et al. A MAC protocol for delay-sensitive VANET applications with self-learning contention scheme
CN104581821A (en) Congestion Control Method Based on Node Cache Length Fair Allocation Rate
WO2007130867A2 (en) System and method for optimizing throughput in a wireless network
Wu et al. A hop-by-hop cross-layer congestion control scheme for wireless sensor networks
CN115413041B (en) Centralized wireless ad hoc network resource allocation method and system
CN114303411A (en) TS operation for RTA session management
CN103501531A (en) A Method of Channel Allocation in MAC Layer of Ad Hoc Network Based on Power Control
Kuo et al. A CSMA-based MAC protocol for WLANs with automatic synchronization capability to provide hard quality of service guarantees
Biswas et al. On-demand reliable medium access in sensor networks
CN109982433B (en) A Resource Optimization Method for URLLC System with Fixed Frame Length Based on Heuristic Algorithm

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant