Channel occupancy time sharing and handling in sidelink communication systems

Abstract

Methods, apparatuses, and systems related to processing and communicating COT information received from other UEs in a sidelink communication system. In one example aspect, a method of wireless communication includes a first wireless device transmitting, to a second wireless device, a signal including second channel occupancy time (COT) sharing information, wherein the second COT sharing information is determined based on a first rule and X first channel occupancy time (COT) sharing information; the X first COT sharing information corresponds to a set of X frequency resources; and X is an integer greater than or equal to 2.

Description

Technical Field

[0001] This article relates to wireless communication. Background Technology

[0002] Mobile communication technologies are moving the world toward an increasingly connected and networked society. Compared to existing wireless networks, next-generation systems and communication technologies will need to support a wider range of use case characteristics and provide a greater range and flexibility for more complex and sophisticated access requirements.

[0003] LTE (Long Term Evolution) is a wireless communication standard for mobile devices and data terminals developed by the 3rd Generation Partnership Project (3GPP). LTE-Advanced (LTE-A) is a wireless communication standard that enhances the LTE standard. The fifth-generation wireless system, known as 5G, advances the LTE and LTE-A wireless standards and aims to support higher data rates, massive connectivity, ultra-low latency, high reliability, and other emerging business needs. Summary of the Invention

[0004] This article discloses techniques, particularly for UEs, to process and transmit COT information received from other UEs in a pass-through communication system.

[0005] In one embodiment, a wireless communication method is disclosed. The method includes a first wireless device transmitting a signal to a second wireless device including second channel occupancy time (COT) sharing information, wherein the second COT sharing information is determined according to a first rule and X sets of first channel occupancy time (COT) sharing information; the X sets of first COT sharing information correspond to X sets of frequency resources; and X is an integer greater than or equal to 2.

[0006] In yet another embodiment, a wireless communication device is disclosed, which includes a process configured or operable to perform the above-described method.

[0007] In yet another embodiment, a computer-readable storage medium is disclosed. This computer-readable storage medium stores code that, when executed by a processor, causes the processor to perform the methods described above. Attached Figure Description

[0008] Figure 1 A flowchart illustrating an example of processing COT shared information is provided.

[0009] Figure 2 An example diagram illustrating the correspondence between the first COT shared information and the second COT shared information.

[0010] Figure 3 An example diagram illustrating the correspondence between the first COT sharing information, the second COT sharing information, and the target COT sharing information received from other UEs.

[0011] Figure 4 An example diagram is shown illustrating the determination of the second COT sharing information based on the first COT sharing information.

[0012] Figure 5 Another example diagram is shown for determining the second COT sharing information based on the first COT sharing information.

[0013] Figure 6 An example diagram is shown to determine the first COT shared information and the second COT shared information based on the second rule and the first rule.

[0014] Figure 7 An example diagram is shown for determining the second COT shared information based on the first rule.

[0015] Figure 8 An example diagram is shown illustrating the determination of transmissions on frequency resources based on the first COT shared information.

[0016] Figure 9 An exemplary block diagram of a hardware platform that is part of a network device or communication apparatus is shown.

[0017] Figure 10 The present invention illustrates implementations of network communication including base stations (BS) and user equipment (UE) based on some of the disclosed technologies.

[0018] Figure 11 A flowchart illustrating a wireless communication method according to one or more embodiments of the present technology is shown. Detailed Implementation

[0019] The headings of the following sections are used to facilitate understanding of the disclosed subject matter and do not in any way limit the scope of the claimed subject matter. Therefore, one or more features of one segment may be combined with one or more features of another segment. Furthermore, for clarity, the term "5G" is used; however, the technologies disclosed herein are not limited to 5G technology and can be used in wireless systems implementing other protocols.

[0020] This application discloses methods and apparatus related to COT shared information processing in a direct link communication system.

[0021] In a direct-link communication system, when user equipment (UE) needs to transmit services, the services between UEs do not need to go through the network side. In other words, this service transmission does not pass through the cellular link between the UE and the base station, but is sent directly from the data source UE to the target UE through a direct communication channel (sometimes called a side link). This direct communication mode between UEs has characteristics that differ from the communication mode of traditional cellular systems.

[0022] Typical applications of direct-link communication include device-to-device (D2D) communication and vehicle-to-everything (V2X) communication. Among them, vehicle-to-everything (V2X) communication includes vehicle-to-vehicle (V2V), vehicle-to-pedestrian (V2P), and vehicle-to-infrastructure (V2I).

[0023] For short-range communication users accessing Sidelink communication, Sidelink communication saves radio spectrum resources and reduces data transmission pressure on the core network, thereby reducing system resource consumption, improving the spectrum efficiency of cellular communication systems, and reducing communication latency. Straight-through link communication also significantly reduces network operating costs.

[0024] Current straight-through link designs only consider ITS (Intelligent Transport System) spectrum and licensed spectrum allocated to network operators. However, current designs do not consider unlicensed spectrum.

[0025] In existing sidelinks, a time slot can contain several sidelink channels. These sidelink channels include the Physical Sidelink Control Channel (PSCCH), the Physical Sidelink Shared Channel (PSSCH), and the Physical Sidelink Feedback Channel (PSFCH). Additionally, the time slot also includes OFDM symbols, in which no sidelink channels are transmitted throughout the entire symbol.

[0026] In sidelink communication, the transmitting device selects resources for signaling / data transmission.

[0027] One approach is through scheduling by a central node (such as a base station), which determines the resources used by the transmitting device and notifies the terminal via signaling.

[0028] Correspondingly, another approach to resource selection is the contention-based resource selection method. In this method, the device can autonomously select resources within the resource pool by monitoring resource usage and monitoring results. This contention-based method can also be called a terminal-autonomous resource selection method.

[0029] On unlicensed spectrum, only channels that have successfully completed the Listen-Before-Speak (LBT) process can be used to transmit information. The LBT scheme means that communication nodes must compete with other communication nodes for transmission resources. Only when the time-frequency resource contention is successful can the communication node transmit information on that resource. More specifically, under the LBT mechanism, communication nodes perform a channel access procedure (monitoring whether the channel is idle) before transmitting information, and communication nodes can only transmit information when the channel is idle. The LBT mechanism described above is a typical channel access mechanism; the terminal can listen for channel idleness and then perform LBT and other channel access procedures and channel occupancy.

[0030] However, COT information processing and sharing technologies and systems require further exploration and research. This application discloses various solutions regarding how a UE processes received COT information. This application also discloses methods and schemes involving transmitting processed COT shared information while simultaneously transmitting time and / or frequency resources covered by COT shared information. This application discloses and proposes methods that improve communication efficiency in direct-link communication systems due to at least less overhead and better spectrum utilization.

[0031] Implementation Method 1

[0032] This section discloses in particular an embodiment of processing received COT information and generating COT sharing information to be transmitted in a pass-through link communication system.

[0033] In this embodiment, the first node determines the second COT sharing information and sends the second COT information. Specifically, the first node determines X pieces of first COT sharing information corresponding to X resource block sets (RB sets). Here, X is a positive integer greater than 1. The first node uses the X pieces of first COT sharing information to determine the second COT sharing information according to a first rule. The first node then sends the second COT sharing information.

[0034] exist Figure 1 The process described is shown in the figure.

[0035] Here, each of the X resource block sets (RB sets) includes multiple RBs contained in a channel. The first node performs channel access processing as a frequency domain unit. It is assumed that the channel access process evaluation results in channel availability. In this case, the strength of interference signals on the channel is not high, and the first node can consider using the channel to transmit sidelink information.

[0036] Here, the bandwidth of a channel is typically 20MHz.

[0037] Furthermore, the first node performing a channel access procedure for a set of RBs means that the first node performs a channel access procedure for the channel corresponding to the set of RBs.

[0038] In one embodiment, the first COT shared information includes COT shared information corresponding to one RB set. The second COT shared information includes COT shared information corresponding to X RB sets. In a specific embodiment, such as... Figure 2 As shown, X = 4. According to... Figure 2 RB sets 1-4 correspond to four first COT shared information sets. The first node determines the second COT shared information set based on the four first COT shared information sets 1-4.

[0039] In one embodiment, although the first COT shared information and the second COT shared information may include the same type of information, the values ​​of the information are different. In a special case, both the first COT shared information and the second COT shared information include a Channel Access Priority (CAPC) category, but their CAPC values ​​may be different.

[0040] For example, the first COT shared information corresponding to an RB set determined by the first node is determined based on the PSSCH to be sent or the PSSCH sent by the first node.

[0041] In specific cases, the first COT shared information includes CAPC.

[0042] There is a mapping relationship between PQI (or PPPP) and CAPC. Based on this mapping relationship and PQI (or PPPP), the CAPC value contained in the first COT shared information is determined.

[0043] Here, PPPP represents the priority of each adjacent service message; PQI represents PC5 5QI (5G QoS identifier), QoS (Quality of Service) represents the quality of service, and PC5 is the terminal-to-terminal wireless communication interface.

[0044] In one embodiment, the first node determines the first COT shared information corresponding to the RB set. One of the aforementioned X RB sets is denoted as the first RB set.

[0045] The first node receives M messages from M other nodes. Here, M >= 2. The M messages include M COT shared messages, and the M COT messages include the COT shared messages corresponding to the first RB set.

[0046] To distinguish between the first COT shared information and the second COT shared information mentioned above, the M COT shared information from M nodes are represented as the first target COT shared information, the second target COT shared information, ..., the Mth target COT shared information.

[0047] The first node uses the shared information of the first target COT, the shared information of the second target COT, ..., the shared information of the Mth target COT, and determines the first COT shared information according to the second rule. In special cases, the first node selects M target COT shared information and determines the selected information as the first COT shared information of the first RB set. To express this more clearly, Figure 3 It displays the first COT shared information, the second COT shared information, the first target COT shared information, the second target COT shared information, ... the Mth target COT shared information.

[0048] In specific circumstances, such as Figure 3 As shown, X = 4.

[0049] Figure 3 The figure only shows the target COT shared information of other nodes corresponding to RB set 3 as the first RB set. The target COT shared information of other nodes corresponding to other RB sets is not shown in the figure as another first RB set. Figure 3 The second node is UE2, the third node is UE3, and the fourth node is UE4.

[0050] In one embodiment, the first COT sharing information may include at least one of the following: CAPC value, remaining COT duration, source identifier, destination identifier, RB set number, shared resource usage distance, starting offset of shared COT, and channel access type.

[0051] The CAPC value can also be referred to as the CAPC level. The CAPC value is used by nodes to perform channel access procedures, and the node can indicate the CAPC value it uses to other nodes.

[0052] The remaining COT duration indicates how much time is left to share the COT.

[0053] The source ID is used to indicate the ID of the node that initiated the COT sharing.

[0054] The destination ID is used to indicate which nodes or nodes the shared COT can be shared with, and the destination ID corresponding to the COT sharing can be different from the destination ID corresponding to the PSSCH.

[0055] The destination identifier corresponding to PSSCH is used to indicate which / which nodes PSSCH is sent to.

[0056] The RB set number indicates which RB sets (or channels corresponding to these RB sets) can be shared.

[0057] The shared resource usage distance represents the distance range of nodes that can use the shared COT.

[0058] The starting offset of a shared COT represents the offset time between the time when the COT sharing information is sent and the start time of the shared COT.

[0059] The channel access type indicates which channel access procedure a node using a shared COT needs to perform in order to send information within the shared COT.

[0060] In one embodiment, the second COT sharing information may include at least one of the following: CAPC value, remaining COT duration, source identifier, destination identifier, RB set number, shared resource usage distance, start offset of shared COT, or channel access type.

[0061] Implementation Method 2

[0062] This section discloses instances involving the transmission of COT shared information along with PSSCH on frequency resources covered by COT shared information.

[0063] For example, the first node determines the second COT sharing information by using X first COT sharing information corresponding to X resource block sets (RB sets), and transmits the second COT sharing information and PSSCH for each overlapping RB set in the frequency domain during a time slot. Transmitting a PSSCH covering each X resource block set prevents each X resource block set from being preempted by other nodes.

[0064] In this embodiment, the first node determines and sends out the second COT sharing information. This process may include the first node determining X pieces of first COT sharing information, each corresponding to one of X resource block sets (RB sets), where X is a positive integer greater than 1. The first node can then use these X pieces of first COT sharing information to determine the second COT sharing information according to a first rule. The first node then sends the second COT sharing information. Furthermore, the first node may send a PSSCH, which will overlap with all the aforementioned X RB sets in the frequency domain.

[0065] For example, Figure 2 Specific embodiments of sharing COT sharing information and transmitting PSSCH with X=4 frequency resources are disclosed. Figure 2 The first node determines the second COT sharing information. The first node not only transmits the second COT sharing information in the time slot, but also transmits the PSSCH. Specifically, some RBs in RB set 1 are used to transmit the second COT sharing information, and the frequency domain resources used by the transmitted PSSCH include not only some RBs in RB set 1, but also some RBs in RB set 2, RB set 3, and RB set 4.

[0066] In one embodiment, the first node sends an SCI. The SCI may include control information for instructing PSSCH decoding, and the SCI includes second COT sharing information.

[0067] Implementation Method 3

[0068] This embodiment discloses, in particular, several instances of how a UE can determine first COT shared information based on multiple target COT information received from other UEs according to a determination rule.

[0069] In this embodiment, the first node determines X first COT shared information corresponding to X resource block sets (RB sets). The first COT shared information includes COT shared information corresponding to the RB sets.

[0070] In one embodiment, one of the X sets of RBs is designated as the first RB set. The first node uses the first target COT shared information, the second target COT shared information, ..., the Mth target COT shared information to determine the first COT shared information according to the second rule. Here, M>=2.

[0071] In one embodiment, the first target COT sharing information includes the COT sharing information of the first RB set received from the second node UE2; the second target COT sharing information includes the COT sharing information of the first RB set received from the third node UE3, ..., the Mth target COT sharing information includes the COT sharing information of the first RB set received from the Mth node UEM. For M=3, when the first RB set is RB set 3, the first COT sharing information, the first target COT sharing information, the second target COT sharing information, and the Mth target COT sharing information correspond to RB set 3, such as... Figure 3 As shown, the first node determines the first COT shared information according to the second rule.

[0072] In specific cases, the second rule is that the first node selects from the M target COT shared information and determines the selected information as the first COT shared information of the first RB set.

[0073] In one implementation, one of the X sets of RBs is designated as the first RB set. The first target COT sharing information includes the COT sharing information of the first RB set received from the second node UE2, the second target COT sharing information includes the COT sharing information of the first RB set received from the third node UE3, ..., the Mth target COT sharing information includes the COT sharing information of the first RB set received from the Mth node UE M.

[0074] In one implementation, the aforementioned first target COT sharing information, second target COT sharing information, ..., Mth target COT sharing information includes the first target CAPC value, the second target CAPC value, ..., the Mth target CAPC value.

[0075] According to the second rule, the first node determines the first CAPC value included in the first COT shared information. The second rule can select the first CAPC value as the maximum value from the first target CAPC value, the second target CAPC value, ..., the Mth target CAPC value.

[0076] In another embodiment, the first target COT sharing information, the second target COT sharing information, ..., the Mth target COT sharing information respectively include the remaining COT duration of the first target, the remaining COT duration value of the second target, ..., the remaining COT duration value of the Mth target.

[0077] The first node determines the first remaining COT duration value included in the first COT shared information according to the second rule. In one embodiment, the second rule is that the first remaining COT duration value determined by the first node is the maximum value among the remaining COT duration values ​​of the first target, the remaining COT duration values ​​of the second target, ..., and the remaining COT duration values ​​of the Mth target.

[0078] In one embodiment, the aforementioned first target COT sharing information, second target COT sharing information, ..., Mth target COT sharing information respectively include the first target communication distance, the second target communication distance, ..., the Mth target communication distance.

[0079] The first node determines the first communication distance contained in the first COT shared information according to the second rule. In one embodiment, the second rule can determine the first communication distance as the maximum value among the first target communication distance, the second target communication distance, ... the Mth target communication distance.

[0080] In one embodiment, one RB set from the X RB sets is designated as the second RB set. The first node determines the first CAPC value included in the first COT shared information according to a second rule. In one embodiment, the second rule is that the first CAPC value is determined by the CAPC value corresponding to the first node in the PSSCH to be sent or by the CAPC value sent by the first node.

[0081] The CAPC value is associated with PQI (or PPPP), and there is a mapping relationship between PQI (or PPPP) and the CAPC value.

[0082] The first node determines the CAPC value by mapping the PQI (or PPPP) to the CAPC value and the PQI (or PPPP) associated with the PSSCH to be sent or sent by the node, and uses this CAPC value as the first CAPC value.

[0083] Implementation Method 4

[0084] This implementation discloses, in particular, several embodiments relating to how a UE can determine second COT shared information based on multiple first COT shared information based on determination rules.

[0085] In one implementation, the first node uses X first COT sharing information corresponding to X resource block sets (RB sets) to determine the second COT sharing information according to the first rule; the first node sends the second COT sharing information.

[0086] The second COT shared information may include COT shared information from X RB sets.

[0087] In another embodiment, the second COT shared information includes COT shared information corresponding to X RB sets, wherein the COT shared information refers to the value of specific information included in the second COT shared information, and the value is used for all of the aforementioned X RB sets.

[0088] In special cases, this specific information is the remaining COT duration. The second COT shared information determined by the first node includes the remaining COT duration, and the first node represents the remaining COT duration as the common remaining COT duration set by the aforementioned X RBs by sending the remaining COT duration.

[0089] In another embodiment, the second COT shared information includes COT shared information corresponding to X RB sets, which means that the second COT shared information includes X values ​​of specific information, which are used for the aforementioned X RB sets respectively.

[0090] In special cases, the specific information is the remaining COT duration, and the X value of the specific information corresponds to the X value of the remaining COT duration.

[0091] The second COT shared information determined by the first node includes X remaining COT duration values. The first node sends X remaining COT duration values, which respectively represent the remaining COT duration of X RB sets.

[0092] In the example, the first node determines the second COT shared information according to the first rule. The second COT shared information includes the second CAPC value (CAPC level).

[0093] The first node determines the second CAPC value according to the first rule, which states that the second CAPC value determined by the first node is the minimum value among X first CAPC values. The X first CAPC values ​​are the CAPC values ​​included in the X first COT shared information.

[0094] Figure 4 The special case where X = 4 and the minimum value of the first CAPC is 2 is disclosed.

[0095] In another embodiment, the first node determines second COT sharing information according to a first rule, the second COT sharing information including a second remaining COT duration value. The second remaining COT time is determined by the first node according to the first rule.

[0096] The second rule is that the second remaining COT duration determined by the first node is the minimum value among X first remaining COT duration values. The X first remaining COT durations are the remaining COT duration values ​​contained in the X first COT shared information.

[0097] Figure 5 This is a special case where the minimum duration of the first remaining COT is 4ms when X=4.

[0098] In another embodiment, the first node determines the second COT sharing information according to the first rule, the second COT sharing information including the second communication distance.

[0099] The first node determines the second communication distance according to the first rule. The first rule is that the second communication distance determined by the first node is the minimum value among X first communication distances.

[0100] The X first communication distances are the communication distances contained in the X first COT shared information. Here, the communication distance is the distance that allows the use of the shared COT.

[0101] In one embodiment, the first node determines second COT shared information according to a first rule. The second COT shared information includes X second CAPC values ​​(CAPC levels). The first node determines X second CAPC values ​​according to the first rule, and the second rule is that the X second CAPC values ​​determined by the first node are each equal to X first CAPC values. The X first CAPC values ​​are CAPC values ​​included in the X first COT shared information.

[0102] In another embodiment, the first node determines second COT shared information according to a first rule, the second COT shared information including X second remaining COT times. The first node determines X second remaining COT durations according to the first rule, the first rule being that the X second remaining COT duration values ​​determined by the first node are each equal to X first remaining COT duration values. The X first remaining COT durations are the remaining COT durations included in the X first COT shared information.

[0103] Implementation Method 5

[0104] This implementation discloses in particular an embodiment involving decisions regarding the use of frequency resources based on COT-shared information related to frequency resources.

[0105] In one embodiment, the first node determines X resource block sets (RB sets) that correspond to X first COT shared information, where X is a positive integer greater than 1.

[0106] Frequency resources (e.g., RB sets) can be of different types. For example, X RB sets can include RB sets of type 1 and RB sets of type 2.

[0107] The first type of RB set is a shared RB set among other nodes of the COT, and the second type of RB set is a RB set not shared by other nodes of the COT. The first node performs a type 2 channel access procedure for the first type of RB set, and performs a type 1 channel access procedure for the second type of RB set.

[0108] In Type 1 channel access, a counter N is involved, with an initial value of 0 to a random value ranging from CW. During Type 1 channel access, the first node determines the channel is available only after detecting that the channel is idle N times. Channel availability means that the first node can send sidelink information on the channel.

[0109] The Type 2 channel outcome process includes the Type 2A, Type 2B, and Type 2C channel access processes.

[0110] In the channel access process of type 2A, the first node determines that the channel is available only if the channel detected by the first node has been idle for a period of at least 25µs.

[0111] During the Type 2B channel access process, the first node detects the channel within 16µs, monitors whether the channel is idle for a certain period of time, and then determines that the channel is available.

[0112] During Type 2C channel access, the first node can send sidelink information on the channel without monitoring channel idleness.

[0113] Figure 6 This is a special case that includes X = 4 RB sets. The first type of RB set includes RB set 3, and the second type of RB set includes RB set 1.

[0114] exist Figure 6 In this process, the second node initializes the COT (Combat Overhead) and shares its initialized COT with the first node by sending first target COT sharing information. The first target COT sharing information includes the RB set shared by the second node UE2 and the remaining COT duration, etc. The RB set shared by the second node UE2 includes RB set 3. Similarly, the RB set shared by the third node UE3 and the fourth node UE4 includes RB set 3. Figure 6In the COT shared information (target COT shared information) received by the first node from other nodes, the shared RB set does not include RB set 1. Therefore, RB set 1 belongs to the second type of RB set.

[0115] For RB set 3, which belongs to the first type of RB set, the first node performs the type 2 channel access procedure.

[0116] For RB set 1, which belongs to the second type of RB set, the first node performs the type 1 channel access procedure.

[0117] The first node performs channel access procedures for all X RB sets. The evaluation results of the channel access procedures for the X RB sets show that each channel including one of the X RB sets is available. Then the first node transmits PSSCH that overlaps with all X RB sets in the frequency domain.

[0118] The first node performing a channel access procedure for a set of RBs means that the first node performs a channel access procedure for a channel that includes the set of RBs. In special cases, the bandwidth of the channel including the set of RBs is 20MHz, and some or all of the RBs included in the channel are used as the set of RBs.

[0119] Implementation Method Six

[0120] This embodiment specifically discloses an example of adding certain information from the received COT shared information to the second COT shared information to be sent.

[0121] In this implementation, the first node uses X pieces of first COT shared information according to a first rule to determine the second COT shared information, where X is a positive integer. The X RB sets include a third RB set, and the first COT shared information corresponding to the third RB set includes the first target source ID.

[0122] The first target source ID is the source ID contained in the second target COT shared information sent by the second node and received by the first node. The first node determines that the second source ID belonging to the second COT shared information includes the first target source ID.

[0123] Figure 7 It is a special case of X=1.

[0124] according to Figure 7 The second node UE2 initializes the COT and shares the initialized COT with the first node UE1 by sending the first target COT sharing information to the first node.

[0125] Here, the first target COT sharing information sent by the second node includes a source identifier, which indicates which UE initializes and performs COT sharing. After receiving the first target COT sharing information, the first node determines that the first COT sharing information is the COT sharing information corresponding to the third RB set. The first COT sharing information includes the source ID of the second node UE2. In this special case, the first COT sharing information and the second COT sharing information are the same, and the first node sends the second COT sharing information. In this way, the first node forwards the source ID received from the second node UE2 and notifies other nodes that the second node UE2 initializes the shared COT notified by the first node.

[0126] In one embodiment, the first node determines the second COT shared information using X first COT shared information pieces according to a first rule, where X is a positive integer. The X RB sets include a third RB set, and the first COT shared information corresponding to the third RB set includes a first target destination ID.

[0127] The first target destination ID is the destination ID contained in the second target COT shared information sent by the second node and received by the first node.

[0128] The first node determines the second destination ID, which belongs to the second COT shared information, including the first target destination ID.

[0129] Figure 7 This is a specific case where X = 1. According to... Figure 7 The second node, UE2, initializes the COT and shares the initialized COT with the first node, UE1, and other nodes by sending first target COT sharing information to the first node. The first target COT sharing information sent by the second node includes a destination ID, which indicates which UEs can use the shared COT. Upon receiving the first target COT sharing information, the first node determines that the first COT sharing information corresponds to the COT sharing information of the third RB set. The first COT sharing information includes the destination ID of the second node, UE2. In this special case, the first COT sharing information and the second COT sharing information are the same, and the first node sends the second COT sharing information. Through this method, the first node forwards the destination ID received from the second node, UE2, and notifies other nodes which nodes can use the shared COT.

[0130] Implementation Method Seven

[0131] This implementation discloses an example of a UE's limitation on frequency resources based on received and processed COT information.

[0132] In one embodiment, the first node determines X first COT sharing information corresponding to X resource block sets (RB sets). The first node uses the X first COT sharing information to determine the first COT sharing information according to a first rule. Given two COT sharing information sets, the first node sends the second COT sharing information. In addition to sending the second COT sharing information, the first node may also send a unicast PSSCH, which overlaps in the frequency domain with the X resource block sets (RB sets) within the shared COT determined by the first node. The first node does not send the unicast PSSCH if the following condition is met: one of the X first COT sharing information sets includes the COT sharing information sent by the second node UE2 and other first COT sharing information. This information includes the COT sharing information sent from the third node UE3. One RB set corresponding to the aforementioned first COT sharing information is designated as the fourth RB set, and one RB set corresponding to the other aforementioned first COT sharing information is designated as the fifth RB set.

[0133] Figure 8 This is a special case of X=2. According to... Figure 8 The first node receives first target COT sharing information sent by the second node and second target COT sharing information sent by the third node UE3. The first target COT sharing information is the COT sharing information sent by the second node UE2 for the fourth RB set (RB set 2). The second target COT sharing information is the COT sharing information sent by the third node UE3 for the fifth RB set (RB set 1). The first node uses the received first target COT sharing information as the first COT sharing information for RB set 2 and the received second target COT sharing information as the first COT sharing information for RB set 1. Since the first COT sharing information corresponding to RB set 2 and RB set 1 comes from the first target sharing information and the second target sharing information, respectively, i.e., from the second node UE2 and the third node UE3, respectively, the first node may not transmit a unicast PSSCH that overlaps in the frequency domain with the X resource block sets (RB sets) within the shared COT (coverage type) determined by the first node.

[0134] In one example, the first node sends a PSSCH that overlaps with all X RB sets in the shared COT determined by the first node. One of the conditions for the first node to send the PSSCH is that the values ​​of the X first CAPCs corresponding to the X RB sets are the same. The X first CAPC values ​​belong to the X first COT shared information corresponding to the X RB sets.

[0135] Figure 9An exemplary block diagram of a hardware platform 900, which may be part of a network device (e.g., a base station) or a communication device (e.g., a user equipment (UE)), is shown. The hardware platform 900 includes at least one processor 910 and a memory 905 having instructions stored thereon. When executed by the processor 910, the instructions configure the hardware platform 900 to perform operations on... Figures 1 to 8 The operations described in the different embodiments described herein are neutralized. Transmitter 915 transmits or sends information or data to another device. For example, a network device transmitter can send a message to a user equipment. Receiver 920 receives information or data transmitted or sent by another device. For example, a user equipment can receive a message from a network device.

[0136] The implementation methods discussed above will be applied to network communication. Figure 10 An embodiment of a communication system (e.g., a 5G or NR cellular network) including a base station 1020 and one or more user equipments (UEs) 1011, 1012, and 1013 is illustrated. In some embodiments, the UE accesses the BS (e.g., the network) using a communication link to the network (sometimes referred to as the uplink direction, as depicted by dashed arrows 1031, 1032, and 1033), which then enables subsequent communication from the BS to the UE (e.g., shown in the direction from the network to the UE, sometimes referred to as the downlink direction, as shown by arrows 1041, 1042, and 1043). In some embodiments, the BS sends information to the UE (sometimes referred to as the downlink direction, as depicted by arrows 1041, 1042, and 1043), and then the UE enables subsequent communication from the UE to the BS (e.g., shown in the direction from the UE to the BS, sometimes referred to as the uplink direction, as shown by dashed arrows 1031, 1032, and 1033). UE can be, for example, a smartphone, tablet, mobile computer, machine-to-machine (M2M) device, Internet of Things (IoT) device, etc.

[0137] Figure 11 An exemplary flowchart representation of a method for wireless communication according to one or more embodiments of the present technology is shown. Operation 1102 includes transmitting a signal including second channel occupancy time (COT) sharing information from a first wireless device to a second wireless device, wherein the second COT sharing information is determined according to a first rule and X first channel occupancy time COT sharing information; the X first COT sharing information corresponds to X sets of frequency resources; X is an integer greater than or equal to 2.

[0138] Figure 11 Various preferred embodiments and additional features of the above-described method are as follows. Further embodiments are described with reference to Embodiments 1 to 7.

[0139] In one embodiment, a wireless communication method is disclosed. The method includes transmitting a signal including second channel occupancy time (COT) sharing information from a first wireless device to a second wireless device, wherein the second COT sharing information is determined according to a first rule and X sets of first channel occupancy time (COT) sharing information; the X sets of first COT sharing information correspond to X sets of frequency resources; and X is an integer greater than or equal to 2.

[0140] In another embodiment, another wireless communication method is disclosed. The method includes: a second wireless device receiving from a first wireless device a signal including second channel occupancy time (COT) sharing information; and communicating using the second COT sharing information, wherein the second COT sharing information is determined according to a first rule and X first channel occupancy time COT sharing information; the X first COT sharing information corresponds to X sets of frequency resources; and X is an integer greater than or equal to 1.

[0141] In some implementations, the first wireless device determines each of X first COT shared information based on a second rule and M received channel occupancy time (COT) shared information, wherein the M received COT shared information are sent to the first wireless device from M different wireless devices.

[0142] In some implementations, the second rule differs from the first rule.

[0143] In some implementations, the second rule includes determining the parameter in the first COT shared information as the maximum value among the parameter values ​​of the same type in the M received COT shared information.

[0144] In some implementations, the second rule includes determining the parameters in the first COT sharing information based on the values ​​of parameters of the same type as those generated by the first wireless device.

[0145] In some implementations, the parameter is at least one of the following: 1) Channel Access Priority Class (CAPC), 2) the remaining duration after excluding the elapsed time in the COT duration, and 3) a parameter indicating the use of shared time and / or frequency resources within the maximum distance.

[0146] In some implementations, the first rule includes determining the parameter in the second COT shared information as the minimum value among X parameter values ​​of the same type in the first COT shared information.

[0147] In some implementations, the first rule includes determining the parameters in the second COT shared information as a list of values ​​for X parameters of the same type in the first COT shared information.

[0148] In some implementations, the parameter is at least one of the following: 1) Channel Access Priority Class (CAPC), 2) the remaining duration after excluding the elapsed time in the COT duration, and 3) a parameter indicating the use of shared time and / or frequency resources within the maximum distance.

[0149] In some implementations, the first rule includes adding parameters from M received COT shared information to the second COT shared information.

[0150] In some implementations, the parameter is at least one of the following: 1) at least one source device ID received from another communication device, 2) at least one destination ID received from another communication device, wherein the source ID represents the identity information of the wireless device that initiates the sharing of COT sharing information; and the destination ID represents the identification information of all wireless devices that can use the received COT sharing information to determine available time-frequency resources.

[0151] In some embodiments, the method further includes transmitting information by the first wireless device about at least a portion of each frequency resource in the X set of frequency resources.

[0152] In some implementations, the X set of frequency resources includes X1 set of frequency resources and X2 set of frequency resources, wherein the first wireless device performs a type 1 channel access procedure for each X1 set of resources before transmitting on each X1 set of resources, and wherein the first wireless device performs a type 2 channel access procedure for each X2 set of resources before transmitting on each X2 set of resources.

[0153] In some implementations, when it is determined that all X first COT shared messages contain information from the same wireless device among M received COT shared messages sent from M different wireless devices, the first wireless device transmits to a single wireless device on at least a portion of each X set of frequency resources.

[0154] In some implementations, the method further includes: when it is determined that the parameter values ​​in the X first COT shared information are not equal, not transmitting on all X sets of frequency resources.

[0155] It should be understood that this document discloses methods and apparatus related to processing and transmitting COT information received from other UEs in a direct-link communication system. Direct-link communication saves radio spectrum resources, reduces data transmission pressure on the core network, reduces system resource consumption, improves the spectrum efficiency of cellular communication systems, and reduces communication latency. Direct-link communication also significantly reduces network operating costs. In direct-link communication, one way to select resources is through a contention-based resource selection method, which can be achieved through COT information sharing. However, there is a lack of research and studies on COT information processing and sharing technologies and systems. This document discloses various solutions regarding how UEs process received COT information. This application also discloses methods and schemes involving transmitting processed COT shared information while transmitting on frequency resources covered by COT shared information. This application discloses and proposes methods that improve communication efficiency in direct-link communication systems due to at least less overhead and better spectrum utilization.

[0156] The disclosures and other embodiments, modules, and functional operations described in this document can be implemented in digital electronic circuits, or in computer software, firmware, or hardware (including the structures disclosed in this document and their structural equivalents), or in a combination of one or more of them. The disclosed and other embodiments can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer-readable medium for execution by or control of the operation of a data processing apparatus. The computer-readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a material component affecting machine-readable propagation signals, or a combination of one or more of them. The term "data processing apparatus" includes all means, devices, and machines for processing data, including, for example, a programmable processor, a computer, or multiple processors or computers. In addition to hardware, the apparatus may include code that creates an execution environment for the computer program in question, for example, code constituting processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them. Propagation signals are artificially generated signals, such as machine-generated electrical, optical, or electromagnetic signals, which are generated to encode information for transmission to a suitable receiver device.

[0157] A computer program (also called a program, software, software application, script, or code) can be written in any programming language, including compiled or interpreted languages, and can be deployed in any form, including as a standalone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored as a part of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), a single file dedicated to the program in question, or one or more coordinating files (e.g., a file that stores one or more modules, subroutines, or multiple parts of code). A computer program can be deployed to execute on or on computers located at a site or distributed across multiple sites and interconnected via a communications network.

[0158] The processes and logic flows described herein can be executed by one or more programmable processors, which execute one or more computer programs to perform functions by manipulating input data and generating outputs. The processes and logic flows can also be executed by special-purpose logic circuitry (e.g., FPGAs (Field-Programmable Gate Arrays) or ASICs (Application-Specific Integrated Circuits)), and the devices can also be implemented as special-purpose logic circuitry.

[0159] For example, processors suitable for executing computer programs include general-purpose and special-purpose microprocessors, as well as any one or more processors in any kind of digital computer. Typically, the processor receives instructions and data from read-only memory or random access memory, or both. The basic components of a computer are a processor for executing instructions and one or more memory devices for storing instructions and data. Typically, a computer will also include one or more mass storage devices (e.g., magnetic disks, magneto-optical disks, or optical disks) operatively coupled to receive data from or transfer data to, or both. However, a computer does not need to have such devices. Computer-readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media, and memory devices, including, for example, semiconductor memory devices such as EPROM, EEPROM, and flash memory devices; magnetic disks, such as internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and memory may be supplemented or incorporated therein by dedicated logic circuitry.

[0160] While this document contains numerous details, these details should not be construed as limiting the scope of the claimed invention, but rather as descriptions of features of particular embodiments. Some features described in the context of individual embodiments in this document may also be implemented in combination in a single embodiment. Conversely, various features described in the context of a single embodiment may also be implemented individually or in any suitable sub-combination in multiple embodiments. Furthermore, while features may be described above as functioning in certain combinations and even initially claimed in this way, in some cases, one or more features from the claimed combination may be removed from the combination, and the claimed combination may involve sub-combinations or variations thereof. Similarly, although operations are depicted in a specific order in the drawings, this should not be construed as requiring the operations to be performed in the specific order shown or sequentially, or requiring the performance of all shown operations to achieve the desired result.

[0161] Only some embodiments and implementations are disclosed. Based on the disclosed content, changes, modifications, and enhancements can be made to the described embodiments and implementations, as well as other implementations.

Claims

1. A method of digital communication, comprising: The first wireless device sends a signal to the second wireless device, including the second channel occupancy time (COT) sharing information. The second COT shared information is determined based on the first rule and X first channel occupancy time COT shared information. Among them, the X first COT shared information pieces correspond to X sets of frequency resources. Where X is an integer greater than or equal to 2; The first wireless device determines each of the X first COT sharing information based on the second rule and M received channel occupancy time (COT) sharing information, wherein the M received COT sharing information are sent to the first wireless device from M different wireless devices.

2. The method according to claim 1, wherein the second rule is different from the first rule.

3. The method according to claim 1, wherein, The second rule includes determining the maximum value among the values ​​of parameters of the same type in the M received COT shared information as the parameter in the first COT shared information.

4. The method according to claim 1, wherein, The second rule includes determining the parameters in the first COT sharing information based on the values ​​of parameters of the same type generated by the first wireless device.

5. The method according to claim 3 or 4, wherein, The parameter is at least one of the following: 1) Channel Access Priority Class (CAPC), 2) Remaining duration after excluding the elapsed time in the COT duration, and 3) Parameter indicating the use of shared time and / or frequency resources within the maximum distance.

6. The method according to claim 1, wherein, The first rule includes determining that the parameter in the second COT shared information is the minimum value among the parameter values ​​of the same type in the X first COT shared information.

7. The method according to claim 1, wherein, The first rule includes determining the parameters in the second COT shared information as a list of values ​​for parameters of the same type in the X first COT shared information.

8. The method according to claim 6 or 7, wherein, The parameter is at least one of the following: 1) Channel Access Priority Class (CAPC), 2) Remaining duration after excluding the elapsed time in the COT duration, and 3) Parameter indicating the use of shared time and / or frequency resources within the maximum distance.

9. The method according to claim 1, wherein, The first rule includes adding parameters from the received M COT shared information to the second COT shared information.

10. The method according to claim 9, wherein, The parameter is at least one of the following: 1) at least one source ID received from another communication device, 2) at least one destination ID received from another communication device; The source ID represents the identity information of the wireless device that begins sharing COT shared information. The destination ID represents the identification information of all wireless devices used to determine available time-frequency resources using the received COT shared information.

11. The method of claim 1, further comprising the first wireless device transmitting information about at least a portion of each of the X sets of frequency resources.

12. The method according to claim 2, wherein, The X set of frequency resources includes X1 set of frequency resources and X2 set of frequency resources. Before transmitting on each X1 set of resources, the first wireless device performs a type 1 channel access procedure for each X1 set of resources. Before transmitting on each X2 set of resources, the first wireless device performs a type 2 channel access procedure for each X2 set of resources.

13. The method according to claim 12, wherein, When it is determined that all X first COT shared messages contain information from the same wireless device among M received COT shared messages sent by M different wireless devices, the first wireless device transmits to a single wireless device on at least a portion of each of the X sets of frequency resources.

14. The method of claim 12, further comprising: When it is determined that the parameter values ​​in the X first COT shared information are not equal, transmission will not be performed on all X sets of frequency resources.

15. An apparatus for a communication network, comprising: A processor configured to implement the method of any one of claims 1 to 14.

16. A computer-readable storage medium having code stored thereon, said code causing the processor, when executed by a processor, to perform the method of any one of claims 1 to 14.

Images