EP4559217A1

EP4559217A1 - Channel occupancy time sharing and processing in sidelink communication systems

Info

Publication number: EP4559217A1
Application number: EP22964045.3A
Authority: EP
Inventors: Haigang HE; Youxiong Lu; Weimin XING; Jie Chen
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2022-11-04
Filing date: 2022-11-04
Publication date: 2025-05-28
Also published as: WO2024092738A1; CN119769122A; EP4559217A4

Abstract

Methods, apparatus, and systems that relate to process and transfer the COT information received from other UEs in sidelink communication systems. In one example aspect, a method for wireless communication includes transmitting, by a first wireless device to a second wireless device, a signal including a second channel occupancy time (COT) shared information, wherein the second COT shared information is determined based on a first rule and X first channel occupancy time (COT) shared information, wherein the X first COT shared information correspond to X sets of frequency resources, wherein X is an integer larger or equals to 2.

Description

CHANNEL OCCUPANCY TIME SHARING AND PROCESSING IN SIDELINK COMMUNICATION SYSTEMS

TECHNICAL FIELD

This patent document is related to wireless communication.

BACKGROUND

Mobile telecommunication technologies are moving the world toward an increasingly connected and networked society. In comparison with the existing wireless networks, next generation systems and communication techniques will need to support a much wider range of use-case characteristics and provide a more complex and sophisticated range of access requirements and flexibilities.
Long-Term Evolution (LTE) is a standard for wireless communication for mobile devices and data terminals developed by 3rd Generation Partnership Project (3GPP) . LTE Advanced (LTE-A) is a wireless communication standard that enhances the LTE standard. The 5th generation of wireless system, known as 5G, advances the LTE and LTE-Awireless standards and is committed to supporting higher data-rates, large number of connections, ultra-low latency, high reliability and other emerging business needs.
SUMMARY
This patent document discloses techniques, among other things, for a UE to process and transfer the COT information received from other UEs in sidelink communication systems.
In one example aspect, wireless communication method is disclosed. The method includes transmitting, by a first wireless device to a second wireless device, a signal including a second channel occupancy time (COT) shared information, wherein the second COT shared information is determined based on a first rule and X first channel occupancy time (COT) shared information, wherein the X first COT shared information correspond to X sets of frequency resources, wherein X is an integer larger or equals to 2.
In yet another example aspect, a wireless communication device comprising a process that is configured or operable to perform the above-described methods is disclosed.
In yet another example aspect, a computer readable storage medium is disclosed. The computer-readable storage medium stores code that, upon execution by a processor, causes the processor to implement an above-described method.
BRIEF DESCRIPTION OF THE DRAWING
FIG. 1 shows a flow chart of an example of processing COT shared information.
FIG. 2 shows a diagram of an example of a correspondence relationship between the first COT shared information and the second COT shared information.
FIG. 3 shows a diagram of an example of correspondence relationship among the first COT shared information, the second COT shared information, and the target COT shared information received from other UEs.
FIG. 4 shows a diagram of an example of determining the second COT shared information based on the first COT shared information.
FIG. 5 shows a diagram of another example of determining the second COT shared information based on the first COT shared information.
FIG. 6 shows a diagram of an example of determining the first COT shared information and the second COT shared information based on a second rule and a first rule.
FIG. 7 shows a diagram of an example of determining the second COT shared information based on a first rule.
FIG. 8 shows a diagram of an example of determining a transmission on frequency resources based on the first COT shared information.
FIG. 9 shows an exemplary block diagram of a hardware platform that may be a part of a network device or a communication device.
FIG. 10 shows an example of network communication including a base station (BS) and user equipment (UE) based on some implementations of the disclosed technology.
FIG. 11 is a flowchart representation of a method for wireless communication in accordance with one or more embodiments of the present technology.

DETAILED DESCRIPTION

Headings for the various sections below are used to facilitate the understanding of the disclosed subject matter and do not limit the scope of the claimed subject matter in any way. Accordingly, one or more features of one section can be combined with one or more features of another section. Furthermore, 5G terminology is used for the sake of clarity of explanation, but the techniques disclosed in the present document are not limited to 5G technology only and may be used in wireless systems that implemented other protocols.
This application discloses methods and apparatuses related to COT shared information processing in sidelink communication systems.
In a sidelink communication system, when there is a service to be transmitted between user equipments (UEs) , the service between the UEs does not necessary pass through the network side. In other words, such service transmission does not pass through the cellular link between the UE and the base station but directly transmitted from the data source UE to the target UE through a direct communication channel, sometimes called the sidelink. This direct communication mode between the UEs has different characteristics from the communication mode of the traditional cellular system.
Typical applications of Sidelink communication include Device-to-Device (D2D, Device-to-Device) communication and Vehicle to Everything (V2X) communication. Among them, the Internet of Vehicles (V2X) communication includes Vehicle to Vehicle (V2V for short) , Vehicle to Pedestrian (V2P for short) , Vehicle to Infrastructure (V2I for short) .
For short-range communication users who have access to Sidelink communication, Sidelink communication not only saves wireless spectrum resources, but also reduces the data transmission pressure on the core network, which can reduce the occupation of system resources, increase the spectral efficiency of the cellular communication system, and reduce the communication delay. Sidelink communication also saves the network operation cost to a great extent.
The current Sidelink designs only consider the ITS (Intelligent Transport System) spectrum and the licensed spectrum allocated to the network operator. However, the current designs do not consider unlicensed spectrum.
In the existing Sidelink, a slot can contain some Sidelink channels. The Sidelink channels include a side link control channel PSCCH (Physical sidelink control channel) , a side link shared channel PSSCH (Physical sidelink shared channel) and a Side link feedback channel PSFCH (Physical sidelink feedback channel) . In addition, a slot also includes OFDM symbols in which no sidelink channel is transmitted throughout the symbol.
In Sidelink communication, the sending device selects the resources for signaling/data transmission.
One way is through the scheduling of the central node (such as the base station) , the central node determines the resources used by the device for sending and informs the terminal through signaling.
Correspondingly, another way of selecting resources is the competition-based resource selection method. In a competition-based resource selection method, a device can choose the resource to send signaling/data autonomously in a resource pool by monitoring the usage of resources within the scope of the resource pool and monitoring the results. The competition-based resource selection method may also be referred to as a terminal-autonomous resource selection method.
On an unlicensed spectrum, only the channel successful of 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 time-frequency resource competition is successful, the communication node can transmit information on the time-frequency resource. More specifically, under the LBT mechanism, the 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 a channel access process such as LBT and perform channel occupation after monitoring that the channel is idle.
However, there needs to be more study and research on COT information processing and sharing technologies and systems. This patent application discloses multiple solutions regarding how a UE can process received COT information. The application also discloses methods and schemes involving sending the processed COT shared information out while transmitting on the time and/or frequency resources covered by the COT shared information. This application discloses and proposes methods will improve the communication efficiency in sidelink communication systems due to at least less overhead and better spectrum utilization.
Embodiment 1
This section discloses, among other things, examples of processing the received COT information and generating COT shared information to be sent out in sidelink communication systems.
In this embodiment, a first node determines the second COT sharing information and sends the second COT information. In particular, the process includes: the first node determines X pieces of the first COT shared information corresponding to X resource block sets (RB sets) , respectively. Here, X is a positive integer greater than 1. The first node uses the X pieces of the first COT shared information, according to a first rule to determine the second COT sharing information. The first node sends the second COT sharing information.
The described process is shown in FIG. 1.
Here, each RB set in the X resource block sets (RB sets) includes a number of RBs included in one channel. The first node uses a channel as a frequency domain unit to perform a channel access process. Suppose the evaluation result of the channel access process is that the channel is available. In that case, the strength of the interference signal on the channel is not large, and the first node may consider using the channel to transmit sidelink information.
Here, the bandwidth of one channel is typically 20 MHz.
In addition, the first node performs the channel access process for one RB set means that the first node performs the channel access process for the channel corresponding to the RB set.
In one example, a piece of 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 example, as shown in FIG. 2, X=4. According to FIG. 2, RB sets 1-4, respectively, correspond to four pieces of the first COT shared information. The first node determines the second COT sharing information according to the four pieces of the first COT sharing information corresponding to RB sets 1 -4.
In one example, 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 Channel Access Priority Class (CAPC, channel access priority) , but the value of the CAPC of the two can be different.
In another example, the first COT shared information corresponding to one RB set, determined by the first node, is determined based on the PSSCH to be sent or the sent PSSCH of the first node.
In a particular case, the first COT shared information includes CAPC.
There is a mapping relationship between PQI (or PPPP) and the CAPC, and the CAPC value included in the first COT shared information is determined based on the mapping relationship and PQI (or PPPP) .
Here, PPPP represents the priority of each packet of proximity services; PQI represents PC5 5QI (5G QoS Identifier) , and QoS (Quality of Service) represents the quality of service, and PC5 is a terminal-to-terminal Wireless communication interface.
In one example, the first node determines a piece of the first COT shared information corresponding to an RB set. One RB set in the above-mentioned X RB sets is marked as the first RB set.
The first node receives M pieces of information sent by M other nodes. Here M>=2. The M pieces of information include M pieces of COT shared information, and the M pieces of COT information include COT shared information corresponding to the first RB set.
To distinguish from the above-mentioned first COT shared information and second COT shared information, M pieces of COT shared information from M nodes are expressed as the first target COT shared information, the second target COT shared information, ...., the M ^th target COT shares information.
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 a special case, the first node selects the M pieces of target COT shared information, and the selected information is determined as the first COT shared information of the first RB set. In order to express more clearly, the first COT shared information, the second COT shared information, the first target COT shared information, the second target COT shared information, ..., and the Mth target COT shared information are shown in FIG. 3.
In a particular case, as shown in FIG. 3, X=4.
FIG. 3 only shows the target COT sharing information from other nodes corresponding to RB set 3 as the first RB set, and the target COT sharing information from other nodes corresponding to other RB sets as another first RB set is not shown in the FIG. In FIG. 3, the second node is UE2, the third node is UE3, and the fourth node is UE4.
In one example, 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, distance of using the shared resources, start offset of shared COT and channel access type.
The CAPC value may also be called the CAPC level. A CAPC value is used to perform the channel access process by a node, and the node may indicate its used CAPC value to other nodes.
The remaining COT duration indicates how much time is left for the shared COT to share.
The source ID is used to indicate the ID of the node that initiates COT sharing.
The destination ID is used to indicate to which node/nodes the shared COT can be shared, where the COT share corresponding destination ID can be different from the destination ID corresponding to PSSCH.
The destination identification number corresponding to the PSSCH is used to indicate which/which nodes the PSSCH is sent to.
The RB set number indicates which/which RB sets (or the channels corresponding to these RB sets) can be shared.
Distance of using the shared resources indicates the distance range of nodes that can use the shared COT.
The start offset of the shared COT indicates the offset time between when the COT sharing information is sent and the start time of the shared COT.
The channel access type indicates which type of channel access procedure needs to be performed by a node using the shared COT to send information within the shared COT.
In one example, 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, distance of using the shared resources, start offset of shared COT, or channel access type.
Embodiment 2
This section discloses, among other things, examples involving sending out COT shared information together with a PSSCH on the frequency resources covered by the COT shared information.
For example, a first node determines the second COT sharing information by using X pieces of the first COT shared information corresponding to X resource block sets (RB sets) and send the second COT sharing information and a PSSCH overlap with each of X RB sets in the frequency domain in a slot. Sending a PSSCH across each of X RB sets can prevent each of X RB sets from being preempted by other nodes.
In this embodiment, the first node determines the second COT sharing information and sends it out. This process may include the first node determining X pieces of the first COT shared information corresponding to X resource block sets (RB sets) respectively, wish X as a positive integer greater than 1. The first node may use the X pieces of the first COT shared information, according to the first rule to determine the second COT sharing information. The first node sends the second COT sharing information. Also, the first node may send a PSSCH, which will be overlap with all the above-mentioned X RB sets in the frequency domain.
For example, FIG. 2 discloses a specific example of sharing COT shared information together with sending PSSCH with X=4 frequency resources. According to FIG. 2, the second COT sharing information is determined by the first node. The first node not only sends the second COT sharing information in a slot, but also sends PSSCH. Among them, some RBs in RB set1 are used to send the second COT sharing 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 3, some RBs in RB set 4.
In an example, the first node sends an SCI. The SCI may include control information for indicating the PSSCH decoding, and the SCI includes the second COT sharing information.
Embodiment 3
This embodiment discloses, among other things, multiple examples involving how a UE may determine a first COT shared information based on multiple target COT information received from other UEs based on a decision rule.
In this embodiment, the first node determines X pieces of first COT shared information corresponding to X resource block sets (RB sets) respectively. The first COT sharing information includes COT sharing information corresponding to an RB set.
In one example, one RB set in the X RB sets is marked 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 and determines the first COT shared information according to a second rule. Here, M>=2.
In one example, 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 shared information, the first target COT shared information, the second target COT shared information, and the M-th target COT shared information corresponding to RB set 3, as shown in Figure 3. The first node determines the first COT sharing information according to the second rule.
In a particular case, the second rule is that the first node selects from the M pieces of target COT shared information, and the selected information is determined as the first COT shared information of the first RB set.
In one embodiment, one RB set in 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 UEM.
In one embodiment, the above-mentioned first target COT sharing information, second target COT sharing information, ..., the Mth target COT sharing information includes a first target CAPC value, a second target CAPC value…, an Mth target CAPC value.
According to a second rule, the first node determines the first CAPC value included in the first COT sharing information. The second rule can select the first CAPC value as the maximum value among the first target CAPC value, the second target CAPC value...., and the Mth target CAPC value.
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.
The first node determines the first remaining COT duration value included in the first COT sharing information according to a second rule. In one example, 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 value of the first target, the remaining COT duration value of the second target, ...., the remaining COT duration value of the Mth target.
In one embodiment, the above-mentioned first target COT sharing information, second target COT sharing information, ...., Mth target COT sharing information respectively include a first target communication distance, a second target communication distance, ...., the Mth target communication distance.
The first node determines the first communication distance included in the first COT sharing information according to a second rule. In one example, the second rule can determine the first communication distance as the maximum value among the first target communication distance, the second target communication distance, ...., and the Mth target communication distance.
In one example, one RB set in the X RB sets is marked as the second RB set. The first node determines the first CAPC value included in the first COT sharing information according to a second rule. In one example, the second rule is that the first CAPC value is determined by the first node corresponding CAPC value of the PSSCH to be sent or sent by the first node.
This CAPC value is associated with a PQI (or PPPP) , and there is a mapping relationship between the PQI (or PPPP) and the CAPC value.
The first node determines the CAPC value by using 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 the CAPC value is used as the first CAPC value.
Embodiment 4
This embodiment discloses, among other things, multiple examples involving how a UE may determine a second COT shared information based on multiple first COT shared information based on a decision rule.
In one embodiment, the first node uses X pieces of first COT shared information corresponding to X resource block sets (RB sets) respectively and determines a second COT shared information according to a first rule; the first node sends the second COT shared information.
The second COT shared information may include COT shared information of X RB sets.
In another example, the second COT shared information includes COT shared information corresponding to X RB sets, which refers to a value of a specific information included in the second COT shared information, and the value is used for all the above X RB sets.
In a special case, the specific information is the remaining COT duration, the second COT sharing information determined by the first node includes a remaining COT duration, and the first node indicates the remaining COT duration as the common remaining COT duration of the above-mentioned X RB sets by sending the remaining COT duration.
In another example, 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 a specific information, and these X values are respectively used for the above X RB sets.
In a special case, the specific information is the remaining COT duration, and X values of a specific information correspond to X values of the remaining COT duration.
The second COT sharing information determined by the first node includes X values of the remaining COT durations, and the first node sends the X remaining COT duration values to indicate the remaining COT durations of the X RB sets respectively.
In an example, the first node determines the second COT shared information according to the first rule, and the second COT shared information includes a second CAPC value (CAPC level) .
The second CAPC value determined by the first node according to a first rule, where the first rule is that the second CAPC determined by the first node is the minimum value among the X first CAPC values. The X first CAPC values are CAPC values included in the X first COT shared information.
FIG. 4 discloses a special case where X=4 and the minimum value of first CAPC values is 2.
In another example, 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 second remaining COT duration determined by the first node according to the first rule.
The second rule is that the second remaining COT duration determined by the first node is the minimum value among the X first remaining COT duration values. The X first remaining COT durations are the remaining COT duration values included in the X first COT sharing information.
FIG. 5 is a special case where the minimum value of X=4 first remaining COT durations is 4ms.
In another example, the first node determines the second COT shared information according to the first rule, and the second COT shared information includes a second communication distance.
The second communication distance determined by the first node according to the first rule. The first rule is that the second communication distance determined by the first node is the minimum value among the X first communication distances.
The X first communication distances are the communication distances included in the X first COT shared information. The communication distance here is the distance that allows the use of the shared COT.
In one example, 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 CAPC values included in the X first COT shared information.
In another example, 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 durations. The first node determines X second remaining COT durations according to a first rule, where 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.
Embodiment 5
This embodiment discloses among other things, examples involving decision-making on using a frequency resource based on the COT shared information related to the frequency resource.
In one example, the first node determines that X resource block sets (RB sets) respectively correspond to X pieces of the first COT shared information, where X is a positive integer greater than 1.
A frequency resource, e.g., an RB set, can be of different types. For example, the X RB sets may include a first-type RB set and a second-type RB set.
The first type of RB set is an RB set shared by other nodes for COT, and the second type of RB set is an RB set that is not shared by other nodes for COT. The first node performs the Type 2 channel access procedure for the first type of RB set, and the first node performs the Type 1 channel access procedure for the second type of RB set.
In the Type 1 channel access process, a counter N is involved, and the initial value of the counter N is a random value from 0 to the CW value. During the Type 1 channel access process, the first node determines that the channel is available only after detecting that the number of times the channel is idle reaches N times. The channel is available means that the first node can send sidelink information on the channel.
Type 2 channel result process, including Type 2A, Type 2B and Type 2C channel access process.
In a Type 2A channel access process, the first node determines that the channel is available only when the channel detected by the first node is idle in at least 25us for a certain period of time.
In a Type 2B channel access process, the first node detects the channel within 16us and monitors that the channel is idle for a certain period of time and then determines that the channel is available.
In a Type 2C channel access process, the first node can send sidelink information on the channel without monitoring that the channel is idle.
FIG. 6 is a special case with X=4 RB sets included. The first type of RB sets includes RB set 3, and the second type of RB sets includes RB set 1.
In FIG. 6, the second node initializes a COT, 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 (s) shared by the second node UE2, the remaining COT duration, and so on. The RB sets shared by the second node UE2 includes RB set 3. Similarly, the RB sets shared by the third node UE3 includes RB set 3, and the RB sets shared by the fourth node UE4 includes RB set 3. In FIG. 6, shared RB sets included in the COT shared information (target COT shared information) received by the first node from other nodes does not include RB set1. Therefore, RB set1 belongs to the second type of RB set.
For RB set3 belonging to the first type of RB set, the first node performs a Type 2 channel access procedure.
For RB set1 belonging to the second type of RB set, the first node performs a Type 1 channel access procedure.
The first node performs the channel access process for all X RB sets, and the evaluation results of the channel access process of X RB sets show that each channel including one of X RB sets are available, then the first node sends the PSSCH which overlap with each of all the X RB sets in the frequency domain.
The first node performing the channel access process for one RB set means that the first node performs the channel access process for the channel including the RB set. In a special case, the bandwidth of a channel including an RB set is 20 MHz, and some or all of the RBs included in the channel are used as the RB set.
Embodiment 6
This embodiment discloses, among other things, examples involving adding certain information in the received COT shared information into the second COT shared information to be sent out.
In an embodiment, the first node uses X pieces of the first COT shared information and determines the second 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 a first target source ID.
The first target source ID is the source ID included in the second target COT sharing 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.
FIG. 7 is a special case where X=1.
According to FIG. 7, the second node UE2 initializes a COT and shares the initialized COT with the first node UE1 by sending the first target COT sharing information to the first node.
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 shared information includes the source ID of the second node UE2. In this special case, the first COT shared information and the second COT shared information are the same, and the first node sends the second COT shared information. In the above manner, the first node forwards the source ID received from the second node UE2 and informs other nodes that the second node UE2 initializes the shared COT notified by the first node.
In one example, the first node uses the X pieces of the first COT shared information to determine the second 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 a first target destination ID.
The first target destination ID is the destination ID included in the second target COT sharing information sent by the second node and received by the first node.
The first node determines that the second destination ID belonging to the second COT shared information includes the first target destination ID.
FIG. 7 is a particular case with X=1. According to FIG. 7, a second node UE2 initializes a 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, where 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 shared information includes the destination ID of the second node UE2. In this special case, the first COT shared information and the second COT shared information are the same, and the first node sends the second COT shared information. In the above manner, the first node forwards the destination ID received from the second node UE2 and informs other nodes which nodes can use the shared COT.
Embodiment 7
This embodiment discloses, among others, examples involving restrictions for a UE to transmit on a frequency resource based on the received and processed COT information.
In one example, the first node determines X pieces of the first COT shared information corresponding to X resource block sets (RB sets) , respectively. And the first node uses the X pieces of the first COT shared information to determine the first COT shared information according to a first rule. Two COT shared information, and the first node sends the second COT shared information. In addition to sending the second COT sharing information, the first node may also send a unicast PSSCH overlapping the frequency domain of 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 pieces of the first COT shared information, one of the first COT shared information includes the COT shared information sent from the second node UE2, and the other first COT shared information. The information includes the COT sharing information sent from the third node UE3. One RB set corresponding to the above-mentioned first COT sharing information is marked as the fourth RB set, and one RB set corresponding to the above-mentioned other first COT sharing information is marked as the fifth RB set.
FIG. 8 is a special case with X=2. According to FIG. 8, the first node receives the first target COT sharing information sent by the second node and receives the 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 set2) . The second target COT sharing information is the COT sharing information sent by the third node UE3 for the fifth RB set (RB set1) . 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. Because the first COT shared information corresponding to RB set 2 and RB set 1, respectively comes from the first target shared information and the second target shared information, that is, from the second node UE2 and the third node UE3, respectively. Therefore, the first node may not transmit a unicast PSSCH overlapping the frequency domain of X resource block sets (RB sets) within the shared COT determined by the first node.
In one example, the first node sends a PSSCH overlapping with all of the 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 X first CAPC corresponding to the X RB sets are the same. The X first CAPC values respectively belong to the X first COT shared information corresponding to the X RB sets.
FIG. 9 shows an exemplary block diagram of a hardware platform 900 that may be a part of a network device (e.g., base station) or a communication device (e.g., a user equipment (UE) ) . The hardware platform 900 includes at least one processor 910 and a memory 905 having instructions stored thereupon. The instructions upon execution by the processor 910 configure the hardware platform 900 to perform the operations described in FIGS. 1 to 8 and in the various embodiments described in this patent document. The transmitter 915 transmits or sends information or data to another device. For example, a network device transmitter can send a message to user equipment. The receiver 920 receives information or data transmitted or sent by another device. For example, user equipment can receive a message from a network device.
The implementations as discussed above will apply to a network communication. FIG. 10 shows an example of a communication system (e.g., a 5G or NR cellular network) that includes a base station 1020 and one or more user equipment (UE) 1011, 1012 and 1013. In some embodiments, the UEs access the BS (e.g., the network) using a communication link to the network (sometimes called uplink direction, as depicted by dashed arrows 1031, 1032, 1033) , which then enables subsequent communication (e.g., shown in the direction from the network to the UEs, sometimes called downlink direction, shown by arrows 1041, 1042, 1043) from the BS to the UEs. In some embodiments, the BS send information to the UEs (sometimes called downlink direction, as depicted by arrows 1041, 1042, 1043) , which then enables subsequent communication (e.g., shown in the direction from the UEs to the BS, sometimes called uplink direction, shown by dashed arrows 1031, 1032, 1033) from the UEs to the BS. The UE may be, for example, a smartphone, a tablet, a mobile computer, a machine to machine (M2M) device, an Internet of Things (IoT) device, and so on.
FIG. 11 shows an example flowchart representation of a method for wireless communication in accordance with one or more embodiments of the present technology. Operation 1102 includes transmitting, by a first wireless device to a second wireless device, a signal including a second channel occupancy time (COT) shared information, wherein the second COT shared information is determined based on a first rule and X first channel occupancy time (COT) shared information, wherein the X first COT shared information correspond to X sets of frequency resources, wherein X is an integer larger or equals to 2.
Various preferred embodiments and additional features of the above-described method of FIG. 11 are as follows. Further examples are described with reference to embodiments 1 to 7.
In one example aspect, a wireless communication method is disclosed. The method includes transmitting, by a first wireless device to a second wireless device, a signal including a second channel occupancy time (COT) shared information, wherein the second COT shared information is determined based on a first rule and X first channel occupancy time (COT) shared information, wherein the X first COT shared information correspond to X sets of frequency resources, wherein X is an integer larger or equals to 2.
In another example aspect, another wireless communication method is disclosed. The method includes receiving, by a second wireless device from a first wireless device, a signal including a second channel occupancy time (COT) shared information; and performing a communication using the second COT shared information, wherein the second COT shared information is determined based on a first rule and X first channel occupancy time (COT) shared information, wherein the X first COT shared information correspond to X sets of frequency resources, wherein X is an integer larger or equals to 1.
In some embodiments, each of the X first COT shared information is determined, by the first wireless device, based on a second rule and M received channel occupancy time (COT) shared information, wherein the M received COT shared information are transmitted to the first wireless device from M different wireless devices.
In some embodiments, the second rule is different from the first rule.
In some embodiments, the second rule comprises determine a parameter in a first COT shared information as a maximum value among values of parameters of a same type in the M received COT shared information.
In some embodiments, the second rule comprises determine a parameter in a first COT shared information based on a value of a parameter of a same type for a COT shared information generated by the first wireless device.
In some embodiments, the parameter is at least one of: 1) channel access priority class (CAPC) 2) a remaining duration after excluding a lapsed time in a COT duration or 3) a parameter indicating a maximum distance at which an indicated shared time and/or frequency resources can be used
In some embodiments, the first rule comprises determine a parameter in the second COT shared information as a minimum value among the values of parameters of a same type in the X first COT shared information.
In some embodiments, the first rule comprises determine a parameter in the second COT shared information as a list of values for parameters of a same type in the X first COT shared information.
In some embodiments, the parameter is at least one of: 1) channel access priority class (CAPC) 2) a remaining duration after excluding a lapsed time in a COT duration or 3) a parameter indicating a maximum distance at which an indicated shared time and/or frequency resources can be used.
In some embodiments, the first rule comprises adding a parameter from the M received COT shared information into the second COT shared information.
In some embodiments, the parameter is at least one of 1) at least a source device ID received from another communication device or 2) at least a destination ID received from another communication device, wherein the source ID indicates an identity information of a wireless device initiating sharing a COT shared information, wherein the destination ID indicates an identify information used for determining all the wireless devices that can use received COT shared information to determine available time-frequency resources
In some embodiments, the above methods further comprising, transmitting, by the first wireless device, information on at least part of each of the X sets of frequency resources.
In some embodiments, the X sets of frequency resources comprise a X1 sets of frequency resources and another X2 sets of frequency resources, wherein the first wireless device perform type1 channel access procedure for each of X1 sets of resources before transmitting on each of X1 sets of resources, wherein the first wireless device perform type2 channel access procedure for each of X2 sets of resources before transmitting on each of X2 sets of resources.
In some embodiments, the first wireless device transmit on at least part of each of the X sets of frequency resources to a single wireless device when determining that all of the X first COT shared information contain information from a same wireless device among M different wireless devices sending the M received COT shared information.
In some embodiments, the above methods further comprising: expecting not to transmit to transmit on all of the X sets of frequency resources when determining that values of a parameter in the X first COT share information are not equal.
It will be appreciated that the present document discloses methods and apparatus related to processing and transferring the COT information received from other UEs in sidelink communication systems. Sidelink communication not only saves wireless spectrum resources, but also reduces the data transmission pressure on the core network, which can reduce the occupation of system resources, increase the spectral efficiency of the cellular communication system, and reduce the communication delay. Sidelink communication also saves the network operation cost to a great extent. In sidelink communication, one way of selecting resources is the competition-based resource selection method, which can be achieved through COT information sharing. However, there is little study and research on COT information processing and sharing technologies and systems. This patent application discloses multiple solutions regarding how a UE can process received COT information. The application also discloses methods and schemes involving sending the processed COT shared information out while transmitting on the frequency resources covered by the COT shared information. This application discloses and proposes methods will improve the communication efficiency in sidelink communication systems due to at least less overhead and better spectrum utilization.
The disclosed and other embodiments, modules and the functional operations described in this document can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this document and their structural equivalents, or in combinations 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 to control the operation of, data processing apparatus. The computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more of them. The term “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them. A propagated signal is an artificially generated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus.
A computer program (also known 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 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 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, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code) . A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.
The processes and logic flows described in this document can 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 can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit) .
Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read only memory or a random access memory or both. The essential elements of a computer are a processor for performing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not 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 by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto optical disks; and CD ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.
While this document contains many specifics, these should not be construed as limitations on the scope of an invention that is claimed or of what may be claimed, but rather as descriptions of features specific to particular embodiments. Certain features that are described in this document in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or a variation of a subcombination. Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results.
Only a few examples and implementations are disclosed. Variations, modifications, and enhancements to the described examples and implementations and other implementations can be made based on what is disclosed.

Claims

A method for digital communication, comprising:

transmitting, by a first wireless device to a second wireless device, a signal including a second channel occupancy time (COT) shared information,

wherein the second COT shared information is determined based on a first rule and X first channel occupancy time (COT) shared information,

wherein the X first COT shared information correspond to X sets of frequency resources,

wherein X is an integer larger or equals to 2.
The method of claim 1, wherein each of the X first COT shared information is determined, by the first wireless device, based on a second rule and M received channel occupancy time (COT) shared information, wherein the M received COT shared information are transmitted to the first wireless device from M different wireless devices.
The method of claims 2, wherein the second rule is different from the first rule.
The method of claim 2, wherein the second rule comprises determine a parameter in a first COT shared information as a maximum value among values of parameters of a same type in the M received COT shared information.
The method of claim 2, wherein the second rule comprises determine a parameter in a first COT shared information based on a value of a parameter of a same type for a COT shared information generated by the first wireless device.
The method of claims 4 or 5, wherein the parameter is at least one of: 1) channel access priority class (CAPC) 2) a remaining duration after excluding a lapsed time in a COT duration or 3) a parameter indicating a maximum distance at which an indicated shared time and/or frequency resources can be used.
The method of claim 1, wherein the first rule comprises determine a parameter in the second COT shared information as a minimum value among the values of parameters of a same type in the X first COT shared information.
The method of claim 1, wherein the first rule comprises determine a parameter in the second COT shared information as a list of values for parameters of a same type in the X first COT shared information.
The method of claims 7 or 8, wherein the parameter is at least one of: 1) channel access priority class (CAPC) 2) a remaining duration after excluding a lapsed time in a COT duration or 3) a parameter indicating a maximum distance at which an indicated shared time and/or frequency resources can be used.
The method of claim 2, wherein the first rule comprises adding a parameter from the M received COT shared information into the second COT shared information.
The method of claim 10, wherein the parameter is at least one of 1) at least a source device ID received from another communication device or 2) at least a destination ID received from another communication device

wherein the source ID indicates an identity information of a wireless device initiating sharing a COT shared information,

wherein the destination ID indicates an identify information used for determining all the wireless devices that can use received COT shared information to determine available time-frequency resources.
The method of claim 1, further comprising, transmitting, by the first wireless device, information on at least part of each of the X sets of frequency resources.
The method of claim 3, wherein the X sets of frequency resources comprise a X1 sets of frequency resources and another X2 sets of frequency resources, wherein the first wireless device perform type1 channel access procedure for each of X1 sets of resources before transmitting on each of X1 sets of resources, wherein the first wireless device perform type2 channel access procedure for each of X2 sets of resources before transmitting on each of X2 sets of resources.
The method of claim 13, wherein the first wireless device transmit on at least part of each of the X sets of frequency resources to a single wireless device when determining that all of the X first COT shared information contain information from a same wireless device among M different wireless devices sending the M received COT shared information.
The method of claim 13, further comprising:

expecting not to transmit to transmit on all of the X sets of frequency resources when determining that values of a parameter in the X first COT share information are not equal.
An apparatus for communication network, comprising: a processor configured to implement a method recited in any of claims 1 to 15.
A computer-readable storage medium having code stored thereupon, the code, upon execution by a processor, causing the processor to implement a method recited in any of claims 1 to 15.