Communication method and device

Abstract

The invention provides a communication method and device, and is used for providing a competition channel mechanism suitable for a satellite flash communication technology. The method comprises the following steps: a first node determines M measurement time domain resources, determines M segments of time domain resources according to the M measurement time domain resources, determines a channel competition result of the first node in a first competition channel period according to a state of the first node on the kth segment of time domain resource and / or a channel state measurement result on the kth measurement time domain resource, the M measurement time domain resources are used for measuring the channel state, M is an integer greater than 1, the kth time domain resource is one of the M time domain resources, and the kth measurement time domain resource is one of the M measurement time domain resources. In the embodiment of the invention, the measurement time domain resources in the first competition channel period are more, multiple channel state measurement results can be comprehensively considered, the channel competition result can be more accurately determined, and the chance of the first node to compete for the channel is more, so that the first node has higher probability to compete for the channel.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a communication method and apparatus. Background Technology

[0002] The development of wireless local area networks (WLANs) has made wireless communication increasingly popular. The standards for WLANs developed by the Institute of Electrical and Electronics Engineers (IEEE) (i.e., the 802.11 protocol suite) have also evolved accordingly.

[0003] With the continuous development of IoT technology, short-range communication technologies such as WLAN may no longer adequately meet the needs of many application scenarios. Therefore, SparkLink (or NearLink) communication technology for short-range communication has emerged. Currently, nodes operating in unlicensed frequency bands using Wireless Fidelity (WiFi) (or Bluetooth or cellular networks) compete for channels using corresponding contention mechanisms (also known as channel contention mechanisms or random access mechanisms), thus enabling communication through the acquired channels. However, if nodes operating in unlicensed frequency bands adopt SparkLink communication technology, a suitable contention mechanism for SparkLink needs to be designed. Therefore, how to design a suitable contention mechanism for SparkLink communication technology has become an urgent problem to be solved. Summary of the Invention

[0004] This application provides a communication method and apparatus for providing a competitive channel mechanism suitable for star-flash communication technology.

[0005] Firstly, this application provides a communication method, which can be executed by a first node or a module (such as a processor, processing unit, chip system, circuit, or chip) within the first node. Optionally, the method can also be implemented by a logical node, logical module, or software capable of implementing all or part of the functions of the first node. For example, the following describes the execution of the communication method by a first node. The method may include the following steps: the first node determines M measurement time-domain resources; based on the M measurement time-domain resources, it determines M segments of time-domain resources; based on the state of the first node on the k-th segment of time-domain resources and / or the channel state measurement result on the k-th measurement time-domain resources, it determines the channel contention result of the first node in a first contention channel period, wherein the M measurement time-domain resources are used to measure the channel state, M is an integer greater than 1, the k-th segment of time-domain resources is one of the M segments of time-domain resources, and the k-th measurement time-domain resource is one of the M measurement time-domain resources.

[0006] In this method, after determining M time-domain resources based on M measured time-domain resources, the first node can determine its channel contention result in the first contention channel period based on its state on the k-th time-domain resource and / or the channel state measurement result on the k-th measured time-domain resource. This provides a corresponding (or matching) contention channel mechanism for nodes using StarFlash communication technology. The state of the first node on the k-th time-domain resource reflects the channel state measurement results obtained from one or more measurements prior to the k-th time-domain resource, and the channel state measurement result on the k-th measured time-domain resource reflects the busy / idle status of the corresponding time-domain resource. Since there are many measured time-domain resources for measuring channel state in the first contention channel period, multiple channel state measurement results can be comprehensively considered to more accurately determine the first node's channel contention result in the first contention channel period. Furthermore, since there are more time-domain resources available for measuring channel state during the first channel contention period, the first node has more opportunities to compete for the channel, making it more likely that the first node will win the channel. This allows the first node (such as the first node operating in the unlicensed frequency band) to have a higher probability of winning the channel.

[0007] In one possible implementation, the method further includes:

[0008] The first node determines the state of the first node in the i-th segment of time domain resources based on the state of the first node in the (i-1)th segment of time domain resources, where the (i-1)th segment of time domain resources and the i-th segment of time domain resources are two consecutive segments of time domain resources in the M segments of time domain resources.

[0009] In the above implementation, the state of the first node in the i-th time domain resource is accurately determined based on the state of the first node in the (i-1)th time domain resource. This allows the state in the i-th time domain resource to continue the state in the (i-1)th time domain resource, which can increase the probability of a node that has already occupied the channel occupying the channel and reduce the probability of a node that has not occupied the channel occupying the channel.

[0010] In one possible implementation, the first node determines its state in the i-th time domain resource based on its state in the (i-1)-th time domain resource. This includes several possible implementations:

[0011] Implementation method A: If the state of the first node on the time domain resource of the (i-1)th segment is the released state, then the first node can determine that the state of the first node on the time domain resource of the i-th segment is the released state.

[0012] The above implementation method A ensures that the i-th segment of resources will not occupy the channel after the i-1-th segment of time-domain resources releases the channel, and the probability of nodes competing to occupy the channel is low. It is suitable for low-priority nodes or low-priority services.

[0013] Implementation method B: If the state of the first node in the (i-1)th segment of time domain resources is occupied, then the first node can determine that the state of the first node in the i-th segment of time domain resources is occupied.

[0014] The above implementation method B ensures that the i-th segment of resources will not release the channel after the i-1-th segment of time-domain resources has occupied the channel, and the probability of nodes competing to occupy the channel is high. It is suitable for high-priority nodes or high-priority services.

[0015] In one possible implementation, the method further includes:

[0016] The first node determines the state of the first node on the i-th segment of time domain resources based on the channel state measurement result on the (i-1)-th measurement time domain resource. The (i-1)-th segment of time domain resources and the i-th segment of time domain resources corresponding to the (i-1)-th measurement time domain resource are two consecutive segments of time domain resources in the M segments of time domain resources.

[0017] In the above implementation, the state of the first node in the i-th time domain resource can be accurately determined by the channel state measurement result obtained from the measurement on the (i-1)th measurement time domain resource, thereby enabling nodes to compete for channel occupancy.

[0018] In one possible implementation, the first node determines its state on the i-th time-domain resource based on the channel state measurement result on the (i-1)-th measurement time-domain resource, including:

[0019] If the channel state measurement result on the (i-1)th measurement time domain resource is "channel idle", then the first node can determine that the state of the first node on the i-th time domain resource is "occupied"; or,

[0020] If the channel state measurement result on the (i-1)th time domain resource is "channel busy", then the first node can determine that the state of the first node on the i-th time domain resource is "released".

[0021] The above implementation accurately determines the state of the first node in the next time-domain resource segment by based on the channel busy / idle status measured on the (i-1)th measurement time-domain resource. For example, if the channel is detected as idle (i.e., no other node is detected occupying the channel), the first node can immediately occupy the channel in the next time-domain resource segment. If the channel is detected as busy (i.e., other nodes are detected occupying the channel), the first node can immediately release the channel in the next time-domain resource segment. This enables the process of nodes competing to occupy the channel.

[0022] In one possible implementation, the method further includes:

[0023] The first node determines the state of the first node in the i-th time domain resource based on the state of the first node in the i-1th time domain resource and the channel state measurement result in the i-1th measurement time domain resource. The i-1th time domain resource and the i-th time domain resource are two consecutive time domain resources in the M time domain resources.

[0024] In the above implementation, the state of the first node in the i-th time domain resource is determined by the state of the first node in the i-1th time domain resource and the channel state measurement result in the i-1th measurement time domain resource. This enables the process of nodes competing for and occupying the channel. Furthermore, when the state of the first node in the i-1th time domain resource is occupied, collision detection is performed on the channel occupied by the first node based on the i-1th measurement time domain resource, which helps to reduce the probability of resource conflicts between nodes.

[0025] In one possible implementation, the first node determines its state on the i-th time-domain resource based on its state on the (i-1)-th time-domain resource and the channel state measurement result on the (i-1)-th measurement time-domain resource, including:

[0026] If the first node is in an occupied state on the (i-1)th time-domain resource segment, and the channel state measurement result on the (i-1)th measurement time-domain resource segment is an idle channel, then the first node can determine that its state on the i-th time-domain resource segment is occupied; or,

[0027] If the state of the first node on the (i-1)th time domain resource is occupied, and the channel state measurement result on the (i-1)th measurement time domain resource is busy, then the first node can determine that the state of the first node on the i-th time domain resource is released.

[0028] In the above implementation, when the first node is in an occupied state on the i-1th time domain resource, conflict detection is performed on the channel occupied by the first node based on the i-1th measured time domain resource to determine whether there are other nodes also occupying the channel. If so, the channel is released; otherwise, the channel is not released. This helps to reduce the probability of resource conflicts between nodes.

[0029] In one possible implementation, the method further includes:

[0030] If the first node is in an occupied state on the t-th time domain resource, then the first node can send a signal on the t-th time domain resource, where the t-th time domain resource is one segment of M time domain resources; or,

[0031] If the first node is in an occupied state on the t-th time domain resource, and there is a resource in the t-th time domain resource for sending signals, then the first node can send signals on the t-th time domain resource, where the t-th time domain resource is a segment of M time domain resources.

[0032] In the above implementation, the first node sends a signal on the t-th time domain resource in the occupied state, which enables other nodes to measure the energy of the signal sent by the first node on the t-th time domain resource, thereby knowing that there is a node occupying the channel, thus realizing that the first node temporarily occupies the channel.

[0033] In one possible implementation, M can be pre-configured; or,

[0034] M can be determined based on at least one channel state measurement result prior to the first contention channel period and / or the communication performance of the first node prior to the first contention channel period.

[0035] In the above implementation, M can be pre-configured according to actual needs, thus meeting the requirements of different users. Alternatively, M can be adjusted (or updated) in a timely and effective manner based on at least one channel state measurement result and / or the communication performance of the first node before the first contention channel period. This allows for timely reduction of the value of M when channel congestion is detected before the first contention channel period, thereby reducing the number of measurement time-domain resources and helping to reduce the probability of conflicts caused by the possible identical time-domain positions of measurement time-domain resources of different nodes. It also allows for increasing the value of M when the channel is relatively idle before the first contention channel period, thereby increasing the number of measurement time-domain resources and helping to increase the probability of the first node competing for and obtaining the channel (which can be understood as the first node having more opportunities to compete for the channel, and thus a higher probability of obtaining the channel).

[0036] In one possible implementation, M time-domain resources correspond one-to-one with M measurement time-domain resources, and a measurement time-domain resource is located at the end of a time-domain resource corresponding to the measurement time-domain resource.

[0037] In the above implementation, by placing a measurement time-domain resource at the end of the time-domain resource segment in which the measurement time-domain resource is located, the channel state measurement result obtained by the first node on the measurement time-domain resource can directly affect the state of the first node on one or more time-domain resources located after the measurement time-domain resource.

[0038] In one possible implementation, the temporal location of at least one of the M measurement time-domain resources is determined based on a random selection method.

[0039] In the above implementation, by ensuring that the time-domain position of at least one of the M measurement time-domain resources is determined by random selection, the time-domain position of the measurement time-domain resources can be randomized. This helps to reduce the probability that the time-domain positions of all measurement time-domain resources in multiple domains (such as multiple G nodes) are the same, thereby enabling multiple domains to coexist through channel contention.

[0040] In one possible implementation, the M measurement time-domain resources do not overlap, and the M time-domain resources are continuous in the time domain.

[0041] In the above implementation, since the M measurement time-domain resources are different, the first node has more opportunities to compete for the channel, thus increasing its probability of winning the channel. Furthermore, this implementation avoids the complex situation of partial overlap between two measurement resources, helping to prevent the measurement process and the decision-making based on the measurement results from becoming overly complicated. Moreover, since the M time-domain resources are continuous in the time domain, the channel state measurement results can directly affect whether the nearest adjacent time-domain resource occupies the channel, ensuring the timeliness of the channel state measurement results.

[0042] In one possible implementation, the channel state measurement results on the time-domain resources can be obtained by measuring some or all of the resources in the time-domain resources.

[0043] In the above implementation, if a portion of the measurement time-domain resources is used to measure the channel state, the remaining portion of the measurement time-domain resources (or a portion of the remaining resources) can be used by the node to perform some internal processing operations after the measurement channel is busy or idle (for example, it can be used by the node to calculate the measurement results and determine the state of the first node on the time-domain resources located after the measurement time-domain resources (for example, the state of the first node on the time-domain resources located after the measurement time-domain resources is occupied or released)). Alternatively, the remaining portion of the resources (or a portion of the remaining resources) can be used by the node to transmit signals.

[0044] In one possible implementation, the M-segment time-domain resources can be located in the first contention channel period.

[0045] In the above implementation, the first node determines the measurement time-domain resources before the first contention channel period. That is, the M measurement time-domain resources included in the M time-domain resources are determined by the first node before entering the first contention channel period. Therefore, there is no need to temporarily change (or adjust) the transmission or reception state of the time-domain resources based on the channel state measurement results, making it easy to implement. Specifically, the first node can determine, before the first contention channel period, which time-domain resources in the time-domain resource units included in the first contention channel period are configured as reception state for measurement, and which time-domain resources are configured as transmission state for transmitting signals when in an occupied state.

[0046] In one possible implementation, the first node is in a released state for the first p time-domain resources within the M time-domain resources; or...

[0047] The first node is in an occupied state for the first p-1 time domain resources in the M-segment time domain resources, and the first node is in a released state for the p-th time domain resource in the M-segment time domain resources.

[0048] In the above implementation, by ensuring (or designing or setting) that the first node is in a released state for the first p time domain resources in the M time domain resources, the starting point of node channel contention can be adjusted, and the probability of node channel contention can also be adjusted (for example, when the starting point of channel contention is early, there are more time domain resources to measure, the first node has more opportunities to compete for the channel, and the probability of winning the channel is also higher; or when the starting point of channel contention is late, there are relatively fewer time domain resources to measure, the first node has relatively fewer opportunities to compete for the channel, and the probability of winning the channel is also relatively lower). Furthermore, by ensuring that the first node is in an occupied state for the first p-1 time domain resources in the M time domain resources, and that the first node is in a released state for the p-th time domain resources in the M time domain resources, the starting point of node channel contention can be adjusted without changing the probability of node channel contention (because the first node is in an occupied state for the first p-1 time domain resources, the p-th time domain resources are freed up for inter-node channel contention).

[0049] In one possible implementation, p can be determined based on the priority of the first node; or,

[0050] p can be determined based on the priority of the service to be transmitted.

[0051] In the above implementation, when p is a relatively small integer value, it helps high-priority nodes or high-priority services to have a higher probability of successfully competing for the channel.

[0052] In one possible implementation, if the first node is in a communication state before the first contention channel period and / or the first contention channel period satisfies the first condition, then the first node's state on the time domain resources in the first p-1 segments is an occupied state, and the first node's state on the time domain resources in the p-th segment is a released state; or,

[0053] If the first contention channel period is the first period in which the first node is in the contention channel state and / or the first contention channel period satisfies the first condition, then the state of the first node in the first p-1 time domain resources is the occupied state, and the state of the first node in the p-th time domain resources is the released state.

[0054] The above implementation method can make the starting point of the contention channel relatively randomized, thereby effectively avoiding the following situation: when multiple domains (such as multiple G nodes) are competing for the channel, because the start time of the time domain resources used by one or more domains for channel competition is consistently after the end time of the time domain resources used by one or more domains for channel competition, one or more domains have a high probability of continuously occupying the channel, while other one or more domains have a high probability of failing to compete for the channel. For example, this scheme is used when the time domain resource position of the first contention channel period meets the first condition, or it is not used when the time domain resource position of the first contention channel period does not meet the first condition. This helps to further randomize the starting position of the contention channel, thereby effectively avoiding the aforementioned problem of one or more domains having a high probability of continuously occupying the channel, while other one or more domains have a high probability of failing to compete for the channel. Here, the first condition can be a constraint (or limiting condition) on the time domain resource position of the first contention channel period.

[0055] In one possible implementation, the first contention channel period may contain q time-domain resource units, where q is an integer greater than or equal to 1;

[0056] Where q can be pre-configured; or,

[0057] q can be determined based on at least one channel state measurement result prior to the first contention channel period and / or the communication performance of the first node prior to the first contention channel period.

[0058] In the above implementation, q can be pre-configured according to actual needs, thus meeting the requirements of different users. Alternatively, q can be adjusted in a timely and effective manner based on at least one channel state measurement result and / or the communication performance of the first node before the first contention channel period. This allows for timely increase of the value of q when channel congestion is detected before the first contention channel period, which helps to expand the selection range of measurement time-domain resources and obtain a more reasonable selection range. This results in greater randomness in the location of measurement time-domain resources, which helps to reduce the probability of conflicts caused by the possibility of conflict due to the time-domain locations of measurement time-domain resources of different nodes being the same. Furthermore, it allows for timely decrease of the value of q when the channel is relatively idle before the first contention channel period, which helps to ensure that the first contention channel period contains a reasonable number of time-domain resources, increases the density of measurement time-domain resources, improves the probability of preempting the channel, and reduces the waste of time-domain resources.

[0059] In one possible implementation, the method further includes:

[0060] The first node determines the channel contention result based on the state of the first node on the k-th time domain resource and / or the channel state measurement result on the k-th measurement time domain resource, and the channel state measurement result on the second measurement time domain resource. Here, the M measurement time domain resources are the first measurement time domain resources, and the second measurement time domain resources are different from the first measurement time domain resources.

[0061] In the above implementation, by combining the channel state measurement results obtained by the first node on the k-th time domain resource and / or the channel state measurement results obtained by the first node on the k-th measurement time domain resource with the channel state measurement results obtained by the first node on the second measurement time domain resource, the channel contention results can be made more accurate, thereby further improving the success rate of the node occupying the channel and avoiding interference from other nodes to a certain extent.

[0062] In one possible implementation, if the channel contention result is successful, then after the first contention channel period ends, the state of the first node can be updated (or adjusted or switched) from the contention channel state to the communication state. The duration of the communication state can include s time-domain resource units, where s is an integer greater than or equal to 1.

[0063] The above implementation allows the first node to promptly switch its state from the contention channel state to the communication state after the first contention channel period ends, enabling timely communication. Furthermore, the duration of the communication state is an integer number of time-domain resource units, matching the node's (or device's) scheduled transmission timing, making it easy to implement.

[0064] In one possible implementation, the method further includes:

[0065] If the first node is in an idle state, then the first node does not send a signal. The duration of the idle state can include h time-domain resource units, where h is an integer greater than or equal to 1.

[0066] The above implementation method can effectively avoid the first node unnecessarily occupying the channel due to channel contention or invalid communication.

[0067] In one possible implementation, the first node competes on N channels during the first contention channel period, where each of the N channels corresponds to M time-domain resources.

[0068] The method further includes:

[0069] If f out of N channels satisfy the second condition, and f is greater than or equal to g, then the first node can determine that the channel contention result is successful, where g is the number of target channels required for communication by the first node, and f, N and g are all positive integers.

[0070] The second condition may include at least one of the following: the state of the first node on the k-th time domain resource is occupied, and the channel state measurement result on the k-th measurement time domain resource is idle.

[0071] In the above implementation, g represents the minimum number of channels required to satisfy the communication needs of the first node. When the number of channels obtained by the first node is less than g, the communication needs of the first node are not met, and therefore the first node needs to continue competing for channels in the next channel competition cycle. When the number of channels obtained by the first node is greater than or equal to g, the communication needs of the first node are met, and therefore the first node can communicate based on the channels obtained through competition.

[0072] In one possible implementation, after the first node determines that the channel contention result is successful, the method further includes:

[0073] The first node can choose g channels from f channels and communicate on g channels; or...

[0074] The first node can communicate on f channels.

[0075] In the above implementation, after the first node successfully competes for a channel, when it uses g of the f channels it has acquired for communication (which can be understood as the first node using the target number of channels out of all acquired channels for communication), the communication bandwidth for each communication is relatively fixed, and the communication process is relatively simple. When the first node uses f channels it has acquired for communication (which can be understood as the first node using all acquired channels for communication), it can occupy as many resources as possible to obtain the highest possible communication rate.

[0076] In one possible implementation, during the first contention channel period, the first node competes on N channels, and the first node performs one of the following steps on each of the N channels:

[0077] The first node determines its state in the i-th time domain resource based on its state in the (i-1)-th time domain resource, where the (i-1)-th and i-th time domain resources are two consecutive time domain resource segments within the M time domain resource segments; or...

[0078] The first node determines its state on the i-th time-domain resource based on the channel state measurement result on the (i-1)-th measurement time-domain resource, where the (i-1)-th and i-th time-domain resources corresponding to the (i-1)-th measurement time-domain resource are two consecutive time-domain resources in the M-segment time-domain resources; or...

[0079] The first node determines the state of the first node in the i-th time domain resource based on the state of the first node in the i-1th time domain resource and the channel state measurement result in the i-1th measurement time domain resource. The i-1th time domain resource and the i-th time domain resource are two consecutive time domain resources in the M time domain resources.

[0080] In the above implementation, when the first node competes for channels on multiple channels, the time-domain positions of the measurement resources on each channel are the same, which avoids the duplex problem caused by different transmission and reception configurations of different channels (which can be understood as the time-domain resource configuration available for receiving signals and the time-domain resource configuration available for transmitting signals). Furthermore, the first node independently executes the channel contention process on each of the multiple channels, thus increasing the probability of contention for each channel. The state of the time-domain resources available for receiving signals is the receiving state, and the state of the time-domain resources available for transmitting signals is the transmitting state.

[0081] Secondly, this application provides a communication device including units or means for performing the various steps of any of the implementation methods in the first aspect described above.

[0082] For example, the communication device can be a first node, or a module within the first node (such as a processor, processing unit, chip system, circuit, or chip). The communication device has the function of implementing any of the methods described in the first aspect above. This function can be implemented in hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above-described function.

[0083] Thirdly, this application provides a communication device that has the functions involved in the first aspect above. For example, the communication device includes modules, units, or means that perform the operations involved in the first aspect above. The functions, units, or means can be implemented by software, or by hardware, or by hardware executing corresponding software.

[0084] In one possible implementation, the communication device may include a processing unit (or processing module). Optionally, the communication device may further include a transceiver unit (or communication module, used for sending and receiving data). The transceiver unit can be used to send and receive signals to enable communication between the communication device and other devices; for example, the transceiver unit can be used to send data to other communication devices. The processing unit can be used to perform some internal operations of the communication device. The functions performed by the transceiver unit and the processing unit can correspond to the operations described in the first aspect above.

[0085] In one possible implementation, the communication device includes a processor that can be coupled to a memory. The memory can store computer programs or instructions necessary to implement the functions described in the first aspect above. The processor can execute the computer programs or instructions stored in the memory, causing the communication device to implement the methods in any of the possible implementations of the first aspect above, when the computer programs or instructions are executed.

[0086] In one possible implementation, the communication device includes a processor and a memory, the memory of which may store computer programs or instructions necessary for implementing the functions described in the first aspect above. The processor may execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, cause the communication device to implement the methods in any of the possible implementations of the first aspect above.

[0087] In one possible implementation, the communication device includes a processor and a transceiver (or communication interface or interface circuitry), wherein the processor is used to communicate with other devices via the transceiver and to perform the methods in any of the possible implementations of the first aspect described above. The transceiver is used to enable the communication device to communicate with other devices, for example, to receive signals from other communication devices and transmit them to the processor, or to send signals from the processor of the communication device to other communication devices, such as the transmission or reception of data and / or signals. Exemplarily, the communication interface may be a transceiver, circuit, bus, module, or other type of communication interface.

[0088] It is understood that, in the third aspect mentioned above, the processor can be implemented in hardware or software. When implemented in hardware, the processor can be a logic circuit, integrated circuit, etc.; when implemented in software, the processor can be a general-purpose processor that reads software code stored in memory. Furthermore, there can be one or more processors, and one or more memories. The memory can be integrated with the processor or separated from it. In specific implementations, the memory can be integrated with the processor on the same chip or disposed on different chips. This application does not limit the type of memory or the arrangement of the memory and processor.

[0089] Fourthly, this application provides a possible communication system, which may include the first node mentioned in the first aspect above. The implementation of the relevant functions of the first node can be found in the description mentioned in the first aspect above, and will not be repeated here.

[0090] For example, the number of first nodes can be one or more.

[0091] Fifthly, this application provides a computer program product comprising a computer program or instructions that, when executed on a communication device (or computer), cause the communication device (or computer) to perform the method in any possible implementation of the first aspect described above.

[0092] In a sixth aspect, this application provides a computer-readable storage medium storing a computer program or instructions that, when executed by a communication device (or computer), cause the communication device (or computer) to perform the method in any possible implementation of the first aspect described above.

[0093] In a seventh aspect, this application provides a chip that may include a processor and may also include a memory (or the chip may be coupled to the memory), the chip executing program instructions in the memory to cause the chip to perform the method in any possible implementation of the first aspect above. Here, "coupling" means that two components are directly or indirectly connected to each other, such as coupling can refer to an electrical connection between two components.

[0094] Eighthly, this application also provides a chip system including a processor for supporting a computer device in implementing any of the possible implementations of the first aspect described above. In one possible implementation, the chip system further includes a memory for storing programs and data necessary for the computer device. The chip system may be composed of chips or may include chips and other discrete devices.

[0095] Based on the implementation methods provided in the above aspects, this application can be further combined to provide more implementation methods. Attached Figure Description

[0096] Figure 1 This illustration shows a schematic diagram of a communication protocol architecture for a star-flash communication technology provided in an embodiment of this application.

[0097] Figure 2 An exemplary illustration shows a subcarrier planning diagram with a bandwidth of 20MHz provided in an embodiment of this application;

[0098] Figure 3 An exemplary schematic diagram of a superframe structure provided in an embodiment of this application is shown;

[0099] Figure 4 An exemplary diagram illustrates a network architecture provided in an embodiment of this application;

[0100] Figure 5 An exemplary diagram of a CCA provided in an embodiment of this application is shown;

[0101] Figure 6 An exemplary flowchart of a communication method provided in an embodiment of this application is shown;

[0102] Figure 7a This illustration shows a schematic diagram of a method for segmenting a first contention channel period according to an embodiment of this application;

[0103] Figure 7b This illustration shows another schematic diagram of segmenting the first contention channel period provided in an embodiment of this application;

[0104] Figure 7c This illustration shows another schematic diagram of segmenting the first contention channel period provided in an embodiment of this application;

[0105] Figure 8a This illustration shows a schematic diagram of a method for segmenting a first temporal domain resource set according to an embodiment of this application;

[0106] Figure 8b This illustration shows another schematic diagram of segmenting the first temporal domain resource set provided by an embodiment of this application;

[0107] Figure 8c This illustration shows another schematic diagram of segmenting the first temporal domain resource set provided in an embodiment of this application;

[0108] Figure 9 An exemplary schematic diagram of a possible communication device provided in an embodiment of this application is shown;

[0109] Figure 10 An exemplary schematic diagram of another possible communication device provided in an embodiment of this application is shown. Detailed Implementation

[0110] The embodiments of this application will now be described in detail with reference to the accompanying drawings.

[0111] The following describes the communication system architecture to which the communication method provided in this application is applicable. It should be noted that this description is for the convenience of those skilled in the art and is not intended to limit the scope of protection claimed in this application.

[0112] Currently, the SparkLink Alliance provides the communication protocol architecture for SparkLink communication technology. This protocol architecture can provide access technologies including SparkLink Basic (SLB) access technology and SparkLink Low Energy (SLE) access technology. Figure 1 This is a schematic diagram of the communication protocol architecture of the Starflash communication technology involved in the embodiments of this application. See also... Figure 1 As shown, the protocol architecture includes a basic application layer, a basic service layer, and a StarShine access layer (also known as the access layer). The basic application layer and the basic service layer can be collectively referred to as the StarShine upper layer.

[0113] (1) Basic Application Layer

[0114] The basic application layer includes various general frameworks. In order to enable communication between different devices on different platforms, the basic application layer has defined frameworks for various possible and universally applicable application scenarios.

[0115] (2) Basic Service Layer

[0116] The basic service layer comprises the control plane and the data plane. The control plane primarily provides services such as device discovery and management. The data plane includes channel control data, broadcast data, service management data, real-time data, and reliable data, as well as transmission control adaptation protocols, transmission control protocol / internet protocol (TCP / IP), and transparent transmission protocols.

[0117] (3) Starlight Access Layer

[0118] The StarFlash access layer includes an SLB module and an SLE module. The SLB module can also be referred to as the SLB access layer, and the SLE module as the SLE access layer. The SLB module communicates via SLB access technology. SLB access technology has high bandwidth communication capabilities and can support high-bandwidth services such as wireless screen projection and video calls. It offers high data throughput and fast data transmission speeds during communication. However, SLB access technology has relatively high power consumption and a longer access process.

[0119] In SLB access technology, communication equipment includes grant node devices (G-node devices or G nodes) and terminal node devices (T-node devices or T nodes). A G-node represents a node that sends data scheduling information at the access layer, while a T-node represents a node that receives data scheduling information and sends data according to that information. It is also specified that G-node devices can send broadcasts, and T-node devices can scan for information. During the establishment of an SLB connection between G-node devices and T-node devices, T-node devices are allowed to scan for and discover G-node devices and send connection requests to connect to them.

[0120] For example, when a large-screen device (such as a smart TV) is a G-node device and a mobile phone is a T-node device, the large-screen device will automatically broadcast basic SLB connection information after enabling SLB communication. When the mobile phone needs to cast its screen, it starts scanning for surrounding G-node devices, receiving their broadcast SLB connection information, and displaying the device scan results (such as device model and name) based on the SLB connection information. In response to the user selecting a large-screen device from the scan results, the mobile phone sends a connection request to the large-screen device, thereby establishing an SLB connection with the large-screen device.

[0121] The SLE module communicates via SLE access technology. SLE features low-power communication capabilities; when the SLE module is idle (i.e., not connected to other devices), it can broadcast device information and data on three fixed broadcast channels, enabling rapid discovery and connection, thus saving device power. However, SLE access technology supports relatively small bandwidth and has a slower data transmission speed. Therefore, it is typically used for services with low bandwidth requirements, such as audio playback via wireless headphones or mobile phone control of smart home devices.

[0122] It is understood that the communication protocol architecture shown above is only one possible example, and other possible protocol layers may also be included in the communication protocol architecture. This application embodiment does not limit this.

[0123] based on Figure 1 The communication protocol architecture is illustrated below. The relevant terminology used in StarScan communication technology is explained below. Unless otherwise specified, these explanations are provided to support the meaning of the relevant terminology and to facilitate understanding of the embodiments of this application, and should not be construed as strict limitations on the terminology within the scope of protection claimed in this application.

[0124] (1) Channel bandwidth of Starlight Communication Technology

[0125] The operating frequency band of StarFlash communication technology (such as SLB access technology) can be a low frequency band, such as 5150MHz-5350MHz or 5725MHz-5850MHz, with a minimum channel (or carrier) bandwidth of 20MHz, and supports channel bandwidths of 40 / 60 / 80 / 100 / 160 / 320MHz, which are composed of multiple consecutive 20MHz bandwidths aggregated together. Figure 2 A schematic diagram of subcarrier planning for a 20MHz bandwidth is shown below. Figure 2 As shown, a 20MHz operating bandwidth channel consists of 39 consecutive subcarriers with a subcarrier spacing of 480kHz. The 39 subcarriers are numbered 0, 1, ... 38 in ascending order of their corresponding frequencies. Subcarrier 19 (the 20th subcarrier) is a DC subcarrier and does not carry information. In a 20MHz bandwidth channel, resources are reserved at the lowest and highest frequencies as guard intervals, namely the left guard interval and the right guard interval, respectively. For example, the parameter format for a 20MHz bandwidth channel can be found in Table 1.

[0126] Table 1

[0127] parameter 20MHz fs (sampling frequency) 30.72MHz NDFT (DFT points) 64 ΔF (subcarrier spacing) 480KHz TDFT (symbol period) 1 / 0.480 = 2.08 μs Ts (sampling interval) 1 / 0.03072 = 32.55 ns TGI = 5Ts (Short Protection Interval) 5 / 0.03072 = 162.76 ns TGI = 14Ts (Long Protection Interval) 14 / 0.03072 = 455.73 ns

[0128] In Table 1 above, the DFT point count can be understood as the number of sampling points used in DFT processing or the size of the filter used in DFT processing. The DFT point count can also be replaced by the inverse discrete fourier transform (IDFT) point count, the IDFT size, or the DFT size. The sampling frequency is equal to the product of the DFT point count and the subcarrier spacing. The symbol period is determined based on the subcarrier spacing. The sampling interval, short guard interval, and long / short guard interval are determined based on the sampling frequency. The specific meanings of the parameters shown in Table 1 can be found in existing communication standards and will not be elaborated further.

[0129] (2) Superframe, wireless frame

[0130] StarSpeed ​​communication technology employs Time Division Duplex (TDD). Specifically, StarSpeed ​​communication technology (such as SLB access technology) uses superframes to achieve communication between G-node devices and T-node devices. A superframe can contain 48 radio frames, each consisting of 10 symbols. These symbols can be orthogonal frequency division multiplexing (OFDM) symbols or discrete fourier transformation-spread-OFDM (DFT-s-OFDM) symbols, where DFT-s-OFDM symbols can be understood as a special type of OFDM symbol. Furthermore, the StarSpeed ​​communication system also supports half-superframes containing 24 radio frames. In the parameters for the low-frequency band shown in Table 1 or Table 2, the duration of each symbol (i.e., symbol period) is approximately 2.0833 microseconds (μs), the duration of each radio frame is approximately 20.833 μs, and the duration of each superframe is approximately 1 millisecond (ms).

[0131] Figure 3 This is a schematic diagram of a possible superframe structure. (Example) Figure 3 As shown, this superframe includes radio frames 0 to 47. For example, radio frame 0 includes 10 OFDM symbols, of which 4 are G symbols, 3 are T symbols, 2 are GAP symbols, and 1 is an SG symbol; radio frame 47 includes 10 OFDM symbols, of which 4 are G symbols, 3 are T symbols, 2 are GAP symbols, and 1 is an ST symbol. Here, G symbols represent symbols used by G node devices to send (G link) information to T node devices, T nodes represent symbols used by T nodes to send (T link) information to G nodes, SG / ST represent the symbol resources available for overhead symbols in G / T symbols respectively, and the overhead symbol resources of each radio frame can be flexibly configured to 0, 1, or 2 symbols. GAP is the handover interval between G and T symbols.

[0132] To facilitate understanding of the communication scheme provided in the embodiments of this application, firstly, let's take... Figure 4 The network architecture shown in the diagram is used as an example to illustrate the network architecture applicable to the embodiments of this application. For example... Figure 4 As shown, the network architecture may include multiple communication devices (such as a first communication device and a second communication device), both of which are configured with Figure 1 The intended communication protocol architecture is shown, and it enables communication between the two parties using StarScan communication technology based on this communication protocol architecture.

[0133] The communication devices (such as the first communication device and the second communication device) in this application embodiment can be devices from various fields. For example, in the field of smart homes, there are large-screen devices, artificial intelligence (AI) speakers, high fidelity (HiFi) speakers, temperature sensors, or humidity sensors; or in the field of smart terminals, there are mobile phones, tablets, wearable devices, augmented reality (AR) / virtual reality (VR) devices, laptops, ultra-mobile personal computers (UMPCs), netbooks, or personal digital assistants (PDAs); or in the field of smart manufacturing, there are robotic arms, cameras, joysticks, monitors, logistics vehicles, or smart shelves; or in the field of smart cars, there are in-vehicle devices or other devices. This application embodiment does not limit the specific type of communication device.

[0134] For example, the first communication device is a G-node device and the second communication device is a T-node device; or, the second communication device is a G-node device and the first communication device is a T-node device. In one possible implementation, the role of the communication device can be determined based on its input and output characteristics, including whether the communication device supports inputting information via a mouse, keyboard, or screen, and whether it supports outputting information via a screen or speaker. For example, devices such as mobile phones and tablets, which facilitate user input, typically act as T-nodes and default to acting as T-node devices during SLB connection. Conversely, devices such as large-screen devices and smart speakers, which are less convenient for user input, typically act as G-nodes and default to acting as G-node devices during SLB connection.

[0135] It is understood that the communication method provided in this application embodiment is applicable to communication between G node devices and T node devices, and can also be applied to communication between G node devices or between T node devices, without any specific limitation.

[0136] The network architecture and business scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0137] Although the embodiments of this application are primarily illustrated using the deployment of a Starlight communication network, particularly an SLB communication network, those skilled in the art will readily understand that the various aspects involved in the embodiments of this application can be extended to other networks employing various standards or protocols, such as high-performance radio local area networks (HIPERLANs), wireless wide area networks (WWANs), wireless personal area networks (WPANs), or other networks now known or developed in the future. Therefore, regardless of the coverage area and wireless access protocol used, the various aspects provided in the embodiments of this application can be applied to any suitable wireless network.

[0138] The technical solutions of this application embodiment can also be applied to various communication systems or networks, such as: WLAN communication systems, Wireless Fidelity (Wi-Fi) systems, Long Term Evolution (LTE) systems, LTE Frequency Division Duplex (FDD) systems, LTE TDD systems, Universal Mobile Telecommunication System (UMTS) systems, Worldwide Interoperability for Microwave Access (WiMAX) communication systems, 5th Generation (5G) systems or New Radio (NR) systems, Future Communications systems, Internet of Things (IoT) networks, or Vehicle-to-Everything (V2X) networks, etc. The communication systems applicable to this application described above are merely illustrative examples; the application is not limited to these examples. These examples are uniformly described here and will not be repeated below.

[0139] This application supports IEEE protocols, such as IEEE 802.11be / Wi-Fi 7 / EHT, IEEE 802.11bn / UHR / Wi-Fi 8, IEEE Integrated mmWave / IMMW, IEEE 802.15 / UWB, or IEEE 802.11bf / sensing; this application may also support Spark Link / NearLink standard protocols.

[0140] Currently, nodes operating in unlicensed frequency bands using WiFi (or Bluetooth or cellular) technology compete for channels using corresponding contention mechanisms, thus enabling communication via the acquired channels. However, if nodes operating in unlicensed frequency bands employ StarSignal communication technology, a contention mechanism suitable for StarSignal communication needs to be designed.

[0141] If nodes operating in unlicensed frequency bands use Starlink communication technology (such as SLB access technology), they may face issues such as multi-domain coexistence (e.g., multiple G nodes operating on the same channel or in the same area) and multi-system coexistence (e.g., nodes using Starlink communication technology sharing the same channel with nodes using WiFi technology, or nodes using Starlink communication technology and nodes using WiFi technology located in the same area). Based on national regulations for relevant frequency bands (e.g., 2.4GHz or 5GHz), nodes from different domains or systems need to compete for channels to communicate. Therefore, a node using Starlink communication technology needs to compete for a channel with other nodes operating on the same channel (or in the same area) to achieve its own communication, or it needs to compete for a channel with nodes operating in unlicensed frequency bands using other system technologies (such as WiFi technology) to achieve its own communication.

[0142] The regulations require that:

[0143] a. Before each channel is occupied, a clear channel assessment (CCA) must be performed. For example, depending on the frequency band and equipment type, the assessment time should be no less than 16 microseconds (µs) or 25µs.

[0144] b. After occupying the channel for a period of time, the channel needs to be released first, and then the channel can be re-competed for.

[0145] For example, consider a node using Starlight Communication technology undergoing random access via a frame-based channel contention mechanism in a cellular network. Here, the frame-based mechanism refers to: Figure 5 As shown, a Channel Acceptance Detection (CCA) is performed before each fixed frame period (FFP) (regulations require the fixed frame period to be no less than 1ms and no more than 10ms). If the channel assessment result obtained from the CCA before a certain FFP is "channel idle," the node can occupy the channel to transmit data within that FFP. For example, the node can use one channel occupancy time (COT) within that FFP to transmit data. If the channel assessment result obtained from the CCA before a certain FFP is "channel busy," the node will not occupy the channel to transmit data within that FFP, and will perform CCA again after waiting for one FTP (Failed Transfer Protocol) period. An idle period is maintained between the COT within the current FFP and the start of the next FFP. For example, regulations require the idle period to be no less than 5% of the COT and no less than 100µs. If the channel assessment result obtained from the CCA before a certain FFP is "channel busy," the node will be silent (or suspended) (mute after failed CCA).

[0146] However, nodes using the StarFlash communication technology and employing a frame-based mechanism for random access have the following problems:

[0147] (1) An FFP has only one chance to compete for a channel. If nodes using StarFlash communication technology coexist with nodes using WiFi technology, the nodes using StarFlash communication technology may never be able to compete for a channel because their channel competition capability is lower than that of the nodes using WiFi technology.

[0148] (2) When nodes using StarFlash communication technology are located in (or in) a multi-domain coexistence scenario, the frame-based mechanism cannot effectively achieve multi-domain coexistence. Specifically, for the frame-based mechanism, the CCA time of different domains is the same, so they cannot detect each other's channel occupation, which will lead to continuous collisions.

[0149] For example, consider a node using StarSpark communication technology randomly accessing the WiFi network using a contention-based channel mechanism (Carrier Sense Multiple Access with Collision Avoidance, CSMA / CA). The CSMA / CA mechanism means that when a node needs to send data, it must first compete for the channel. Before competing for the channel, the node selects a random number within the contention window as a backoff counter value. Then, the node continuously checks if the channel is idle. For example, the node checks the channel idle every time a slot (e.g., a 9µs slot) has elapsed. If the channel is idle, the node decrements the backoff counter value by 1; if the channel is busy, the backoff counter value remains unchanged. The node continues to check the channel idle until the backoff counter value equals 0, at which point the node competes for the channel and uses it to send data. However, since the resource scheduling method of nodes using StarSpark communication technology is a continuous timing method (the timing used by nodes using StarSpark communication technology during communication is configured with time-domain resource units (such as superframes) as the granularity, and the information transmission resource configuration is also designed in a continuous manner), it is very different from the CSMA / CA mechanism in WiFi technology. Therefore, the implementation logic and timing of StarSpark communication technology need to be modified very much.

[0150] In view of this, this application provides a communication method for providing a competitive channel mechanism suitable for StarSignal communication technology, which enables nodes using StarSignal communication technology (such as nodes using StarSignal communication technology operating in unlicensed frequency bands) to compete for the channel with a fair probability.

[0151] The specific implementation of the communication method in the embodiments of this application will be described in detail below with reference to the accompanying drawings.

[0152] Figure 6 This illustration shows a flowchart of a communication method provided in an embodiment of this application. The method is applicable to... Figure 4 The network architecture shown is as intended. It is understandable that... Figure 6 The illustrated communication method uses the first node as the executing entity as an example, but this application does not limit the executing entity in the interactive illustration. It should be understood that, unless otherwise specified, "first node" in this application can refer to the first node itself, a module within the first node (such as a processor, processing unit, chip system, circuit, or chip), or a logical node, logical module, or software capable of implementing all or part of the functions of the first node. For example, the first node could be... Figure 4 The first communication device shown (e.g., a G-node device).

[0153] like Figure 6 As shown, the method includes:

[0154] Step 601: The first node determines M measurement time-domain resources.

[0155] Among them, M measurement time-domain resources (also called measurement resources) are used to measure the channel state (which can be understood as measuring or detecting the channel's busy / idle state). Here, M is an integer greater than 1. It is understood that the M measurement time-domain resources do not overlap.

[0156] In this embodiment, the aforementioned M measurement time-domain resources can be determined by the first node before entering the first contention channel period. That is, the aforementioned M measurement time-domain resources can be predetermined by the first node, eliminating the need to temporarily adjust the state of certain time-domain resources (e.g., transmit or receive states) based on channel state measurement results after entering the first contention channel period. The M measurement time-domain resources are located within the first contention channel period. For example, before the first contention channel period, the first node can determine which time-domain resources within the time-domain resource units included in the first contention channel period are configured as receive states for measurement, and which time-domain resources are configured as transmit states for transmitting signals when in an occupied state. This eliminates the need to temporarily change (or adjust) the transmit or receive states of the time-domain resources based on channel state measurement results, making it easy to implement.

[0157] For example, any one of the M measurement time-domain resources may include one or more radio frames, or one or more time slots, or one or more symbols (such as OFDM symbols). Optionally, any of the above measurement time-domain resources may also include a portion of a radio frame, or a portion of a time slot, or at least one radio frame and / or a portion of at least one radio frame from a plurality of consecutive radio frames (e.g., the end portion of one radio frame and the beginning portion of another radio frame in two consecutive radio frames, or the beginning portion of one radio frame and another radio frame in two consecutive radio frames, or the end portion of one radio frame and another radio frame in two consecutive radio frames), or at least one time slot and / or a portion of at least one time slot from a plurality of consecutive time slots (e.g., the end portion of one time slot and the beginning portion of another time slot in two consecutive time slots, or the beginning portion of one time slot and another time slot in two consecutive time slots, or the end portion of one time slot and another time slot in two consecutive time slots).

[0158] The following describes several possible ways to determine M.

[0159] Method 1: M can be pre-configured, such as by an upper layer. Alternatively, M can be pre-defined, such as by a protocol.

[0160] For example, the value of M can be a preset value, such as M being 2, which is simple and easy to implement.

[0161] Method 2: The first node determines M based on at least one channel state measurement result prior to the first contention channel period and / or the communication performance of the first node prior to the first contention channel period.

[0162] The following examples illustrate the implementation process of the first node determining M based on at least one channel state measurement result prior to the first contention channel period and / or the first node's communication performance prior to the first contention channel period.

[0163] Example 1: The first node determines M based on at least one channel state measurement result prior to the first contention channel period.

[0164] In this embodiment, the first node can statistically analyze at least one channel state measurement result (also referred to as channel state result, channel busy / idle result, or channel result) prior to the first contention channel period to determine a first quantity or a first proportion. The first quantity is the number of channel state measurement results where the channel state measurement result is "channel busy" among the at least one channel state measurement result, and the first proportion is the percentage of channel state measurement results where the channel state measurement result is "channel busy" among the at least one channel state measurement result.

[0165] For example, at least one channel state measurement result may be a channel state measurement result obtained by the first node on at least one measurement time domain resource included in a contention channel period before the first contention channel period, or at least one channel state measurement result may be a channel state measurement result obtained by the first node on at least one measurement time domain resource included in multiple contention channel periods before the first contention channel period.

[0166] In one example, if the first quantity is greater than a first quantity threshold or the first proportion is greater than a first proportion threshold, the first node can determine that M is a small integer value during the first contention channel period. This improves the randomness of the measured resource location and helps reduce collisions. For example, let's say M is 5 before the first contention channel period. When the first quantity is greater than the first quantity threshold or the first proportion is greater than the first proportion threshold, the first node can adjust the value of M from 5 to 2, or it can adjust the value of M from 5 to another integer value smaller than 5. That is, during the first contention channel period, M is 2, or M is another integer value smaller than 5. It is understandable that when the first quantity is greater than the first quantity threshold or the first proportion is greater than the first proportion threshold, the channel can be considered to be relatively congested. By selecting an integer value that conforms to the actual channel conditions as the value of M (for example, selecting a small integer value as the value of M), a reasonable number of measurement time-domain resources can be obtained for measuring the channel state. This helps to reduce the probability of conflict caused by the possible same time-domain location of measurement time-domain resources of different nodes, and can control the probability of conflict caused by the possible same time-domain location of all measurement time-domain resources of different nodes within a reasonable range.

[0167] In another example, if the first quantity is less than a first quantity threshold or the first proportion is less than a first proportion threshold, the first node can determine that M is a large integer value during the first contention channel period. For example, continuing with the example that M is 5 before the first contention channel period, when the first quantity is less than the first quantity threshold or the first proportion is less than the first proportion threshold, the first node can adjust the value of M from 5 to 6, or the first node can adjust the value of M from 5 to another integer value greater than 5. That is, during the first contention channel period, M is 6, or M is another integer value greater than 5. Optionally, when the first quantity is less than the first quantity threshold or the first proportion is less than the first proportion threshold, the first node can also determine that the value of M remains 5 during the first contention channel period. It is understandable that when the first quantity is less than the first quantity threshold or the first proportion is less than the first proportion threshold, the channel can be considered to be relatively uncongested (which can be understood as the channel being relatively idle). By selecting an integer value that conforms to the actual channel conditions as the value of M (for example, selecting a larger integer value as the value of M), a reasonable number of measurement time-domain resources can be obtained to measure the channel state, which helps to increase the probability of the first node competing for the channel (which can be understood as the first node having more opportunities to compete for the channel, and the probability of competing for the channel also increasing).

[0168] In another example, if the first quantity equals the first quantity threshold or the first proportion equals the first proportion threshold, then the first node can determine that in the first contention channel period, the value of M can be a large integer value, or it can be a small integer value, or it can remain the original value (for example, the value of M is still the value before the first contention channel period).

[0169] Example 2: The first node determines M based on its communication performance before the first contention channel period.

[0170] In this embodiment, the first node can determine its communication performance (such as packet loss rate or block error rate) before the first contention channel period. Then, the first node can determine M based on its communication performance before the first contention channel period.

[0171] For example, taking packet loss rate as a communication performance indicator, the first node can statistically analyze the packet loss situation during the communication state before the first contention channel period to determine the first packet loss rate.

[0172] In one example, if the first packet loss rate is greater than the first threshold, the first node can determine that M is a small integer value during the first contention channel period. For example, continuing with the example that M is 5 before the first contention channel period, when the first packet loss rate is greater than the first threshold, the first node can adjust the value of M from 5 to 2, or the first node can adjust the value of M from 5 to another integer value smaller than 5. That is to say, during the first contention channel period, M is 2, or M is another integer value smaller than 5. It can be understood that when the first packet loss rate is greater than the first threshold, the channel can be considered relatively congested. By selecting an integer value that conforms to the actual channel conditions as the value of M (for example, selecting a small integer value as the value of M), a reasonable number of measurement time-domain resources can be obtained for measuring the channel state. This helps to reduce the probability of collisions caused by the possible identical time-domain locations of measurement time-domain resources of different nodes, and can control the probability of collisions caused by the possible identical time-domain locations of all measurement time-domain resources of different nodes within a reasonable range.

[0173] In another example, if the first packet loss rate is less than the first threshold, the first node can determine that M is a large integer value during the first contention channel period. For example, continuing with the example that M is 5 before the first contention channel period, when the first packet loss rate is less than the first threshold, the first node can adjust the value of M from 5 to 6, or the first node can adjust the value of M from 5 to another integer value greater than 5. That is, during the first contention channel period, M is 6, or M is another integer value greater than 5. Optionally, when the first packet loss rate is less than the first threshold, the first node can also determine that the value of M remains 5 during the first contention channel period. It is understandable that when the first packet loss rate is less than the first threshold, the channel can be considered to be relatively uncongested (which can be understood as the channel being relatively idle). By selecting an integer value that matches the actual channel conditions as the value of M (for example, selecting a large integer value as the value of M), a reasonable amount of measurement time-domain resources can be obtained to measure the channel state, which helps to increase the probability of the first node competing for the channel (which can be understood as the first node having more opportunities to compete for the channel, and the probability of competing for the channel also increasing).

[0174] In another example, if the first packet loss rate equals the first threshold, then the first node can determine that in the first contention channel period, the value of M can be a large integer value, or it can be a small integer value, or it can remain the original value (for example, the value of M is still the value before the first contention channel period).

[0175] Example 3: The first node determines M based on at least one channel state measurement result prior to the first contention channel period and the communication performance of the first node prior to the first contention channel period.

[0176] In this embodiment, the first node can determine its communication performance (e.g., packet loss rate or block error rate) before the first contention channel period, and can statistically analyze at least one channel state measurement result of the first node before the first contention channel period to determine a first quantity or a first proportion. Then, the first node can determine M based on the first quantity (or first proportion) and its communication performance before the first contention channel period.

[0177] For example, taking the packet loss rate as the first proportion, the first node can determine the first packet loss rate by statistically analyzing the packet loss situation of the first node in the communication state before the first contention channel period, and can determine the first proportion by statistically analyzing at least one channel state measurement result of the first node before the first contention channel period.

[0178] In one example, if the first proportion is greater than a first proportion threshold and the first packet loss rate is greater than a first threshold, the first node can determine that M is a small integer value during the first contention channel period. For example, continuing with the example that M is 5 before the first contention channel period, when the first proportion is greater than the first proportion threshold and the first packet loss rate is greater than the first threshold, the first node can adjust the value of M from 5 to 2, or the first node can adjust the value of M from 5 to another integer value smaller than 5. That is to say, during the first contention channel period, M is 2, or M is another integer value smaller than 5. It is understandable that when the first proportion is greater than the first proportion threshold and the first packet loss rate is greater than the first threshold, the channel can be considered to be relatively congested. By selecting an integer value that conforms to the actual channel conditions as the value of M (for example, selecting a small integer value as the value of M), a reasonable number of measurement time-domain resources can be obtained for measuring the channel state. This helps to reduce the probability of conflict caused by the possible same time-domain location of measurement time-domain resources of different nodes, and can control the probability of conflict caused by the possible same time-domain location of all measurement time-domain resources of different nodes within a reasonable range.

[0179] In another example, if the first proportion is less than the first proportion threshold and the first packet loss rate is less than the first threshold, the first node can determine that M is a large integer value during the first contention channel period. For example, continuing with the example that M is 5 before the first contention channel period, when the first proportion is less than the first proportion threshold and the first packet loss rate is less than the first threshold, the first node can adjust the value of M from 5 to 6, or the first node can adjust the value of M from 5 to another integer value greater than 5. That is, during the first contention channel period, M is 6, or M is another integer value greater than 5. Optionally, when the first proportion is less than the first proportion threshold and the first packet loss rate is less than the first threshold, the first node can also determine that the value of M remains 5 during the first contention channel period. It is understandable that when the first proportion is less than the first proportion threshold and the first packet loss rate is less than the first threshold, the channel can be considered to be relatively uncongested (which can be understood as the channel being relatively idle). By selecting an integer value that conforms to the actual channel conditions as the value of M (for example, selecting a large integer value as the value of M), a reasonable number of measurement time-domain resources can be obtained to measure the channel state, which helps to increase the probability of the first node competing for the channel (which can be understood as, since the number of measurement time-domain resources is relatively large in a channel competition period, the first node has more opportunities to compete for the channel in a channel competition period, and its ability to compete for the channel is stronger, thus increasing the probability of competing for the channel).

[0180] In another example, if the first proportion equals the first proportion threshold and the first packet loss rate equals the first threshold, then the first node can determine that in the first contention channel period, the value of M can be a large integer value, or it can be a small integer value, or it can remain the original value (for example, the value of M is still the value before the first contention channel period).

[0181] Understandably, when the first proportion is greater than the first proportion threshold and the first packet loss rate is less than or equal to the first threshold, the channel can be considered relatively busy (or relatively congested). The method for the first node to determine M can be referred to the relevant description in Example 1 above, and will not be repeated here. When the first proportion is less than or equal to the first proportion threshold and the first packet loss rate is greater than the first threshold, the channel can be considered relatively congested. The method for the first node to determine M can be referred to the relevant description in Example 2 above, and will not be repeated here.

[0182] It is understood that the above content is only an example of several ways to determine M. The first node can also determine M in other ways, which will not be listed here.

[0183] The following describes several possible ways to determine the temporal location of the above M measurement time-domain resources.

[0184] Implementation Method 1: The time-domain location (also referred to as position) of at least one of the above M measurement time-domain resources is determined by the first node based on (or according to) a random selection method (or random selection algorithm).

[0185] It is understandable that in multi-domain coexistence scenarios (such as two G nodes competing for the same channel), if the time-domain positions of all measurement time-domain resources of the two G nodes are the same, the two G nodes cannot avoid each other when competing for the same channel, resulting in channel contention collisions and thus continuous conflicts. This application's embodiment designs a method where the time-domain position of at least one of the M measurement time-domain resources is determined based on a random selection method (or random selection algorithm). This randomizes the time-domain positions of the measurement time-domain resources, helping to reduce the probability that the time-domain positions of all measurement time-domain resources of multiple G nodes (such as the two G nodes mentioned above) are the same. This allows multiple G nodes to achieve multi-domain coexistence by competing for the channel.

[0186] For example, taking the value of M as 3 and the three measurement time-domain resources as measurement time-domain resource a1, measurement time-domain resource a2 and measurement time-domain resource a3, the following examples illustrate the implementation process of the first node determining the time-domain position of at least one measurement time-domain resource among the M measurement time-domain resources based on a random selection method.

[0187] Example 1: Taking the location of one of the three measurement time-domain resources (e.g., measurement time-domain resource a1) determined based on a selection method as an example. The first node can determine the time-domain location of measurement time-domain resource a1 based on a random selection method. Then, the first node can determine measurement time-domain resource a1 based on its time-domain location and size. It is understood that for measurement time-domain resources a2 and a3, the first node can determine their time-domain locations according to a preset (or predefined or pre-configured) method. Optionally, the time-domain locations of measurement time-domain resources a2 and a3 can also be selected using a non-random selection method. For example, the preset method for determining the location of measurement time-domain resources can pre-set the time-domain location of one or more of the M measurement time-domain resources. For instance, the time-domain locations of measurement time-domain resources a2 and a3 are pre-set. For example, taking a first contention channel period that includes a superframe as an example, the time-domain location of measurement time-domain resource a2 is within radio frame 15 included in the superframe, and the time-domain location of measurement time-domain resource a2 is within radio frame 30 included in the superframe.

[0188] Example 2: Taking the example that the time-domain locations of the three measurement time-domain resources mentioned above are all determined based on a random selection method. The first node can determine the time-domain locations of measurement time-domain resources a1, a2, and a3 respectively based on a random selection method. After obtaining the time-domain location of measurement time-domain resource a1, the first node can determine measurement time-domain resource a1 based on its time-domain location and size. After obtaining the time-domain location of measurement time-domain resource a2, the first node can determine measurement time-domain resource a2 based on its time-domain location and size. After obtaining the time-domain location of measurement time-domain resource a3, the first node can determine measurement time-domain resource a3 based on its time-domain location and size.

[0189] Implementation Method 2: The time-domain locations of the above M measurement time-domain resources are determined by the first node based on a non-random selection method.

[0190] For example, continuing with M being 3, and the three measurement time-domain resources being measurement time-domain resource a1, a2, and a3, the first node can determine the time-domain positions of measurement time-domain resources a1, a2, and a3 respectively based on a non-random selection method. After obtaining the time-domain position of measurement time-domain resource a1, the first node can determine measurement time-domain resource a1 based on its time-domain position and size. After obtaining the time-domain position of measurement time-domain resource a2, the first node can determine measurement time-domain resource a2 based on its time-domain position and size. After obtaining the time-domain position of measurement time-domain resource a3, the first node can determine measurement time-domain resource a3 based on its time-domain position and size.

[0191] For example, the non-random selection method may be that the first node sequentially determines the time domain positions of the above M measurement time domain resources according to the order of the time domain resources included in a continuous time domain resource used to select measurement time domain resources within the first competition channel period, or the first node may determine the time domain positions of the above M measurement time domain resources from a continuous time domain resource used to select measurement time domain resources at equal time intervals.

[0192] Next, we will introduce the implementation process of determining the M measurement time-domain resources of the first node through the following possible implementation methods.

[0193] Method 1: The first node selects M time-domain resources as measurement time-domain resources during the first contention channel period.

[0194] The first contention channel period can contain q time-domain resource units, where q is an integer greater than or equal to 1.

[0195] For example, a time-domain resource unit can be one of the following: a radio frame, a time slot, a superframe, a transmission time interval (TTI), or other fixed or configurable periods defined by the protocol.

[0196] The following describes several possible ways to determine q.

[0197] Option a: q can be pre-configured, such as by an upper layer. Alternatively, q can also be pre-defined, such as by a protocol.

[0198] For example, the value of q can be a preset value, such as q being 1, which is simple and easy to implement.

[0199] Method b: The first node determines q based on at least one channel state measurement result prior to the first contention channel period and / or the communication performance of the first node prior to the first contention channel period.

[0200] The following examples illustrate the implementation process of the first node determining q based on at least one channel state measurement result prior to the first contention channel period and / or the communication performance of the first node prior to the first contention channel period.

[0201] Example a: The first node determines q based on at least one channel state measurement result prior to the first contention channel period.

[0202] In this embodiment of the application, the first node can statistically analyze at least one channel state measurement result prior to the first contention channel period to determine a second quantity or a second proportion. The second quantity is the number of channel state measurement results in which the channel state measurement result is "channel busy" among the at least one channel state measurement results, and the second proportion is the percentage of channel state measurement results in which the channel state measurement result is "channel busy" among the at least one channel state measurement results.

[0203] For example, at least one channel state measurement result can be a channel state measurement result obtained by the first node on at least one measurement time-domain resource included in a contention channel period prior to the first contention channel period, or at least one channel state measurement result can be a channel state measurement result obtained by the first node on at least one measurement time-domain resource included in multiple contention channel periods prior to the first contention channel period. Optionally, the channel state measurement result on each measurement time-domain resource in at least one measurement time-domain resource can be obtained by measuring on some resources in that measurement time-domain resource, or it can be obtained by measuring on all resources in that measurement time-domain resource. For example, take a certain measurement time-domain resource (such as measurement time-domain resource 01) in at least one measurement time-domain resource. If a portion of the resources in measurement time-domain resource 01 are used to measure channel state, the remaining resources in measurement time-domain resource 01 can be used by the node to perform some internal processing operations after measuring channel busy / idle conditions (for example, it can be used by the node to determine the state of the first node on the time-domain resources located after measurement time-domain resource 01 (for example, the state of the first node on the time-domain resources located after measurement time-domain resource 01 is occupied or released)), or it can be used by the node to send signals.

[0204] In one example, if the second quantity is greater than a second quantity threshold or the second proportion is greater than a second proportion threshold, the first node can determine that q takes the value of a large integer during the first contention channel period. For example, let's assume that q is 1 before the first contention channel period. When the second quantity is greater than the second quantity threshold or the second proportion is greater than the second proportion threshold, the first node can adjust the value of q from 1 to 2, or the first node can adjust the value of q from 1 to another integer value greater than 1. That is to say, during the first contention channel period, q takes the value of 2, or q takes the value of another integer value greater than 1. It is understandable that when the second quantity is greater than the second quantity threshold or the second proportion is greater than the second proportion threshold, the channel can be considered to be relatively congested. By selecting an integer value that conforms to the actual channel conditions as the value of q (for example, selecting a larger integer value as the value of q), the selection range of measurement time-domain resources can be expanded, thereby obtaining a more reasonable selection range of measurement time-domain resources. This helps to reduce the probability of conflicts caused by the possible same time-domain location of measurement time-domain resources of different nodes, and can control the probability of conflicts caused by the possible same time-domain location of all measurement time-domain resources of different nodes within a reasonable range.

[0205] In another example, if the second quantity is less than a second quantity threshold or the second proportion is less than a second proportion threshold, the first node can determine that q takes the value of a small integer during the first contention channel period. For example, let's say q is 3 before the first contention channel period. When the second quantity is less than the second quantity threshold or the second proportion is less than the second proportion threshold, the first node can adjust the value of q from 3 to 2, or the first node can adjust the value of q from 3 to another integer value smaller than 3. That is, during the first contention channel period, q takes the value of 2, or q takes the value of another integer value smaller than 3. Optionally, when the second quantity is less than the second quantity threshold or the second proportion is less than the second proportion threshold, the first node can also determine that the value of q remains 3 during the first contention channel period. It is understandable that when the second quantity is less than the second quantity threshold or the second proportion is less than the second proportion threshold, the channel can be considered to be relatively uncongested (which can be understood as the channel being relatively idle). By selecting an integer value that conforms to the actual channel conditions as the value of q (for example, selecting a small integer value as the value of q), it can be ensured that the first contention channel period contains a reasonable amount of time domain resources, which helps to avoid wasting time domain resources.

[0206] In another example, if the second quantity equals the second quantity threshold or the second proportion equals the second proportion threshold, then the first node can determine that in the first contention channel period, the value of q can be a large integer value, or it can be a small integer value, or it can remain the original value (for example, the value of q remains the value before the first contention channel period).

[0207] Example b: The first node determines q based on its communication performance prior to the first contention channel period.

[0208] In this embodiment, the first node can determine its communication performance (such as packet loss rate or block error rate) before the first contention channel period. Then, the first node can determine q based on its communication performance before the first contention channel period.

[0209] For example, taking packet loss rate as a communication performance indicator, the first node can statistically analyze the packet loss situation during the communication state before the first contention channel period to determine the second packet loss rate.

[0210] In one example, if the second packet loss rate is greater than the second threshold, the first node can determine that the value of q is a relatively large integer value during the first contention channel period. For example, continuing with the example that q is 1 before the first contention channel period, when the second packet loss rate is greater than the second threshold, the first node can adjust the value of q from 1 to 2, or the first node can adjust the value of q from 1 to other integer values ​​greater than 1. That is to say, during the first contention channel period, the value of q is 2, or the value of q is other integer values ​​greater than 1. It can be understood that when the second packet loss rate is greater than the second threshold, the channel can be considered relatively congested. By selecting an integer value that conforms to the actual channel conditions as the value of q (for example, selecting a relatively large integer value as the value of q), the selection range of measurement time-domain resources can be expanded, thereby obtaining a more reasonable selection range of measurement time-domain resources. This helps to reduce the probability of conflicts caused by the possible identical time-domain positions of measurement time-domain resources of different nodes, and can control the probability of conflicts caused by the possible identical time-domain positions of all measurement time-domain resources of different nodes within a reasonable range.

[0211] In another example, if the second packet loss rate is less than the second threshold, the first node can determine that the value of q is a small integer value during the first contention channel period. For example, let's say the value of q is 3 before the first contention channel period. When the second packet loss rate is less than the second threshold, the first node can adjust the value of q from 3 to 2, or it can adjust the value of q from 3 to another integer value smaller than 3. That is, during the first contention channel period, the value of q is 2, or the value of q is another integer value smaller than 3. Optionally, when the second packet loss rate is less than the second threshold, the first node can also determine that the value of q remains 3 during the first contention channel period. It can be understood that when the second packet loss rate is less than the second threshold, the channel can be considered to be less congested (which can be understood as the channel being relatively idle). By selecting an integer value that conforms to the actual channel conditions as the value of q (for example, selecting a small integer value as the value of q), it can be ensured that the first contention channel period contains a reasonable amount of time-domain resources, which helps to avoid wasting time-domain resources.

[0212] In another example, if the second packet loss rate equals the second threshold, then the first node can determine that in the first contention channel period, the value of q can be a large integer value, or it can be a small integer value, or it can remain the original value (for example, the value of q is still the value before the first contention channel period).

[0213] Example c: The first node determines q based on at least one channel state measurement result prior to the first contention channel period and the communication performance of the first node prior to the first contention channel period.

[0214] In this embodiment, the first node can determine its communication performance (e.g., packet loss rate or block error rate) before the first contention channel period, and can statistically analyze at least one channel state measurement result of the first node before the first contention channel period to determine a second quantity or a second proportion. Then, the first node can determine q based on the second quantity (or second proportion) and its communication performance before the first contention channel period.

[0215] For example, taking the second ratio as the communication performance measure of packet loss rate, the first node can determine the second packet loss rate by statistically analyzing the packet loss situation of the first node in the communication state before the first contention channel period, and can also determine the second ratio by statistically analyzing at least one channel state measurement result of the first node before the first contention channel period.

[0216] In one example, if the second ratio is greater than the second ratio threshold and the second packet loss rate is greater than the second threshold, the first node can determine that q takes the value of a large integer during the first contention channel period. For example, continuing with the example that q is 1 before the first contention channel period, when the second ratio is greater than the second ratio threshold and the second packet loss rate is greater than the second threshold, the first node can adjust the value of q from 1 to 2, or the first node can adjust the value of q from 1 to other integer values ​​greater than 1. That is to say, during the first contention channel period, q takes the value of 2, or q takes the value of other integer values ​​greater than 1. It is understandable that when the second proportion is greater than the second proportion threshold and the second packet loss rate is greater than the second threshold, the channel can be considered to be relatively congested. By selecting an integer value that conforms to the actual channel conditions as the value of q (for example, selecting a small integer value as the value of q), a reasonable number of measurement time-domain resources can be obtained for measuring the channel state. This helps to reduce the probability of conflicts caused by the possible identical time-domain locations of measurement time-domain resources of different nodes, and can control the probability of conflicts caused by the possible identical time-domain locations of all measurement time-domain resources of different nodes within a reasonable range.

[0217] In another example, if the second proportion is less than the second proportion threshold and the second packet loss rate is less than the second threshold, the first node can determine that q takes the value of a small integer during the first contention channel period. For example, continuing with the example that q is 3 before the first contention channel period, when the second proportion is less than the second proportion threshold and the second packet loss rate is less than the second threshold, the first node can adjust the value of q from 3 to 2, or the first node can adjust the value of q from 3 to other integer values ​​smaller than 3. That is, during the first contention channel period, q takes the value of 2, or q takes the value of other integer values ​​smaller than 3. Optionally, when the second proportion is less than the second proportion threshold and the second packet loss rate is less than the second threshold, the first node can also determine that the value of q remains 3 during the first contention channel period. It is understandable that when the second proportion is less than the second proportion threshold and the second packet loss rate is less than the second threshold, the channel can be considered to be relatively uncongested (which can be understood as the channel being relatively idle). By selecting an integer value that conforms to the actual channel conditions as the value of q (for example, selecting a small integer value as the value of q), it can be ensured that the first contention channel period contains a reasonable amount of time domain resources, which helps to avoid wasting time domain resources.

[0218] In another example, if the second proportion equals the second proportion threshold and the second packet loss rate equals the second threshold, then the first node can determine that in the first contention channel period, the value of q can be a large integer value, or it can be a small integer value, or it can remain the original value (for example, the value of q remains the value before the first contention channel period).

[0219] Understandably, when the second proportion is greater than the second proportion threshold and the second packet loss rate is less than or equal to the second threshold, the channel can be considered relatively busy (or relatively congested). The method by which the first node determines q can be referred to the relevant description in Example a above, and will not be repeated here. When the second proportion is less than or equal to the second proportion threshold and the second packet loss rate is greater than the second threshold, the channel can be considered relatively congested. The method by which the first node determines q can be referred to the relevant description in Example b above, and will not be repeated here.

[0220] It is understood that the above content is only an example of several ways to determine q. The first node can also determine q in other ways, which will not be listed here.

[0221] The following examples illustrate the process by which the first node selects M time-domain resources as measurement time-domain resources during the first contention channel period.

[0222] Example 1: Taking a first contention channel period comprising one superframe, with M equal to 5, and a measurement time-domain resource being the size of one radio frame as an example. A superframe can include 48 radio frames. The first node can randomly (or non-randomly) select the time-domain positions of 5 radio frames from the 48 radio frames as the time-domain positions of the measurement time-domain resources. Then, based on the size of the measurement time-domain resources and the time-domain positions of the 5 measurement time-domain resources, the first node can determine 5 measurement time-domain resources (e.g., measurement time-domain resource 1, measurement time-domain resource 2, measurement time-domain resource 3, measurement time-domain resource 4, and measurement time-domain resource 5). The 5 radio frames (i.e., the 5 measurement time-domain resources) do not overlap.

[0223] For example, taking a superframe included in the first contention channel period as an example. Figure 3 Taking a superframe as an example, the first node can randomly (or non-randomly) select the temporal positions of 5 radio frames out of 48 radio frames as the temporal positions of the measurement temporal resources. For example, the temporal position of radio frame 5 is used as the temporal position of measurement temporal resource 1, the temporal position of radio frame 16 is used as the temporal position of measurement temporal resource 2, the temporal position of radio frame 25 is used as the temporal position of measurement temporal resource 3, the temporal position of radio frame 35 is used as the temporal position of measurement temporal resource 4, and the temporal position of radio frame 45 is used as the temporal position of measurement temporal resource 5. When the size of a measurement temporal resource is one radio frame, the first node can determine radio frame 5 as measurement temporal resource 1 based on the temporal position of measurement temporal resource 1. The first node can determine radio frame 16 as measurement temporal resource 2 based on the temporal position of measurement temporal resource 2. The first node can determine radio frame 25 as measurement temporal resource 3 based on the temporal position of measurement temporal resource 3. The first node can determine radio frame 35 as measurement time-domain resource 4 based on the time-domain location of measurement time-domain resource 4. The first node can determine radio frame 35 as measurement time-domain resource 5 based on the time-domain location of measurement time-domain resource 5.

[0224] Optionally, when the size of a measurement time-domain resource is two consecutive radio frames, the first node can also randomly (or non-randomly) select the time-domain positions of two consecutive radio frames from the 48 radio frames as the time-domain positions of one measurement time-domain resource, thereby randomly (or non-randomly) selecting the time-domain positions of 10 radio frames as the time-domain positions of 5 measurement time-domain resources. Each of the 5 measurement time-domain resources includes the time-domain positions of two consecutive radio frames. The 10 radio frames do not overlap, which can be understood as the 5 measurement time-domain resources not overlapping. Then, when the size of a measurement time-domain resource is two consecutive radio frames, the first node can determine each measurement time-domain resource based on its size and the time-domain positions of each of the 5 measurement time-domain resources.

[0225] Example 2: Taking a first contention channel period consisting of one radio frame, with M equal to 2, and a measurement time-domain resource having a length of one OFDM symbol as an example. A radio frame may include 10 OFDM symbols. The first node can select (or randomly select) the time-domain positions of two OFDM symbols from the 10 OFDM symbols as the time-domain positions of the measurement time-domain resources. Then, based on the size of the measurement time-domain resources and the time-domain positions of the two measurement time-domain resources, the first node can determine two measurement time-domain resources (e.g., measurement time-domain resource a and measurement time-domain resource b). The two OFDM symbols (i.e., the two measurement time-domain resources) do not overlap.

[0226] For example, taking a radio frame included in the first contention channel period as an example. Figure 3 Taking wireless frame 1 as an example, the first node can randomly (or non-randomly) select the time-domain locations of two OFDM symbols from the 10 OFDM symbols as the time-domain locations for measuring time-domain resources. For example, Figure 3 The temporal position of the first T symbol from left to right in the illustrated radio frame 1 is taken as the temporal position of the measurement temporal resource a. Figure 3 The temporal position of the third T symbol from left to right in the illustrated radio frame 1 is used as the temporal position of the measurement temporal resource b. Subsequently, given a measurement temporal resource of size one OFDM symbol, the first node can determine the temporal position of the measurement temporal resource a based on its temporal position. Figure 3 In the illustrated wireless frame 1, the first T symbol from left to right is designated as measurement time-domain resource a. The first node can determine the measurement time-domain resource b based on its time-domain location. Figure 3 The third T symbol from left to right in the illustrated radio frame 1 is used as the measurement time-domain resource b.

[0227] Optionally, the first node can also be selected. Figure 3The temporal position of the second G symbol from left to right in the illustrated radio frame 1 is taken as the temporal position of the measurement temporal resource 1. Figure 3 The temporal position of the fourth G symbol from left to right in the illustrated radio frame 1 is used as the temporal position of measurement temporal resource 2. Subsequently, when the size of a measurement temporal resource is one OFDM symbol, the first node can determine the temporal position of measurement temporal resource 2 based on its temporal position. Figure 3 In the illustrated wireless frame 1, the second G symbol from left to right is designated as measurement time-domain resource a. The first node can determine the measurement time-domain resource b based on its time-domain location. Figure 3 The fourth G symbol from left to right in the illustrated radio frame 1 is used as the measurement time-domain resource b.

[0228] Optionally, the first node can also be selected. Figure 3 The temporal position of the second G symbol from left to right in the illustrated radio frame 1 is used as the temporal position of the measurement temporal resource a, and the selection... Figure 3 The temporal position of the second T symbol from left to right in the illustrated radio frame 1 is used as the temporal position of the measurement temporal resource b. Subsequently, given a measurement temporal resource of size one OFDM symbol, the first node can determine the temporal position of the measurement temporal resource a based on its temporal position. Figure 3 In the illustrated wireless frame 1, the second G symbol from left to right is designated as measurement time-domain resource a. The first node can determine the measurement time-domain resource b based on its time-domain location. Figure 3 The second T symbol from left to right in the illustrated radio frame 1 is used as the measurement time-domain resource b.

[0229] Optionally, when the size of a measurement time-domain resource is two consecutive OFDM symbols, the first node can also randomly (or non-randomly) select the time-domain positions of two consecutive OFDM symbols in radio frame 1 as the time-domain positions of a measurement time-domain resource, thereby randomly (or non-randomly) selecting the time-domain positions of four OFDM symbols as the time-domain positions of the two measurement time-domain resources. The time-domain position of each of the two measurement time-domain resources includes the OFDM symbols of two consecutive radio frames. The four OFDM symbols do not overlap, meaning the two measurement time-domain resources do not overlap. Then, when the size of a measurement time-domain resource is two consecutive OFDM symbols, the first node can determine each measurement time-domain resource based on its size and the time-domain position of each of the two measurement time-domain resources.

[0230] It is understood that the above content is only an example of several ways for the first node to select M time-domain resources as measurement time-domain resources within the first contention channel period. The first node can also select M time-domain resources as measurement time-domain resources within the first contention channel period in other ways (for example, when the first contention channel period contains 2 consecutive superframes, the first node can randomly select (or non-randomly select) the time-domain positions of M radio frames in the 2 consecutive superframes as the time-domain positions of the measurement time-domain resources, or, for example, when the first contention channel period contains 2 consecutive radio frames, the first node can randomly select (or non-randomly select) the time-domain positions of M OFDM symbols in the 2 consecutive radio frames as the time-domain positions of the measurement time-domain resources). These will not be listed one by one here.

[0231] Method 2: The first node selects a first time-domain resource set (also called a first time-domain resource cluster) within the first contention channel period. The first time-domain resource set is a continuous segment of time-domain resources within the first contention channel period. For example, the first time-domain resource set may include at least one radio frame, at least one time slot, at least one superframe, or at least one symbol, etc. Then, the first node can select M time-domain resources from the first time-domain resource set as measurement time-domain resources.

[0232] The relevant description of the first contention channel period in Method 2 can be found in the relevant description in Method 1 above, and will not be repeated here.

[0233] The following examples illustrate the process by which the first node selects M time-domain resources from the first time-domain resource set as measurement time-domain resources.

[0234] Example 1: Taking a first contention channel period comprising one superframe, a first time-domain resource set comprising 20 consecutive radio frames, M being 5, and the size of one measurement time-domain resource being one radio frame as an example. One superframe can include 48 radio frames. The first node can select 20 consecutive radio frames from the 48 radio frames as the first time-domain resource set. Then, the first node can randomly (or non-randomly) select the time-domain positions of 5 radio frames from these 20 consecutive radio frames as the time-domain positions of the measurement time-domain resources. Subsequently, the first node can determine 5 measurement time-domain resources (e.g., measurement time-domain resource 1', measurement time-domain resource 2', measurement time-domain resource 3', measurement time-domain resource 4', and measurement time-domain resource 5') based on the size of the measurement time-domain resources and the time-domain positions of the 5 measurement time-domain resources. The 5 radio frames (i.e., the 5 measurement time-domain resources) do not overlap.

[0235] For example, continuing with a superframe included in the first contention channel period. Figure 3Taking the illustrated superframe as an example, the first node can select 20 consecutive radio frames from 48 radio frames as the first temporal resource set. For example, these 20 consecutive radio frames include... Figure 3 The diagram shows wireless frames 3, 4, ..., 22. Then, the first node can randomly (or non-randomly) select the time-domain positions of 5 wireless frames from these 20 consecutive wireless frames as the time-domain positions for measuring time-domain resources. For example, the time-domain position of wireless frame 5 is used as the time-domain position for measuring time-domain resource 1', the time-domain position of wireless frame 8 is used as the time-domain position for measuring time-domain resource 2', the time-domain position of wireless frame 15 is used as the time-domain position for measuring time-domain resource 3', the time-domain position of wireless frame 18 is used as the time-domain position for measuring time-domain resource 4', and the time-domain position of wireless frame 22 is used as the time-domain position for measuring time-domain resource 5'. Then, when the size of a measuring time-domain resource is one wireless frame, the first node can determine wireless frame 5 as measuring time-domain resource 1' based on the time-domain position of measuring time-domain resource 1'. The first node can determine wireless frame 8 as measuring time-domain resource 2' based on the time-domain position of measuring time-domain resource 2'. The first node can determine radio frame 15 as measurement time-domain resource 3' based on the time-domain location of measurement time-domain resource 3'. The first node can determine radio frame 18 as measurement time-domain resource 4' based on the time-domain location of measurement time-domain resource 4'. The first node can determine radio frame 22 as measurement time-domain resource 5' based on the time-domain location of measurement time-domain resource 5'.

[0236] Optionally, when the size of a measurement time-domain resource is two consecutive radio frames, the first node can also randomly (or non-randomly) select the time-domain positions of two consecutive radio frames from the aforementioned 20 radio frames as the time-domain positions of one measurement time-domain resource, thereby randomly (or non-randomly) selecting the time-domain positions of 10 radio frames as the time-domain positions of 5 measurement time-domain resources. Each of the 5 measurement time-domain resources includes the time-domain positions of two consecutive radio frames. The 10 radio frames do not overlap, which can be understood as the 5 measurement time-domain resources not overlapping. Then, when the size of a measurement time-domain resource is two consecutive radio frames, the first node can determine each measurement time-domain resource based on its size and the time-domain positions of each of the 5 measurement time-domain resources.

[0237] Example 2: Taking a first contention channel period consisting of one radio frame, a first time-domain resource set consisting of 6 consecutive OFDM symbols, M being 2, and the size of one measurement time-domain resource being one OFDM symbol as an example. A radio frame may include 10 OFDM symbols. The first node can select 6 consecutive OFDM symbols from the 10 OFDM symbols as the first time-domain resource set. Then, the first node can randomly (or non-randomly) select the time-domain positions of 2 OFDM symbols from these 6 consecutive OFDM symbols as the time-domain positions of the measurement time-domain resources. Afterwards, the first node can determine 2 measurement time-domain resources (e.g., measurement time-domain resource a' and measurement time-domain resource b') based on the size of the measurement time-domain resources and the time-domain positions of the 2 measurement time-domain resources. The 2 OFDM symbols (i.e., the 2 measurement time-domain resources) do not overlap.

[0238] For example, continuing with one radio frame included in the first contention channel period. Figure 3 Taking radio frame 1 as an example, the first node can select 6 consecutive OFDM symbols from 10 OFDM symbols as the first time-domain resource set. For example, these 6 consecutive OFDM symbols can be... Figure 3 The illustrated radio frame 1 shows the third G symbol, the fourth G symbol, ..., the second T symbol from left to right. Then, the first node can randomly (or non-randomly) select the time-domain positions of two OFDM symbols from these six consecutive OFDM symbols as the time-domain positions of the measurement time-domain resources. For example, the time-domain position of the fourth G symbol from the above six consecutive OFDM symbols is used as the time-domain position of measurement time-domain resource a', and the time-domain position of the second T symbol from the above six consecutive OFDM symbols is used as the time-domain position of measurement time-domain resource b'. Then, when the size of a measurement time-domain resource is one OFDM symbol, the first node can determine the fourth G symbol from the above six consecutive OFDM symbols as measurement time-domain resource a' based on the time-domain position of measurement time-domain resource a'. The first node can determine the second T symbol from the above six consecutive OFDM symbols as measurement time-domain resource b' based on the time-domain position of measurement time-domain resource b'.

[0239] Optionally, the first node may also select the time-domain position of the first T symbol among the six consecutive OFDM symbols as the time-domain position of measurement time-domain resource a', and select the time-domain position of the second T symbol among the six consecutive OFDM symbols as the time-domain position of measurement time-domain resource b'. Then, when the size of a measurement time-domain resource is one OFDM symbol, the first node can determine the first T symbol among the six consecutive OFDM symbols as measurement time-domain resource a' based on the time-domain position of measurement time-domain resource a'. The first node can also determine the second T symbol among the six consecutive OFDM symbols as measurement time-domain resource b' based on the time-domain position of measurement time-domain resource b'.

[0240] It is understood that the above content is merely an illustrative description of several implementation processes of Method 2. The first node can also select M time-domain resources as measurement time-domain resources in other ways. For example, when the first contention channel period contains two consecutive superframes, the first node can select a first time-domain resource set from the two consecutive superframes, and then randomly (or non-randomly) select the time-domain positions of M radio frames from the first time-domain resource set as the time-domain positions of the measurement time-domain resources. As another example, when the first contention channel period contains two consecutive radio frames, the first node can select a first time-domain resource set from the two consecutive radio frames, and then randomly (or non-randomly) select the time-domain positions of M OFDM symbols from the first time-domain resource set as the time-domain positions of the measurement time-domain resources. These are not all listed here.

[0241] Step 602: The first node determines M time-domain resources based on the M measured time-domain resources.

[0242] Among them, the M-segment time domain resources are located in the first contention channel period.

[0243] It is understandable that the M-segment time-domain resources are continuous in the time domain. That is to say, there are no gaps (or no gaps) between the M-segment time-domain resources.

[0244] The following describes the implementation process of the first node determining M time-domain resources based on M measured time-domain resources through several possible implementation methods.

[0245] Implementation method 1: If the M measurement time-domain resources are determined based on the first contention channel period, the first node can use the M measurement time-domain resources to divide (or segment) the first contention channel period to obtain M segments of time-domain resources or M+1 segments of time-domain resources.

[0246] In one example, when at least one of the M measurement time-domain resources is located at the end of the first contention channel period, the first node uses the M measurement time-domain resources to divide the first contention channel period, thus obtaining M segments of time-domain resources.

[0247] Understandably, in this example, the M time-domain resources correspond one-to-one with the M measurement time-domain resources. Optionally, a measurement time-domain resource can be located at the end of a corresponding time-domain resource segment (also referred to as the tail position or end). That is, among the M measurement time-domain resources, at least one measurement time-domain resource can be located at the end of the time-domain resource segment containing that at least one measurement time-domain resource. This method, by placing a measurement time-domain resource at the tail position of its corresponding time-domain resource segment, allows the channel state measurement result obtained by the first node on that measurement time-domain resource to directly affect the state of the first node on one or more time-domain resources following that measurement time-domain resource. Optionally, any one of the M measurement time-domain resources can also be located at the beginning of the corresponding time-domain resource segment (also referred to as the start position).

[0248] For example, with M equal to 3, the three measurement time-domain resources are measurement time-domain resource c1, measurement time-domain resource c2, and measurement time-domain resource c3, and the three time-domain resource segments are the first time-domain resource, the second time-domain resource, and the third time-domain resource. Specifically, measurement time-domain resource c1 corresponds to the first time-domain resource, measurement time-domain resource c2 corresponds to the second time-domain resource, and measurement time-domain resource c3 corresponds to the third time-domain resource.

[0249] For example, one of the three measurement time-domain resources mentioned above (such as measurement time-domain resource c1) is located at the end of the time-domain resource segment in which it is located. That is, measurement time-domain resource c1 is located at the end of the first time-domain resource segment (which can be understood as being segmented using the tail boundary line (also called the tail boundary point, right boundary line, or right boundary point) of measurement time-domain resource c1 as the segmentation position). Optionally, measurement time-domain resource c2 can be located at the beginning of the second time-domain resource segment (which can be understood as being segmented using the beginning boundary line (also called the beginning boundary point, left boundary line, or left boundary point) of measurement time-domain resource c3 as the segmentation position), and / or, measurement time-domain resource c3 can be located at the beginning of the third time-domain resource segment (which can be understood as being segmented using the beginning boundary line of measurement time-domain resource c3 as the segmentation position).

[0250] For example, among the three measurement time-domain resources mentioned above, two measurement time-domain resources (such as measurement time-domain resource c1 and measurement time-domain resource c2) are located at the end of their respective time-domain resource segments. That is, measurement time-domain resource c1 is located at the end of the first time-domain resource segment (which can be understood as being segmented using the tail boundary of measurement time-domain resource c1 as the segmentation point), and measurement time-domain resource c2 is located at the end of the second time-domain resource segment (which can be understood as being segmented using the tail boundary of measurement time-domain resource c2 as the segmentation point). Optionally, measurement time-domain resource c3 can be located at the beginning of the third time-domain resource segment (which can be understood as being segmented using the beginning boundary of measurement time-domain resource c3 as the segmentation point).

[0251] For example, all three measurement time-domain resources are located at the end of their respective time-domain resource segments (which can be understood as being obtained by dividing the segments using the boundary lines of the three measurement time-domain resources as the dividing points). That is, measurement time-domain resource c1 is located at the end of the first time-domain resource segment, measurement time-domain resource c2 is located at the end of the second time-domain resource segment, and measurement time-domain resource c3 is located at the end of the third time-domain resource segment.

[0252] Optionally, the above three measurement time-domain resources are all located at the beginning of the time-domain resources of their respective segments (which can be understood as being obtained by dividing the segments using the boundary lines of the beginning of the above three measurement time-domain resources as the dividing points), that is, measurement time-domain resource c1 is located at the beginning of the first segment of time-domain resources, measurement time-domain resource c2 is located at the beginning of the second segment of time-domain resources, and measurement time-domain resource c3 is located at the beginning of the third segment of time-domain resources.

[0253] For example, taking a first contention channel period comprising 10 radio frames (e.g., radio frame 1, radio frame 2, ..., radio frame 10), with M being 3, and three measurement time-domain resources being measurement time-domain resource b1, measurement time-domain resource b2, and measurement time-domain resource b3, with the size of one measurement time-domain resource being one radio frame. Figure 7a As shown, radio frame 2 serves as measurement time-domain resource b1, radio frame 6 as measurement time-domain resource b2, and radio frame 10 as measurement time-domain resource b3. The first node uses these three measurement time-domain resources to divide the first contention channel period, obtaining three segments of time-domain resources, such as... Figure 7a The diagram shows the first, second, and third time-domain resources. Measurement time-domain resource b1 is located at the end of the first time-domain resource, measurement time-domain resource b2 is located at the end of the second time-domain resource, and measurement time-domain resource b3 is located at the end of the third time-domain resource.

[0254] Optionally, adjacent measurement time-domain resources can exist among the M measurement time-domain resources (e.g., two or three adjacent measurement time-domain resources). For example, continuing with the first contention channel period including 10 radio frames (e.g., radio frame 1, radio frame 2, ..., radio frame 10), where M is 3, and the three measurement time-domain resources are measurement time-domain resource b1, measurement time-domain resource b2, and measurement time-domain resource b3, with the size of one measurement time-domain resource being one radio frame. Figure 7b As shown, radio frame 2 serves as measurement time-domain resource b1, radio frame 3 as measurement time-domain resource b2, and radio frame 10 as measurement time-domain resource b3. The first node uses these three measurement time-domain resources to divide the first contention channel period, obtaining three segments of time-domain resources, such as... Figure 7b The diagram shows the first, second, and third time-domain resources. Measurement time-domain resource b1 is located at the end of the first time-domain resource, and measurement time-domain resource b3 is located at the end of the third time-domain resource.

[0255] In another example, when none of the M measurement time-domain resources are located at the end of the first contention channel period, the first node uses the M measurement time-domain resources to divide the first contention channel period, thus obtaining M+1 segments of time-domain resources.

[0256] For example, continuing with the first contention channel period comprising 10 radio frames (e.g., radio frame 1, radio frame 2, ..., radio frame 10), where M is 3, and the three measurement time-domain resources are measurement time-domain resource b1, measurement time-domain resource b2, and measurement time-domain resource b3, with the size of one measurement time-domain resource equal to one radio frame. Figure 7c As shown, radio frame 2 serves as measurement time-domain resource b1, radio frame 6 as measurement time-domain resource b2, and radio frame 9 as measurement time-domain resource b3. The first node uses these three measurement time-domain resources to divide the first contention channel period, resulting in four time-domain resource segments, such as... Figure 7c The diagram shows the first, second, third, and fourth time-domain resources. Measurement time-domain resource b1 is located at the end of the first time-domain resource, measurement time-domain resource b2 is located at the end of the second time-domain resource, and measurement time-domain resource b3 is located at the end of the third time-domain resource.

[0257] Implementation Method 2: If the M measurement time-domain resources are determined based on the first time-domain resource set in the first contention channel period, then the first node can use the M measurement time-domain resources to divide the first time-domain resource set to obtain M segments of time-domain resources or M+1 segments of time-domain resources.

[0258] In one example, when one or more of the M measurement time-domain resources are located at the end of the first time-domain resource set, the first node uses the M measurement time-domain resources to divide the first time-domain resource set, thus obtaining M segments of time-domain resources.

[0259] It is understood that in this example, the M time-domain resources correspond one-to-one with the M measurement time-domain resources. Optionally, a measurement time-domain resource can be located at the end of a time-domain resource segment corresponding to it. That is, among the M measurement time-domain resources, at least one measurement time-domain resource can be located at the end of the time-domain resource segment containing that at least one measurement time-domain resource. Optionally, any one of the M measurement time-domain resources can also be located at the beginning of the time-domain resource segment corresponding to it.

[0260] In Implementation Method 2, the details regarding whether a measurement time-domain resource can be located at the end of a segment of time-domain resources corresponding to that measurement time-domain resource or at the beginning of a segment of time-domain resources corresponding to that measurement time-domain resource are not described in detail. Please refer to the relevant introduction in Implementation Method 1 above, and it will not be repeated here.

[0261] For example, let's assume the first contention channel period includes 10 radio frames (e.g., radio frame 1, radio frame 2, ..., radio frame 10), and the first time-domain resource set includes 7 consecutive radio frames in the first contention channel period (e.g., radio frame 3, radio frame 4, ..., radio frame 9). Let M be 3, and the three measurement time-domain resources be measurement time-domain resource b1', measurement time-domain resource b2', and measurement time-domain resource b3'. The size of one measurement time-domain resource is one radio frame. Figure 8a As shown, wireless frame 4 serves as measurement time-domain resource b1', wireless frame 6 as measurement time-domain resource b2', and wireless frame 9 as measurement time-domain resource b3'. The first node uses these three measurement time-domain resources to segment the first time-domain resource set, resulting in three time-domain resource segments, such as... Figure 8a The diagram shows the first, second, and third time-domain resources. Measurement time-domain resource b1' is located at the end of the first time-domain resource, measurement time-domain resource b2' is located at the end of the second time-domain resource, and measurement time-domain resource b3' is located at the end of the third time-domain resource.

[0262] Optionally, adjacent measurement time-domain resources may exist among the M measurement time-domain resources (e.g., two or three adjacent measurement time-domain resources). For example, continuing with the scenario where the first contention channel period includes 10 radio frames (e.g., radio frame 1, radio frame 2, ..., radio frame 10), and the first time-domain resource set includes 7 consecutive radio frames in the first contention channel period (e.g., radio frame 3, radio frame 4, ..., radio frame 9), where M is 3, and the three measurement time-domain resources are measurement time-domain resource b1', measurement time-domain resource b2', and measurement time-domain resource b3', with the size of one measurement time-domain resource being one radio frame. Figure 8b As shown, wireless frame 5 serves as measurement time-domain resource b1', wireless frame 6 as measurement time-domain resource b2', and wireless frame 9 as measurement time-domain resource b3'. The first node uses these three measurement time-domain resources to segment the first time-domain resource set, resulting in three time-domain resource segments, such as... Figure 8b The diagram shows the first, second, and third time-domain resources. Measurement time-domain resource b1' is located at the end of the first time-domain resource, and measurement time-domain resource b3' is located at the end of the third time-domain resource.

[0263] In another example, when none of the M measurement time-domain resources are located at the end of the first time-domain resource set, the first node uses the M measurement time-domain resources to divide the first time-domain resource set, which can yield M+1 segments of time-domain resources.

[0264] For example, continuing with the first contention channel period comprising 10 radio frames (e.g., radio frame 1, radio frame 2, ..., radio frame 10), and the first time-domain resource set comprising 7 consecutive radio frames in the first contention channel period (e.g., radio frame 3, radio frame 4, ..., radio frame 9), where M is 3, and the three measurement time-domain resources are measurement time-domain resource b1', measurement time-domain resource b2', and measurement time-domain resource b3', with the size of one measurement time-domain resource being one radio frame, as an example. Figure 8c As shown, wireless frame 4 serves as measurement time-domain resource b1', wireless frame 6 as measurement time-domain resource b2', and wireless frame 8 as measurement time-domain resource b3'. The first node uses these three measurement time-domain resources to segment the first time-domain resource set, resulting in four time-domain resource segments, such as... Figure 8c The diagram shows the first, second, third, and fourth time-domain resources. Measurement time-domain resource b1' is located at the end of the first time-domain resource, measurement time-domain resource b2' is located at the end of the second time-domain resource, and measurement time-domain resource b3' is located at the end of the third time-domain resource.

[0265] Step 603: The first node determines the channel contention result of the first node in the first contention channel period based on the state of the first node on the k-th time domain resource and / or the channel state measurement result on the k-th measurement time domain resource.

[0266] Among them, the k-th time domain resource can be one of the M time domain resources, and the k-th measurement time domain resource can be one of the M measurement time domain resources.

[0267] For example, the channel contention result (also known as the channel contention result) can include the following: successful channel contention (also known as successful channel contention) or failed channel contention (also known as failed channel contention).

[0268] It is understood that, in the aforementioned M time-domain resources, the state of the first node on at least one time-domain resource can be determined based on the state on the preceding time-domain resource and / or the channel state measurement results obtained by the first node from the measurement of the time-domain resources included in the preceding time-domain resource. Optionally, when the first node is in an occupied state on a certain time-domain resource, the first node can transmit a signal on that time-domain resource. In this way, by transmitting a signal on that time-domain resource, the first node can enable other nodes to measure the energy of the signal transmitted by the first node on that time-domain resource, thereby knowing that a node is currently occupying the channel, thus realizing that the first node temporarily occupies the channel. When the first node is in a released state on that time-domain resource, the first node will not transmit a signal on that time-domain resource. For example, take a certain time-domain resource (such as the t-th time-domain resource) in the aforementioned M time-domain resources as an example. If the first node is in an occupied state on the time-domain resource segment t (e.g., the time-domain resource segment t includes measurement time-domain resources and other time-domain resources (also called non-measurement time-domain resources), and the other time-domain resources can be used to transmit signals), then the first node can transmit signals on the time-domain resource segment t. If the first node is in a released state on the time-domain resource segment t, then the first node will not transmit signals on the time-domain resource segment t. It can be understood that all resources in the measurement time-domain resources included in the time-domain resource segment t are used for measurement, or some resources in the measurement time-domain resources are used for measurement, and the remaining resources can be used to transmit signals and / or can be used for some internal processing operations. Optionally, if the first node is in an occupied state on the time-domain resource segment t (e.g., the time-domain resource segment t only includes measurement time-domain resources), and there are resources (or time-domain resources) in the time-domain resource segment t that can be used to transmit signals, then the first node can also transmit signals on the time-domain resource segment t.

[0269] For example, as mentioned above Figure 7aTaking the three time-domain resources shown as an example: When the state of a certain time-domain resource (such as the second time-domain resource) is determined based on the state of the preceding time-domain resource and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the preceding time-domain resource, the first node can determine the state of the first node in the second time-domain resource based on the state of the first node in the first time-domain resource and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the first time-domain resource. When the states of two time-domain resources (such as the second and third time-domain resources) are determined based on the states of the preceding time-domain resources and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the preceding time-domain resource, the first node can determine the state of the first node in the second time-domain resource based on the state of the first node in the first time-domain resource and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the first time-domain resource. The first node can determine its state on the third time domain resource based on its state on the second time domain resource and / or the channel state measurement results obtained by the first node from the measurement time domain resources included in the second time domain resource.

[0270] Optionally, in the aforementioned M time-domain resources, the state of the first node on at least one time-domain resource can also be determined based on the state on an earlier time-domain resource and / or the channel state measurement results obtained by measuring the time-domain resources included in the earlier time-domain resource. For example, continuing with the above... Figure 7a Taking the three time-domain resources shown as an example, when the state of a certain time-domain resource (such as the third time-domain resource) is determined based on the state of the previous time-domain resource (such as the first time-domain resource) and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the previous time-domain resource (such as the first time-domain resource), the first node can determine the state of the first node in the third time-domain resource based on the state of the first node in the first time-domain resource and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the first time-domain resource.

[0271] For example, using the above... Figure 7cTaking the four time-domain resources shown as an example, when the state of a certain time-domain resource (such as the third time-domain resource) is determined based on the state of the previous time-domain resource (such as the first time-domain resource) and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the previous time-domain resource (such as the first time-domain resource), the first node can determine the state of the first node in the third time-domain resource based on the state of the first node in the first time-domain resource and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the first time-domain resource. When the states of two of the three time-domain resources (e.g., the third and fourth time-domain resources) are determined based on the states of an earlier time-domain resource and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the earlier time-domain resource, the first node can determine its state in the third time-domain resource based on its state in the first time-domain resource and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the first time-domain resource. Similarly, the first node can determine its state in the fourth time-domain resource based on its state in the first time-domain resource and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the first time-domain resource. Optionally, the first node can also determine its state in the fourth time-domain resource based on its state in the second time-domain resource and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the second time-domain resource. Optionally, the first node may also determine its state in the third time-domain resource based on its state in the second time-domain resource segment and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the second time-domain resource segment. Alternatively, the first node may also determine its state in the second time-domain resource segment based on its state in the first time-domain resource segment and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the first time-domain resource segment.

[0272] The following describes the implementation process of determining the state of the first node on at least one time-domain resource based on the state on the previous time-domain resource and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the previous time-domain resource, through the following possible implementation methods.

[0273] Implementation method a: The first node determines its state in the i-th time domain resource based on its state in the (i-1)-th time domain resource. This implementation method a determines (or infers or decides) the state of the first node in the i-th time domain resource based on its state in the (i-1)-th time domain resource, which can realize the process of nodes competing for channel occupancy (for example, if the first node's state in the i-th time domain resource is occupied, it immediately occupies the channel; if the first node's state in the i-th time domain resource is released, it immediately releases the channel).

[0274] Among them, the (i-1)th segment of time-domain resources and the ith segment of time-domain resources are two consecutive segments of time-domain resources in the M segments of time-domain resources.

[0275] In one example, if the state of the first node on the (i-1)th time domain resource is the released state, then the first node can determine that the state of the first node on the i-th time domain resource is the released state.

[0276] When the first node is in the released state on the i-th time domain resource, the first node will not send a signal on the i-th time domain resource.

[0277] In another example, if the first node is in an occupied state on the (i-1)th time domain resource segment, then the first node can determine that its state on the i-th time domain resource segment is occupied. This example makes the probability of nodes competing for channel occupancy relatively high, and is suitable for high-priority nodes or high-priority services.

[0278] When the first node is in an occupied state on the i-th time-domain resource segment, if the i-th time-domain resource segment includes the i-th measurement time-domain resource and other time-domain resources (also referred to as non-measurement time-domain resources, which can be used to transmit signals), then the first node can transmit signals on the i-th time-domain resource segment. It can be understood that all resources in the i-th measurement time-domain resource are used for measurement, or some resources in the i-th measurement time-domain resource are used for measurement, and the remaining resources can be used for signal transmission and / or for some internal processing operations. Optionally, when the first node is in an occupied state on the i-th time-domain resource segment, if the i-th time-domain resource segment only includes the i-th measurement time-domain resource, and the i-th measurement time-domain resource includes resources that can be used to transmit signals, then the first node can also transmit signals on the i-th time-domain resource segment.

[0279] For example, continuing with the above... Figure 7a Taking the first and second time-domain resources of the three time-domain resources shown as an example. If the first node is in Figure 7a If the state of the first temporal resource shown is the released state, then the first node can determine that the first node is in the... Figure 7aThe state of the second time-domain resource shown is "released". When the first node's state on the second time-domain resource is "released", the first node will not send a signal on the second time-domain resource. If the first node is in... Figure 7a If the state of the first time-domain resource shown is occupied, then the first node can determine that the first node is in the occupied state. Figure 7a The state of the second time-domain resource shown is occupied. When the first node is in the occupied state of the second time-domain resource, the first node can transmit signals on the second time-domain resource. For example, the first node can transmit signals on radio frame 3, radio frame 4, or radio frame 5 included in the second time-domain resource. Optionally, if radio frame 6 (i.e., measurement time-domain resource b2) includes resources that can be used to transmit signals, the first node can also transmit signals on resources that can be used to transmit signals.

[0280] Implementation method b: The first node determines its state on the i-th time domain resource based on the channel state measurement result on the (i-1)-th measurement time domain resource. Here, the (i-1)-th and i-th time domain resources corresponding to the (i-1)-th measurement time domain resource are two consecutive time domain resources within the M time domain resources. This implementation method b, which determines the first node's state on the i-th time domain resource based on the channel state measurement result obtained on the (i-1)-th measurement time domain resource, can enable inter-node contention for channel access.

[0281] In one example, if the channel state measurement result on the (i-1)th measurement time-domain resource is "channel idle" (which can be understood as the channel state measurement result obtained by the first node on the (i-1)th measurement time-domain resource being "channel idle"), then the first node can determine that its state on the i-th time-domain resource is "occupied". For example, the first node can measure the received signal strength indication (RSSI) on the (i-1)th measurement time-domain resource. If the RSSI is less than or equal to the signal strength threshold, the first node can determine that the channel state measurement result is "channel idle"; if the RSSI is greater than the signal strength threshold, the first node can determine that the channel state measurement result is "channel busy".

[0282] When the first node is in an occupied state on the i-th time-domain resource segment, if the i-th time-domain resource segment includes the i-th measurement time-domain resource and other time-domain resources, then the first node can transmit signals on the i-th time-domain resource segment. It can be understood that all resources in the i-th measurement time-domain resource are used for measurement, or some resources in the i-th measurement time-domain resource are used for measurement, and the remaining resources can be used for signal transmission and / or for some internal processing operations. Optionally, when the first node is in an occupied state on the i-th time-domain resource segment, if the i-th time-domain resource segment only includes the i-th measurement time-domain resource, and the i-th measurement time-domain resource includes resources that can be used for signal transmission, then the first node can also transmit signals on the i-th time-domain resource segment.

[0283] In another example, if the channel state measurement result on the (i-1)th measurement time domain resource is "channel busy" (which can be understood as the channel state measurement result obtained by the first node on the (i-1)th measurement time domain resource being "channel busy"), then the first node can determine that the state of the first node on the i-th time domain resource is "released".

[0284] When the first node is in the released state on the i-th time domain resource, the first node will not send a signal on the i-th time domain resource.

[0285] For example, continuing with the above... Figure 7a Taking the first and second time-domain resources of the three time-domain resources shown as an example. If the first node is in Figure 7a If the channel state measurement result obtained on radio frame 2 (i.e., measurement time-domain resource b1), which includes the first segment of time-domain resources, is that the channel is idle, then the first node can determine that its state on the second segment of time-domain resources is occupied. When the first node's state on the second segment of time-domain resources is occupied, the first node can transmit signals on the second segment of time-domain resources. For example, the first node can transmit signals on radio frame 3, radio frame 4, or radio frame 5, which are included in the second segment of time-domain resources. Optionally, if radio frame 6 (i.e., measurement time-domain resource b2) includes resources that can be used to transmit signals, then the first node can also transmit signals on resources that can be used to transmit signals. If the first node in Figure 7a If the channel state measurement result obtained on radio frame 2 (i.e., measurement time-domain resource b1) of the first time-domain resource segment shown is "channel busy", then the first node can determine that the state of the first node on the second time-domain resource segment is "released". When the state of the first node on the second time-domain resource segment is "released", the first node will not transmit signals on the second time-domain resource segment.

[0286] Implementation method c: The first node determines its state in the i-th time domain resource based on its state in the (i-1)-th time domain resource and the channel state measurement result in the (i-1)-th measurement time domain resource. This implementation method c, by determining the first node's state in the i-th time domain resource based on its state in the (i-1)-th time domain resource and the channel state measurement result in the (i-1)-th measurement time domain resource, can realize the process of nodes competing for channel occupancy. Furthermore, even when the first node's state in the (i-1)-th time domain resource is occupied, collision detection on the channel based on the (i-1)-th measurement time domain resource helps reduce the probability of resource conflicts between nodes.

[0287] In one example, if the state of the first node on the (i-1)th time domain resource is occupied, and the channel state measurement result on the (i-1)th measurement time domain resource is idle, then the first node can determine that the state of the first node on the i-th time domain resource is occupied.

[0288] When the first node is in an occupied state on the i-th time-domain resource segment, if the i-th time-domain resource segment includes the i-th measurement time-domain resource and other time-domain resources, then the first node can transmit signals on the i-th time-domain resource segment. It can be understood that all resources in the i-th measurement time-domain resource are used for measurement, or some resources in the i-th measurement time-domain resource are used for measurement, and the remaining resources can be used for signal transmission and / or for some internal processing operations. Optionally, when the first node is in an occupied state on the i-th time-domain resource segment, if the i-th time-domain resource segment only includes the i-th measurement time-domain resource, and the i-th measurement time-domain resource includes resources that can be used for signal transmission, then the first node can also transmit signals on the i-th time-domain resource segment.

[0289] In another example, if the state of the first node on the (i-1)th time domain resource is occupied, and the channel state measurement result on the (i-1)th measurement time domain resource is busy, then the first node can determine that the state of the first node on the i-th time domain resource is released.

[0290] Optionally, if the first node's state on the (i-1)th time-domain resource is a released state and the channel state measurement result on the (i-1)th measurement time-domain resource is a busy channel, or if the first node's state on the (i-1)th time-domain resource is a released state and the channel state measurement result on the (i-1)th measurement time-domain resource is an idle channel, then the first node can also determine that its state on the i-th time-domain resource is a released state.

[0291] When the first node is in the released state on the i-th time domain resource, the first node will not send a signal on the i-th time domain resource.

[0292] For example, continuing with the above... Figure 7a Taking the first and second time-domain resources of the three time-domain resources shown as an example. If the first node is in Figure 7a The first segment of the time-domain resource shown is in an occupied state, and the first node is in... Figure 7a If the channel state measurement result obtained on radio frame 2 (i.e., measurement time-domain resource b1), which includes the first time-domain resource segment, is that the channel is idle, then the first node can determine that its state on the second time-domain resource segment is occupied. When the first node's state on the second time-domain resource segment is occupied, the first node can transmit signals on the second time-domain resource segment. For example, the first node can transmit signals on radio frame 3, radio frame 4, or radio frame 5, which are included in the second time-domain resource segment. Optionally, if radio frame 6 (i.e., measurement time-domain resource b2) includes resources that can be used to transmit signals, then the first node can also transmit signals on resources that can be used to transmit signals.

[0293] If the first node is Figure 7a The first segment of the time-domain resource shown is in an occupied state, and the first node is in... Figure 7a If the channel state measurement result obtained on radio frame 2 (i.e., measurement time-domain resource b1) of the first segment of time-domain resources shown is that the channel is busy, then the first node can determine that the first node is in Figure 7a The second temporal resource shown is in a released state. Optionally, if the first node is in... Figure 7a The first segment of the time-domain resource shown is in a released state and the first node is in Figure 7a The channel state measurement result obtained on radio frame 2 (i.e., measurement time-domain resource b1) included in the first segment of time-domain resources shown is that the channel is busy, or if the first node is... Figure 7a The first segment of the time-domain resource shown is in a released state and the first node is in Figure 7a If the channel state measurement result obtained on radio frame 2 (i.e., measurement time-domain resource b1) of the first segment of time-domain resources shown is that the channel is idle, then the first node can also determine that the first node is in Figure 7a The state of the second time-domain resource shown is the released state. When the state of the first node on the second time-domain resource is the released state, the first node will not send a signal on the second time-domain resource.

[0294] Next, the following describes the implementation process of determining the channel contention result of the first node in the first contention channel period based on the state of the first node on the k-th time domain resource and / or the channel state measurement result on the k-th measurement time domain resource through the following possible implementation methods.

[0295] Method A: The first node determines the channel contention result of the first node in the first contention channel period based on the state of the first node on the k-th time domain resource. Since the state of the k-th time domain resource can reflect the channel state measurement results obtained from one or more measurements of the k-th time domain resource before it, the channel contention result of the first node in the first contention channel period can be accurately determined based on the state of the first node on the k-th time domain resource.

[0296] It is understandable that the method for determining the state of the k-th time-domain resource segment can refer to the relevant descriptions of implementation methods a to c above, and will not be repeated here. Optionally, the state of the k-th time-domain resource segment can also be determined based on the state of the preceding time-domain resource segment (such as the (k-2)-th or (k-3)-th time-domain resource segment and / or the channel state measurement results obtained by the first node from the measurement time-domain resources included in the preceding time-domain resource segment. For details, please refer to the relevant introduction above, and will not be repeated here.

[0297] Optionally, the first node can also determine its channel contention result in the first contention channel period based on its state in the k-th time-domain resource and the channel state measurement result in the second measurement time-domain resource. This method, by comprehensively considering the first node's state in the k-th time-domain resource and the channel state measurement result obtained in the second measurement time-domain resource (which can be understood as combining the first node's state in the k-th time-domain resource with the channel state measurement result obtained in the second measurement time-domain resource), can further improve the accuracy of the channel contention result, thereby increasing the success rate of a node occupying the channel and mitigating interference from other nodes to some extent. Here, the M measurement time-domain resources are the first measurement time-domain resources, and the second measurement time-domain resources are different from the first measurement time-domain resources. That is, the second measurement time-domain resources are different from all M measurement time-domain resources.

[0298] In one example, if the first node is in an occupied state on the k-th time domain resource, then the first node can determine that the channel contention result of the first node in the first contention channel period is a successful channel contention.

[0299] In another example, if the state of the first node on the k-th time domain resource is the released state, then the first node can determine that the channel contention result of the first node in the first contention channel period is a channel contention failure.

[0300] In another example, if the state of the first node on the k-th time domain resource is occupied, and the channel state measurement result obtained by the first node on the second measurement time domain resource is that the channel is idle, then the first node can determine that the channel contention result of the first node in the first contention channel period is that the channel contention is successful.

[0301] In another example, if the state of the first node on the k-th time domain resource is occupied, and the channel state measurement result obtained by the first node on the second measurement time domain resource is busy, then the first node can determine that the channel contention result of the first node in the first contention channel period is a channel contention failure.

[0302] In another example, if the state of the first node on the k-th time domain resource is the released state, and the channel state measurement result obtained by the first node on the second measurement time domain resource is the channel busy, then the first node can determine whether the channel contention result of the first node in the first contention channel period is channel contention success or channel contention failure.

[0303] In another example, if the state of the first node on the k-th time domain resource is the released state, and the channel state measurement result obtained by the first node on the second measurement time domain resource is the channel idle, then the first node can determine that the channel contention result of the first node in the first contention channel period is the channel contention failure.

[0304] Optionally, when the first node determines that its channel contention result in the first contention channel period is successful based on its occupied state on the k-th time-domain resource, the first node can determine (or set or maintain) its occupied state on time-domain resources after the k-th time-domain resource without measuring the channel state on subsequent measurement time-domain resources. Alternatively, even if the first node measures the channel state on subsequent measurement time-domain resources, regardless of the measurement result, its occupied state on time-domain resources after the k-th time-domain resource will be maintained. This approach can be applied to some high-priority nodes or high-priority services, helping to improve the success rate of node channel occupancy.

[0305] Method B: The first node determines its channel contention result in the first contention channel period based on the channel state measurement result on the k-th measurement time domain resource. Since the channel state measurement result on the k-th measurement time domain resource can reflect the busy / idle status of the channel corresponding to the k-th time domain resource, the channel contention result of the first node in the first contention channel period can be accurately determined based on the channel state measurement result on the k-th measurement time domain resource.

[0306] Optionally, the first node can also determine its channel contention result in the first contention channel period based on the channel state measurement results on the k-th measurement time domain resource and the second measurement time domain resource. This method, by comprehensively considering both the channel state measurement results obtained by the first node on the k-th measurement time domain resource and the channel state measurement results obtained by the first node on the second measurement time domain resource (which can be understood as combining the channel state measurement results obtained by the first node on the k-th measurement time domain resource with the channel state measurement results obtained by the first node on the second measurement time domain resource), can further improve the accuracy of the channel contention result, thereby increasing the success rate of the node occupying the channel and mitigating interference from other nodes to a certain extent.

[0307] For example, the kth measurement time-domain resource can be a measurement time-domain resource included in the kth time-domain resource segment, or the kth measurement time-domain resource can be a measurement time-domain resource included in another time-domain resource segment among the M time-domain resources. This application does not impose any restrictions on this.

[0308] In one example, if the channel state measurement result obtained by the first node on the k-th measurement time domain resource is that the channel is idle, then the first node can determine that the channel contention result of the first node in the first contention channel period is that the channel contention is successful.

[0309] In another example, if the channel state measurement result obtained by the first node on the k-th measurement time domain resource is that the channel is busy, then the first node can determine that the channel contention result of the first node in the first contention channel period is that the channel contention has failed.

[0310] In another example, if the channel state measurement result obtained by the first node on the k-th measurement time domain resource is that the channel is idle, and the channel state measurement result obtained by the first node on the second measurement time domain resource is that the channel is idle, then the first node can determine that the channel contention result of the first node in the first contention channel period is that the channel contention is successful.

[0311] In another example, if the channel state measurement result obtained by the first node on the k-th measurement time domain resource is that the channel is idle, and the channel state measurement result obtained by the first node on the second measurement time domain resource is that the channel is busy, then the first node can determine that the channel contention result of the first node in the first contention channel period is that the channel contention has failed.

[0312] In another example, if the channel state measurement result obtained by the first node on the k-th measurement time domain resource is that the channel is busy, and the channel state measurement result obtained by the first node on the second measurement time domain resource is that the channel is busy, then the first node can determine that the channel contention result of the first node in the first contention channel period is that the channel contention has failed.

[0313] In another example, if the channel state measurement result obtained by the first node on the k-th measurement time domain resource is that the channel is busy, and the channel state measurement result obtained by the first node on the second measurement time domain resource is that the channel is idle, then the first node can determine whether the channel contention result of the first node in the first contention channel period is that the channel contention is successful or the channel contention is unsuccessful.

[0314] Optionally, when the first node determines that its channel contention in the first contention channel period is successful based on the channel state measurement result obtained by the first node on the k-th measurement time-domain resource as "channel idle," the first node can define its state on the time-domain resources after the k-th segment as "occupied," without needing to measure the channel state on subsequent measurement time-domain resources. Alternatively, even if the first node measures the channel state on subsequent measurement time-domain resources, regardless of the channel state measurement result, its state on the time-domain resources after the k-th segment will remain "occupied." This approach can be applied to some high-priority nodes or high-priority services, helping to improve the success rate of node channel occupancy.

[0315] Method C: The first node determines the channel contention result of the first node in the first contention channel period based on the state of the first node on the k-th time domain resource and the channel state measurement result on the k-th measurement time domain resource.

[0316] Optionally, the first node can also determine the channel contention result in the first contention channel period based on its state on the k-th time-domain resource, the channel state measurement result on the k-th measurement time-domain resource, and the channel state measurement result on the second measurement time-domain resource. This method comprehensively considers the first node's state on the k-th time-domain resource, the channel state measurement result obtained by the first node on the k-th measurement time-domain resource, and the channel state measurement result obtained by the first node on the second measurement time-domain resource (which can be understood as combining the first node's state on the k-th time-domain resource and the channel state measurement result obtained by the first node on the k-th measurement time-domain resource with the channel state measurement result obtained by the first node on the second measurement time-domain resource). This can further improve the accuracy of the channel contention result, thereby increasing the success rate of a node occupying the channel and mitigating interference from other nodes to some extent.

[0317] For example, the kth measurement time-domain resource can be a measurement time-domain resource included in the kth time-domain resource segment, or the kth measurement time-domain resource can be a measurement time-domain resource included in another time-domain resource segment among the M time-domain resources. This application does not impose any restrictions on this.

[0318] In one example, if the state of the first node on the k-th time domain resource is occupied, and the channel state measurement result obtained by the first node on the k-th measurement time domain resource is channel idle, then the first node can determine that the channel contention result of the first node in the first contention channel period is channel contention successful.

[0319] Optionally, when the state of the first node on the k-th time domain resource is occupied, and the channel state measurement result obtained by the first node on the k-th measurement time domain resource is that the channel is busy, the first node can also determine that the channel contention result of the first node in the first contention channel period is that the channel contention is successful.

[0320] In another example, if the state of the first node on the k-th time domain resource is the released state, and the channel state measurement result obtained by the first node on the k-th measurement time domain resource is the channel busy, then the first node can determine that the channel contention result of the first node in the first contention channel period is the channel contention failure.

[0321] Optionally, when the state of the first node on the k-th time domain resource is the released state, and the channel state measurement result obtained by the first node on the k-th measurement time domain resource is the channel idle, the first node can also determine that the channel contention result of the first node in the first contention channel period is the channel contention success.

[0322] In another example, if the state of the first node on the k-th time domain resource is occupied, and the channel state measurement result obtained by the first node on the k-th measurement time domain resource is idle, and the channel state measurement result obtained by the first node on the second measurement time domain resource is idle or busy, then the first node can determine that the channel contention result of the first node in the first contention channel period is successful.

[0323] In another example, if the state of the first node on the k-th time domain resource is occupied, and the channel state measurement result obtained by the first node on the k-th measurement time domain resource is busy, and the channel state measurement result obtained by the first node on the second measurement time domain resource is idle, then the first node can determine that the channel contention result of the first node in the first contention channel period is successful.

[0324] In another example, if the state of the first node on the k-th time domain resource is occupied, and the channel state measurement result obtained by the first node on the k-th measurement time domain resource is busy, and the channel state measurement result obtained by the first node on the second measurement time domain resource is busy, then the first node can determine that the channel contention result of the first node in the first contention channel period is a channel contention failure.

[0325] In another example, if the state of the first node on the k-th time domain resource is the released state, and the channel state measurement result obtained by the first node on the k-th measurement time domain resource is the channel idle, and the channel state measurement result obtained by the first node on the second measurement time domain resource is the channel idle, then the first node can determine that the channel contention result of the first node in the first contention channel period is the channel contention success.

[0326] In another example, if the state of the first node on the k-th time domain resource is the released state, and the channel state measurement result obtained by the first node on the k-th measurement time domain resource is the channel busy, and the channel state measurement result obtained by the first node on the second measurement time domain resource is the channel busy or the channel idle, then the first node can determine that the channel contention result of the first node in the first contention channel period is the channel contention failure.

[0327] In another example, if the state of the first node on the k-th time domain resource is the released state, and the channel state measurement result obtained by the first node on the k-th measurement time domain resource is the channel idle, and the channel state measurement result obtained by the first node on the second measurement time domain resource is the channel busy, then the first node can determine that the channel contention result of the first node in the first contention channel period is the channel contention failure.

[0328] Optionally, when the k-th time domain resource is the last time domain resource in the M-th time domain resource (i.e., the M-th measurement time domain resource), or when the k-th time domain resource is the last time domain resource in the M+1-th time domain resource (i.e., the M+1-th measurement time domain resource), the determination time (or judgment time) of the channel contention result can be made later. This will result in more measurements affecting the channel contention result, thereby increasing the probability that the first node will win the channel and reducing the probability of nodes colliding due to channel contention.

[0329] In this embodiment, if the first node determines that the channel contention result in the first contention channel period is successful, the first node can update its state from the contention channel state to the communication state after the first contention channel period ends (this can also be understood as the first node switching from the contention channel state to the communication state). It should be understood that the contention channel state indicates the state in which the first node needs to contend for the channel before sending data (or signals). For example, the first node is in the contention channel state during the first contention channel period. The communication state indicates the state in which the first node has successfully acquired the channel and can use it for communication. When the first node is in the communication state, it can send scheduling signaling and / or data on the acquired channel.

[0330] For example, the duration of a communication state can include s time-domain resource units, which can be matched with the timing of the communication and is easy to implement. Here, s is an integer greater than or equal to 1.

[0331] Optionally, if the first node is in an idle state, it may not send a signal. This effectively avoids the first node unnecessarily occupying the channel due to channel contention or invalid communication. For example, the duration of the idle state may include h time-domain resource units, which can be matched with the timing of communication and is easy to implement. Here, h is an integer greater than or equal to 1.

[0332] For example, if the first node determines that it has failed in the channel contention during the first contention channel cycle, and the first node has not yet entered the channel contention for the next contention channel cycle, or if the first node does not transmit data (or signals), then the first node can be in an idle state. Optionally, the first node can also switch from a communication state to an idle state if it has no data transmission.

[0333] Optionally, before determining the channel contention result of the first node in the first contention channel period, the first node needs to determine the state of the previous one or more time domain resources in the M time domain resources (which can be understood as needing to initialize the state of the previous one or more time domain resources in the M time domain resources). This can adjust the starting point (also known as the starting position) of the node contention channel.

[0334] The following examples illustrate the state of one or more time-domain resources in the M-segment time-domain resource.

[0335] Example a1: The first node is in the released state in the first p time domain resources of the M time domain resources.

[0336] Optionally, when determining M+1 time-domain resources based on M measured time-domain resources, the state of the first node on the first p time-domain resources in the M+1 time-domain resources can also be a released state.

[0337] Example a1 above can adjust the starting point of node contention for the channel (which can be understood as the starting point of one or more nodes competing for the channel), and can adjust the probability of nodes competing for the channel (for example, when the starting point of the channel contention is early, there are more time-domain resources to measure, the first node has more opportunities to compete for the channel, and the probability of winning the channel is also higher; or when the starting point of the channel contention is late, there are relatively fewer data to measure time-domain resources, the first node has relatively fewer opportunities to compete for the channel, and the probability of winning the channel is also relatively lower).

[0338] Example a2: The first node is in the occupied state for the first p-1 time domain resources in the M time domain resources, and the first node is in the released state for the p-th time domain resource in the M time domain resources.

[0339] Optionally, when determining M+1 time-domain resources based on M measured time-domain resources, the state of the first node on the first p-1 time-domain resources in the M+1 time-domain resources can all be in an occupied state, and the state of the first node on the p-th time-domain resource in the M+1 time-domain resources can be in a released state.

[0340] Example a2 above can adjust the starting point of node contention for the channel (one or more nodes start competing for the channel from the p-th time domain resource; if the value of p changes, the starting point of the node contention for the channel will also change), without changing the probability of the node contention for the channel (because the first node is in an occupied state in the first p-1 time domain resources, and the p-th time domain resource is freed up for inter-node channel contention).

[0341] For example, p can be determined by the first node based on its own priority, or it can be determined by the first node based on the priority of the service to be transmitted. For instance, when p is a relatively small integer value, it helps to increase the probability of high-priority nodes or high-priority services successfully competing for the channel.

[0342] In one possible implementation, if the first node is in a communication state before the first contention channel period and / or the first contention channel period satisfies a first condition, then the first node can determine that its state on the first p-1 time domain resources in the M time domain resources is occupied, and its state on the p-th time domain resource in the M time domain resources is released. This implementation can make the start point of the contention channel relatively randomized, thereby effectively avoiding the situation where multiple domains (e.g., multiple G nodes) are competing for the channel, and one or more domains have a high probability of continuously occupying the channel, while other domains have a high probability of failing to compete for the channel because the start time of the time domain resources (e.g., the first time domain resource set) used by one or more domains for channel competition is long after the end time of the time domain resources (e.g., the second time domain resource set) used by another or more domains for channel competition. For example, consider two G nodes (e.g., G1 node and G2 node). The start time of the first time domain resource set of G1 node is after the end time of the second time domain resource set of G2 node. This implementation avoids a situation where, when G1 and G2 compete for the channel, G1 likely continuously occupies the channel, while G2 likely fails to acquire the channel. This is because the start time of G1's first time-domain resource set is after the end time of G2's second time-domain resource set. The second time-domain resource set is a continuous segment of time-domain resources within the channel contention period of G2. For example, the second time-domain resource set may include at least one radio frame, at least one time slot, at least one superframe, or at least one symbol.

[0343] In another possible implementation, if the first contention channel period is the first period in which the first node is in the contention channel state and / or the first contention channel period satisfies the first condition, then the first node can determine that the state of the first node in the first p-1 time domain resources in the M-segment time domain resources is occupied, and the state of the first node in the p-th time domain resources in the M-segment time domain resources is released.

[0344] The first condition can be a constraint (or limitation) on the location of time-domain resources in the first contention channel period. For example, the first condition may include the following: the number of the first time-domain resource (or the first time-domain resource unit) included in the first contention channel period is odd; the number of the first time-domain resource (or the first time-domain resource unit) included in the first contention channel period is even; the value obtained by performing a modulo operation (or a remainder operation) between the number of the first time-domain resource (or the first time-domain resource unit) included in the first contention channel period and a first preset value is a second preset value (e.g., the number of the first time-domain resource (or the first time-domain resource unit) mod the first preset value = the second preset value); the start time of the first contention channel period is greater than or equal to a preset time; or the number of the first time-domain resource (or the first time-domain resource unit) included in the first contention channel period is greater than or equal to a preset threshold or a condition defined by the protocol. For example, the first preset value is 3, and the second preset value is 2.

[0345] Optionally, in the aforementioned M segments of time-domain resources, the state of the first node in the first p segments of time-domain resources or the state of the first node in the first p-1 segments of time-domain resources can also be determined by the first node based on the state of the first node in the last segment of time-domain resources in the O segments of time-domain resources within the second contention channel period or the state in the last e segments of time-domain resources. Here, the second contention channel period is the most recent contention channel period corresponding to the first node that precedes the first contention channel period, and e is an integer greater than 1.

[0346] For example, consider the state of the first node in the first p segments of time-domain resources as determined by the state of the first node in the last segment of time-domain resources within the O segments. If the state of the last segment of time-domain resources within the O segments is "released," then the first node can determine that the state of the first p segments of time-domain resources is "released." If the state of the last segment of time-domain resources within the O segments is "occupied," then the first node can determine that the state of the first p segments of time-domain resources is "occupied."

[0347] For example, consider the state of the first node in the first p segments of time-domain resources as determined by the state of the first node in the last e segments of time-domain resources within the O segments. If the number of time-domain resources in the last e segments of the O segments that are in a released state is greater than or equal to a third quantity threshold (or the proportion of time-domain resources in a released state is greater than or equal to a third proportion threshold), then the first node can determine that the state of the first p segments of time-domain resources is released. If the number of time-domain resources in the last e segments of the O segments that are in a occupied state is greater than or equal to a fourth quantity threshold (or the proportion of time-domain resources in a occupied state is greater than or equal to a fourth proportion threshold), then the first node can determine that the state of the first p segments of time-domain resources is occupied.

[0348] Optionally, during the first contention channel period, the first node can compete on one channel or multiple channels. When the first node competes on one channel, that channel can correspond to M time-domain resources. When the first node competes on multiple channels, each of the multiple channels can correspond to M time-domain resources. That is, when the first node competes on multiple channels, the first node determines the channel contention result of the first node in the first contention channel period based on the M time-domain resources corresponding to the multiple channels. In this embodiment, for each of the multiple channels, the first node can determine the state of the first node on the k-th time-domain resource and / or the channel state measurement result on the k-th measurement time-domain resource corresponding to the M time-domain resources of that channel. Then, the first node can determine the channel contention result of the first node in the first contention channel period based on the state on the k-th time-domain resource corresponding to the multiple channels and / or the channel state measurement result on the k-th measurement time-domain resource.

[0349] For example, consider a first node competing on N channels, where N is an integer greater than or equal to 1. During the first channel competition period, the first node determines its channel competition result based on the M time-domain resources corresponding to the N channels. It should be understood that the time-domain positions of the measurement time-domain resources corresponding to the N channels in the M time-domain resources are the same. This avoids duplex conflicts caused by different transmit / receive state configurations on different channels (e.g., for the same time-domain resource, one channel configures it as a receive state (meaning it's used to receive signals for measurement), while another channel configures it as a transmit state (meaning it's used to transmit signals)). For example, for a certain time-domain resource in the M time-domain resources, the first node uses it as a measurement time-domain resource to measure the channel state on one channel (e.g., channel 1), but uses it as a resource for transmitting signals on another channel (e.g., channel 2). Optionally, for each time-domain resource in the M time-domain resource segments, the state of the first node on that time-domain resource segment can be different or the same across the N channels. For example, consider two channels (e.g., channel 1 and channel 2) and two time-domain resource segments (e.g., time-domain resource 1 and time-domain resource 2). Channel 1 corresponds to time-domain resource 1 and time-domain resource 2, and channel 2 also corresponds to time-domain resource 1 and time-domain resource 2. In one example, for channel 1, the first node's state on time-domain resource 1 is occupied; for channel 2, the first node's state on time-domain resource 1 is released. In another example, for channel 1, the first node's state on time-domain resource 1 is released; for channel 2, the first node's state on time-domain resource 1 is released. In yet another example, for channel 1, the first node's state on time-domain resource 2 is occupied; for channel 2, the first node's state on time-domain resource 2 is occupied. In yet another example, for channel 1, the first node is in a released state on another time-domain resource 2; for channel 2, the first node is in an occupied state on another time-domain resource 2.

[0350] Optionally, when the first node competes on N channels during the first contention channel period, the first node may perform one of the following methods a1 to a3 on each of the N channels:

[0351] Method a1: The first node determines the state of the first node in the i-th time domain resource based on the state of the first node in the (i-1)th time domain resource.

[0352] Method a2: The first node determines the state of the first node on the i-th time domain resource based on the channel state measurement result on the (i-1)-th measurement time domain resource.

[0353] Method a3: The first node determines the state of the first node in the i-th time domain resource based on the state of the first node in the i-1th time domain resource and the channel state measurement result in the i-1th measurement time domain resource.

[0354] Among them, the (i-1)th segment of time-domain resources and the ith segment of time-domain resources are two consecutive segments of time-domain resources in the M segments of time-domain resources.

[0355] It is understood that the specific descriptions of methods a1 to a3 can be found in the relevant introductions of implementation methods a to c, and will not be repeated here.

[0356] For example, taking the first node competing on N channels during the first contention channel period as an example, the following examples illustrate the process by which the first node determines the channel contention result during the first contention channel period.

[0357] Example b1: If f out of N channels satisfy the second condition, and f is greater than or equal to g, then the first node can determine that the channel contention result of the first node in the first contention channel period is a successful channel contention.

[0358] Where g is the number of target channels required for communication by the first node. Where f, N, and g are all positive integers.

[0359] For example, the second condition may include at least one of the following: the state of the first node on the k-th time-domain resource is occupied, and the channel state measurement result on the k-th measurement time-domain resource is idle. The method for determining the state of the first node on the k-th time-domain resource can be found in the previous section, as can the method for determining the channel state measurement result on the k-th measurement time-domain resource; these will not be repeated here.

[0360] In one example, after the first node determines that it has successfully contested a channel in the first channel contention period, it can select g channels from f channels. Then, the first node can communicate on g channels. In this way, after each successful channel contention, the first node can use the target number of channels obtained through contention for communication, resulting in a relatively fixed communication bandwidth and a simpler communication process.

[0361] In another example, after the first node determines that it has successfully contested the channel in the first channel contention period, it can communicate on f channels. Thus, after each successful channel contention, the first node can use all the channels it has acquired for communication, and can also utilize as many resources as possible, resulting in potentially different communication bandwidths for each communication and a relatively complex communication process.

[0362] Example b2: If f out of N channels satisfy the second condition and f is less than g, or if none of the N channels satisfy the second condition, then the first node can determine that the channel contention result of the first node in the first contention channel period is a channel contention failure.

[0363] For example, with three channels (e.g., channel 1, channel 2, and channel 3), the time-domain resource of the k-th segment is... Figure 7a Taking the second time-domain resource segment as an example, with g set to 1, if one of the three channels (e.g., channel 1) satisfies at least one of the following: the first node's state on the second time-domain resource segment is occupied, or the channel state measurement result obtained by the first node on radio frame 6 (i.e., measurement time-domain resource b2) is that the channel is idle, then the first node can determine that the channel contention result in the first contention channel period is successful. Afterwards, the first node can communicate on channel 1, for example, the first node can send data on channel 1. In other words, it can be understood that on channel 1, if the first node's state on the second time-domain resource segment is occupied and / or the channel state measurement result obtained by the first node on radio frame 6 (i.e., measurement time-domain resource b2) is that the channel is idle, then the first node can successfully compete for channel 1. Since the number of successfully competed channels (1) is equal to the value of g (1), the first node can communicate on channel 1.

[0364] If two of the three channels (e.g., channel 1 and channel 2) satisfy at least one of the following conditions: the first node is in an occupied state on the second time-domain resource or the channel state measurement result obtained by the first node on radio frame 6 (i.e., measurement time-domain resource b2) is that the channel is idle, then the first node can determine that the channel contention result in the first contention channel period is successful. That is, it can be understood that on channel 1, if the first node is in an occupied state on the second time-domain resource and / or the channel state measurement result obtained by the first node on radio frame 6 (i.e., measurement time-domain resource b2) is that the channel is idle, then the first node can successfully compete for channel 1. On channel 2, if the first node is in an occupied state on the second time-domain resource and / or the channel state measurement result obtained by the first node on radio frame 6 (i.e., measurement time-domain resource b2) is that the channel is idle, then the first node can also successfully compete for channel 2. Since the number of successfully competed channels (2) is greater than the value of g (1), the first node can communicate on channel 1 and / or channel 2. For example, in one example, the first node can choose one channel between channel 1 and channel 2 (e.g., channel 2). Then, the first node can communicate on channel 2, for example, the first node sends data on channel 2. In another example, the first node can communicate on both channel 1 and channel 2, for example, the first node sends data on both channel 1 and channel 2.

[0365] If none of the three channels satisfies at least one of the following: the state of the first node on the second time domain resource is occupied or the channel state measurement result obtained by the first node on radio frame 6 (i.e., measuring time domain resource b2) is idle, then the first node can determine that the channel contention result of the first node in the first contention channel period is a channel contention failure.

[0366] For example, with three channels (e.g., channel 1, channel 2, and channel 3), the time-domain resource of the k-th segment is... Figure 7a Taking the second time-domain resource segment as an example, with g set to 2. If two of the three channels (e.g., channel 1 and channel 2) satisfy at least one of the following: the first node's state on the second time-domain resource segment is occupied, or the channel state measurement result obtained by the first node on radio frame 6 (i.e., measuring time-domain resource b2) is that the channel is idle, then the first node can determine that the channel contention result in the first contention channel period is successful. Afterwards, the first node can communicate on channel 1 and channel 2 respectively, for example, the first node can send data on channel 1 and channel 2 respectively.

[0367] If each of the three channels satisfies at least one of the following: the first node's state on the second time-domain resource is occupied, or the channel state measurement result obtained by the first node on radio frame 6 (i.e., measuring time-domain resource b2) is idle, then the first node can determine that the channel contention result in the first contention channel period is successful. In one example, the first node can choose two channels from channel 1, channel 2, and channel 3 (e.g., channel 2 and channel 3). Then, the first node can communicate on channel 2 and channel 3 respectively, for example, the first node can send data on channel 2 and channel 3 respectively. In another example, the first node can communicate on channel 1, channel 2, and channel 3 respectively, for example, the first node can send data on channel 1, channel 2, and channel 3 respectively.

[0368] If only one of the three channels or no channel satisfies at least one of the following: the state of the first node on the second time domain resource is occupied or the channel state measurement result obtained by the first node on radio frame 6 (i.e., measuring time domain resource b2) is idle, then the first node can determine that the channel contention result of the first node in the first contention channel period is a channel contention failure.

[0369] As can be seen from steps 601 to 603 above, after determining M time-domain resources based on M measured time-domain resources, the first node can determine its channel contention result in the first contention channel period based on its state on the k-th time-domain resource and / or the channel state measurement result on the k-th measured time-domain resource. This provides a corresponding channel contention mechanism for nodes using StarFlash communication technology. The state of the first node on the k-th time-domain resource reflects the channel state measurement results obtained from one or more measurements prior to the k-th time-domain resource, and the channel state measurement result on the k-th measured time-domain resource reflects the busy / idle status of the corresponding k-th time-domain resource. Since there are many measured time-domain resources for measuring channel state in the first contention channel period, by comprehensively considering multiple channel state measurement results, the channel contention result of the first node in the first contention channel period can be determined more accurately. Furthermore, since there are more time-domain resources available for measuring channel state during the first channel contention period, the first node has more opportunities to compete for the channel, making it more likely that the first node will win the channel. This allows the first node (such as the first node operating in the unlicensed frequency band) to have a higher probability of winning the channel.

[0370] It is understood that, in order to achieve the functions in the above embodiments, the first node includes the corresponding hardware structure and / or software module for executing each function. Those skilled in the art should readily recognize that, based on the units and method steps described in conjunction with the embodiments disclosed in this application, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed by hardware or by computer software driving hardware depends on the specific application scenario and design constraints of the technical solution.

[0371] Figure 9 and Figure 10 The diagram illustrates the possible structures of communication devices provided in embodiments of this application. These communication devices can be used to implement the functions of the first node in the above method embodiments, and thus also achieve the beneficial effects of the above method embodiments. In the embodiments of this application, the communication device can be the first node, or it can be a module (such as a chip) applied to the first node.

[0372] Figure 9 The communication device 900 shown includes a processing unit 910 (or may be referred to as a processing module). Optionally, Figure 9 The communication device 900 shown may further include a transceiver unit 920 (or a communication module, transceiver module, or communication module for sending and receiving data). The communication device 900 can be used to implement the above. Figure 6 The method embodiment shown illustrates the function of the first node. For example, the transceiver unit 920 can perform the receiving and sending actions performed by the first node in the above method embodiment. The processing unit 910 can perform other actions performed by the first node in the above method embodiment besides the sending and receiving actions.

[0373] When the communication device 900 is used to achieve the above Figure 6 In the method embodiment shown, the first node functions as follows: Processing unit 910 is used to determine M measurement time-domain resources. The M measurement time-domain resources can be used to measure channel state, and M is an integer greater than 1. Processing unit 910 is also used to determine M segments of time-domain resources based on the M measurement time-domain resources. Processing unit 910 is also used to determine the channel contention result of the first node in the first contention channel period based on the state of the first node on the k-th segment of time-domain resources and / or the channel state measurement result on the k-th measurement time-domain resource. The k-th segment of time-domain resources is one of the M segments of time-domain resources, and the k-th measurement time-domain resource is one of the M measurement time-domain resources. Transceiver unit 920 is used to perform corresponding transmit / receive operations, such as transmitting signals on a certain time-domain resource or transmitting data or signaling on the channel.

[0374] For a more detailed description of the processing unit 910 and the transceiver unit 920, please refer to the above. Figure 6 The relevant descriptions in the method embodiments shown will not be repeated here.

[0375] It should be understood that the transceiver unit 920 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components, and the processing unit 910 can be implemented by a processor or processor-related circuit components.

[0376] It should be noted that the module division in the embodiments of this application is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods. Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, exist as separate physical entities, or have two or more units integrated into one unit. The integrated units described above can be implemented in hardware or as software functional units.

[0377] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, or a server, etc.) or processor to execute all or part of the steps of the methods of the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as a USB flash drive, a portable hard drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0378] Figure 10 The communication device 1000 shown includes a processor 1010. Optionally, the communication device 1000 may also include at least one of a memory 1020, a transceiver 1030, and an antenna 1040.

[0379] The transceiver 1030 can be a transceiver unit, transceiver, or transceiver circuit, etc., used to implement transceiver functions. The transceiver 1030 can include a receiver and a transmitter. The receiver can be a receiver or receiving circuit, etc., used to implement the receiving function; the transmitter can be a transmitter or transmitting circuit, etc., used to implement the transmitting function.

[0380] The memory 1020 may store a computer program, software code, or instructions 1050, which may also be referred to as firmware. The processor 1010 can control the communication device 1000 by running its own computer program, software code, or instructions 1060, or by calling the computer program, software code, or instructions 1050 stored in the memory 1020, to implement the embodiments described above. The processor 1010 may be a central processing unit (CPU), and the memory 1020 may be a read-only memory (ROM) or a random access memory (RAM).

[0381] The processor 1010 and transceiver 1030 described in this application can be disposed on an integrated circuit (IC), analog IC, radio frequency integrated circuit (RFIC), mixed signal IC, application specific integrated circuit (ASIC), printed circuit board (PCB), or electronic device.

[0382] The modules included in the communication device 1000 are merely illustrative examples, and this application does not impose any limitations on them.

[0383] When the communication device 1000 is used to implement the above method embodiments, the processor 1010 can implement the functions of the processing unit 910, and the transceiver 1030 can implement the functions of the transceiver unit 920.

[0384] Based on the same concept, embodiments of this application also provide a possible communication system. This communication system may include one or more first nodes. The first nodes can be used to implement the technical solutions related to the first nodes in the above embodiments. Optionally, the communication system may also include one or more second nodes. For example, the second node may be... Figure 4 The second communication device shown (e.g., the T-node device).

[0385] Based on the same concept, this application also provides a computer program product, which includes a computer program or instructions that, when run on a communication device (or computer), cause the communication device (or computer) to perform the methods provided in the above embodiments.

[0386] Based on the same concept, embodiments of this application also provide a computer-readable storage medium storing a computer program or instructions that, when executed by a communication device (or computer), cause the communication device (or computer) to perform the methods provided in the above embodiments.

[0387] The storage medium can be any available medium that a computer can access. For example, but not limited to, a computer-readable medium can include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.

[0388] Based on the same concept, embodiments of this application also provide a chip, which may include a processor and a memory (or the chip may be coupled to the memory). The processor executes program instructions in the memory to cause the chip to perform the methods provided in the above embodiments. Here, "coupling" means that two components are directly or indirectly connected to each other, such as coupling can refer to an electrical connection between two components.

[0389] Based on the same concept, embodiments of this application also provide a chip system, which includes a processor for supporting a computer device in implementing the functions involved in the first node of the above embodiments. In one possible implementation, the chip system further includes a memory for storing necessary programs and data of the computer device. This chip system may be composed of chips or may include chips and other discrete devices.

[0390] It is understood that the processor in the embodiments of this application may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. A general-purpose processor may be a microprocessor or any conventional processor.

[0391] The method steps in the embodiments of this application can be implemented in hardware or by a processor executing software instructions. The software instructions can consist of corresponding software modules, which can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disks, portable hard disks, compact disc read-only memory (CD-ROM), or any other form of storage medium known in the art. An exemplary storage medium is coupled to a processor, enabling the processor to read information from and write information to the storage medium. Of course, the storage medium can also be a component of the processor. The processor and storage medium can reside in an ASIC. Furthermore, the ASIC can reside in a first node. Alternatively, the processor and storage medium can exist as discrete components in the first node.

[0392] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer programs or instructions. A computer program is a set of instructions that directs each step of an action of an electronic computer or other device with message processing capabilities. It is typically written in a programming language and runs on a target architecture. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of this application are performed, in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer program or instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; it can also be an optical medium, such as a digital video optical disc; or it can be a semiconductor medium, such as a solid-state drive. The computer-readable storage medium can be volatile or non-volatile, or it can include both types of storage media.

[0393] In the various embodiments of this application, unless otherwise specified or in case of logical conflict, the terminology and / or descriptions between different embodiments are consistent and can be referenced by each other. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0394] In this application, "at least one" means one or more, and "more than one" means two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. In the textual description of this application, the character " / " generally indicates an "or" relationship between the preceding and following related objects; in the formulas of this application, the character " / " indicates a "division" relationship between the preceding and following related objects.

[0395] It is understood that the various numerical designations used in the embodiments of this application are merely for descriptive convenience and are not intended to limit the scope of the embodiments of this application. The order of the process numbers described above does not imply the order of execution; the execution order of each process should be determined by its function and internal logic.

Claims

1. A communication method, characterized in that, Applied to the first node, the method includes: M measurement time-domain resources are determined, and the M measurement time-domain resources are used to measure the channel state, where M is an integer greater than 1; Based on the M measured time-domain resources, determine M time-domain resources; Based on the state of the first node on the k-th time domain resource and / or the channel state measurement result on the k-th measurement time domain resource, the channel contention result of the first node in the first contention channel period is determined, wherein the k-th time domain resource is one of the M time domain resources, and the k-th measurement time domain resource is one of the M measurement time domain resources.

2. The method as described in claim 1, characterized in that, The method further includes: Based on the state of the first node in the (i-1)th segment of time domain resources, the state of the first node in the i-th segment of time domain resources is determined. The (i-1)th segment of time domain resources and the i-th segment of time domain resources are two consecutive segments of time domain resources in the M segments of time domain resources.

3. The method as described in claim 2, characterized in that, Based on the state of the first node in the (i-1)th time domain resource segment, determine the state of the first node in the i-th time domain resource segment, including: If the state of the first node on the (i-1)th time-domain resource segment is a released state, then the state of the first node on the i-th time-domain resource segment is determined to be a released state; or, If the state of the first node on the (i-1)th time domain resource is occupied, then the state of the first node on the i-th time domain resource is determined to be occupied.

4. The method as described in claim 1, characterized in that, The method further includes: Based on the channel state measurement result on the (i-1)th measurement time domain resource, the state of the first node on the i-th segment of time domain resource is determined. The (i-1)th segment of time domain resource corresponding to the (i-1)th measurement time domain resource and the i-th segment of time domain resource are two consecutive segments of time domain resources in the M segments of time domain resources.

5. The method as described in claim 4, characterized in that, Based on the channel state measurement results on the (i-1)th measurement time-domain resource, the state of the first node on the i-th time-domain resource is determined, including: If the channel state measurement result on the (i-1)th measurement time-domain resource is "channel idle", then the state of the first node on the i-th time-domain resource is determined to be "occupied"; or, If the channel state measurement result on the (i-1)th measurement time domain resource is "channel busy", then the state of the first node on the i-th segment of the time domain resource is determined to be "released".

6. The method as described in claim 1, characterized in that, The method further includes: Based on the state of the first node on the (i-1)th time domain resource and the channel state measurement result on the (i-1)th measurement time domain resource, the state of the first node on the i-th time domain resource is determined. The (i-1)th time domain resource and the i-th time domain resource are two consecutive time domain resources in the M-segment time domain resources.

7. The method as described in claim 6, characterized in that, Based on the state of the first node in the (i-1)th time domain resource and the channel state measurement result in the (i-1)th measurement time domain resource, the state of the first node in the i-th time domain resource is determined, including: If the state of the first node on the (i-1)th time-domain resource is occupied, and the channel state measurement result on the (i-1)th measurement time-domain resource is idle, then the state of the first node on the i-th time-domain resource is determined to be occupied; or, If the state of the first node on the (i-1)th time domain resource is occupied, and the channel state measurement result on the (i-1)th measurement time domain resource is busy, then the state of the first node on the i-th time domain resource is determined to be released.

8. The method according to any one of claims 1-7, characterized in that, The method further includes: If the first node is in an occupied state on the t-th time domain resource, then a signal is sent on the t-th time domain resource, where the t-th time domain resource is a segment of the M time domain resources; or... If the first node is in an occupied state on the t-th time domain resource, and there is a resource in the t-th time domain resource for transmitting signals, then the signal is transmitted on the t-th time domain resource, where the t-th time domain resource is a segment of the M-th time domain resources.

9. The method according to any one of claims 1-8, characterized in that, The M is pre-configured; or, M is determined based on at least one channel state measurement result prior to the first contention channel period and / or the communication performance of the first node prior to the first contention channel period.

10. The method according to any one of claims 1-9, characterized in that, The M time-domain resources correspond one-to-one with the M measurement time-domain resources, and each measurement time-domain resource is located at the end of a time-domain resource corresponding to the measurement time-domain resource.

11. The method according to any one of claims 1-10, characterized in that, The temporal location of at least one of the M measurement time-domain resources is determined based on a random selection method.

12. The method according to any one of claims 1-11, characterized in that, The M measurement time-domain resources do not overlap, and the M time-domain resources are continuous in the time domain.

13. The method according to any one of claims 1-12, characterized in that, The channel state measurement results on the measurement time-domain resources are obtained by measuring some or all of the resources in the measurement time-domain resources.

14. The method according to any one of claims 1-13, characterized in that, The M-segment time-domain resources are located in the first contention channel period.

15. The method according to any one of claims 1-14, characterized in that, The first node is in a released state for the first p time-domain resources in the M time-domain resources; or... The first node is in an occupied state for the first p-1 time domain resources in the M time domain resources, and the first node is in a released state for the p-th time domain resource in the M time domain resources.

16. The method as described in claim 15, characterized in that, The value of p is determined based on the priority of the first node; or, The value of p is determined based on the priority of the service to be transmitted.

17. The method as described in claim 15 or 16, characterized in that, If the first node is in a communication state before the first contention channel period and / or the first contention channel period meets the first condition, then the state of the first node on the first p-1 time domain resources is occupied, and the state of the first node on the p-th time domain resources is released. or, If the first contention channel period is the first period in which the first node is in the contention channel state and / or the first contention channel period satisfies the first condition, then the state of the first node on the first p-1 time domain resources is the occupied state, and the state of the first node on the p-th time domain resources is the released state.

18. The method according to any one of claims 1-17, characterized in that, The first contention channel period contains q time-domain resource units, where q is an integer greater than or equal to 1; Wherein, q is pre-configured; or, The q is determined based on at least one channel state measurement result prior to the first contention channel period and / or the communication performance of the first node prior to the first contention channel period.

19. The method according to any one of claims 1-18, characterized in that, The method further includes: The channel contention result is determined based on the state of the first node on the k-th time-domain resource and / or the channel state measurement result on the k-th measurement time-domain resource, and the channel state measurement result on the second measurement time-domain resource, wherein the M measurement time-domain resources are the first measurement time-domain resources, and the second measurement time-domain resources are different from the first measurement time-domain resources.

20. The method according to any one of claims 1-19, characterized in that, If the channel contention result is successful, then after the first contention channel period ends, the state of the first node is updated from the contention channel state to the communication state. The duration of the communication state includes s time-domain resource units, where s is an integer greater than or equal to 1.

21. The method according to any one of claims 1-20, characterized in that, The method further includes: If the first node is in an idle state, no signal is sent. The duration of the idle state includes h time-domain resource units, where h is an integer greater than or equal to 1.

22. The method according to any one of claims 1-21, characterized in that, During the first contention channel period, the first node competes on N channels, each of the N channels corresponding to the M time domain resources; The method further includes: If f channels out of the N channels all satisfy the second condition, and f is greater than or equal to g, then the channel contention result is determined to be a successful channel contention, where g is the number of target channels required for the first node to communicate, and f, N, and g are all positive integers. The second condition includes at least one of the following: the state of the first node on the k-th time domain resource is occupied, and the channel state measurement result on the k-th measurement time domain resource is idle.

23. The method as described in claim 22, characterized in that, After determining that the channel contention result is a successful channel contention, the method further includes: Choose g channels from the f channels and communicate on the g channels; or, Communication is conducted on the f channels.

24. The method according to any one of claims 1-23, characterized in that, During the first contention channel period, the first node competes on N channels, and the first node performs one of the following steps on each of the N channels: Based on the state of the first node in the (i-1)th time-domain resource segment, determine the state of the first node in the i-th time-domain resource segment, where the (i-1)th time-domain resource segment and the i-th time-domain resource segment are two consecutive time-domain resource segments among the M time-domain resource segments; or... Based on the channel state measurement result on the (i-1)th measurement time-domain resource, the state of the first node on the i-th time-domain resource segment is determined, wherein the (i-1)th time-domain resource segment corresponding to the (i-1)th measurement time-domain resource and the i-th time-domain resource segment are two consecutive time-domain resources in the M time-domain resources; or... Based on the state of the first node on the (i-1)th time domain resource and the channel state measurement result on the (i-1)th measurement time domain resource, the state of the first node on the i-th time domain resource is determined. The (i-1)th time domain resource and the i-th time domain resource are two consecutive time domain resources in the M-segment time domain resources.

25. A communication device, characterized in that, Includes modules or units for performing the method as described in any one of claims 1-24.

26. A communication device, characterized in that, Including processor and memory; The memory is used to store computer programs; The processor is configured to execute a computer program in the memory such that the method described in any one of claims 1-24 is implemented.

27. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program or instructions that, when executed by a communication device, cause the method described in any one of claims 1-24 to be implemented.

28. A computer program product, characterized in that, The computer program product includes a computer program or instructions that, when executed on a communication device, cause the method described in any one of claims 1-24 to be implemented.

29. A chip, characterized in that, The chip includes a processor coupled to a memory, the processor being configured to execute program instructions stored in the memory such that the method described in any one of claims 1-24 is implemented.

Images