CN107872900A - A kind of satellite channel S ALOHA access systems and method for supporting Differentiated Services - Google Patents
A kind of satellite channel S ALOHA access systems and method for supporting Differentiated Services Download PDFInfo
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 15
- 230000005540 biological transmission Effects 0.000 claims description 49
- 238000004364 calculation method Methods 0.000 claims description 28
- 238000013097 stability assessment Methods 0.000 claims description 6
- 230000006641 stabilisation Effects 0.000 claims 1
- 238000011105 stabilization Methods 0.000 claims 1
- 238000004891 communication Methods 0.000 abstract description 8
- 238000012360 testing method Methods 0.000 abstract description 2
- 238000010200 validation analysis Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000010606 normalization Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0866—Non-scheduled access, e.g. ALOHA using a dedicated channel for access
- H04W74/0875—Non-scheduled access, e.g. ALOHA using a dedicated channel for access with assigned priorities based access
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements 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/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
- H04L1/1887—Scheduling and prioritising arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements 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/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
- H04L1/189—Transmission 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
Technical field
The present invention relates to a kind of satellite channel S-ALOHA access systems and method for supporting Differentiated Services, belong to communication skill
Art field.
Background technology
There are the following problems for existing satellite channel S-ALOHA accesses：
(1) under normal circumstances, the S-ALOHA protocol parameters of all users are fixed configurations, it is impossible to are led to according to whole satellite
The state of letter system is adjusted, and causes user can not obtain consistent access service quality and can in different time diverse location
Expected access delay.
(2) S-ALOHA agreements do not support the Differentiated Services characteristic between different user in itself, can not meet high-priority users
In the Priority Service demand of access phase.
(3) under normal circumstances, the satellite communication system accessed using S-ALOHA agreements is not arrived to the total business of system
It is controlled up to rate, when number of users increase, it is possible to cause system to enter the range of instability of S-ALOHA agreements, aggravate
Channel confliction, have a strong impact on user's access efficiency.
According to above-mentioned analysis, traditional S-ALOHA agreements are deposited in flexibility, stability and in terms of supporting Differentiated Services ability
In short slab, in the satellite communication system of wide area covering, traditional S-ALOHA agreements are difficult to adapt to the increase of future communications capacity, use
The increase of amount amount, type of service increase the development trend with the enhancing of access service quality requirement.
The content of the invention
It is an object of the invention to：A kind of overcome the deficiencies in the prior art, there is provided satellite channel S- for supporting Differentiated Services
ALOHA cut-in methods, it can meet different brackets user's on the premise of ensuring that S-ALOHA agreements are stable using this method
Differentiated Services access demand.
The above-mentioned purpose of the present invention is to be achieved by following technical solution：A kind of satellite channel for supporting Differentiated Services
S-ALOHA access systems, including：User's total business arrival rate computing unit, User Priority division unit, time slot collision probability
Computing 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：According to the new business arrival rate of user's (terrestrial user) and it is current single when
The collision probability of gap transmission, calculate the total business arrival rate of the user.Assuming that the new business arrival rate of user is λi, it is current single
The collision probability of individual time slot is 1-p (0), and wherein p (0) is time slot Successful transmissions probability, then flat required for user's Successful transmissions
Equal number of attempt is
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 phase
Same 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, each time slot
Interior each user can send a message (packet).
First information (packet) is sent by some user for the first time, turns into the new business of this user, if the new business
Failed transmission, user resend the information in some time slot afterwards, referred to as retransmit business, and total business includes new business
With the business of re-transmission.
User Priority division unit：Set to all users composition is divided, and different users is divided into not
With priority set in, the priority set after division is subjected to serial number, it is excellent corresponding to the bigger set of number value
First level is higher, and setting different repetitions for different priority set sends the factor, while the repetition of priority set is sent
The factor is set as the number value of the set.Assuming that the span for repeating to send the factor in system is [1, N], then it is excellent by user
System total business arrival rate after the division of first level is
Time slot collision probability calculation unit is given system total business arrival rate.
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, and the unit interval includes a multiple time slots.
Time slot collision probability calculation unit：Obedience Poisson process is reached according to system business to be calculated, according to system
Total business arrival rate Λ can obtain collision probability p (0)=e of single time slot-ΛT, further according to user total business arrival rate Λ with
The relation Simultaneous Equations of the collision probability of single time slot calculate p (0), deliver to user's access delay estimation unit.T is single
The duration of time slot.
Equation group is as follows：
User's access delay estimation unit：The access delay of user is estimated, it is assumed that the repetition of active user is sent
The factor is Ki, the collision probability of current time slots is 1-p (0), then the probability of single access signal (packet) Successful transmissions isThe average number of attempt of access signal (packet) Successful transmissions is corresponding to active user
Because the average access delay of user is directly proportional to the average number of attempt of access packet Successful transmissions, therefore the average access of user
Postpone TiIt is calculated asBy the average access delay T of useriDeliver to iterative calculation unit；
S-ALOHA agreement stability assessment units：It is steady that user after being divided to priority accesses the S-ALOHA agreements used
Qualitative to be assessed, if Λ T ＞ 1, S-ALOHA agreements are unstable, if Λ T≤1, S-ALOHA agreement are stable.
Iterate to calculate unit：According to the average access delay T of useriWith the requirement to access delay, to User Priority
Division is adjusted, and is stepped up being unsatisfactory for the priority of access delay requirement user and is repeated to send the factor；It is preferential to user
Level division be adjusted after, when all users access delay meet demand or reach setting adjustment maximum times when, will most
The User Priority once adjusted afterwards is defined as final User Priority.As shown in figure 3, the step of iterative calculation, is as follows
All users are divided into the priority set that numbering is 1 first, in this case the repetition hair of all users
It is 1 to send the factor, and the collision probability p (0) of single time slot is calculated by equation group, steady to user's average access delay and agreement respectively
It is qualitative to be judged.
Calculate being averaged for user's access by the collision probability p (0) of single time slot and the repetition transmission factor of user and connect
Enter to postpone Ti, and with the average access delay demand T of the useri' contrasted, if Ti≤T′iWhen then representing the access of the user
Prolong demand to be met.
Pass through the new business arrival rate λ of each useriRelation between the collision probability p (0) of single time slot calculates
The total business arrival rate λ ' of the useri, the total business arrival rate Λ of further all users of computing system, pass through all users'
Whether the product between total business arrival rate Λ and slot length T is less than or equal to 1 to judge whether agreement is stablized.
If the access delay demand of all users is met and agreement is stable, iterative algorithm successfully terminates, will used
Output result of the priority dividing mode at family as iterative calculation unit；If agreement is unstable, illustrate to iterate to calculate unit
Feasible solution can not be calculated, it is necessary to consider that adjusting customer service arrival rate or access delay demand re-starts iterative calculation；If
The access delay of certain user can not be met, then be successively divided into these users and corresponded to than being currently located priority set
Repetition send the factor big 1 priority set in, re-start iterative calculation.
The present invention compared with prior art the advantages of be：
(1) present invention allows the user higher to access delay requirement to use repetition sending strategy, i.e., is not receiving
To the packet of multiple access requests can be continuously transmitted on the premise of access acknowledgment packet, connect if user disposably continuously transmits K
Enter request packet, each probability of success for being grouped individual transmission is P (0), then this probability being successfully accessed of user is 1- (1-P
(0))K, K is bigger, and single is successfully accessed that probability is higher, and user's access delay is shorter.The number of access request packet will be continuously transmitted
Amount K is related to the priority of user to realize the Differentiated Services between user.
(2) The present invention gives a kind of satellite channel S-ALOHA access systems and method for supporting Differentiated Services, establish
Customer service arrival rate mathematical modeling, give the evaluation method of user's access delay.On this basis, user is gathered and carried out
Division forms multiple priority set, gives priority set with repeating the mapping relations of the transmission factor, utilizes different weights
The Differentiated Services that the factor realizes different user are sent in recurrence.
(3) The present invention gives the iterative algorithm of User Priority division, the stability of S-ALOHA agreements is included into iteration
In the criterion of algorithm, the result of iterative calculation need to ensure the stability of S-ALOHA agreements, ensure that in actual applications using S-
The access system of ALOHA agreements is in stable state.
Brief description of the drawings
Fig. 1 be the present invention relates to each unit relation schematic diagram；
Fig. 2 is iterative calculation unit algorithm execution flow chart；
Fig. 3 is to retransmit schematic diagram using the S-ALOHA access protocols for repeating sending strategy.
Embodiment
The present invention is described further with specific example below in conjunction with the accompanying drawings.
The present invention relates to a kind of satellite channel S-ALOHA (CDMA slotted ALOHA) access systems and method for supporting Differentiated Services,
On S-ALOHA protocol basis, employing repetition sending strategy reduces the access delay of high-priority users, realizes and distinguishes clothes
Business；The present invention have studied user and be closed under the conditions of satellite channel using the time delay and total business arrival rate of S-ALOHA dynamic access
On the basis of system, the validation testing of user's access request is improved, it is proposed that repeat sending strategy, i.e. user can not receive
Access request can continuously transmit multiple requests in the case of confirming, differentiation is realized by the control that different terminals are repeated to send with the factor
Service.This method can simply and effectively lift Differentiated Services ability of the satellite communication system in user's access phase, give
Go out the quantitative predication of user's access delay, supported to ensure that the QoS of user provides aid decision.
The present invention supports the satellite channel S-ALOHA access systems of Differentiated Services, including：User's total business arrival rate calculates
Unit, User Priority division unit, time slot collision probability calculation unit, user's access delay estimation unit, S-ALOHA agreements
Stability assessment unit and iterative calculation unit, as shown in Figure 1；
User's total business arrival rate computing unit：According to the new business arrival rate of user's (terrestrial user) and signal single
The collision probability of slot transmission, calculate the total business arrival rate of the user.Assuming that the new business arrival rate of user is λi, p (0)
It is signal in the probability of single time slot Successful transmissions, therefore signal is 1-p (0) in the collision probability that single time slot transmits, then arrive
Untill time slot Successful transmissions, the average number of attempt of user is signal
Then, user's total business arrival rate is
Signal collision refers to that two or more users are transmitted in identical time slot, and signal collision can cause phase
Close subscriber signal bust this.Signal refers to that the signal that current time slots user sends does not collide in time slot Successful transmissions.
Time shaft is divided into several identicals period, each period is referred to as a time slot, and each user can
To send an at most message (packet) in any one time slot.
The signal (packet) that user sends for the first time is referred to as the new business of the user, if the signal (packet) passes not successfully
Defeated, then user will resend the signal (packet) in some time slot afterwards, and these re-transmission signals (packet) are referred to as retransmitting
Business.The total business of user includes new business and retransmits business.
User Priority division unit：Set to all users composition is divided, and different users is divided into not
With priority set in, the priority set after division is subjected to serial number, it is excellent corresponding to the bigger set of number value
First level is higher, while the repetition transmission factor of priority set is set as to the number value of the set.Assuming that repeat to send out in system
The span for sending the factor is [1, N], then the system total business arrival rate after User Priority divides is
Time slot collision probability calculation unit is given system total business arrival rate.
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, and the unit interval includes one or more time slots.
Time slot collision probability calculation unit：Obedience Poisson process is reached according to system business to be calculated, according to system
Total business arrival rate Λ can obtain collision probability p (0)=e of single time slot-ΛT, further according to user total business arrival rate Λ with
The relation Simultaneous Equations of the collision probability of single time slot calculate p (0), deliver to user's access delay estimation unit.T is single
The duration of time slot.
Equation group is as follows：
User's access delay estimation unit：The access delay of user is estimated, it is assumed that the repetition of active user is sent
The factor is Ki, the collision probability of current time slots is 1-p (0), then the probability of single access signal (packet) Successful transmissions isThe average number of attempt of access signal (packet) Successful transmissions is corresponding to active user
Because the average access delay of user is directly proportional to the average number of attempt of access packet Successful transmissions, therefore the average access of user
Postpone TiIt is calculated as
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 S-ALOHA agreements of use
Stability is assessed, if Λ T ＞ 1, S-ALOHA agreements are unstable, if Λ T≤1, S-ALOHA agreement are stable.
Iterate to calculate unit：According to the average access delay T of useriWith the requirement to access delay, to User Priority
Division is adjusted, and is stepped up being unsatisfactory for the priority of access delay requirement user and is repeated to send the factor；It is preferential to user
Level division be adjusted after, when all users access delay meet demand or reach setting adjustment maximum times when, will most
The User Priority once adjusted afterwards is defined as final User Priority.
Support the satellite channel S-ALOHA access systems of Differentiated Services by allowing certain customers using repetition sending strategy
To meet the needs of it is to access delay.When repetition sending strategy refers to that user sends signal (packet) using S-ALOHA agreements
Can do not receive response or feedback time-out before repeat to send several identical signals (packet), as long as shown in figure 3, its
In any one signal (packet) Successful transmissions mean that subscriber signal (packet) transmission success, it is constant in time slot collision probability
On the premise of, it can be obviously improved signal (packet) Successful transmissions probability using sending strategy is repeated.In view of in satellite communication
In system, the roundtrip propagation time delay of signal of communication is larger between user and satellite, can show because signal (packet) collision rift retransmits
The access delay of increase user is write, and the Successful transmissions probability of subscriber signal (packet) can be lifted using sending strategy is repeated,
And then reduce the access delay of user.The repetition transmission factor of user is bigger, and lifting effect is more notable, and access delay is shorter,
Therefore can be that the different repetition of different grades of user configuration sends the factor to realize Differentiated Services.System employs agreement
Whether no stability and user's access delay are met the iterative calculation unit for criterion, it is ensured that access system can be stable
On the premise of meet the needs of each user is to access delay.
According to stability requirement of all users to the demand and S-ALOHA agreements of access delay, iterative calculation unit obtains
The User Priority dividing mode gone out has two kinds of possible results.One kind is that priority dividing mode can either meet that user is docked
The demand for entering time delay disclosure satisfy that the stability requirement of S-ALOHA agreements again, to support the satellite channel S-ALOHA of Differentiated Services
The desired result of access system；Another kind is that priority dividing mode can not meet the needs of access delay or can not meet
The stability requirement of agreement, show that rational User Priority dividing mode can not be found under current input condition, it is necessary to
The input condition of system is adjusted and is iterated calculating again.As shown in figure 3, specific adjustable strategies are as follows
(1) demand of the certain customers to access delay is reduced so that iterative calculation unit is not necessarily these user configurations more
Big repetition sends the factor, so as to reduce system total business arrival rate, improves system stability margin, while is also easier to meet to use
Demand of the family to access delay；
(2) reduce the new business arrival rate of certain customers or increase user retransmits and sends interval, being equivalent to reduces these
Contribution of the user to system total business arrival rate, so as to reduce system total business arrival rate, improve system stability margin.
As shown in Figures 2 and 3, it is as follows to iterate to calculate the step of being iterated to calculate in unit
All users are divided into the priority set that numbering is 1 first, in this case the repetition hair of all users
It is 1 to send the factor, and the collision probability p (0) of single time slot is calculated by equation group, steady to user's average access delay and agreement respectively
It is qualitative to be judged.
Calculate being averaged for user's access by the collision probability p (0) of single time slot and the repetition transmission factor of user and connect
Enter to postpone Ti, and with the average access delay demand T ' of the useriContrasted, if Ti≤T′iWhen then representing the access of the user
Prolong demand to be met.
Pass through the new business arrival rate λ of each useriRelation between the collision probability p (0) of single time slot calculates
The total business arrival rate λ ' of the useri, the total business arrival rate Λ of further all users of computing system, pass through all users'
Whether the product between total business arrival rate Λ and slot length T is less than or equal to 1 to judge whether agreement is stablized.
If the access delay demand of all users is met and agreement is stable, iterative algorithm successfully terminates, will used
Output result of the priority dividing mode at family as iterative calculation unit；If agreement is unstable, illustrate to iterate to calculate unit
Feasible solution can not be calculated, it is necessary to consider that adjusting customer service arrival rate or access delay demand re-starts iterative calculation；If
The access delay of certain user can not be met, then be successively divided into these users and corresponded to than being currently located priority set
Repetition send the factor big 1 priority set in, re-start iterative calculation.
There are 10 users in optimum decision system, each user's new business arrival rate is identical, and belongs to priority set 1,
It is λ T=0.03 to normalize new business arrival rate, then it is 10 λ T=0.3 that all user's new business of system, which reach rate, is represented with p (0)
Single time slot Successful transmissions probability, then all user's total business arrival rate of system beAccording to all users of system
Total business arrival rate can calculate single time slot Successful transmissions probabilityBy solving equation p (0) lnp (0)
=0.3 can solve p (0)=0.613, then can further calculate each user access it is flat required for packet Successful transmissions
Equal number of attempt isAll user's total business arrival rate of system are 0.489, and now S-ALOHA agreements are stable.
Assuming that the average number of attempt required for wherein some user requires access packet Successful transmissions is no more than 1.2, fortune
Row iteration algorithm, the user is divided into priority set 2, then now the normalization new business arrival rate of system is 11 λ T=
0.33, single time slot Successful transmissions Probability p (0)=0.547 is solved using equation p (0) lnp (0)=0.33, can be further
Calculating the average number of attempt required for belonging to user's access packet Successful transmissions of priority set 1 is
Belong to priority set 2 user access packet Successful transmissions required for average number of attempt be
Can not meet the needs of user, according to algorithm flow, the user is divided into priority set 3.The now normalization of system
New business arrival rate is 12 λ T=0.36, and single time slot Successful transmissions Probability p is solved using equation p (0) lnp (0)=0.36
(0)=0.447, can further calculate belong to priority set 1 user access packet Successful transmissions required for be averaged
Number of attempt isBelong to the average trial that the user of priority set 3 is accessed required for packet Successful transmissions
Number isMeet the user's request, iterative algorithm normally exits.
By above-mentioned example as can be seen that support Differentiated Services satellite channel S-ALOHA access systems by one of them
Average number of attempt needed for the access packet Successful transmissions of user is reduced to 1.2, because the average access delay of user is with putting down
Equal number of attempt is directly proportional, therefore compared to traditional S-ALOHA access systems, supports the satellite channel S- of Differentiated Services
The average access delay of the user is reduced 36% by ALOHA access systems, meets demand of the user to access delay.Together
When, the average access delay of the user reduces 46% compared to other users, realizes the Differentiated Services to the user.
The content not being described in detail in description of the invention belongs to the known technology of professional and technical personnel in the field.
Claims (10)
- 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. 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. 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>&Sigma;</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>&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. 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>&lambda;</mi> <mi>i</mi> <mo>&prime;</mo> </msubsup> <mo>=</mo> <mfrac> <msub> <mi>&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. 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. 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. 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. 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>&Lambda;</mi> <mo>=</mo> <msubsup> <mo>&Sigma;</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </msubsup> <mi>k</mi> <msub> <mo>&Sigma;</mo> <mrow> <mi>i</mi> <mo>&Element;</mo> <msub> <mi>U</mi> <mi>i</mi> </msub> </mrow> </msub> <msubsup> <mi>&lambda;</mi> <mi>i</mi> <mo>&prime;</mo> </msubsup> <mo>,</mo> </mrow>In formula,λiFor the new business arrival rate of user.
- 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. 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>&Sigma;</mi> <mrow> <mi>k</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>&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 isTime 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>&Lambda;</mi> <mo>=</mo> <msubsup> <mo>&Sigma;</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </msubsup> <mi>k</mi> <munder> <mo>&Sigma;</mo> <mrow> <mi>i</mi> <mo>&Element;</mo> <msub> <mi>U</mi> <mi>i</mi> </msub> </mrow> </munder> <msubsup> <mi>&lambda;</mi> <mi>i</mi> <mo>&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.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711043540.8A CN107872900B (en) | 2017-10-31 | 2017-10-31 | 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 | 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 | Satellite channel S-ALOHA access system and method supporting differentiated services |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107872900B (en) |
Cited By (7)
| 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 | 北京邮电大学 | Aloha enhanced access method for low-orbit constellation system |
| 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)
| 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 |
-
2017
- 2017-10-31 CN CN201711043540.8A patent/CN107872900B/en active Active
Patent Citations (4)
| 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)
| Title |
|---|
| SHEIKH等: ""Analysis of spatially distributed FU-FB S-ALOHA in fading channels using TUA"", 《WEB OF SCIENCE》 * |
| 惠蕾放、马伟等: ""分布式空间系统星间通信组网技术研究综述"", 《空间电子技术》 * |
| 陶孝锋等: ""卫星通信系统中的ALOHA技术"", 《空间电子技术》 * |
Cited By (12)
| 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 | 北京邮电大学 | Aloha enhanced access method for low-orbit constellation system |
| 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 | 南京邮电大学 | Asynchronous random access method based on multi-satellite cooperative beam forming 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 | 西安电子科技大学 | 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 kind of satellite channel S ALOHA access systems and method for supporting Differentiated Services | |
| Li et al. | Buffer sizing for 802.11-based networks | |
| CN103238366B (en) | communication terminal, channel selection method and program | |
| CN100394748C (en) | Distributive competition control of withdraw of radio local network | |
| CN101127661A (en) | A wireless competition access control method based on congestion degree possibility P | |
| CN101026577A (en) | Scheduling method for ensuring time delay stability of non-real-time business data packet for OFDMA system | |
| CN102724706B (en) | Two-stage frame aggregation method | |
| CN102595509A (en) | Cocurrent data distribution method based on transmission control protocol (TCP) in heterogeneous networks | |
| CN103856303B (en) | The method that node minimum contention window value is dynamically set according to number of retransmissions | |
| Lopez-Aguilera et al. | An asymmetric access point for solving the unfairness problem in WLANs | |
| Cano et al. | Tuning the EDCA parameters in WLANs with heterogeneous traffic: A flow-level analysis | |
| US8040802B2 (en) | Method of controlling congestion for wireless communications | |
| Arif et al. | Throughput Estimates for A-MPDU and Block ACK Schemes Using HT-PHY Layer. | |
| Orim et al. | Cluster-based random access scheme for 5G URLLC | |
| Dong et al. | Packet delay analysis on IEEE 802.11 DCF under finite load traffic in multi-hop ad hoc networks | |
| EP2400792B1 (en) | Method and system for deriving an aggregation delay for packet aggregation in a wireless network | |
| CN106301501A (en) | A kind of instant data transfer optimization method of combined coding modulation | |
| Zhang et al. | Adaptive contention window adjustment for 802.11-based mesh networks | |
| Oliveira et al. | Maximum-throughput access control in wireless LANs through max-weight-inspired policies | |
| Lebeugle et al. | User-level performance in WLAN hotspots | |
| Liu et al. | Delay analysis of IEEE 802.11 e EDCA under unsaturated conditions | |
| Sanada et al. | Estimating the number of nodes in WLANs to improve throughput and QoS | |
| Zawawi et al. | Rate Adaptation for Quality of Service (QoS) Improvement in IEEE 802.11 ax Wireless Local Area Network (WLAN | |
| Lin et al. | Adaptive tuning of MIMO-enabled 802.11 e WLANs with network utility maximization | |
| Dolińska et al. | Throughput efficiency in IEEE 802.11 n networks |
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 |