WO2016184219A1

WO2016184219A1 - Method and device for sharing unauthorized frequency spectrum

Info

Publication number: WO2016184219A1
Application number: PCT/CN2016/075481
Authority: WO
Inventors: 杨维维; 戴博; 梁春丽
Original assignee: 中兴通讯股份有限公司
Priority date: 2015-05-15
Filing date: 2016-03-03
Publication date: 2016-11-24
Also published as: CN106304092A

Abstract

A method and device for sharing an unauthorized frequency spectrum. The method comprises: transmission nodes compete for resources on an unauthorized frequency spectrum by a predefined listen-before-talk (LBT) mechanism; and the transmission nodes perform data transmission on the unauthorized frequency spectrum if resource competition on the unauthorized frequency spectrum is successful. The method and device for sharing an unauthorized frequency spectrum of the technical solution can solve the problem of unauthorized frequency spectrum sharing of a system where transmission nodes are located and other systems.

Description

Method and device for sharing unlicensed spectrum

Technical field

This document relates to, but is not limited to, the field of communications, and in particular, to a method and apparatus for sharing unlicensed spectrum.

Background technique

Up to now, it is well known that Long Term Evolution (LTE) is deployed in licensed carriers. However, with the rapid growth of data services, in the near future, the licensed spectrum will no longer be able to withstand such a huge amount of data. Therefore, deploying LTE in the unlicensed spectrum and sharing the data traffic in the authorized carrier through the unlicensed spectrum is an important evolution direction of the subsequent LTE development.

In addition, the unlicensed spectrum has the following characteristics: (1) free/low cost (no need to purchase non-spectrum, spectrum resource is zero cost); (2) low access requirements and low cost (individuals, enterprises can participate in deployment, equipment) (3) Sharing resources (when multiple different systems are operating or when different operators of the same system are operating, some shared resources can be considered to improve spectrum efficiency); (4) Wireless connection More technologies (cross-communication standards, difficult collaboration, diverse network topology); (5) many wireless access sites (large number of users, difficult collaboration, centralized management overhead); (6) application multiple (multi-service It can be operated therein, for example, Machine to Machine (M2M), Vehicle to Vehicle (V2V).

Different countries have different regulations for the use of unlicensed spectrum. For example, in the European market, unlicensed spectrum must be used in the form of LBT (listen-before-talk). For specific LBT mechanisms, the frame is The process of the basic equipment (FBE, Frame Based Equipment) and the load-based equipment (LBE, Load Based Equipment) is different.

For FBE, the process of LBT is as follows: Before transmission, the device needs to perform Clear Channel Assessment (CCA). If the channel is idle, the data will be sent immediately. If the channel is not idle until the next fixed frame period. , can not transfer data. Fixed frame by The channel Occupancy Time (COT) and the idle period (Idle period), wherein the channel occupation time takes a value between 1 ms and 10 ms, and the minimum idle period is 5% of the channel occupation time. At the end of the idle period, The device performs a new CCA test.

For LBE, the LBT process includes an initial CCA (Initial CCA) process and an extended CCA (Extended CCA) process. Specifically, there are two LBT processes. Mode A: Initial CCA process: Before transmission, the device needs to perform CCA, and judge whether the channel is idle according to the channel evaluation result. If the channel evaluation result indicates that the channel is idle, the data is immediately transmitted. If the channel is not idle, the device cannot send data, and the device performs Extended clean channel estimation, extended clean channel evaluation for q observation slots. The observation time slot may be a non-occupied idle time slot or a busy time slot. The busy time slot is all time between two non-occupied idle time slots. The initial value of q is 16. When the N non-occupied idle time slots are not detected in the current extended clean channel evaluation, the value of q is doubled. Once the q value reaches 1024, the q value of the next extended clean channel estimate is reset to 16. N is randomly selected in [1, q]. Mode B: Initial CCA process: Before transmission, the device needs to perform CCA, and judge whether the channel is idle according to the channel evaluation result. If the channel evaluation result indicates that the channel is empty, the data is immediately transmitted. If the channel is not idle, the device cannot send data, and the device performs Extended clean channel evaluation: Generate random number N, N value is a counter, the value range is [1, q], and then perform CCA evaluation to determine whether the channel is occupied. If it is occupied, the N value remains unchanged and continue to CCA. Detect, if the channel is not occupied, the value of N is decremented by 1, to determine whether the value of N is reduced to 0. If it is reduced to 0, the data is transmitted. If the value of N is not 0, the CCA detection is continued. That is, the device performs N times of CCA detection. If the detection channel is empty, the value of N decreases. If the channel is not idle, the value of N does not change, and when N is decremented to 0, data is transmitted. The channel occupancy time specified for the channel occupancy time control is 13 ms. The existing regulations also stipulate that the corresponding detection length of the CCA detection, that is, the clean channel evaluation length is not less than 20 us, where q is the competition window length in the LBT mechanism.

For unlicensed spectrum, multiple systems work on the same spectrum, such as WIFI systems. The LBT mechanisms used by different systems may be different, resulting in the inability to guarantee fair coexistence between different systems. Therefore, when the LTE system works on the unlicensed spectrum, it is crucial to solve the problem of fair coexistence with other systems.

Summary of the invention

The following is an overview of the topics detailed in this document. This Summary is not intended to limit the scope of the claims.

The embodiment of the invention provides a method and a device for sharing an unlicensed spectrum, which can solve the problem of sharing the unlicensed spectrum between the LTE system and other systems.

An embodiment of the present invention provides a method for sharing an unlicensed spectrum, including: a transmitting node competing for resources on an unlicensed spectrum by using a predefined LBT mechanism; and the transmitting node performs data transmission on an unlicensed spectrum that is successful in competing resources.

Optionally, the predefined LBT mechanism includes one or more of the following manners:

The position of the initial clean channel assessment in the LBT mechanism is variable;

The location of the initial clean channel assessment in the LBT mechanism is fixed;

The length of the competition window in the LBT mechanism is variable;

The relationship between the length of the competition window and the data scheduling mode in the LBT mechanism is in accordance with predetermined conditions;

The relationship between the length of the competition window and the data transmission in the LBT mechanism conforms to predetermined conditions;

In the extended clean channel evaluation CCA process of the LBT mechanism, when the delay period length is greater than zero, the delay period detection is included.

Optionally, the location of the initial clean channel assessment in the LBT mechanism is variable, including:

The location of the initial clean channel assessment is determined according to location configuration signaling; or,

The location of the initial clean channel assessment is determined according to location coordination information; or,

The location of the initial clean channel assessment changes according to the period.

Optionally, the location configuration signaling includes: RRC (Radio Resource Control) signaling, System Information Block (SIB) signaling, or Downlink Control Information (DCI).

Optionally, when the location configuration signaling is DCI, determining, by the location configuration signaling, the location of the initial clean channel assessment comprises: selecting, by using a DCI indication, a location combination from a predefined initial clean channel assessment. The location of the clean channel assessment.

Optionally, the location coordination information includes one of the following information:

The transit node detects another Licensed-assisted access (LAA) section The location of the initial clean channel assessment of the point;

The transmitting node receives an initial clean channel evaluation location that the other LAA node proposes to evade by occupying the channel/information;

The transmitting node receives the initial clean channel evaluation location selected by the other LAA nodes through the occupied channel/information transmission.

Optionally, the period includes: a predefined period, a period that satisfies a predetermined condition between frame lengths, a period that satisfies a predetermined condition with a field length, or a period that satisfies a predetermined condition with a maximum channel occupation time .

Optionally, the fixed location of the initial clean channel assessment in the LBT mechanism includes: the location of the initial clean channel assessment is a predefined location.

Optionally, the variable window length in the LBT mechanism may include:

The contention window length is determined according to the length configuration signaling; or,

The contention window length determines a change based on the length trigger information.

Optionally, the length configuration signaling refers to: RRC signaling, SIB signaling, or DCI.

Optionally, determining, by the contention window length, the change according to the length trigger information includes one of the following manners:

If the length trigger information includes the last competition result being a failure, determining that the contention window length becomes longer or shorter;

If the length trigger information includes the competition result that the number of failures reaches a predetermined threshold, determining that the contention window length becomes longer or shorter;

If the length trigger information includes the last competition result being successful, determining that the contention window length becomes longer or shorter;

If the length trigger information includes the number of times the competition result is successful reaches a predetermined threshold, determining that the contention window length becomes longer or shorter;

If the length triggering information includes the energy of the channel detected by the transmitting node, when the channel energy is greater than the predetermined threshold, determining that the contention window length becomes longer or shorter;

If the length trigger information includes the detection result of the transmission node to other systems, the detection result includes the number of other systems detected, or whether the results of other systems are detected; when detected When the number of other systems is greater than a predetermined threshold, it is determined that the contention window length becomes long, and when it is detected that the number of other systems is less than or equal to the threshold, it is determined that the contention window length becomes shorter; or, when other systems are detected, the competition window length is determined. Lengthening or shortening, determining that the length of the competition window does not change when no other systems are detected;

If the length trigger information includes the detection result of the transmission node to other LAA nodes, the detection result includes the number of other LAA nodes detected, or whether the results of other LAA nodes are detected; when the number of other LAA nodes is detected to be greater than the predetermined number At the threshold, it is determined that the contention window length becomes long, and when it is detected that the number of other LAA nodes is less than or equal to a predetermined threshold, it is determined that the contention window length becomes shorter; or, when other LAA nodes are detected, it is determined that the contention window length becomes longer or Shortening, when no other LAA nodes are detected, it is determined that the contention window length is unchanged;

If the length trigger information includes the detection result of the LAA node of the other carrier by the transmission node, the detection result includes the detected number of other operator LAA nodes, or whether the result of the other operator LAA node is detected; when other When the number of the operator LAA nodes is greater than a predetermined threshold, it is determined that the contention window length becomes long, and when it is detected that the number of other operator LAA nodes is less than or equal to a predetermined threshold, determining that the contention window length becomes shorter; or, when other operations are detected When the LAA node is used, it is determined that the length of the contention window becomes longer or shorter. When no other operator LAA node is detected, the length of the contention window is determined to be unchanged;

If the length triggering information includes the detection result of the LAA node of the same carrier by the transmitting node, the detection result includes the detected number of LAA nodes of the same carrier, or whether the result of detecting the same operator LAA node is detected; when the same is detected; When the number of the operator LAA nodes is greater than a predetermined threshold, it is determined that the contention window length becomes long. When it is detected that the number of LAA nodes of the same operator is less than or equal to a predetermined threshold, the length of the competition window is determined to be unchanged; or, when the same operation is detected When the LAA node is used, it is determined that the length of the competition window becomes longer or shorter. When the same operator LAA node is not detected, the length of the competition window is determined to be unchanged;

If the length triggering information includes the window length indication information received by the transmitting node, the transmitting node determines the contention window length change according to the window length indication information;

If the length triggering information includes the occupied state information, the occupied state information is the type of the occupied signal, or is the occupied signal identified by the transmitting node, and when the occupied state information is the type of the occupied signal, the different occupied signal types correspond to different changes. Or, when the occupancy status information is whether the occupation signal is recognized by the transmission node, if it is identified, determining that the contention window length becomes long, if Not identified, determine that the length of the competition window is the same or shorter;

If the length triggering information includes the maximum channel occupation time, when the maximum channel occupation time is greater than the predetermined threshold, determining that the contention window length becomes longer, and determining that the contention window length becomes shorter when the maximum channel occupation time is less than or equal to the predetermined threshold;

If the length triggering information includes the uplink and downlink configuration corresponding to the LAA serving cell, when the uplink and downlink configuration corresponding to the LAA serving cell meets the preset condition, it is determined that the contention window length becomes longer or shorter;

If the length triggering information includes the subframe type on the LAA serving cell, when the subframe type on the LAA serving cell meets the preset condition, it is determined that the contention window length becomes longer or shorter;

If the length triggering information includes the public channel of the LAA, when the operator of the LAA public channel identification meets the preset condition, it is determined that the contention window length becomes longer or shorter;

If the length triggering information includes a data packet size that the transmitting node needs to transmit, when the data packet size that the transmitting node needs to transmit is greater than a predetermined threshold, determining that the contention window length becomes longer, when the data packet size that the transmitting node needs to transmit is less than or equal to a predetermined threshold. When it is determined, the length of the competition window is shortened.

Optionally, the manner in which the contention window length becomes longer includes one of the following:

Increase in multiples;

Become longer at a predefined level;

Become longer by index;

It becomes longer in power.

Optionally, the manner in which the contention window length is shortened includes one of the following:

Shorten in multiples;

Shortened by predefined levels;

Shorten by index;

Shortened by power.

Optionally, the relationship between the contention window length and the data scheduling mode in the LBT mechanism is consistent with a predetermined condition, including: a transmission node that is in the same scheduling, the competition window length is unchanged; wherein the same scheduling is Refers to the same data packet being scheduled by the same scheduling information.

Optionally, the relationship between the contention window length and the data transmission in the LBT mechanism conforms to a predetermined condition, that is, when the transmitting node transmits the first transmission data and retransmits the data, the contention window length does not change.

An embodiment of the present invention further provides an unlicensed spectrum sharing apparatus, which is applied to a transmission node, and includes: a contention module, configured to compete for resources on an unlicensed spectrum by using a predefined LBT mechanism; and a transmission module, configured to compete in the spectrum After the module successfully competes for resources on the unlicensed spectrum with a predefined LBT mechanism, the module performs data transmission on the unlicensed spectrum where the contention is successful.

The length of the competition window in the LBT mechanism is variable;

In the extended CAA process of the LBT mechanism, when the delay period length is greater than zero, the delay period detection is included.

Optionally, the variable window length in the LBT mechanism may include:

The embodiment of the invention further provides a computer storage medium, wherein the computer storage medium stores computer executable instructions, and the computer executable instructions are used to execute the above method.

In the embodiment of the present invention, the transmitting node competes for resources on the unlicensed spectrum with a predefined LBT mechanism, and performs data transmission on the unlicensed spectrum that the competing resources succeed. In this way, the friendly coexistence of the system where the transmission node is located (such as the LTE system) and other systems on the unlicensed spectrum is realized, and at the same time, the idle resources are fully applied to the data transmission of the system where the transmission node is located, and the resources of the unlicensed spectrum are improved. Utilization, achieving a higher data transfer rate.

Other aspects will be apparent upon reading and understanding the drawings and detailed description.

BRIEF abstract

FIG. 1 is a flowchart of a method for sharing an unlicensed spectrum according to an embodiment of the present invention;

2 is a schematic diagram of a base station (eNB) performing LBT according to an embodiment of the present invention;

3 is a schematic diagram of a terminal (UE) performing LBT according to an embodiment of the present invention;

4 is a flowchart of an LBT mechanism according to an embodiment of the present invention;

Figure 5 is a flow chart of the delay period detecting process of Figure 4;

FIG. 6 is a schematic structural diagram of a device for sharing an unlicensed spectrum applied to a transmission node according to an embodiment of the present invention.

Embodiments of the invention

The embodiments of the present invention are described in detail below with reference to the accompanying drawings.

FIG. 1 is a flowchart of a method for sharing an unlicensed spectrum according to an embodiment of the present invention. As shown in FIG. 1, the method for sharing an unlicensed spectrum provided by an embodiment of the present invention includes the following steps:

Step 101: The transmitting node competes for resources on the unlicensed spectrum with a predefined LBT mechanism.

Here, the transmission node is, for example, a terminal (UE) or a base station (eNB) in the LTE system.

The predefined LBT mechanism includes one or more of the following ways:

The length of the competition window in the LBT mechanism is variable;

In the extended clean channel estimation process of the LBT mechanism, when the delay period length is greater than zero, the delay period detection is included.

Among them, the length of the competition window in the LBT mechanism is q value. Wherein, the value of q is in the range of [a1, a2], wherein a2 is greater than a1, a1 is a positive number greater than or equal to 0, and a2 is a positive number greater than zero.

In an embodiment, the location of the initial clean channel assessment in the LBT mechanism is variable, including: determining the location of the initial clean channel assessment based on the location configuration signaling. The location configuration signaling includes: RRC (Radio Resource Control) signaling, System Information Block (SIB) signaling, or Downlink Control Information (DCI). For example, when the location configuration signaling is DCI, the location of the initial clean channel assessment is determined according to the location configuration signaling, including: selecting, by using a DCI indication, the initial clean channel from a preset combination of pre-defined initial clean channel assessments. The location of the assessment.

In an embodiment, the location of the initial clean channel assessment in the LBT mechanism is variable, and the location of the initial clean channel assessment is determined according to the location coordination information. The location coordination information is exchanged through the air interface.

The location coordination information includes at least one of the following information:

The transit node detects the location of the initial CCA of the other authorized access-assisted access (LAA) node;

The transmitting node receives an initial CCA location that the other LAA node proposes to evade by occupying the channel/signal;

The initial selection of the proposed selection by the transmitting node to receive the channel/signal from other LAA nodes CCA location.

In an embodiment, the variable location of the initial clean channel assessment in the LBT mechanism includes: the location of the initial clean channel assessment changes according to a period. The period includes a pre-defined period, a period that satisfies a predetermined condition with a frame length, a period that satisfies a predetermined condition with a field length, or a period that satisfies a predetermined condition with a maximum channel occupation time.

In an embodiment, the fixed location of the initial clean channel assessment in the LBT mechanism includes: the location of the initial clean channel assessment is a predefined location.

In an embodiment, the variable window length in the LBT mechanism is variable, and the contention window length is determined according to the length configuration signaling. The length configuration signaling includes: RRC signaling, SIB signaling, or DCI.

In an embodiment, the variable window length in the LBT mechanism may include: the contention window length determines a change according to the length trigger information.

The competition window length determines the change according to the length trigger information to include at least one of the following manners:

If the length trigger information includes the last competition result being a failure, determining that the contention window length becomes longer or shorter, for example, determining that the contention window length becomes longer;

If the length trigger information includes the competition result that the number of failures reaches a predetermined threshold, determining that the contention window length becomes longer or shorter, for example, determining that the contention window length becomes longer;

If the length trigger information includes that the last competition result is successful, determining that the contention window length becomes longer or shorter, for example, determining that the contention window length becomes shorter;

If the length trigger information includes the number of times the competition result is successful reaches a predetermined threshold, determining that the contention window length becomes longer or shorter, for example, determining that the contention window length becomes shorter;

If the length triggering information includes the energy of the channel detected by the transmitting node, when the channel energy is greater than the predetermined threshold, determining that the contention window length becomes longer or shorter, for example, determining that the contention window length becomes longer;

If the length trigger information includes the detection result of the transmission node to other systems, the detection result includes the number of other systems detected, or whether the results of other systems are detected; when it is detected that the number of other systems is greater than a predetermined threshold, determining The length of the competition window becomes long, and when it is detected that the number of other systems is less than or equal to a predetermined threshold, it is determined that the contention window length becomes shorter; or, when other systems are detected, it is determined that the contention window length becomes longer or shorter, for example, determining The length of the competition window becomes longer, when not When other systems are detected, the length of the competition window is determined to be unchanged;

If the length trigger information includes the detection result of the transmission node to other LAA nodes, the detection result includes the number of other LAA nodes detected, or whether the results of other LAA nodes are detected; when the number of other LAA nodes is detected to be greater than the predetermined number At the threshold, it is determined that the contention window length becomes long, and when it is detected that the number of other LAA nodes is less than or equal to a predetermined threshold, it is determined that the contention window length becomes shorter; or, when other LAA nodes are detected, it is determined that the contention window length becomes longer Or shortening, for example, determining that the contention window length becomes longer, and when no other LAA nodes are detected, determining that the contention window length is unchanged;

If the length trigger information includes the detection result of the LAA node of the other carrier by the transmission node, the detection result includes the detected number of other operator LAA nodes, or whether the result of the other operator LAA node is detected; when other When the number of the operator LAA nodes is greater than a predetermined threshold, it is determined that the contention window length becomes long, and when it is detected that the number of other operator LAA nodes is less than or equal to a predetermined threshold, determining that the contention window length becomes shorter; or, when other operations are detected When the LAA node is used, it is determined that the contention window length becomes longer or shorter. For example, it is determined that the contention window length becomes long. When no other operator LAA node is detected, the length of the contention window is determined to be unchanged;

If the length triggering information includes the detection result of the LAA node of the same carrier by the transmitting node, the detection result includes the detected number of LAA nodes of the same carrier, or whether the result of detecting the same operator LAA node is detected; when the same is detected; When the number of the operator LAA nodes is greater than a predetermined threshold, it is determined that the contention window length becomes longer or shorter, for example, determining that the contention window length becomes longer, and when it is detected that the number of LAA nodes of the same operator is less than or equal to a predetermined threshold, determining competition The length of the window is unchanged; or, when the same operator LAA node is detected, it is determined that the contention window length becomes longer or shorter, for example, it is determined that the contention window length becomes longer, and when the same operator LAA node is not detected, the competition window is determined. The length is unchanged;

If the length trigger information includes the window length indication information received by the transmission node, the transmission node determines the contention window length change according to the window length indication information. For example, when the transmitting node is a base station, determining the contention window length change according to the window length indication information includes: determining, by the base station, a contention window length change according to the window length indication information fed back by the terminal, where the feedback information is a hybrid automatic repeat request (HARQ) , Hybrid Automatic Repeat reQuest) (ACK) (HARQ-ACK) information, or Channel State Information (CSI), where the terminal is a scheduled terminal, or all terminals, or terminals greater than a certain threshold; When the transmission node is a terminal, according to the window The determining, by the terminal, the contention window length change includes: determining, by the terminal, the contention window length change according to the received window length indication information; the window length indication information is obtained by using uplink scheduling information or RRC information;

If the length triggering information includes the occupied state information, the occupied state information is the type of the occupied signal, or is the occupied signal identified by the transmitting node, and when the occupied state information is the type of the occupied signal, the different occupied signal types correspond to different changes. Or, when the occupancy status information is whether the occupation signal is recognized by the transmission node, if it is identified, determining that the contention window length becomes long, if not recognized, determining that the competition window length does not change or becomes shorter;

If the length triggering information includes the uplink and downlink configuration corresponding to the LAA serving cell, when the uplink and downlink configuration corresponding to the LAA serving cell meets the preset condition, it is determined that the contention window length becomes longer or shorter, for example, determining that the contention window length becomes shorter;

If the length trigger information includes the subframe type on the LAA serving cell, when the subframe type on the LAA serving cell satisfies the preset condition, it is determined that the contention window length becomes longer or shorter, for example, determining that the contention window length becomes shorter;

If the length trigger information includes the public channel of the LAA, when the operator of the LAA public channel identification meets the preset condition, it is determined that the contention window length becomes longer or shorter, for example, determining that the contention window length becomes shorter;

Among them, the way in which the length of the competition window becomes longer includes one of the following:

Increase in multiples;

Become longer at a predefined level;

Become longer by index;

It becomes longer in power.

Among them, the way in which the length of the competition window becomes shorter includes one of the following:

Shorten in multiples;

Shortened by predefined levels;

Shorten by index;

Shortened by power.

In an embodiment, the relationship between the contention window length and the data scheduling mode in the LBT mechanism is consistent with a predetermined condition, including: a transmission node that is in the same scheduling, the competition window length is unchanged; wherein the same scheduling is Refers to the same data packet being scheduled by the same scheduling information.

In an embodiment, the relationship between the contention window length and the data transmission in the LBT mechanism conforms to a predetermined condition, and the length of the contention window is unchanged when the transmitting node transmits the first transmission data and the retransmission data.

In an embodiment, during the extended clean channel estimation process of the LBT mechanism, when the delay period detection length is greater than 0, the delay period detection is included. In the extended clean channel evaluation process, the value of the random number N and the length of the delay period in the delay period detection satisfy a predetermined condition, and the value range of N is [0, q]. For example, after delay period detection, N=Nk, where k is a positive number greater than or equal to 0, and the value of k is at least related to the length of the delay period or configured by signaling or a predefined value, for example, k is a delay period The length is divided by the extended CCA detection length and rounded out, or k is the delay period length and the sum of the extended CCA detection length in the delay period detection divided by the extended CCA detection length, or k is the extended CCA in the delay period detection. The detection length is divided by the extended CCA detection length and rounded up. The rounding includes rounding up and down rounding, for example, the value of k is predefined to be 0, or the value of k is predetermined to be 1.

Step 102: The transmitting node performs data transmission on the unlicensed spectrum that the contention resource is successful.

Embodiment 1

For transmitting downlink data on an unlicensed spectrum, the base station (eNB) needs to perform LBT before transmitting data. As shown in Figure 2, the authorized cell (LCell, Licensed Cell) is authorized. The serving cell on the spectrum, the unlicensed cell (UCell) is the serving cell on the unlicensed spectrum. The base station performs LBT on the UCell. After the contention is successful, the downlink data is sent on the UCell.

For transmitting uplink data on an unlicensed spectrum, the terminal (UE) needs to perform LBT before transmitting data. As shown in FIG. 3, the authorized cell LCell is a serving cell on the licensed spectrum, and the unlicensed cell UCell is a serving cell on the unlicensed spectrum. The terminal performs LBT on the UCell. After the contention is successful, the uplink data is sent on the UCell. The LBT receives the scheduling information corresponding to the data before.

Embodiment 2

In this embodiment, the transmission node is a terminal in the LTE system. The terminal competes for resources on the unlicensed spectrum with a predefined LBT mechanism; the terminal performs data transmission on the unlicensed spectrum where the contention is successful.

In a specific embodiment, the location of the initial LBT mechanism for the initial clean channel assessment is obtained according to the location configuration signaling, and the location configuration signaling is RRC signaling. For example, the UE performs an initial clean channel assessment on subframe #0 according to the high layer signaling indication.

In a specific embodiment, the location of the initial LBT mechanism for the initial clean channel assessment is obtained according to the location configuration signaling, and the location configuration signaling is the DCI. Assuming that the pre-defined location combination is {subframe #0, subframe #5, subframe #9}, the location of the initial clean channel evaluation is indicated by the LBT indication field in the DCI as {subframe #0}, where the LBT indication The size of the domain is related to the number of predefined locations.

In a specific embodiment, the location of the initial LBT mechanism for the initial clean channel assessment changes according to the period. Assuming a period of 10, the location of the initial clean channel evaluation is A in the mth period, that is, the initial CCA position in the radio frame n is A, and is B in the m+1th period, that is, in the radio frame n+1. The initial CCA position is B, which is C in the m+2th cycle, that is, the initial CCA position in the radio frame n+2 is C, where m, n is a positive integer greater than or equal to 0. The period may be a pre-defined period, a period that satisfies a predetermined condition between frame lengths, a period that satisfies a predetermined condition with a field length, or a period that satisfies a predetermined condition with a maximum channel occupation time.

In one embodiment, the predefined LBT mechanism is fixed for the initial clean channel assessment. The fixed location is a predefined location of the terminal (or base station).

In the above specific embodiment, the positions of the initial clean channel evaluation are all exemplified in units of subframes. However, the present invention is not limited thereto, and may be orthogonal frequency division multiplexing (OFDM, Orthogonal) in a subframe. Frequency Division Multiplexing) is a symbol.

Here, when the terminal is competing for resources on the unlicensed spectrum, the effective utilization of the unlicensed spectrum resources can be ensured by determining the location of the initial clean channel evaluation.

Embodiment 3

In this embodiment, the transmission node is a terminal (UE) in the LTE system. The terminal competes for resources on the unlicensed spectrum with a predefined LBT mechanism; the terminal performs data transmission on the unlicensed spectrum where the contention is successful. Here, it is assumed that the competition window length q is x when the terminal is last competing, where x is a positive number greater than or equal to zero.

In a specific embodiment, the predefined LBT mechanism determines the contention window length based on the length configuration signaling. At this time, the UE obtains the q value in the LBT mechanism according to the RRC signaling. However, the present invention is not limited thereto, and the length configuration signaling may also be SIB signaling or DCI.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, wherein the length trigger information is that the last competition result is a failure. Assuming that the UE's last competition result is a failure, the competition window length used by the UE at this competition becomes W times of the previous time, that is, q=W*x, where W is a positive number greater than 0.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, wherein the length trigger information is that the last competition result is successful. Assuming that the UE's last competition result is successful, the contention window used by the UE during this competition becomes 1/V times of the previous time, that is, q=x/V, where V is a positive number greater than zero.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, where the length trigger information is the number of times the contention result is a failure. Assuming that the number of failures of the UE before the competition is y, the length of the competition window used by the UE in this competition becomes D times of the previous time, that is, q=D*x, where y and D are positive numbers greater than 0.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, wherein the length trigger information is the number of times the contention result is successful. Assuming that the UE has previously competed for the number of successful times to reach n, then the contention window used by the UE during this competition becomes the last time. 1/E times, that is, q=x/E, where n and E are positive numbers greater than zero.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, where the length trigger information is the type of the occupied signal. It is assumed that the type of the occupied signal detected by the UE in this competition is the SRS (Sounding Reference Signal), and the length of the contention window used by the UE in this competition becomes 1/K times of the previous time, that is, q=x. /K, where K is a positive number greater than zero. In addition, the occupied signals that trigger the change of the length of the contention window may be different sequences, different signals, and different bandwidths, and the corresponding competition window length variation factors may be the same or different.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, where the length trigger information is the occupancy status information. Assuming that the UE recognizes the occupancy signal in this competition, the competition window length used by the UE in this competition becomes 1/KK times of the previous time, that is, q=x/KK, where KK is a positive number greater than 0; The occupied signal is not recognized in the second competition, and the length of the competition window used by the UE is unchanged during this competition.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, where the length trigger information is an uplink and downlink configuration corresponding to the LAA serving cell. Assume that the uplink and downlink configurations of the serving cell on the unlicensed spectrum are P, and the value of P is {0, 1, 2, 3, 4, 5, 6}, then the length of the competition window used by the UE in this competition changes. It is 1/L times of the last time, that is, q=x/L, where L is a positive number greater than 0. The competition window length is based on the uplink and downlink configuration changes, and the uplink and downlink configurations in the same uplink and downlink configuration group are the same. The same uplink and downlink configuration group is obtained according to signaling, or according to the uplink and downlink configuration. Than obtained, or obtained according to the type of sub-frame.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, where the length trigger information is the packet size that needs to be transmitted. Assuming that the packet size that the UE needs to transmit is smaller than the threshold, the contention window size used by the UE in this competition becomes 1/ML times of the previous time, that is, q=x/ML; it is assumed that the packet size that the UE needs to transmit is greater than or equal to Threshold, then the competition window length used by the UE in this competition becomes the last ML times, that is, q=ML*x, where ML is a positive number greater than 0, and the change factor ML may be the same or different, and the threshold is Pre-set value.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, where the length trigger information is the maximum channel occupation time. Assuming that the maximum channel occupation time is greater than or equal to the threshold, the length of the competition window used by the UE in this competition becomes NL times of the previous time. That is, q=NL*x; assuming that the maximum channel occupation time is less than the threshold, then the competition window length used by the UE in this competition becomes 1/NL times of the previous time, that is, q=x/NL, where NL is greater than 0. The positive value, the change factor NL may be the same or different, and the threshold is a preset value.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, where the length trigger information is the window length indication information received by the UE, and the terminal passes the window length indication information in DCI format0/4. The domain obtains the window length indication information, and obtains the change manner of the competition window length according to the window length indication information; if the window length indication information is 2 bits, where 00 indicates that the window length is constant, 01 indicates that the window length becomes longer, and 10 indicates that the window length becomes shorter. , 11 represents a multiple of the change in window length.

In addition, in the above specific embodiment, the manner in which the contention window length becomes long includes one of the following: lengthening by a multiple; lengthening according to a predefined level; lengthening by an exponent; and lengthening by a power. The manner in which the length of the competition window becomes shorter includes one of the following: shortening by a multiple; shortening by a predefined level; shortening by an exponent; becoming shorter by a power.

In a specific embodiment, the predefined LBT mechanism is a transit node that is in the same scheduling, and the contention window length is unchanged. The same scheduling refers to scheduling the same data packet by the same scheduling information. Assuming that the UE receives the scheduling information of the data packet A on the subframe n, the UE contends for the resource in the subframe n+k, wherein the contention window length is q, and if the contention result is a failure, the UE is in the subframe n+k+ The content of the competition window is still q again. If the competition result is a failure, the UE competes for resources again in the subframe n+k+j+g. At this time, the length of the competition window is still q, that is, it is at For the UE scheduled in the same time, the value of the competition window length q is unchanged, where n, k, j, g are positive numbers greater than zero.

In a specific embodiment, the predefined LBT mechanism is that the transmission node does not change the length of the contention window when transmitting the first transmission data and retransmitting the data. Assuming that the UE receives the scheduling information of the data packet A on the subframe n, the UE contends for the resource on the subframe n+k, where the contention window length is q. If the contention result is successful, the UE is in the subframe n+k. Sending data, if the base station does not correctly receive the data, and transmits the scheduling information corresponding to the retransmission packet on the subframe n+k+j, then the UE competes for resources in the subframe n+k+j+g, wherein the contention window is still If q, if the competition result is successful, the UE sends retransmission data on the subframe n+k+j+g, that is, when the first transmission data and the retransmission data transmission, the corresponding competition window length does not change, where n, k , j, g is a positive number greater than zero.

In this case, when the UE competes for resources on the unlicensed spectrum, the adjusted contention window length can ensure fair coexistence with other systems, thereby ensuring efficient use of unlicensed spectrum resources.

Embodiment 4

In this embodiment, the transmission node is a base station (eNB) in the LTE system. The base station competes for resources on the unlicensed spectrum with a predefined LBT mechanism; the base station performs data transmission on the unlicensed spectrum where the contention is successful. Here, it is assumed that the competition window length q is d when the eNB is last competing, where d is a positive number greater than or equal to zero.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, wherein the length trigger information is that the last competition result is a failure. Assuming that the last competition result is a failure, the competition window length used by the eNB at this competition becomes F times of the previous time, that is, q=F*d, where F is a positive number greater than zero.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, wherein the length trigger information is that the last competition result is successful. Assuming that the last competition result is successful, the competition window length used by the eNB at this competition becomes 1/G times of the previous time, that is, q=d/G, where G is a positive number greater than zero.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, where the length trigger information is the number of times the contention result is a failure. Assuming that the eNB has previously competed for the number of failures to reach y, then the contention window used by the eNB at this competition becomes H times the previous time, that is, q=H*d, where y, H is a positive number greater than zero.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, wherein the length trigger information is the number of times the contention result is successful. Assuming that the eNB has previously competed for the number of successful times to reach n, then the contention window used by the eNB in this competition becomes 1/Z times the previous time, that is, q=d/Z, where n, Z is greater than 0. number.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, where the length trigger information is the type of the occupied signal. Assuming that the type of the occupied signal is detected as the Primary Synchronization Signal (PSS), the length of the contention window used by the UE in this competition becomes 1/S times of the previous time, that is, q=d/S, where S is A positive number greater than zero. The occupied signals that trigger the change of the length of the contention window may be different sequences, different channels, different signals, and different bandwidths, and the corresponding competition window length change factors may be the same or different.

In a specific embodiment, the predefined LBT mechanism triggers information according to the length of the contention window length. The change is determined, wherein the length trigger information is occupancy status information. Assuming that the eNB recognizes the occupancy signal in this competition, the competition window length used by the eNB in this competition becomes 1/KK times of the previous time, that is, q=x/KK, where KK is a positive number greater than 0; The occupancy signal is not recognized in the secondary competition, and the length of the competition window used by the eNB is unchanged during this competition.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, where the length trigger information is an uplink and downlink configuration corresponding to the LAA serving cell. Assume that the uplink and downlink configurations of the serving cell on the unlicensed spectrum are P, and the value of P is {0, 1, 2, 3, 4, 5, 6}, then the contention window used by the eNB in this competition becomes The last 1/Q times, ie q=d/Q, where Q is a positive number greater than zero. The competition window length is based on the uplink and downlink configuration changes, and the uplink and downlink configurations in the same uplink and downlink configuration group are the same. The same uplink and downlink configuration group is obtained according to signaling, or according to the uplink and downlink configuration. Than obtained, or obtained according to the type of sub-frame.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, wherein the length trigger information is channel energy. It is assumed that when the eNB detects that the channel energy is greater than a certain threshold, the contention window used by the eNB at the time of the competition becomes BB times of the previous time, that is, q=BB*d; or, when the eNB detects that the channel energy is less than or equal to a certain At the threshold, the competition window length used by the eNB at this competition becomes 1/CC times of the previous time, that is, q=d/CC, where BB, CC is a positive number greater than zero.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, wherein the length trigger information is a detection result for the WIFI system. It is assumed that when the eNB detects that the number of WIFI systems is greater than a certain threshold, the competition window length used by the eNB in this competition becomes the previous EE times, that is, q=EE*d; or, when the eNB detects the number of WIFI systems. When the threshold is less than or equal to a certain threshold, the contention window used by the eNB changes during the competition and becomes 1/HH times of the previous time, that is, q=d/HH; or, when the eNB detects the WIFI system, the competition The length of the contention window used by the eNB becomes the previous EE times, that is, q=EE*d; or, when the eNB does not detect the WIFI system, the contention window used by the eNB does not change during the competition, where EE, HH Is a positive number greater than zero. The competition window length change factor may be the same or different.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, where the length trigger information is a detection result for other LAA nodes, other operator LAA nodes, or the same operator LAA node. Assume that when the eNB detects other LAA nodes When the number, the number of LAA nodes of other operators, or the number of LAA nodes of the same operator is greater than a certain threshold, the length of the competition window used by the eNB during the competition becomes MM times of the previous time, that is, q=MM*d; When the eNB detects the number of other LAA nodes, the number of other operator LAA nodes, or the number of LAA nodes of the same operator is less than or equal to a certain threshold, the contention window used by the eNB changes to the previous 1/time. NN times, that is, q=d/NN; or, when the eNB detects other LAA nodes, other operator LAA nodes, or the same operator LAA node, the competition window length used by the eNB in this competition becomes the last EE times. , that is, q=EE*d; or, when the eNB does not detect other LAA nodes, other operator LAA nodes, or the same operator LAA node, the competition window length used by the eNB during the competition is unchanged, where MM, NN is A positive number greater than zero. The competition window length change factor may be the same or different.

In a specific embodiment, the predefined LBT mechanism determines the change according to the length trigger information for the contention window length, where the length trigger information is HARQ-ACK information received by the eNB, and the base station determines, according to the HARQ-ACK information, the contention window length change includes If the eNB can distinguish between acknowledgment (NACK)/no acknowledgment (DTX), when the eNB receives the acknowledgment (ACK)/NACK, it determines that the contention window length is the initial value, and when the eNB receives the DTX, it determines that the contention window length becomes longer. If the eNB cannot distinguish between NACK/DTX, when the eNB receives the ACK, it determines that the contention window length is the initial value, and when the eNB receives the NACK/DTX, it determines that the contention window length becomes longer. The HARQ-ACK is HARQ-ACK information fed back from N UEs, or HARQ-ACK information fed back from scheduled UEs, or HARQ-ACK information fed back from all UEs.

In the above specific embodiment, the manner in which the contention window length becomes long includes one of the following: lengthening by a multiple; lengthening according to a predefined level; lengthening by an exponent; and lengthening by a power. The manner in which the length of the competition window becomes shorter includes one of the following: shortening by a multiple; shortening by a predefined level; shortening by an exponent; becoming shorter by a power.

In this case, when the eNB competes for resources on the unlicensed spectrum, the adjusted contention window length can ensure fair coexistence with the WIFI system, thereby ensuring efficient use of the unlicensed spectrum resources.

Embodiment 5

In this embodiment, the predefined LBT mechanism includes: when the delay period length is greater than zero, the extended CCA process includes delay period detection. Wherein, the value of the random number N is related to the length of the delay period. After the delay period detection, N=N-k, where the value of k is at least the length of the delay period related. Where N has a value range of [0, q] and k is a positive number greater than zero.

4 is a flow chart of an LBT mechanism in accordance with an embodiment of the present invention. As shown in FIG. 4, the LBT mechanism includes an initial CCA process and an extended CCA process.

The initial CCA process is as follows:

Step 401: Enter an initial CCA (iCCA, Initial Clear Channel Assessment);

Step 402: Determine whether the channel is occupied, if the channel is occupied, proceed to step 404, if the channel is not occupied, proceed to step 403;

Step 403: Send data and perform data transmission.

The process of extending the CCA is as follows:

Step 404: Generate a random number N, where N has a value range of [0, q];

Step 405: Enter delay period detection;

Step 406: N=N-k, where the value of k is the value of the delay period detection length divided by the extended clear channel assessment (eCCA) and rounded up;

Step 407: Determine whether N is less than or equal to 0, if greater than 0, proceed to step 409, if less than or equal to 0, proceed to step 408;

Step 408: Send data and perform data transmission.

Step 409: Perform channel detection by using eCCA as the detection length.

Step 410: Determine whether the channel is occupied, if the channel is occupied, return to step 405, if the channel is not occupied, proceed to step 411;

Step 411: N=N-1, and proceeds to step 407.

FIG. 5 is a flow chart of the delay period detecting process of FIG. 4. As shown in Figure 5, the delay period detection process is as follows:

Step 501: Perform channel detection by using eCCA as the detection length.

Step 502: Determine whether the channel is occupied, if the channel is occupied, return to step 501, if the channel is not occupied, proceed to step 503;

Step 503: Perform channel detection by using a delay period detection length as a detection length.

Step 504: Determine whether the channel is occupied. If the channel is occupied, go back to step 503. If the channel is not occupied, end the delay period detection.

In addition, as shown in FIG. 6, the embodiment of the present invention further provides an unlicensed spectrum sharing apparatus, which is applied to a transmission node, and includes: a contention module, configured to compete for resources on an unlicensed spectrum by using a predefined LBT mechanism; And a module, configured to perform data transmission on the unlicensed spectrum that the contention resource succeeds after the contention module successfully competes for resources on the unlicensed spectrum by using the predefined LBT mechanism.

The predefined LBT mechanism includes one or more of the following ways:

The length of the competition window in the LBT mechanism is variable;

In an embodiment, the location of the initial clean channel assessment in the LBT mechanism may include:

In an embodiment, the variable window length in the LBT mechanism may include:

In an embodiment, the relationship between the contention window length and the data scheduling mode in the LBT mechanism is consistent with a predetermined condition, including: a transmission node that is in the same scheduling, and the length of the contention window is unchanged; The same scheduling means that the same data packet is scheduled by the same scheduling information.

In an embodiment, the relationship between the contention window length and the data transmission in the LBT mechanism conforms to a predetermined condition, and the length of the contention window is unchanged when the transmitting node transmits data and retransmits data.

In addition, the specific processing procedure of the above device is the same as that described above, and thus will not be described herein.

It will be apparent to those skilled in the art that the various modules or steps of the present invention described above can be implemented by a general-purpose computing device that can be centralized on a single computing device or distributed across a network of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein. The steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated as a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software.

The basic principles and main features of the present invention and the advantages of the present invention are shown and described above. The present invention is not limited by the above-described embodiments, and the above-described embodiments and the description are merely illustrative of the principles of the present invention, and various changes and modifications may be made without departing from the spirit and scope of the invention. And modifications are intended to fall within the scope of the invention as claimed.

Industrial applicability

The above technical solution realizes the friendly coexistence of the system where the transmission node is located (such as the LTE system) and other systems on the unlicensed spectrum, and at the same time, fully applies the idle resource to the data transmission of the system where the transmission node is located, and improves the unlicensed spectrum. Resource utilization has reached a higher data transfer rate.

Claims

A method for sharing unlicensed spectrum, including:

The transport node competes for resources on the unlicensed spectrum with a predefined first-listening LBT mechanism;

The transmitting node performs data transmission on an unlicensed spectrum that competes for a successful resource.
The method of claim 1 wherein said predefined LBT mechanism comprises one or more of the following:

The position of the initial clean channel assessment in the LBT mechanism is variable;

The location of the initial clean channel assessment in the LBT mechanism is fixed;

The length of the competition window in the LBT mechanism is variable;

The relationship between the length of the competition window and the data scheduling mode in the LBT mechanism is in accordance with predetermined conditions;

The relationship between the length of the competition window and the data transmission in the LBT mechanism conforms to predetermined conditions;

In the extended clean channel evaluation CCA process of the LBT mechanism, when the delay period length is greater than zero, the delay period detection is included.
The method of claim 2 wherein the location of the initial clean channel assessment in the LBT mechanism is variable comprising:

The location of the initial clean channel assessment is determined according to location configuration signaling; or,

The location of the initial clean channel assessment is determined according to location coordination information; or,

The location of the initial clean channel assessment changes according to the period.
The method of claim 3, wherein the location configuration signaling comprises: radio resource control RRC signaling, system information block SIB signaling, or downlink control information DCI.
The method of claim 4, wherein when the location configuration signaling is DCI, determining, by the location configuration signaling, the location of the initial clean channel assessment comprises: evaluating, by a DCI, from a predefined initial clean channel The location of the initial clean channel assessment is selected in the location combination.
The method of claim 3, wherein the location coordination information comprises one of the following information:

The transmitting node detects the location of the initial clean channel assessment of other authorized auxiliary access LAA nodes;

The transmitting node receives an initial clean channel evaluation location that the other LAA node proposes to evade by occupying the channel/information;

The transmitting node receives the initial clean channel evaluation location selected by the other LAA nodes through the occupied channel/information transmission.
The method of claim 3, wherein the period comprises: a predefined period, a period that satisfies a predetermined condition with a frame length, a period that satisfies a predetermined condition with a field length, or a maximum channel occupation time A period in which predetermined conditions are met.
The method of claim 2 wherein the fixed location of the initial clean channel assessment in the LBT mechanism comprises: the location of the initial clean channel assessment being a predefined location.
The method of claim 2 wherein the variable window length in the LBT mechanism is variable comprising:

The contention window length is determined according to the length configuration signaling; or,

The contention window length determines a change based on the length trigger information.
The method of claim 9, wherein the length configuration signaling comprises: radio resource control RRC signaling, system information block SIB signaling, or downlink control information DCI.
The method of claim 9, wherein the contention window length determines the change based on the length trigger information comprises one of the following:

If the length trigger information includes the last competition result being a failure, determining that the contention window length becomes longer or shorter;

If the length trigger information includes the competition result that the number of failures reaches a predetermined threshold, determining that the contention window length becomes longer or shorter;

If the length trigger information includes the last competition result being successful, determining that the contention window length becomes longer or shorter;

If the length trigger information includes the number of times the competition result is successful reaches a predetermined threshold, determining that the contention window length becomes longer or shorter;

If the length triggering information includes the energy of the channel detected by the transmitting node, when the channel energy is greater than the predetermined threshold, determining that the contention window length becomes longer or shorter;

If the length trigger information includes the detection result of the transmission node to other systems, the detection result includes the number of other systems detected, or whether the results of other systems are detected; when it is detected that the number of other systems is greater than a predetermined threshold, determining The length of the competition window becomes longer, and when it is detected that the number of other systems is less than or equal to a predetermined threshold, it is determined that the contention window length becomes shorter; or, when other systems are detected, it is determined that the competition window length becomes longer or shorter, when no detection is performed Determine the length of the competition window unchanged when going to other systems;

If the length trigger information includes the detection result of the transmission node to other LAA nodes, the detection result includes the number of other LAA nodes detected, or whether the results of other LAA nodes are detected; when the number of other LAA nodes is detected to be greater than the predetermined number At the threshold, it is determined that the contention window length becomes long, and when it is detected that the number of other LAA nodes is less than or equal to a predetermined threshold, it is determined that the contention window length becomes shorter; or, when other LAA nodes are detected, it is determined that the contention window length becomes longer or Shortening, when no other LAA nodes are detected, it is determined that the contention window length is unchanged;

If the length trigger information includes the detection result of the LAA node of the other carrier by the transmission node, the detection result includes the detected number of other operator LAA nodes, or whether the result of the other operator LAA node is detected; when other When the number of the operator LAA nodes is greater than a predetermined threshold, it is determined that the contention window length becomes long, and when it is detected that the number of other operator LAA nodes is less than or equal to a predetermined threshold, determining that the contention window length becomes shorter; or, when other operations are detected When the LAA node is used, it is determined that the length of the contention window becomes longer or shorter. When no other operator LAA node is detected, the length of the contention window is determined to be unchanged;

If the length triggering information includes the detection result of the LAA node of the same carrier by the transmitting node, the detection result includes the detected number of LAA nodes of the same carrier, or whether the result of detecting the same operator LAA node is detected; when the same is detected; When the number of the operator LAA nodes is greater than a predetermined threshold, it is determined that the contention window length becomes long. When it is detected that the number of LAA nodes of the same operator is less than or equal to a predetermined threshold, the length of the competition window is determined to be unchanged; or, when the same operation is detected When the LAA node is used, it is determined that the length of the competition window becomes longer or shorter. When the same operator LAA node is not detected, the length of the competition window is determined to be unchanged;

If the length triggering information includes the window length indication information received by the transmitting node, the transmitting node determines the contention window length change according to the window length indication information;

If the length triggering information includes the occupied state information, the occupied state information is the type of the occupied signal, or is the occupied signal identified by the transmitting node, and when the occupied state information is the type of the occupied signal, the different occupied signal types correspond to different changes. Or, when the occupancy status information is whether the occupation signal is recognized by the transmission node, if it is identified, determining that the contention window length becomes long, if not recognized, determining that the competition window length does not change or becomes shorter;

If the length triggering information includes the maximum channel occupation time, when the maximum channel occupation time is greater than the predetermined threshold, determining that the contention window length becomes longer, and determining that the contention window length becomes shorter when the maximum channel occupation time is less than or equal to the predetermined threshold;

If the length triggering information includes the uplink and downlink configuration corresponding to the LAA serving cell, when the uplink and downlink configuration corresponding to the LAA serving cell meets the preset condition, it is determined that the contention window length becomes longer or shorter;

If the length triggering information includes the subframe type on the LAA serving cell, when the subframe type on the LAA serving cell meets the preset condition, it is determined that the contention window length becomes longer or shorter;

If the length triggering information includes the public channel of the LAA, when the operator of the LAA public channel identification meets the preset condition, it is determined that the contention window length becomes longer or shorter;

If the length triggering information includes a data packet size that the transmitting node needs to transmit, when the data packet size that the transmitting node needs to transmit is greater than a predetermined threshold, determining that the contention window length becomes longer, when the data packet size that the transmitting node needs to transmit is less than or equal to a predetermined threshold. When it is determined, the length of the competition window is shortened.
The method of claim 11 wherein the manner in which the contention window length becomes longer comprises one of the following:

Increase in multiples;

Become longer at a predefined level;

Become longer by index;

It becomes longer in power.
The method of claim 11, wherein the manner in which the contention window length becomes shorter includes one of the following:

Shorten in multiples;

Shortened by predefined levels;

Shorten by index;

Shortened by power.
The method of claim 2, wherein the relationship between the contention window length and the data scheduling mode in the LBT mechanism is consistent with a predetermined condition, including: a transmission node that is in the same scheduling, the competition window length is unchanged; The same scheduling means that the same data packet is scheduled by the same scheduling information.
The method of claim 2, wherein the relationship between the contention window length and the data transmission in the LBT mechanism conforms to a predetermined condition comprises: the contention window when the transmitting node transmits the first transmission data and retransmits the data The length does not change.
A shared device for unlicensed spectrum, applied to a transmission node, comprising:

The competition module is set to compete for resources on the unlicensed spectrum with the predefined LBT mechanism.

And a transmission module, configured to perform data transmission on the unlicensed spectrum that the contention resource succeeds after the contention module successfully competes for resources on the unlicensed spectrum by using the predefined LBT mechanism.
The apparatus of claim 16 wherein said predefined LBT mechanism comprises one or more of the following:

The position of the initial clean channel assessment in the LBT mechanism is variable;

The location of the initial clean channel assessment in the LBT mechanism is fixed;

The length of the competition window in the LBT mechanism is variable;

The relationship between the length of the competition window and the data scheduling mode in the LBT mechanism is in accordance with predetermined conditions;

The relationship between the length of the competition window and the data transmission in the LBT mechanism conforms to predetermined conditions;

In the extended CAA process of the LBT mechanism, when the delay period length is greater than zero, the delay period detection is included.
The apparatus of claim 17 wherein the location of the initial clean channel assessment in the LBT mechanism is variable comprising:

The location of the initial clean channel assessment is determined according to location configuration signaling; or,

The location of the initial clean channel assessment is determined according to location coordination information; or,

The location of the initial clean channel assessment changes according to the period.
The apparatus of claim 17, wherein the fixed location of the initial clean channel assessment in the LBT mechanism comprises: the location of the initial clean channel assessment is a predefined location.
The apparatus of claim 17, wherein the variable window length in the LBT mechanism is variable comprises:

The contention window length is determined according to the length configuration signaling; or,

The contention window length determines a change based on the length trigger information.
The apparatus according to claim 17, wherein the relationship between the contention window length and the data scheduling mode in the LBT mechanism conforms to predetermined conditions, including: at the same time scheduled transmission node, the contention window length is unchanged; The same scheduling refers to scheduling the same data packet by the same scheduling information.
The apparatus of claim 17, wherein the relationship between the contention window length and the data transmission in the LBT mechanism conforms to a predetermined condition comprises: the contention window when the transmitting node transmits the first transmission data and retransmits the data The length does not change.
A computer storage medium having stored therein computer executable instructions for performing the method of any one of claims 1-15.