Channel occupancy time sharing and handling in direct link communication systems

Abstract

Methods, apparatuses, and systems relating to processing and transmitting COT information received from other UEs in a direct link communication system. In one example aspect, a method of wireless communication includes a first wireless device transmitting a signal including second channel occupancy time (COT) sharing information to a second wireless device, where the second COT sharing information is determined based on a first rule and X first channel occupancy time (COT) sharing information; the X pieces of first COT shared information correspond to X sets of frequency resources; x is an integer greater than or equal to 2.

Description

Technical Field

[0001] This article relates to wireless communications. Background Art

[0002] Mobile communication technologies are moving the world towards 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 features and provide a more complex and sophisticated range of access requirements and flexibility.

[0003] Long Term Evolution (LTE) is a standard for wireless communications for mobile devices and data terminals developed by the 3rd Generation Partnership Project (3GPP). LTE-Advanced (LTE-A) is a wireless communications standard that enhances the LTE standard. The 5th generation wireless system, called 5G, advances the LTE and LTE-A wireless standards and is committed to supporting higher data rates, a large number of connections, ultra-low latency, high reliability, and other emerging business needs. Summary of the invention

[0004] Disclosed herein is a technology for a UE to process and transmit COT information received from other UEs in a direct link communication system.

[0005] In one embodiment, a wireless communication method is disclosed. The method includes a first wireless device sending a signal including second channel occupancy time (COT) sharing information 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; and X is an integer greater than or equal to 2.

[0006]

[0013] In yet another embodiment aspect, a wireless communication device is disclosed that includes a process configured or operable to perform the above method.

[0007] In yet another embodiment, a computer-readable storage medium is disclosed. The computer-readable storage medium stores code that, when executed by a processor, causes the processor to implement the above method. BRIEF DESCRIPTION OF THE DRAWINGS

[0008] Figure 1 A flow chart showing an example of processing COT shared information.

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

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

[0011] Figure 4 An example diagram showing how second COT shared information is determined based on first COT shared information.

[0012] Figure 5 Another example diagram showing how to determine the second COT shared information based on the first COT shared information.

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

[0014] Figure 7 An example diagram showing how the second COT shared information is determined based on the first rule.

[0015] Figure 8 An example diagram showing determination of transmission on frequency resources based on first COT sharing information.

[0016] Fig. 9 An exemplary block diagram illustrating a hardware platform of a portion of a network device or communication apparatus.

[0017] Fig.10 An embodiment of network communication including a base station (BS) and a user equipment (UE) based on some implementations of the disclosed technology is shown.

[0018] Fig.11 A flowchart showing a wireless communication method according to one or more embodiments of the present technology. DETAILED DESCRIPTION

[0019] The headings of the following sections are used to facilitate understanding of the disclosed subject matter and do not limit the scope of the claimed subject matter in any way. Therefore, one or more features of one section may be combined with one or more features of another section. In addition, for clarity of explanation, 5G terminology is used, however, the technology disclosed in this article is not limited to 5G technology and can be used in wireless systems implementing other protocols.

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

[0021] In a direct link communication system, when there is a service to be transmitted between user equipments (UEs), the service between UEs does not need to pass 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 different characteristics from the communication mode of the traditional cellular system.

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

[0023] For short-distance communication users who access Sidelink communication, Sidelink communication not only saves wireless spectrum resources, but also reduces the data transmission pressure of the core network, which can reduce the occupation of system resources, improve the spectrum efficiency of the cellular communication system, and reduce communication delay. Direct link communication also saves network operation costs to a great extent.

[0024] Current direct 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 the existing sidelink, a time slot may contain some sidelink channels. The sidelink channels include a sidelink control channel PSCCH (physical sidelink control channel), a sidelink shared channel PSSCH (physical sidelink shared channel) and a sidelink feedback channel PSFCH (physical sidelink feedback channel). In addition, a time slot also includes an OFDM symbol, wherein the sidelink channel is not transmitted in the entire symbol.

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

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

[0028] Accordingly, another way to select resources is a resource selection method based on competition. In the resource selection method based on competition, the device can select resources by monitoring the use of resources within the resource pool and the monitoring results to autonomously send signaling / data in the resource pool. The resource selection method based on competition can also be called a terminal autonomous resource selection method.

[0029] On unlicensed spectrum, only channels that successfully complete the listen-before-talk (LBT) process can be used to transmit information. The LBT scheme means that a communication node must compete with other communication nodes to use transmission resources. Only when the competition for time-frequency resources is successful can a communication node transmit information on the time-frequency resources. More specifically, under the LBT mechanism, a communication node performs a channel access process (monitors whether the channel is idle) before information transmission, and the communication node can transmit information only when the channel is idle. The above-mentioned LBT mechanism is a typical channel access mechanism, and the terminal can perform channel access processes such as LBT and channel occupancy after monitoring that the channel is idle.

[0030] However, COT information processing and sharing techniques and systems require more exploration and research. The present application discloses a variety of solutions on how a UE processes received COT information. The present application also discloses methods and schemes for sending processed COT shared information while transmitting time and / or frequency resources covered by the COT shared information. The present application discloses and proposes methods for improving communication efficiency in a direct link communication system due to at least less overhead and better spectrum utilization.

[0031] Implementation Method 1

[0032] In particular, this section discloses embodiments of processing received COT information and generating COT sharing information to be sent in a direct link communication system.

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

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

[0035] Here, each of the X resource block sets (RB sets) includes a plurality of RBs included in one channel. The first node performs channel access processing on the channel as a frequency domain unit. It is assumed that the evaluation result of the channel access process is that the channel is available. In this case, the strength of the interference signal on the channel is not large, and the first node may consider using the channel to send side link information.

[0036] Here, the bandwidth of one channel is usually 20 MHz.

[0037] In addition, the first node performing the channel access procedure for one RB set means that the first node performs the channel access procedure for a channel corresponding to the RB set.

[0038] In one embodiment, the first COT sharing information includes COT sharing information corresponding to one RB set. The second COT sharing information includes COT sharing information corresponding to X RB sets. In a specific embodiment, Figure 2 As shown, X = 4. Figure 2 , RB sets 1-4 correspond to four pieces of first COT shared information respectively. The first node determines the second COT shared information according to the four pieces of first COT shared information corresponding to RB 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, the first COT shared information and the second COT shared information both include a channel access priority category (CAPC), but the CAPC values ​​of the two may be different.

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

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

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

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

[0044] In one embodiment, the first node determines the first COT sharing information corresponding to the RB set. One RB set among the X RB sets is recorded as the first RB set.

[0045] The first node receives M information sent by M other nodes. Here, M>=2. The M information includes M COT shared information, and the M COT information includes COT shared information corresponding to the first RB set.

[0046] In order to distinguish the first COT shared information from the second COT shared information, the M COT shared information from the 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 first target COT shared information, the second target COT shared information, ... the Mth target COT shared information, 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. In order to express more clearly, Figure 3 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 are displayed.

[0048] In certain cases, such as Figure 3 As shown, X=4.

[0049] Figure 3 Only the target COT sharing information of other nodes corresponding to RB set 3 is shown as the first RB set, and the target COT sharing 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 information: CAPC value, remaining COT duration, source identification number, destination identification number, RB set number, shared resource usage distance, starting offset of shared COT, and channel access type.

[0051] The CAPC value may also be referred to as a CAPC level. The CAPC value is used by a node to perform a channel access procedure, and the node may indicate to other nodes the CAPC value it is using.

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

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

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

[0055] The destination identification number corresponding to the PSSCH is used to indicate to which node(s) the PSSCH is sent.

[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 start offset of the shared COT indicates 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 the shared COT needs to perform to send information within the shared COT.

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

[0061] Implementation Method 2

[0062] This section discloses an example involving sending COT shared information together with PSSCH on frequency resources covered by the COT shared information.

[0063] For example, the first node determines the second COT shared information by using X first COT shared information corresponding to X resource block sets (RB sets), and transmits the second COT shared information and a PSSCH overlapped with each of the X RB sets in the frequency domain in a time slot. Sending one PSSCH covering each X resource block set can prevent each X resource block set from being preempted by other nodes.

[0064] In this embodiment, the first node determines and sends the second COT shared information. The process may include the first node determining X first COT shared information, which corresponds to X resource block sets (RB sets), where X is a positive integer greater than 1. The first node can determine the second COT shared information using the X first COT shared information according to the first rule. The first node sends the second COT shared information. In addition, the first node can send a PSSCH, which will overlap with all the above X RB sets in the frequency domain.

[0065] For example, Figure 2 A specific embodiment of sharing COT sharing information and transmitting a PSSCH with X=4 frequency resources is disclosed. Figure 2 , the first node determines the second COT shared information. The first node not only sends the second COT shared information in the time slot, but also sends PSSCH. Among them, some RBs in RB set 1 are used to send the second COT shared information, and the frequency domain resources used by the sent PSSCH include not only some RBs in RB set 1, but also some RBs in RB set 2, some RBs in RB set 3, and some RBs in RB set 4.

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

[0067] Implementation Method 3

[0068] This embodiment particularly discloses multiple examples involving how a UE can determine first COT shared information according to multiple target COT information received from other UEs based on a decision rule.

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

[0070] In one embodiment, one of the X RB sets is recorded as the first RB set. The first node uses the first target COT sharing information, the second target COT sharing information, ... the Mth target COT sharing information to determine the first COT sharing 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 a specific case, 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 embodiment, one RB set among the X RB sets is marked 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 embodiment, the first target COT sharing information, the second target COT sharing information, ... the Mth target COT sharing information include a first target CAPC value, a 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 may 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 sharing information according to the second rule. In one embodiment, the first remaining COT duration value determined by the second rule for the first node is the maximum value among the remaining COT duration value of the first target, the remaining COT duration value of the second target, ..., the remaining COT duration value of the Mth target.

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

[0079] The first node determines the first communication distance included in the first COT shared information according to the second rule. In one embodiment, the second rule may determine the first communication distance to be 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 among the X RB sets is recorded as the second RB set. The first node determines the first CAPC value included in the first COT shared information according to the 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 of the PSSCH to be sent or the CAPC value sent by the first node.

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

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

[0083] Implementation Method 4

[0084] This embodiment particularly discloses multiple embodiments involving how the UE can determine the second COT shared information based on multiple first COT shared information based on a decision rule.

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

[0086] The second COT sharing information may include COT sharing information of X RB sets.

[0087] In another embodiment, the second COT shared information includes COT shared information corresponding to X RB sets, 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 above X RB sets.

[0088] In a special case, the 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 indicates the remaining COT duration as the common remaining COT duration set by the above 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, and the X values ​​are respectively used for the above X RB sets.

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

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

[0092] In an example, the first node determines second COT sharing information according to a first rule, the second COT sharing information including a second CAPC value (CAPC level).

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

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

[0095] In another embodiment, the first node determines the second COT sharing information according to the first rule, and the second COT sharing information includes a second remaining COT duration value. The first node determines the second remaining COT time 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 of the X first remaining COT duration values. The X first remaining COT duration values ​​are the remaining COT duration values ​​included in the X first COT sharing information.

[0097] Figure 5 It is a special case that X=4 that the minimum value of the first remaining COT duration is 4 ms.

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

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

[0100] The X first communication distances are communication distances included in the X first COT sharing information. The communication distance here is a distance that allows the use of the shared COT.

[0101] In one embodiment, the first node determines the second COT shared information according to the first rule, and the second COT shared information includes X second CAPC values ​​(CAPC levels). The first node determines the 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 respectively equal to the X first CAPC values. The X first CAPC values ​​are the CAPC values ​​included in the X first COT shared information.

[0102] In another embodiment, the first node determines the second COT sharing information according to the first rule, and the second COT sharing information includes X second remaining COT times. The first node determines the X second remaining COT durations according to the first rule, and the first rule is that the X second remaining COT duration values ​​determined by the first node are respectively equal to the X first remaining COT duration values. The X first remaining COT durations are the remaining COT durations included in the X first COT sharing information.

[0103] Implementation Method 5

[0104] In particular, the embodiment discloses an embodiment involving a decision on using frequency resources based on COT sharing information related to the frequency resources.

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

[0106] The frequency resources (eg, RB sets) may be of different types. For example, the X RB sets may include a first type of RB set and a second type of RB set.

[0107] The first type RB set is a RB set shared by other nodes of the COT, and the second type 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 RB set, and the first node performs a type 1 channel access procedure for the second type RB set.

[0108] In the channel access process of type 1, a counter N is involved, and the initial value of the counter N is a random value from 0 to the CW value. In the channel access process of type 1, the first node determines that the channel is available only after detecting that the channel is idle for N times. The channel is available means that the first node can send side link information on the channel.

[0109] Type 2 channel access procedures include Type 2A, Type 2B and Type 2C channel access procedures.

[0110] In the channel access process of type 2A, the first node determines that the channel is available only when the channel detected by the first node is idle for a certain period of time in at least 25 us.

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

[0112] In the type 2C channel access procedure, the first node may send sidelink information on the channel without monitoring the channel for idleness.

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

[0114] exist Figure 6 In the example, the second node initializes the COT, and the second node shares its initialized COT with the first node by sending the 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 includes RB set 3, and the RB set shared by the fourth node UE4 includes RB set 3. Figure 6In the example, the shared RB sets included in the COT sharing information (target COT sharing information) received by the first node from other nodes do not include RB set 1. Therefore, RB set 1 belongs to the second type RB set.

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

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

[0117] The first node performs a channel access process on all X RB sets. If an evaluation result of the channel access process on the X RB sets indicates that each channel including one of the X RB sets is available, the first node sends a PSSCH overlapping with all X RB sets in the frequency domain.

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

[0119] Implementation Method 6

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

[0121] In an embodiment, the first node determines the second COT shared information using X first COT shared information according to the 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 the first target source ID.

[0122] The first target source ID is a source ID included 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 identification number, and the source identification number is used to indicate which UE initializes and performs COT sharing. After receiving the first target COT sharing information, the first node determines the first COT sharing information, and the first COT sharing information is the determined 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 the above manner, 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 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 the first target destination ID.

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

[0128] The first node determines that the second destination ID belonging to the second COT shared information includes the first target destination ID.

[0129] Figure 7 is a special case of X = 1. Figure 7 , the second node UE2 initializes the COT and shares the initialized COT with the first node UE1 and other nodes by sending the first target COT sharing information to the first node. The first target COT sharing information sent by the second node includes a destination ID, and the destination ID is used to indicate which UEs can use the shared COT. After receiving the first target COT sharing information, the first node determines the first COT sharing information, and the first COT sharing information is the COT sharing information corresponding to 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. In the above manner, 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 7

[0131] This embodiment discloses an example involving restriction of UEs transmitting on frequency resources based on received and processed COT information.

[0132] In one embodiment, the first node determines X first COT shared information corresponding to X resource block sets (RB sets) respectively. The first node determines the first COT shared information using the X first COT shared information according to the first rule. Two COT shared information, the first node sends the second COT shared information. In addition to sending the second COT shared information, the first node can also send a unicast PSSCH, which overlaps with the frequency domain of the X resource block sets (RB sets) within the shared COT determined by the first node. If the following conditions are met, the first node does not send a unicast PSSCH: Among the X first COT shared information, one of the first COT shared information includes the COT shared information sent by the second node UE2 and other first COT shared information. The information includes COT shared information sent from the third node UE3. An RB set corresponding to the above-mentioned first COT shared information is recorded as the fourth RB set, and an RB set corresponding to the above-mentioned other first COT shared information is recorded as the fifth RB set.

[0133] Figure 8 It is a special case of X = 2. According to Figure 8 , the first node receives the first target COT shared information sent by the second node and receives the second target COT shared information sent by the third node UE3. The first target COT shared information is the COT shared information sent by the second node UE2 for the fourth RB set (RB set 2). The second target COT shared information is the COT shared information sent by the third node UE3 for the fifth RB set (RB set 1). The first node uses the received first target COT shared information as the first COT shared information of RB set 2, and uses the received second target COT shared information as the first COT shared information of RB set 1. Since the first COT shared information corresponding to RB set 2 and RB set 1 come from the first target shared information and the second target shared information, respectively, that is, from the second node UE2 and the third node UE3, respectively. Therefore, the first node may not transmit a unicast PSSCH that overlaps the frequency domain of 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 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 includes: 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, respectively.

[0135] Fig. 9An exemplary block diagram of a hardware platform 900 that may be part of a network device (e.g., a base station) or a communication apparatus (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. The instructions, when executed by the processor 910, configure the hardware platform 900 to execute in Figures 1 to 8 The operations described in the different embodiments described in this document. Transmitter 915 transmits or sends information or data to another device. For example, a network device transmitter can send a message to a user device. Receiver 920 receives information or data transmitted or sent by another device. For example, a user device can receive a message from a network device.

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

[0137] Fig.11 An exemplary flow chart representation of a method for wireless communication according to one or more embodiments of the present technology is shown. Operation 1102 includes sending, by a first wireless device, a signal including second channel occupancy time (COT) sharing information 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] Fig.11 Various preferred embodiments and additional features of the above 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 sending, by a first wireless device, a signal including second channel occupancy time (COT) sharing information 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; 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 receives a signal including second channel occupancy time (COT) sharing information from a first wireless device; 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 embodiments, each of the X first COT shared information is determined by the first wireless apparatus based on a second rule and M received channel occupancy time (COT) shared information, wherein the M received COT shared information is sent to the first wireless apparatus from M different wireless devices.

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

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

[0144] In some embodiments, the second rule includes determining a parameter in the first COT shared information based on a value of a parameter of the same type of the COT shared information generated by the first wireless device.

[0145] In some embodiments, the parameter is at least one of: 1) a channel access priority class (CAPC), 2) a remaining duration after excluding an elapsed time in a COT duration, 3) a parameter indicating use of shared time and / or frequency resources within a maximum distance;

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

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

[0148] In some embodiments, the parameter is at least one of: 1) a channel access priority class (CAPC), 2) a remaining duration after excluding an elapsed time in a COT duration, 3) a parameter indicating use of shared time and / or frequency resources within a maximum distance.

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

[0150] In some embodiments, 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 sharing of COT shared information; and the destination ID represents the identification information used to determine all wireless devices that can use the received COT shared information to determine available time-frequency resources.

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

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

[0153] In some implementations, upon determining that all X first COT shared information include information from the same wireless device among the M received COT shared information sent by M different wireless devices, the first wireless device transmits to the single wireless device on at least a portion of each of the X sets of frequency resources.

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

[0155] It should be understood that this article discloses methods and devices related to processing and transmitting COT information received from other UEs in a direct link communication system. Direct link communication not only saves wireless spectrum resources, but also reduces the data transmission pressure of the core network, can reduce the occupation of system resources, improve the spectrum efficiency of the cellular communication system, and reduce communication delay. Direct link communication also saves network operating costs to a large extent. In direct link communication, one way to select resources is a resource selection method based on competition, which can be achieved through COT information sharing. However, there is almost no research and research on COT information processing and sharing technology and systems. This article discloses a variety of solutions on how UE processes received COT information. The present application also discloses methods and schemes involving sending processed COT shared information while transmitting on frequency resources covered by COT shared information. The present application discloses and proposes a method that will improve communication efficiency in a direct link communication system due to at least less overhead and better spectrum utilization.

[0156] The disclosed and other embodiments, modules and functional operations described in this document may 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 may 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 a data processing device or for controlling the operation of the data processing device. The computer-readable medium may be a machine-readable storage device, a machine-readable storage substrate, a memory device, a material component that affects a machine-readable propagation signal, or a combination of one or more of them. The term "data processing device" includes all devices, equipment and machines for processing data, including, for example, a programmable processor, a computer or multiple processors or computers. In addition to hardware, the device may include code that creates an execution environment for the computer program in question, for example, code that constitutes a processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them. A propagation signal is an artificially generated signal, for example, a machine-generated electrical, optical or electromagnetic signal, which is generated to encode information for transmission to a suitable receiver device.

[0157] A computer program (also referred to as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone 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 may be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, in one or more coordinated files (e.g., files storing one or more modules, subroutines, or multiple portions of code). A computer program may be deployed to execute on a computer or multiple computers located at a site or distributed across multiple sites and interconnected by a communication network.

[0158] The processes and logic flows described herein may be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows may also be performed by, and the apparatus may also be implemented as, a special purpose logic circuit (e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit)).

[0159] For example, processors suitable for executing computer programs include general and special purpose microprocessors and any one or more processors of any kind of digital computer. Typically, the processor will receive instructions and data from a read-only memory or a random access memory or both. The basic elements 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 large-capacity storage devices (e.g., magnetic disks, magneto-optical disks, or optical disks) for storing data or operably coupled to receive data from it or transmit data to it or both. However, a computer need not have such a device. 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 CDROM and DVD-ROM disks. The processor and memory can be supplemented by or incorporated into a dedicated logic circuit.

[0160] Although many details are included herein, these details should not be interpreted as limitations on the scope of the claimed invention or the scope of the claimed invention, but rather as descriptions of the features of a particular embodiment. Certain features described in the context of a separate embodiment in this document may also be implemented in a single embodiment in combination. On the contrary, the various features described in the context of a single embodiment may also be implemented in multiple embodiments individually or in any suitable sub-combination. In addition, although features may be described above as working in certain combinations and even initially claimed, in some cases, one or more features from the claimed combination may be removed from the combination, and the claimed combination may involve a sub-combination or a variant of a sub-combination. Similarly, although operations are depicted in a particular order in the accompanying drawings, this should not be understood as requiring such operations to be performed in the particular order shown or in order, or requiring all operations shown to be performed to achieve the desired result.

[0161] Only some embodiments and implementations are disclosed. Based on what is disclosed, changes, modifications and enhancements may be made to the described embodiments and implementations and other implementations.

Claims

1. A method of digital communication, comprising: The first wireless device sends a signal including second channel occupancy time (COT) sharing information to the second wireless device, The second COT sharing information is determined based on the first rule and X first channel occupation time (COT) sharing information, The X first COT shared information corresponds to X sets of frequency resources. Wherein, X is an integer greater than or equal to 2.

2. The method according to claim 1, wherein: The first wireless device determines each of the X first channel occupancy time (COT) shared information based on a second rule and M received COT shared information, wherein the M received COT shared information are sent to the first wireless device from M different wireless devices. The method of claim 2 , wherein the second rule is different from the first rule.

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

5. The method according to claim 2, wherein: The second rule includes determining a parameter in the first COT shared information based on a value of a parameter of the same type as the COT shared information generated by the first wireless device.

6. The method according to claim 4 or 5, wherein: The parameter is at least one of: 1) a channel access priority class (CAPC), 2) a remaining duration excluding an elapsed time in a COT duration, 3) a parameter indicating use of shared time and / or frequency resources within a maximum distance.

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

8. 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 ​​of the same type of parameters in the X first COT shared information.

9. The method according to claim 7 or 8, wherein: The parameter is at least one of: 1) a channel access priority class (CAPC), 2) a remaining duration excluding an elapsed time in a COT duration, 3) a parameter indicating use of shared time and / or frequency resources within a maximum distance.

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

11. The method according to claim 10, wherein: The parameter is at least one of: 1) at least one source device 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 starts to share the COT shared information. The destination ID represents identification information of all wireless devices that use the received COT sharing information to determine available time-frequency resources.

12. The method of claim 1, further comprising transmitting, by the first wireless device, information regarding at least a portion of each frequency resource in the X set of frequency resources.

13. The method according to claim 3, wherein: The X set frequency resources include X1 set frequency resources and X2 set frequency resources, wherein the first wireless device performs a type 1 channel access procedure on each X1 set resource before transmitting on each X1 set resource, and wherein the first wireless device performs a type 2 channel access procedure on each X2 set resource before transmitting on each X2 set resource.

14. The method according to claim 13, wherein: Upon determining that all of the X first COT shared information include information from the same wireless device among the M received COT shared information 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.

15. The method according to claim 13, further comprising: When it is determined that the parameter values ​​in the X first COT sharing information are not equal, they are not sent on all the X sets of frequency resources.

16. A communication network device, comprising: A processor, the processor being configured to implement the method according to any one of claims 1 to 15.

17. A computer-readable storage medium having stored thereon codes which, when executed by a processor, cause the processor to implement the method of any one of claims 1 to 15.

Images