CN106454853B

CN106454853B - Method and device for adjusting preemption probability of contention mechanism

Info

Publication number: CN106454853B
Application number: CN201510483301.9A
Authority: CN
Inventors: 苟伟; 赵亚军; 杨维维; 毕峰
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2015-08-07
Filing date: 2015-08-07
Publication date: 2021-11-09
Anticipated expiration: 2035-08-07
Also published as: CN106454853A; WO2017024917A1

Abstract

The application provides a method and a device for adjusting the preemption probability of a contention mechanism, which relate to the field of mobile wireless communication and monitor preemption parameters during the execution period of a Listen Before Talk (LBT) for the Kth time and/or one or more times before the Kth time; determining the range of a corresponding contention backoff window in one or more LBT executions after the K +1 th time and/or the K +1 th time according to the preemption parameter; the invention can realize that the station can dynamically and automatically match the total detection duration in the LBT execution according to the unauthorized load in the process of executing the usage right preemption of the unauthorized carrier, so that the LBT efficiency is maximized, and the usage efficiency of the unauthorized carrier is improved; the preemption probability of the competition mechanism is flexibly changed.

Description

Method and device for adjusting preemption probability of contention mechanism

Technical Field

The invention relates to the field of mobile wireless communication, in particular to a method and a device for adjusting the preemption probability of a competition mechanism.

Background

Currently, LTE (Long Term Evolution) is deployed in an authorized carrier for operation. But with the rapid growth of data traffic, the licensed spectrum will no longer be able to withstand such huge amounts of data in the near future. There is therefore a need to deploy LTE in unlicensed spectrum over which data traffic in licensed carriers is shared.

In addition, there are many advantages to unlicensed spectrum. For example, unlicensed spectrum has the following features and advantages:

1. free/low cost (no need to buy non-spectrum, zero cost of spectrum resources).

2. The admission requirement is low, the cost is low (individuals and enterprises can participate in deployment, and the equipment of equipment suppliers can be arbitrary).

3. The resources are shared (when a plurality of different systems operate therein or different operators of the same system operate therein, some ways of sharing the resources may be considered to improve the spectrum efficiency).

4. The wireless access technologies are multiple (different communication standards are crossed, the cooperation is difficult, and the network topology is various).

5. The wireless access stations are many (the number of users is large, the cooperation difficulty is large, and the centralized management overhead is large).

6. Applications are numerous (multiple services are mentioned in which it is possible to operate, for example, Machine to Machine (M2M), Vehicle to Vehicle (V2V)).

The above basic feature determines that unlicensed spectrum may be an important evolution direction of a wireless communication system, but there are many problems. For example, there will be various wireless systems in the unlicensed spectrum that are difficult to coordinate with each other and interfere severely.

Disclosure of Invention

The invention provides a method and a device for adjusting the preemption probability of a competition mechanism, which can flexibly change the preemption probability of the competition mechanism.

In order to achieve the purpose of the invention, the technical scheme adopted by the invention is as follows:

a method for adjusting the preemption probability of a contention mechanism comprises the following steps:

monitoring preemption parameters during the execution period of the Kth and/or one or more Listen Before Talk (LBT) s before the Kth;

determining the range of a corresponding contention backoff window in one or more LBT executions after the K +1 th time and/or the K +1 th time according to the preemption parameter;

wherein K is an integer.

Further, monitoring preemption parameters during the kth and/or one or more previous listen-before-talk LBT executions comprises one or more of:

counting the number P of times that an extended channel assessment eCCA or a clear channel assessment CCA is detected to be busy during the Kth and/or one or more previous LBT execution periods;

counting the times Q of execution of delay cycles occurring during the Kth and/or one or more previous LBT (local binary transmission) executions;

calculating the average duration W of duration between every two detection idleness times during the Kth and/or Kth previous LBT execution period or a plurality of LBT execution periods;

wherein P, Q, W is an integer.

Further, determining, according to the preemption parameter, that the range of the corresponding contention backoff window in the K +1 th and/or one or more LBT executions after the K +1 th includes one or more of:

comparing the number P of times that the eCCA is detected to be busy with a first busy threshold, and determining the range of a corresponding contention backoff window during one or more LBT execution times after the K +1 th time and/or the K +1 th time according to the comparison result;

comparing the number Q of times of executing the delay cycle with a first delay threshold, and determining the range of a corresponding competition backoff window in one or more times of LBT execution after the K +1 th time and/or the K +1 th time according to the comparison result;

and comparing the continuous average time length W with a first time length threshold value, and determining the range of the corresponding competition backoff window in one or more times of LBT execution after the K +1 th time and/or the K +1 th time according to the comparison result.

comparing the number P of times that the eCCA is detected to be busy with a second busy threshold and a third busy threshold, and determining the range of a corresponding contention backoff window in one or more LBT executions after the K +1 th time and/or the K +1 th time according to the comparison result;

comparing the number Q of times of executing the delay cycle with a second delay threshold and a third delay threshold, and determining the range of a corresponding contention backoff window in one or more times of LBT execution after the K +1 th time and/or the K +1 th time according to the comparison result;

and comparing the continuous average duration W with a second duration threshold and a third duration threshold, and determining the range of the corresponding competition backoff window in one or more LBT executions after the K +1 th time and/or the K +1 th time according to the comparison result.

Further, the second busy threshold is N/3 and the third busy threshold is 2N/3; where N is a randomly generated value within a contention backoff window corresponding to the LBT procedure.

Further, the determining, according to the preemption parameter, a range of a contention backoff window corresponding to one or more LBT executions after the K +1 th time and/or the K +1 th time includes:

and determining the range of a corresponding contention backoff window during one or more times of LBT execution after the K +1 th time and/or the K +1 th time according to the preemption parameter and the corresponding first weight during the Kth listen-before-talk LBT execution period, the preemption parameter during one or more times of listen-before-talk LBT execution periods before the K th time and the corresponding second weight.

Further, the method further comprises:

randomly generating a numerical value N in a competition backoff window range corresponding to the Kth LBT process and/or one or more previous LBT processes;

determining the range of the corresponding contention backoff window in one or more times of LBT execution after the K +1 th time and/or the K +1 th time according to the preemption parameter includes:

comparing the number P/value N of times of busy detection of the eCCA with a first busy proportion threshold, and determining the range of a corresponding contention backoff window in one or more LBT executions after the K +1 th time and/or the K +1 th time according to the comparison result; or

Comparing the number P/value N of times of busy detection of the eCCA with a second busy proportion threshold and a third busy proportion threshold, and determining the range of a corresponding contention backoff window in one or more LBT executions after the K +1 th time and/or the K +1 th time according to the comparison result; or

Comparing the number P/value N of times of busy detection of the eCCA with a fourth busy proportion threshold, a fifth busy proportion threshold and a sixth busy proportion threshold, and determining the range of a corresponding contention backoff window in one or more LBT executions after the K +1 th time and/or the K +1 th time according to the comparison result; or

And comparing the number P/value N of times of busy detection of the eCCA with a seventh busy proportion threshold, an eighth busy proportion threshold, a ninth busy proportion threshold and a tenth busy proportion threshold, and determining the range of a corresponding competition backoff window in one or more LBT execution times after the K +1 th time and/or the K +1 th time according to the comparison result.

In order to solve the above technical problem, the present invention further provides a contention mechanism preemption probability adjusting device, including:

the monitoring module monitors preemption parameters during the execution period of the Kth listen before talk LBT and/or one or more times before the Kth listen before talk LBT;

the adjusting module is used for determining the range of the corresponding competition backoff window in the K +1 th time and/or one or more times of LBT execution after the K +1 th time according to the preemption parameter;

wherein K is an integer.

Preferably, the monitoring module comprises:

a first statistic unit, configured to count a number P of times that an extended channel assessment eCCA or a clear channel assessment CCA is detected as busy during a kth and/or one or more previous LBT executions; and/or

A second counting unit, configured to count a number Q of delay cycle executions occurring during the kth and/or one or more previous LBT executions; and/or

The computing unit is used for computing the average duration W of duration between every two detection idleness times during the Kth and/or Kth previous LBT execution period or a plurality of LBT execution periods;

wherein P, Q, W is an integer.

Preferably, the adjusting module comprises:

a first adjusting unit, configured to compare the number P of times that the eCCA is detected as busy with a first busy threshold, and determine, according to a comparison result, a range of a contention backoff window corresponding to one or more LBT executions after the K +1 th time and/or the K +1 th time; and/or

The second adjusting unit is used for comparing the number Q of times of executing the delay cycle with a first delay threshold value, and determining the range of a corresponding contention backoff window in one or more times of LBT execution after the K +1 th time and/or the K +1 th time according to the comparison result; and/or

And the third adjusting unit is used for comparing the continuous average time length W with the first time length threshold value, and determining the range of the corresponding contention backoff window in the K +1 th time and/or one or more times of LBT execution after the K +1 th time according to the comparison result.

Preferably, the adjusting module comprises:

a fourth adjusting unit, configured to compare the number P of times that the eCCA is detected as busy with the second busy threshold and the third busy threshold, and determine, according to a comparison result, a range of a contention backoff window corresponding to the K +1 th time and/or one or more times of LBT execution after the K +1 th time; and/or

A fifth adjusting unit, configured to compare the number Q of times of execution of the delay period with a second delay threshold and a third delay threshold, and determine, according to a comparison result, a range of a contention backoff window corresponding to one or more LBT executions after the K +1 th time and/or the K +1 th time; and/or

And the sixth adjusting unit is configured to compare the sustained average duration W with the second duration threshold and the third duration threshold, and determine, according to a comparison result, a range of a corresponding contention backoff window in the K +1 th and/or one or more LBT executions after the K +1 th LBT execution.

Preferably, the adjusting module is further configured to determine, according to the preemption parameter during the execution period of the kth listen-before-talk LBT, a corresponding first weight, and the preemption parameter during the execution period of the kth previous listen-before-talk LBT or multiple listen-before-talk LBTs, and a corresponding second weight, a range of a corresponding contention backoff window in the execution of one or more LBTs after the kth +1 and/or the kth + 1.

Preferably, the apparatus further comprises:

the generating module is used for randomly generating a numerical value N in a competition backoff window range corresponding to the Kth LBT process and/or one or more previous LBT processes;

the adjustment module includes:

a seventh adjusting unit, configured to compare the number P/value N of times that the eCCA is detected as busy with the first busy proportion threshold, and determine, according to a comparison result, a range of a contention backoff window corresponding to the K +1 th time and/or one or more LBT executions after the K +1 th time; or

An eighth adjusting unit, configured to compare the number P/value N of times that the eCCA is detected as busy with the second busy proportion threshold and the third busy proportion threshold, and determine, according to a comparison result, a range of a contention backoff window corresponding to one or more LBT executions after the K +1 th time and/or the K +1 th time; or

A ninth adjusting unit, configured to compare the number P/value N of times that the eCCA is detected as busy with a fourth busy proportion threshold, a fifth busy proportion threshold, and a sixth busy proportion threshold, and determine, according to a comparison result, a range of a contention backoff window corresponding to one or more LBT executions after the K +1 th time and/or the K +1 th time; or

A tenth adjusting unit, configured to compare the number P/value N of times that the eCCA is detected as busy with a seventh busy proportion threshold, an eighth busy proportion threshold, a ninth busy proportion threshold, and a tenth busy proportion threshold, and determine, according to a comparison result, a range of a contention backoff window corresponding to one or more LBT executions after the K +1 th time and/or the K +1 th time.

Compared with the prior art, the invention has the following beneficial effects:

the method and the device for adjusting the preemption probability of the contention mechanism can realize that the total detection duration in the LBT execution is dynamically and automatically matched according to the unauthorized load weight in the process of executing the usage right preemption of the unauthorized carrier, so that the LBT efficiency is maximized, and the usage efficiency of the unauthorized carrier is improved; the preemption probability of a contention mechanism is flexibly changed so as to meet the contention mechanism requirement in LTE deployment of an unauthorized carrier.

Drawings

Fig. 1 is a flowchart of a contention mechanism preemption probability adjustment method according to an embodiment of the present invention;

fig. 2 is a schematic structural diagram of a contention mechanism preemption probability adjusting apparatus according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more apparent, the following description of the embodiments of the present invention with reference to the accompanying drawings is provided, and it should be noted that, in the case of conflict, features in the embodiments and the embodiments in the present application may be arbitrarily combined with each other.

As shown in fig. 1, an embodiment of the present invention provides a method for adjusting preemption probability of a contention mechanism, including:

s101, monitoring preemption parameters during the execution period of the Kth and/or one or more times of Listen Before Talk (LBT) before the Kth;

s102, determining the range of a corresponding competition backoff window in the K +1 th time and/or one or more times of LBT execution after the K +1 th time according to the preemption parameter;

wherein K is an integer.

Step S101 includes:

counting the number P of times that an extended Channel Assessment (eCCA) or Clear Channel Assessment (CCA) is busy during or one or more times before the Kth LBT execution period and/or counting the number Q of times that a delay period execution occurs and/or calculating the average duration W of the duration between every two detection idleness, wherein P, Q, W is an integer.

The number P of busy detections may be calculated only during eCCA, or may include initial CCA and delay period CCA, and the average duration W of duration between every two idle detections also represents the average duration of duration between every two busy detections.

The smaller the value of P is, the more idle the channel is, the fewer sites participating in the unauthorized carrier preemption are, and at this time, the contention backoff window may be adjusted to become smaller, so as to reduce the time resource waste of unnecessary CCA/eCCA detection. Otherwise, the contention backoff window is adjusted to be larger so as to reduce the conflict of resource preemption between the preemption sites. Q, W values have an equivalent effect to P, and Q, W can also be treated like P.

Step S102 may be adjusted according to at least one of:

comparing the continuous average duration W with a first duration threshold, and determining the range of a corresponding contention backoff window in one or more LBT executions after the K +1 th time and/or the K +1 th time according to the comparison result;

A station (generally referred to as a device using an unlicensed carrier) adjusts the contention probability in the (K + 1) th and/or one or more LBTs after the (K + 1) th based on the performance in the K-th "listen before talk" (LBT) procedure, and may adjust the contention backoff window to generate a contention window range of a random backoff number N (for backoff counting), specifically:

randomly generating a numerical value N in a competition backspacing window range corresponding to the Kth LBT process; step S102 may also be adjusted according to at least one of:

The method may further comprise:

When determining the range of the corresponding contention backoff window at the K +1 th and subsequent one or more times of LBT execution, the K +1 th and subsequent one or more times of LBT may use the same range of the contention backoff window.

The method provided by the embodiment of the invention can also be used for adjusting the adjustment of the LBT competition window of the K +2 th time according to the competition conditions of the LBT process of the K (multiple LBTs before the K) th time and the K +1 th time. In this case, P is the addition of the respective P values of the Kth time (multiple LBT before the Kth time) and the K +1 th time; the N value is the addition of the respective N values of the Kth time (multiple LBT before the Kth time) and the K +1 th time; or weighting by using the corresponding weight value and then carrying out weighted summation. Q, W is used as described above for P.

The maximum value of the next LBT contention window is adjusted according to P, Q, or W is less than or greater than a certain agreed threshold(s). The agreed threshold may be a function of a randomly generated N value in the primary LBT of the station.

For example, P is less than N/3 (or P/N is less than 1/3); the contention window for the next LBT is reduced.

As shown in fig. 2, an embodiment of the present invention provides a contention mechanism probability adjustment apparatus, including:

wherein K is an integer.

Wherein the monitoring module comprises:

wherein P, Q, W is an integer.

The adjustment module includes:

A third adjusting unit, configured to compare the sustained average duration W with a first duration threshold, and determine, according to a comparison result, a range of a contention backoff window corresponding to one or more LBT executions after the K +1 th time and/or the K +1 th time; and/or

The adjusting module is further configured to determine, according to the preemption parameter and the corresponding first weight during the kth listen-before-talk LBT execution period, and the preemption parameter and the corresponding second weight during the one or more previous listen-before-talk LBT execution periods, a range of a contention backoff window corresponding to the kth +1 time and/or one or more LBT execution periods after the kth +1 time.

The device further comprises:

the adjustment module includes:

A tenth adjusting unit, configured to compare the number P/value N of times that the eCCA is detected as busy with a seventh busy proportion threshold, an eighth busy proportion threshold, a ninth busy proportion threshold, and a tenth busy proportion threshold, and determine, according to the comparison result, a range of a contention backoff window corresponding to one or more LBT executions after the K +1 th time and/or the K +1 th time

In the following embodiments, the parameter P is taken as an example, and specific application examples are given. The same processing mechanism may be used for parameter Q, W.

Example one

Determining the range of the corresponding contention backoff window in one or more LBT executions after the K +1 th time and/or the K +1 th time according to the preemption parameter, wherein the determining may be performed in one of the following manners:

mode 1

When P/N is less than or equal to 1/3, the next LBT contention backoff window is adjusted to be: current contention backoff window (or default maximum window value, same below) 0.5; or current contention backoff window P/N; or current contention backoff window 1/3; or a default minimum window value is adopted;

when P/N is less than or equal to 2/3 and greater than 1/3, no adjustment is made, i.e.: current contention backoff window x 1;

when P/N is greater than 2/3, the next LBT contention backoff window is adjusted to be: original pre-contention backoff window 2; or a pre-contention backoff window N/P; or pre-contention backoff window 3/2; or a default maximum window value.

Mode 2

When P/N is less than 1/2, the next LBT contention backoff window is adjusted to be smaller: current contention backoff window 0.5; or current contention backoff window P/N; or a default minimum window value is adopted;

when P/N equals 1/2, no adjustment is made, i.e.: current contention backoff window x 1;

when P/N is greater than 1/2, the next LBT contention backoff window is adjusted to be: current contention backoff window 2; or current contention backoff window N/P; or a default maximum window value.

Mode 3

When P/N is less than or equal to 1/2, the next LBT contention backoff window is adjusted to be: current contention backoff window 0.5; or current contention backoff window P/N; or a default minimum window value is adopted;

Mode 4

When the P/N is less than or equal to 1/4, the next LBT contention backoff window is adjusted to be smaller as: current contention backoff window 0.5; or current contention backoff window 1/3; or a default minimum window value is adopted;

when the P/N is less than or equal to 2/4 and greater than 1/4, the next LBT contention backoff window is adjusted to be smaller as follows: current contention backoff window P/N; or current contention backoff window 2/3;

when P/N is less than or equal to 3/4 and greater than 2/4, the next LBT contention backoff window is increased as: current contention backoff window N/P; or current contention backoff window 3/2;

when P/N is greater than or equal to 3/4, the next LBT contention backoff window is increased to: current contention backoff window 2; or current contention backoff window 3/1; or a default maximum window value.

Mode 5

When the P/N is less than or equal to 1/5, the next LBT contention backoff window is adjusted to be smaller as: current contention backoff window 0.5; or current contention backoff window 1/3; or a default minimum window value is adopted;

when the P/N is less than or equal to 2/5 and greater than 1/5, the next LBT contention backoff window is adjusted to be smaller as follows: current contention backoff window P/N; or current contention backoff window 2/3;

when P/N is less than or equal to 3/5 and greater than 2/5, it is: current contention backoff window x 1;

when P/N is less than or equal to 4/5 and greater than 3/5, the next LBT contention backoff window is increased as: current contention backoff window N/P; or current contention backoff window 3/2;

when P/N is larger than 4/5, the next LBT contention backoff window is increased to: current contention backoff window 2; or current contention backoff window 3/1; or a default maximum window value.

And when the value obtained by the P/N or the current competition backspace window coefficient is not an integer, adopting an upward/downward rounding mode or adopting a near rounding principle. The same applies below.

If the station has an initial window (if the initial window exists, that is, a default window), the station adjusts a contention backoff window corresponding to the next LBT by using the initial window or according to the above principle when the next LBT is executed after one successful transmission;

or if the station has adopted the default window or the specified minimum window value after the primary LBT is successful, if the station needs to reduce the contention window again, the station cannot reduce the contention window corresponding to the next LBT and continues to use the specified minimum window or the default window.

Or if the station has adopted the default window after the primary LBT is successful, or if the station needs to adjust the contention window again when the specified maximum window is adopted, the station cannot adjust the contention window corresponding to the next LBT and continues to use the specified maximum window or the default window.

Or, if the station does not successfully transmit after LBT is successful, the station adjusts the contention backoff window corresponding to the next LBT according to the above manner.

Or, the station always adjusts the contention backoff window corresponding to the next LBT in the above manner.

If the UE side does CCA, or the neighboring station does CCA, one or more of the parameters, the adjusted window length, or the new adjusted random number N in the foregoing manner are notified to the neighboring station or the subordinate UE. The station can configure local scheduling principles, for example, in some manner as described above, e.g., the principle of adjusting the contention window can be sent via system messages.

Example two

Assuming that the station performs LBT for the first time, when the station performs the LBT mechanism, the station first adopts a default contention window, for example, the default contention window is 0 to L in length. When a station needs to count the above parameters in performing LBT for the first time. Taking parameter P (defined in the foregoing description) as an example, the station needs to count parameter P during the first LBT mechanism execution. When a station competes for an unauthorized carrier, a random backoff value generated is N, wherein N is less than or equal to L. Suppose that a station has successfully performed a first LBT, i.e., N is decremented to 0. During which the station counts P as P1, the station adjusts the contention window for the next LBT execution according to mode 3 (and in other similar ways).

The rule of mode 3 specifically used in this embodiment is:

when P/N is greater than 1/2, the next LBT contention backoff window is adjusted to be: current contention backoff window 2; or current contention backoff window N/P; or adopting a default maximum window value;

assuming that P1/N equals 0.6, the length of the station next contention window is: l × N/P1, rounded down.

The next time the station performs LBT, the randomly generated backoff N ranges from 0 to L × N/P1, with L × N/P1 rounding down.

More specifically, the following description is provided: for example, the station contention window is 0-15; then the random backoff value N generated for the first time is 10, and when N is decremented to 0 during the first LBT execution, the station totally counts the number of blind times to be 4 (only counting a single eCCA), that is, in 10 decrements executed by the station, a single eCCA detection is encountered four times to be busy, obviously, the unlicensed carrier is in a relatively idle state, P/N is 4/10 is 0.4, obviously, 0.4 is less than 0.5, so the station can adjust the contention window at the next LBT execution time to be: 15*4/10.

Example 3

Mode 5 is explained, specifically, mode 5:

when P/N is larger than 4/5, the next LBT contention backoff window is increased to: current contention backoff window 2; or current contention backoff window 3/1; or adopt a default maximum window value

Assuming that the competition backspacing window has minimum and maximum specified values, and when the minimum window length is less than or equal to the minimum window length, continuously using the minimum window length; and when the window length is larger than or equal to the maximum window length, continuously using the maximum window length. And all adopt the principle of rounding down.

For example, the minimum contention window is 0 to 7, and the maximum contention window is 0 to 1023. The initial default window is 0-15. The random backoff value N generated for the first time is 8, and when N is decremented to 0 during the first LBT execution, the total number of times that a single eCCA detection is busy during the statistics is 5 (only a single eCCA is counted), that is, the station executes 5 single eCCA detections that are busy in 8 decrements, and calculates according to the method 5: P/N5/8 0.625, and then the station adjusts the contention window for the next LBT execution according to mode 5 as: 15 × 8/5, 24, i.e., the next time the station performs LBT, the contention window for generating the random backoff N is 0-24.

As mentioned above, the minimum contention window is 0 to 7, and the maximum contention is 0 to 1023. The initial default window is 0-15. The contention window of the kth LBT is 0-7, the random backoff value N generated by the station is 5, and during the first LBT execution period, when N is decremented to 0, the total number of times that a single eCCA detection is busy during the statistics period is 2 (only a single eCCA is counted), that is, in the 5 decrements performed by the station, 2 single eCCA detections that are busy are encountered, and the calculation is performed according to the method 5: P/N2/5 0.4, then the station adjusts the contention window for the next LBT execution according to mode 5 as: 7 × 2/5, 2.8, rounded down to 2, where 2 is less than the specified minimum contention window 7, so the minimum contention window is still used from 0 to 7.

Example 4

The station randomly generates a backoff value N of 10 in the kth LBT. The station performs an initial CCA, and if the initial CCA detection result is busy, the station generates a backoff value N-10, and then performs a delay period CCA, and if the detection result is idle, the station performs a single eCCA detection, and if the single eCCA detection is idle, N-1 (representing assignment) at this time; then the single eCCA detection is continued, and assuming that it is detected to be busy, the station freezes N (actual value of N is 9), at which point P counts a number of times (the number of times the single eCCA detects that the channel changes from idle to busy during eCCA execution). Then, a delay period CCA is performed, and if the detection result is idle, the station performs a single eCCA detection, which is assumed to be idle, at which time N-1 (the actual N value is 8), and then continues to perform the single eCCA detection, which is assumed to be busy, at which time N is frozen (the actual N value is 8), and at which time P counts again. And then executing a delay period CCA, wherein the detection result is idle, then executing single eCCA detection by the station, no single eCCA detection is busy, and N is decreased to 0. Then P counts a total of 2 times.

When the ranges of the contention backoff windows of the K +1 th and the following one or more LBTs are determined using the above-described method, the ranges of the contention backoff windows of the K +1 th and the following multiple LBTs may be the same. For example, the range of the contention window of the LBT at times K +1, K +2, and K +3 is the same. The range of the contention window can be adjusted according to the transmission of the data packet (or file) to be transmitted. For example, if the packet size is L and it needs Y preemption of LBT to complete transmission, then Y times is used as an adjustment period, for example, K +1 times, K +2 times, K +3 times … times, K + Y times, and after adjustment, the same contention window range is used for the Y LBT times.

Although the embodiments of the present invention have been described above, the contents thereof are merely embodiments adopted to facilitate understanding of the technical aspects of the present invention, and are not intended to limit the present invention. It will be apparent to persons skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined in the appended claims.

Claims

1. A method for adjusting preemption probability of a contention mechanism is characterized by comprising the following steps:

determining the range of a corresponding contention backoff window in one or more LBT executions after the K +1 th time and/or the K +1 th time according to the preemption parameter, wherein the range of the contention backoff window comprises:

comparing the preemption parameter with at least one appointed threshold value, and determining the range of a corresponding contention backoff window in one or more LBT executions after the K +1 th time and/or the K +1 th time according to the comparison result; the appointed threshold is determined according to a numerical value N, and the numerical value N is a numerical value randomly generated in a competition backspacing window range corresponding to the LBT process;

wherein K is an integer.

2. The method of claim 1, wherein: monitoring preemption parameters during the kth and/or one or more previous listen-before-talk, LBT, executions includes one or more of:

wherein P, Q, W is an integer.

3. The method of claim 2, wherein: determining, according to the preemption parameter, that the range of the corresponding contention backoff window in the K +1 th and/or one or more LBT executions after the K +1 th includes one or more of:

4. The method of claim 2, wherein: determining, according to the preemption parameter, that the range of the corresponding contention backoff window in the K +1 th and/or one or more LBT executions after the K +1 th includes one or more of:

5. The method of claim 4, wherein the second cranked threshold is N/3 and the third cranked threshold is 2N/3; where N is a randomly generated value within a contention backoff window corresponding to the LBT procedure.

6. The method of claim 1, wherein determining, from the preemption parameters, a range of contention backoff windows corresponding to one or more LBT executions after the K +1 th and/or K +1 th time comprises:

7. The method of claim 2, further comprising:

8. A contention mechanism preemption probability adjusting apparatus, comprising:

wherein K is an integer.

9. The apparatus of claim 8, wherein: the monitoring module includes:

wherein P, Q, W is an integer.

10. The apparatus of claim 9, wherein: the adjustment module includes:

11. The apparatus of claim 9, wherein: the adjustment module includes:

12. The apparatus of claim 8, wherein:

13. The apparatus of claim 8, further comprising:

the adjustment module includes: