Communication method and apparatus

Abstract

The present application provides a communication method and apparatus for use in providing a contention channel mechanism suitable for NearLink communication technology. The method comprises: a first node determining M measurement time domain resources; determining M time domain resources on the basis of the M measurement time domain resources; and on the basis of a state of the first node on a k-th time domain resource and / or a channel state measurement result on a k-th measurement time domain resource, determining a channel contention result of the first node in a first contention channel period, wherein the M measurement time domain resources are used for measuring channel states, M is an integer greater than 1, 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. There are many measurement time domain resources within the first contention channel period, so that a channel contention result can be more accurately determined by comprehensively considering a plurality of channel state measurement results, and the first node is also provided with more opportunities to contend for a channel, thereby increasing the probability that the first node obtains the channel.

Description

A communication method and apparatus

[0001] Cross-reference to Related Applications

[0002] This application claims priority to the Chinese Patent Application No. 202411136364.2, filed on August 15, 2024, and entitled “A communication method and apparatus”, the entire contents of which are incorporated herein by reference. TECHNICAL FIELD

[0003] The present application relates to the field of communication technology, and in particular, to a communication method and apparatus. BACKGROUND

[0004] The development of wireless local area network (WLAN) makes wireless communication more and more popular. The standards (i.e., 802.11 protocol group) for WLAN formulated by the Institute of Electrical and Electronics Engineers (IEEE) also evolve accordingly.

[0005] With the continuous development of Internet of Things technology, short-distance communication technologies such as WLAN technology may not be able to well meet more application scenarios and requirements, and therefore, sparklink or nearlink communication technology for short-distance communication emerges as the times require. Currently, nodes working in the unlicensed frequency band using wireless fidelity (WiFi) technology (or Bluetooth technology or cellular network) compete for channels by using a corresponding contention channel mechanism (also referred to as a channel contention mechanism or a random access mechanism), so that the nodes can communicate using the contended channel. However, if the nodes working in the unlicensed frequency band use sparklink communication technology, a contention channel mechanism suitable for sparklink communication technology needs to be designed. Based on this, how to design a contention channel mechanism suitable for sparklink communication technology becomes a problem to be solved. SUMMARY

[0006] The present application provides a communication method and apparatus for providing a contention channel mechanism suitable for sparklink communication technology.

[0007] In a first aspect, the present application provides a communication method, which can be executed by a first node or a module (such as a processor, a processing unit, a chip system, a circuit or a chip, etc.) in the first node. Alternatively, the method can also be implemented by a logical node, a logical module or software capable of implementing all or part of the functions of the first node. Exemplarily, the following takes the first node executing the communication method as an example. The method can comprise the following steps: determining, by the first node, M measurement time domain resources, determining M time domain resources according to the M measurement time domain resources, and determining, by the first node, a channel contention result of the first node in a first contention channel period according to a state of the first node on a kth time domain resource of the M time domain resources and / or a channel state measurement result on a kth measurement time domain resource of the M measurement time domain resources, wherein the M measurement time domain resources are used for measuring channel states, 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.

[0008] In the method, after determining the M time domain resources according to the M measurement time domain resources, the first node can determine the channel contention result of the first node in the first contention channel period according to the state of the first node on the kth time domain resource of the M time domain resources and / or the channel state measurement result on the kth measurement time domain resource, thereby providing a corresponding (or matched) contention channel mechanism for nodes using star flash communication technology. The state of the first node on the kth time domain resource can reflect one or more channel state measurement results obtained by measurement before the kth time domain resource, and the channel state measurement result on the kth measurement time domain resource can reflect the busy / idle state of the channel corresponding to the kth time domain resource. In the first contention channel period, there are more measurement time domain resources for measuring channel states, which can comprehensively consider multiple channel state measurement results and more accurately determine the channel contention result of the first node in the first contention channel period. In addition, since there are more measurement time domain resources for measuring channel states in the first contention channel period, the first node has more opportunities to contend for the channel, so that the first node (such as the first node working in the unlicensed frequency band) has a relatively large probability of contending for the channel.

[0009] In a possible implementation, the method further comprises:

[0010] The first node determines the state of the first node on the ith time domain resource according to the state of the first node on the (i-1)th time domain resource, wherein the (i-1)th time domain resource and the ith time domain resource are two consecutive time domain resources in the M time domain resources.

[0011] In the above implementation, the state of the first node on the i-th time domain resource is determined according to the state of the first node on the (i-1)-th time domain resource, so that the state on the i-th time domain resource is continued from the state on the (i-1)-th time domain resource, which can improve the probability of the node occupying the channel and can reduce the probability of the node occupying the channel.

[0012] In a possible implementation, the first node determines the state of the first node on the i-th time domain resource according to the state of the first node on the (i-1)-th time domain resource, including the following possible implementations:

[0013] Implementation A: If the state of the first node on the (i-1)-th time domain resource is the release state, the first node can determine that the state of the first node on the i-th time domain resource is the release state.

[0014] The above implementation A can make the i-th time domain resource not occupy the channel after the (i-1)-th time domain resource releases the channel, and the probability of the node occupying the channel is low, which is suitable for low-priority nodes or low-priority services.

[0015] Implementation B: If the state of the first node on the (i-1)-th time domain resource is the occupation state, the first node can determine that the state of the first node on the i-th time domain resource is the occupation state.

[0016] The above implementation B can make the i-th time domain resource not release the channel after the (i-1)-th time domain resource occupies the channel, and the probability of the node occupying the channel is high, which is suitable for high-priority nodes or high-priority services.

[0017] In a possible implementation, the method further includes:

[0018] The first node determines the state of the first node on the i-th time domain resource according to a channel state measurement result on an (i-1)-th measurement time domain resource, where the (i-1)-th measurement time domain resource and the i-th time domain resource correspond to two consecutive time domain resources in the M time domain resources.

[0019] In the above implementation, the state of the first node on the i-th time domain resource is determined according to the channel state measurement result measured on the (i-1)-th measurement time domain resource, which can realize mutual competition of the nodes for occupying the channel.

[0020] In a possible implementation, the first node determines the state of the first node on the i-th time domain resource according to the channel state measurement result on the (i-1)-th measurement time domain resource, including:

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

[0022] If the channel state measurement result on the i-1th measurement time domain resource is channel busy, the first node can determine that the state of the first node on the ith time domain resource is released state.

[0023] The above implementation manner can accurately determine the state of the first node on the next time domain resource according to the channel busy / idle state measured on the i-1th measurement time domain resource. For example, if the channel is detected to be idle (i.e., no other node occupies the channel), the first node can immediately occupy the channel on the next time domain resource. If the channel is detected to be busy (i.e., other nodes occupy the channel), the first node can immediately release the channel on the next time domain resource. In this way, the process of mutual competition of nodes to occupy the channel can be realized.

[0024] In a possible implementation manner, the method further includes:

[0025] The first node determines the state of the first node on the ith time domain resource according to the state of the first node on the i-1th time domain resource and the channel state measurement result on the i-1th measurement time domain resource, wherein the i-1th time domain resource and the ith time domain resource are two continuous time domain resources in the M time domain resources.

[0026] In the above implementation manner, the state of the first node on the ith time domain resource is determined according to the state of the first node on the i-1th time domain resource and the channel state measurement result on the i-1th measurement time domain resource, which can realize the process of node competition to occupy the channel, and can help to reduce the probability of resource conflict between nodes by performing conflict detection on the channel occupied by the first node based on the i-1th measurement time domain resource when the state of the first node on the i-1th time domain resource is occupied state.

[0027] In a possible implementation manner, the first node determines the state of the first node on the ith time domain resource according to the state of the first node on the i-1th time domain resource and the channel state measurement result on the i-1th measurement time domain resource, including:

[0028] If the state of the first node on the i-1th time domain resource is occupied state, and the channel state measurement result on the i-1th measurement time domain resource is channel idle, the first node can determine that the state of the first node on the ith time domain resource is occupied state; or

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

[0030] In the above implementation, in the case that the state of the first node on the (i-1)th time domain resource is the occupied state, the determination of whether there is another node also occupying the channel by performing the collision detection based on the (i-1)th measurement time domain resource on the channel occupied by the first node, releasing the channel if there is another node also occupying the channel, and not releasing the channel if there is no other node also occupying the channel, can help to reduce the probability of resource collision between nodes.

[0031] In a possible implementation, the method further includes:

[0032] If the state of the first node on the tth time domain resource is the occupied state, the first node can send a signal on the tth time domain resource, where the tth time domain resource is one of the M time domain resources; or

[0033] If the state of the first node on the tth time domain resource is the occupied state, and there is a resource for sending a signal in the tth time domain resource, the first node can send a signal on the tth time domain resource, where the tth time domain resource is one of the M time domain resources.

[0034] In the above implementation, the first node sends a signal on the tth time domain resource in the occupied state, so that other nodes can measure the energy of the signal sent by the first node on the tth time domain resource, and thus know that there is a node currently occupying the channel, thereby realizing the temporary occupation of the channel by the first node.

[0035] In a possible implementation, M can be preconfigured; or

[0036] M can be determined according to at least one channel state measurement result before the first contention channel period and / or the communication performance of the first node before the first contention channel period.

[0037] In the above implementation, M can be pre-configured according to actual requirements, so as to meet the requirements of different users. Alternatively, M can be timely and effectively adjusted (or updated) based on at least one channel state measurement result before the first contention channel period and / or the communication performance of the first node before the first contention channel period, so as to timely reduce the value of M when it is determined that the channel is congested before the first contention channel period, thereby reducing the number of measurement time domain resources, helping to reduce the probability of collision caused by the same time domain position of the measurement time domain resources of different nodes, and increasing the value of M when it is determined that the channel is relatively idle before the first contention channel period, thereby increasing the number of measurement time domain resources, helping to increase the probability of the first node competing for the channel (it can be understood that the opportunity of the first node competing for the channel is increased, and the probability of the first node competing for the channel is also increased).

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

[0039] In the above implementation, by locating one measurement time domain resource at the tail position of the time domain resource corresponding to the measurement time domain resource, the channel state measurement result measured 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 after the measurement time domain resource.

[0040] In a possible implementation, the time domain position of at least one measurement time domain resource in the M measurement time domain resources is determined based on a random selection manner.

[0041] In the above implementation, by determining the time domain position of at least one measurement time domain resource in the M measurement time domain resources based on a random selection manner, the time domain position of the measurement time domain resource is randomized, which helps to reduce the probability that the time domain positions of all measurement time domain resources of multiple domains (such as multiple G nodes) are the same, so as to enable multiple domains to coexist through the contention channel.

[0042] In a possible implementation, the M measurement time domain resources do not overlap with each other, and the M time domain resources are continuous in time domain.

[0043] In the above implementation, since the M measurement time domain resources are different, the first node has more opportunities to contend for the channel, thereby improving the probability of the first node contending for and obtaining the channel. In addition, the above implementation can avoid the complex situation of two measurement resources partially overlapping, thereby helping to avoid complicating the measurement process and the scheme of making decisions based on the measurement results. Furthermore, the M time domain resources are continuous in the time domain, and the channel state measurement results can directly affect whether the channel is occupied in the most adjacent time domain resource, thereby ensuring the timeliness of the channel state measurement results.

[0044] In a possible implementation, the channel state measurement result on the measurement time domain resource can be measured on part or all of the measurement time domain resource.

[0045] In the above implementation, if part of the measurement time domain resource is used to measure the channel state, the remaining part of the measurement time domain resource (or part of the remaining part) can be used for the node to perform some internal processing operations (for example, the node can use the remaining part to calculate the measurement result and determine the state of the first node on the time domain resource after the measurement time domain resource (for example, the state of the first node on the time domain resource after the measurement time domain resource is an occupied state or a released state)) after measuring the busy state of the channel, or the remaining part (or part of the remaining part) can be used for the node to send a signal.

[0046] In a possible implementation, the M time domain resources can be located in the first contention channel period.

[0047] In the above implementation, the first node determines the measurement time domain resource 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, and therefore it is not necessary to temporarily change (or adjust) the transmission state or the reception state of the time domain resource according to the channel state measurement result, which is easy to implement. Specifically, the first node can determine, before the first contention channel period, which time domain resources in the time domain resource unit included in the first contention channel period are configured as the reception state for measurement and which time domain resources are configured as the transmission state for signal transmission when in the occupied state.

[0048] In a possible implementation, the state of the first node on the first p time domain resources in the M time domain resources is a released state.

[0049] The state of the first node on the first p-1 time domain resources in the M time domain resources is an occupied state, and the state of the first node on the pth time domain resource in the M time domain resources is a released state.

[0050] In the foregoing implementation, by causing (or designing or setting) the first node to have a release state on the first p time domain resources in the M time domain resources, the starting point of the node to contend for the channel can be adjusted, and the probability of the node to contend for the channel can be adjusted (for example, when the starting point of contending for the channel is early, the first node has more opportunities to contend for the channel, and has a larger probability to contend for and obtain the channel, or when the starting point of contending for the channel is late, the first node has relatively fewer opportunities to contend for the channel, and has a relatively smaller probability to contend for and obtain the channel). In addition, by causing the first node to have an occupied state on the first p-1 time domain resources in the M time domain resources, and causing the first node to have a release state on the pth time domain resource in the M time domain resources, the starting point of the node to contend for the channel can be adjusted, and the probability of the node to contend for the channel is not changed (because the first node has an occupied state on the first p-1 time domain resources, the pth time domain resource is left for the nodes to contend for the channel).

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

[0052] P can be determined based on a priority of the to-be-transmitted service.

[0053] In the foregoing implementation, when p is a relatively small integer value, for a node with a high priority or a service with a high priority, it is helpful to make the probability of the node with the high priority or the service with the high priority to contend for the channel to be higher.

[0054] In a 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, the first node has an occupied state on the first p-1 time domain resources, and has a release state on the pth time domain resource; or,

[0055] If the first contention channel period is the first period in which the first node is in a contention channel state and / or the first contention channel period satisfies the first condition, the first node has an occupied state on the first p-1 time domain resources, and has a release state on the pth time domain resource.

[0056] The implementation manner can randomize the start point of the contention channel, thereby effectively avoiding the situation that one or more domains (for example, one or more G nodes) continuously occupy the channel with high probability and other one or more domains fail to contend for the channel with high probability due to the start time of the time domain resource for the contention channel of the one or more domains being located after the end time of the time domain resource for the contention channel of the other one or more domains for a long time. For example, the solution is used when the time domain resource position of the first contention channel period satisfies the first condition, or the solution is not used when the time domain resource position of the first contention channel period does not satisfy the first condition, which is beneficial to further randomize the start point position of the contention channel, thereby effectively avoiding the problem that one or more domains continuously occupy the channel with high probability and other one or more domains fail to contend for the channel with high probability. The first condition can be a restriction condition (or limitation condition) of the time domain resource position of the first contention channel period.

[0057] In a possible implementation manner, the first contention channel period can include q time domain resource units, where q is an integer greater than or equal to 1.

[0058] The q can be preconfigured, or

[0059] The q can be determined according to at least one channel state measurement result before the first contention channel period and / or communication performance of the first node before the first contention channel period.

[0060] In the implementation manner, the q can be preconfigured according to actual requirements, thereby meeting the requirements of different users. Alternatively, the q can be adjusted in a timely and effective manner based on at least one channel state measurement result before the first contention channel period and / or communication performance of the first node before the first contention channel period, thereby expanding the selection range of the measurement time domain resource, obtaining a more reasonable selection range of the measurement time domain resource, obtaining greater randomness of the measurement time domain resource position, reducing the probability of conflict due to the time domain positions of the measurement time domain resources of different nodes being possibly the same, ensuring that the first contention channel period includes a reasonable number of time domain resources, increasing the density of the measurement time domain resource, improving the probability of occupying the channel, and reducing the waste of the time domain resource.

[0061] In a possible implementation manner, the method further includes:

[0062] The first node determines the channel competition result according to a state of the first node on the kth time domain resource and / or a channel state measurement result on the kth measurement time domain resource and a channel state measurement result on a 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 resource is different from the first measurement time domain resource.

[0063] In the implementation manner, the channel competition result is further accurate by combining the state of the first node on the kth time domain resource and / or the channel state measurement result measured by the first node on the kth measurement time domain resource with the channel state measurement result measured by the first node on the second measurement time domain resource, so that the success rate of the node occupying the channel is further improved, and interference from other nodes can be avoided to some extent.

[0064] In a possible implementation manner, if the channel competition result is channel competition success, the state of the first node can be updated (or adjusted or switched) from the competition channel state to a communication state after the first competition channel period ends, wherein a time length of the communication state can include s time domain resource units, and s is an integer greater than or equal to 1.

[0065] The implementation manner can enable the first node to timely switch the state of the first node from the competition channel state to the communication state after the first competition channel period ends, so that the first node can timely perform communication. In addition, the time length of the communication state is an integer number of time domain resource units, which is matched with a node (or device) scheduling transmission timing and is easy to implement.

[0066] In a possible implementation manner, the method further includes:

[0067] If the state of the first node is an idle state, the first node does not send a signal, wherein a time length of the idle state can include h time domain resource units, and h is an integer greater than or equal to 1.

[0068] The implementation manner can effectively avoid the first node from unnecessarily occupying the channel due to competition for the channel or invalid communication.

[0069] In a possible implementation manner, the first node competes for N channels in the first competition channel period, wherein each of the N channels corresponds to M time domain resources.

[0070] The method further includes:

[0071] If f channels in the N channels all satisfy the second condition, and f is greater than or equal to g, the first node can determine that the channel competition result is channel competition success, g is a target channel quantity required by the first node for communication, and f, N and g are positive integers.

[0072] The second condition can include at least one of the following: the state of the first node on the kth time domain resource is an occupied state, and the channel state measurement result on the kth measurement time domain resource is a channel idle.

[0073] In the above implementation, g represents the minimum number of channels satisfying the communication requirement of the first node. When the number of channels obtained by the first node through competition is less than g, the communication requirement of the first node is not satisfied, and therefore the first node needs to continue to compete for channels in the next channel competition period. When the number of channels obtained by the first node through competition is greater than or equal to g, the communication requirement of the first node is satisfied, and therefore the first node can communicate based on the channels obtained through competition.

[0074] In a possible implementation, after the first node determines that the channel competition result is channel competition success, the method further includes:

[0075] The first node can select g channels from the f channels and communicate on the g channels; or

[0076] The first node can communicate on the f channels.

[0077] In the above implementation, when the first node uses g channels from the f channels obtained through competition for communication (it can be understood that the first node uses a target number of channels from all channels obtained through competition for communication) after each time of successful channel competition, the communication bandwidth of each communication can be relatively fixed, and the communication process is relatively simple. When the first node uses the f channels obtained through competition for communication (it can be understood that the first node uses all channels obtained through competition for communication), as many resources as possible can be occupied to obtain as high a communication rate as possible.

[0078] In a possible implementation, the first node competes on N channels in the first channel competition period, and the first node performs the following step on each of the N channels:

[0079] The first node determines the state of the first node on the ith time domain resource according to the state of the first node on the (i-1)th time domain resource, where the (i-1)th time domain resource and the ith time domain resource are two continuous time domain resources in the M time domain resources; or

[0080] The first node determines the state of the first node on the ith time domain resource according to the channel state measurement result on the (i-1)th measurement time domain resource, where the (i-1)th time domain resource corresponding to the (i-1)th measurement time domain resource and the ith time domain resource are two continuous time domain resources in the M time domain resources; or

[0081] The first node determines a state of the first node on the i-th time domain resource according to a state of the first node on the (i-1)-th time domain resource and a channel state measurement result on the (i-1)-th measurement time domain resource, wherein the (i-1)-th time domain resource and the i-th time domain resource are two continuous time domain resources in the M time domain resources.

[0082] In the above implementation, when the first node competes for the channels on the multiple channels, the measurement resource time domain positions of the channels are the same, and a duplex problem caused by different channel transmission configurations (which can be understood as a time domain resource configuration available for receiving a signal and a time domain resource configuration available for transmitting a signal) can be avoided. In addition, the first node independently performs a process of competing for and occupying the channels on the multiple channels, so that the probability of competing for and occupying each channel can be improved. The state of the time domain resource available for receiving a signal is a receiving state, and the state of the time domain resource available for transmitting a signal is a transmitting state.

[0083] In a second aspect, a communication apparatus is provided. The communication apparatus can implement the steps of the methods in the first aspect.

[0084] For example, the communication apparatus can be the first node, and can also be a module (such as a processor, a processing unit, a chip system, a circuit or a chip, etc.) in the first node. The communication apparatus has a function of implementing any of the implementation methods of the first aspect. The function can be implemented by hardware, or can be implemented by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions.

[0085] In a third aspect, a communication apparatus is provided. The communication apparatus has a function of implementing the first aspect. For example, the communication apparatus includes a module or unit or means corresponding to the operations of the first aspect, and the function or unit or means can be implemented by software, or can be implemented by hardware, or can be implemented by hardware executing corresponding software.

[0086] In a possible implementation, the communication apparatus can include a processing unit (or can be referred to as a processing module). Optionally, the communication apparatus can also include a transceiver unit (or can be referred to as a communication module or a transceiver module or a communication module, used for transmitting and receiving data). The transceiver unit can be used to transmit and receive signals to implement communication between the communication apparatus and other apparatuses, for example, the transceiver unit is used to transmit data to other communication apparatuses; the processing unit can be used to perform some internal operations of the communication apparatus. The functions performed by the transceiver unit and the processing unit can correspond to the operations of the first aspect.

[0087] In a possible implementation, the communication apparatus includes a processor, which can be configured to be coupled with a memory. The memory can store computer programs or instructions necessary for implementing the functions related to the first aspect. The processor can execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, the communication apparatus can implement the method in any possible implementation of the first aspect.

[0088] In a possible implementation, the communication apparatus includes a processor and a memory, and the memory can store computer programs or instructions necessary for implementing the functions related to the first aspect. The processor can execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, the communication apparatus can implement the method in any possible implementation of the first aspect.

[0089] In a possible implementation, the communication apparatus includes a processor and a transceiver (or a communication interface or an interface circuit), wherein the processor is configured to communicate with other apparatuses through the transceiver and execute the method in any possible implementation of the first aspect. The transceiver is configured to implement the communication between the communication apparatus and other apparatuses, for example, to receive signals from other communication apparatuses and transmit the signals to the processor or transmit signals from the processor of the communication apparatus to other communication apparatuses, such as transmission or reception of data and / or signals. Exemplarily, the communication interface can be a transceiver, a circuit, a bus, a module or other types of communication interfaces.

[0090] It can be understood that in the third aspect, the processor can be implemented by hardware or software, and when implemented by hardware, the processor can be a logic circuit, an integrated circuit or the like; when implemented by software, the processor can be a general-purpose processor, which implements by reading software codes stored in the memory. In addition, the processor can be one or more, and the memory can be one or more. The memory can be integrated with the processor, or the memory and the processor can be separately arranged. In the specific implementation process, the memory can be integrated on the same chip as the processor, or can be separately arranged on different chips, and the embodiments of the present application do not limit the type of the memory and the arrangement mode of the memory and the processor.

[0091] In a fourth aspect, the present application provides a possible communication system, which can include the first node and the like mentioned in the first aspect. The functions of the first node can be implemented by referring to the related description of the first aspect, which will not be repeated here.

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

[0093] In a fifth aspect, the present application provides a computer program product, which comprises computer programs or instructions, and when the computer programs or instructions are run on a communication device (or a computer), the communication device (or the computer) is caused to perform the method in any possible implementation manner of the first aspect.

[0094] In a sixth aspect, the present application provides a computer readable storage medium, which stores computer programs or instructions, and when the computer programs or instructions are executed by a communication device (or a computer), the communication device (or the computer) is caused to perform the method in any possible implementation manner of the first aspect.

[0095] In a seventh aspect, the present application provides a chip, which can comprise a processor, and can further comprise a memory (or the chip is coupled with the memory), and the chip executes program instructions in the memory, so as to cause the chip to perform the method in any possible implementation manner of the first aspect. The "coupled" means that two components are directly or indirectly combined with each other, and the coupling can mean that the two components are electrically connected.

[0096] In an eighth aspect, the present application further provides a chip system, which comprises a processor, and is used for supporting a computer device to implement the method in any possible implementation manner of the first aspect. In a possible implementation manner, the chip system further comprises a memory, which is used for saving necessary programs and data of the computer device. The chip system can be constituted by a chip, or can comprise the chip and other discrete devices.

[0097] On the basis of the implementation manners of the aspects provided in the present application, further combinations can be made to provide more implementation manners. BRIEF DESCRIPTION OF DRAWINGS

[0098] FIG. 1 exemplarily shows a communication protocol architecture schematic diagram of a star flash communication technology provided by an embodiment of the present application;

[0099] FIG. 2 exemplarily shows a subcarrier planning schematic diagram of a 20MHz bandwidth provided by an embodiment of the present application;

[0100] FIG. 3 exemplarily shows a structure schematic diagram of a superframe provided by an embodiment of the present application;

[0101] FIG. 4 exemplarily shows a network architecture schematic diagram provided by an embodiment of the present application;

[0102] FIG. 5 exemplarily shows a CCA schematic diagram provided by an embodiment of the present application;

[0103] FIG. 6 exemplarily shows a flow schematic diagram of a communication method provided by an embodiment of the present application;

[0104] FIG. 7a exemplarily shows a diagram of splitting a first contention channel period according to an embodiment of the present application;

[0105] FIG. 7b exemplarily shows another diagram of splitting a first contention channel period according to an embodiment of the present application;

[0106] FIG. 7c exemplarily shows still another diagram of splitting a first contention channel period according to an embodiment of the present application;

[0107] FIG. 8a exemplarily shows a diagram of splitting a first time domain resource set according to an embodiment of the present application;

[0108] FIG. 8b exemplarily shows another diagram of splitting a first time domain resource set according to an embodiment of the present application;

[0109] FIG. 8c exemplarily shows still another diagram of splitting a first time domain resource set according to an embodiment of the present application;

[0110] FIG. 9 exemplarily shows a diagram of a structure of a possible communication apparatus according to an embodiment of the present application;

[0111] FIG. 10 exemplarily shows a diagram of a structure of another possible communication apparatus according to an embodiment of the present application. DETAILED DESCRIPTION

[0112] The embodiments of the present application will be described in detail below with reference to the accompanying drawings.

[0113] The communication system architecture to which the communication method provided by the present application is applicable will be introduced below. It should be noted that the introduction is made for the purpose of facilitating the understanding of those skilled in the art, and does not constitute a limitation on the scope of protection required by the present application.

[0114] At present, the sparklink alliance provides a communication protocol architecture of the sparklink communication technology, and the access technologies that can be provided by the protocol architecture include a sparklink basic (SLB) access technology and a sparklink low energy (SLE) access technology. FIG. 1 is a diagram of a communication protocol architecture of the sparklink communication technology according to an embodiment of the present application. As shown in FIG. 1, the protocol architecture includes a basic application layer, a basic service layer and a sparklink access layer (which can also be referred to as an access layer), and the basic application layer and the basic service layer can be collectively referred to as a sparklink upper layer.

[0115] (1) Basic application layer

[0116] The basic application layer includes various general frameworks. In order to realize the communication between different devices under different platforms, the basic application layer formulates frameworks for various possible and generally meaningful application scenarios.

[0117] (2) Basic service layer

[0118] The basic service layer includes a control plane and a data plane. The control plane mainly 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, and also includes transmission control adaptation protocol, transmission control protocol / internet protocol (TCP / IP), and transparent transmission protocol.

[0119] (3) Star flash access layer

[0120] The star flash access layer includes an SLB module and an SLE module. The SLB module can also be referred to as an SLB access layer, and the SLE module can also be referred to as an SLE access layer. The SLB module communicates through SLB access technology. The SLB access technology has large bandwidth communication capability and can carry large bandwidth services such as wireless screen projection services and video call services. The data throughput is high and the transmission speed of data is fast during the communication process. However, the SLB access technology has relatively high power consumption and a long access time.

[0121] In the SLB access technology, the communication device includes a grant node device (referred to as a G node device or a G node) and a terminal node device (referred to as a T node device or a T node). The G node represents a node that sends data scheduling information in the access layer, and the T node represents a node that receives data scheduling information and sends data according to the data scheduling information in the access layer. It is specified that the G node device can send a broadcast, and the T node device can scan information. In the process of establishing an SLB connection between the G node device and the T node device, the T node device is allowed to scan and discover the G node device, and send a connection request to the G node device to connect the G node device.

[0122] 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 SLB basic connection information after the SLB communication function is turned on. When the mobile phone has a screen projection service requirement, it starts to scan each G node device around it, receives the broadcasted SLB basic connection information of the G node device, and displays the device scanning result (such as device model, device name, etc.) according to the SLB basic connection information. In response to the user's operation of selecting the large screen device from the scanning result, the mobile phone sends a connection request to the large screen device, thereby establishing an SLB connection with the large screen device.

[0123] The SLE module communicates through SLE access technology. The SLE has low-power communication capability. When the SLE module is in an idle state (i.e., not connected to other devices), the SLE module can broadcast device information and data on three fixed broadcast channels, enabling fast discovery and connection and helping to save device power. The SLE access technology supports a small bandwidth and slow data transmission speed, and thus is usually used to process services with small bandwidth requirements, such as audio playback services based on wireless earphones and control services of a mobile phone on smart home devices.

[0124] It can be understood that the communication protocol architecture described above is only one possible example, and other possible protocol layers can also be included in the communication protocol architecture, which is not limited in the embodiments of the present application.

[0125] Based on the communication protocol architecture shown in FIG. 1, the related terms involved in the star flash communication technology are explained below. When not specifically stated, these explanations are to support the meanings of the related terms and make the embodiments of the present application easier to understand, and should not be regarded as strict limitations on the terms in the protection scope claimed by the present application.

[0126] (1) Channel bandwidth of star flash communication technology

[0127] The working frequency band of the star flash communication technology (such as the SLB access technology) can be a low frequency band, such as 5150 MHz-5350 MHz or 5725 MHz-5850 MHz, and the minimum channel (or carrier) bandwidth is 20 MHz, supporting 40 / 60 / 80 / 100 / 160 / 320 MHz specifications of channel bandwidth in an aggregated manner by a plurality of 20 MHz bandwidths. FIG. 2 is a schematic diagram of subcarrier planning of a 20 MHz bandwidth. As shown in FIG. 2, the channel of a 20 MHz working bandwidth is composed of 39 consecutive subcarriers, and the subcarrier interval is 480 KHz. The 39 subcarriers are sequentially numbered as 0, 1, …, 38 in order of corresponding frequencies from low to high, in which the subcarrier 19 (i.e., the 20th subcarrier) is a direct current subcarrier and does not carry information. In a 20 MHz bandwidth channel, the lowest frequency and the highest frequency each reserve part of the resources as a protection interval, which are the left protection interval and the right protection interval, respectively. For example, the parameter format of the 20 MHz bandwidth can be referred to Table 1.

[0128] Table 1

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

[0130] (2) Superframe, radio frame

[0131] The star flash communication technology adopts time division duplex (TDD) mode. Specifically, the star flash communication technology (such as the SLB access technology) adopts a superframe to realize communication between the G-node device and the T-node device. The superframe can contain 48 radio frames, and each radio frame includes 10 symbols. The symbol can be an orthogonal frequency division multiplexing (OFDM) symbol or a discrete fourier transformation-spread-OFDM (DFT-s-OFDM) symbol. The DFT-s-OFDM symbol can be understood as a special OFDM symbol. In addition, the star flash communication system also supports a half superframe containing 24 radio frames. In the parameters of the low frequency band shown in Table 1 or Table 2, the duration of each symbol (i.e., the symbol period) is about 2.0833 microseconds (μs), the duration of each radio frame is about 20.833 μs, and the duration of each superframe is about 1 millisecond (ms).

[0132] FIG. 3 is a schematic diagram of the structure of a possible superframe. As shown in FIG. 3, the superframe includes radio frame 0 to radio frame 47. For example, radio frame 0 includes 4 G symbols, 3 T symbols, 2 GAP symbols, and 1 SG symbol in the 10 OFDM symbols; radio frame 47 includes 4 G symbols, 3 T symbols, 2 GAP symbols, and 1 ST symbol in the 10 OFDM symbols. Among them, the G symbol represents a symbol in which the G-node device transmits (G-link) information to the T-node device, the T symbol represents a symbol in which the T-node transmits (T-link) information to the G-node, the SG / ST respectively represents a symbol resource that can be used for overhead symbols in the G / T symbol, the overhead symbol resource of each radio frame can be flexibly configured as 0, 1 or 2 symbols, and the GAP is a switching interval of the G symbol and the T symbol.

[0133] To facilitate understanding of the communication scheme provided by the embodiments of the present application, first, the network architecture applicable to the embodiments of the present application is described in detail taking the network architecture shown in FIG. 4 as an example. As shown in FIG. 4, the network architecture can include a plurality of communication devices (such as a first communication device and a second communication device), and the first communication device and the second communication device are both configured with the communication protocol architecture shown in FIG. 1 and can communicate with each other based on the communication protocol architecture using the star flash communication technology.

[0134] The communication device (such as the first communication device and the second communication device) in the embodiments of the present application can be a device in various fields. For example, a large-screen device, an artificial intelligence (AI) sound box, a high fidelity (HiFi) sound box, a temperature sensor, a humidity sensor, etc. in the field of smart home; or a mobile phone, a tablet computer, a wearable device, an augmented reality (AR) / virtual reality (VR) device, a notebook computer, an ultra mobile personal computer (UMPC), a netbook, or a personal digital assistant (PDA) in the field of smart terminals; or a mechanical arm, a camera, a joystick, a monitor, a logistics vehicle, or a smart shelf in the field of smart manufacturing; or a vehicle-mounted device or other devices in the field of smart cars, etc. The embodiments of the present application do not limit the specific type of the communication device.

[0135] Exemplarily, 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 a possible implementation, the role of the communication device can be determined according to the input and output conditions of the communication device, which include whether the communication device supports inputting information through a mouse, a keyboard, or a screen, whether the communication device supports outputting information through a screen or a loudspeaker, etc. For example, for a mobile phone, a tablet computer, and other devices that are convenient for a user to input information, the role of the device is usually a T-node, and the device acts as a T-node device by default in the SLB connection process. For a large-screen device, a smart sound box, and other devices that are not convenient for a user to input information, the role of the device is usually a G-node, and the device acts as a G-node device by default in the SLB connection process.

[0136] It can be understood that the communication method provided by the embodiments of the present application is applicable to the communication between a G-node device and a T-node device, and can also be applicable to the communication between a G-node device and a G-node device, or the communication between a T-node device and a T-node device, without limitation.

[0137] The network architecture and service scenarios described in the embodiments of the present application are used to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided by the embodiments of the present application. Those skilled in the art can know that, with the evolution of network architecture and the appearance of new service scenarios, the technical solutions provided by the embodiments of the present application are also applicable to similar technical problems.

[0138] Although the embodiments of the present application mainly take deploying a star flash communication network as an example, especially taking an SLB communication network as an example for description, those skilled in the art can easily understand that various aspects involved in the embodiments of the present application can be extended to other networks using various standards or protocols, for example, a high performance radio local area network (HIPERLAN), a wireless wide area network (WWAN), a wireless personal area network (WPAN), or other now known or later developed networks. Therefore, regardless of the coverage range and wireless access protocol used, various aspects provided by the embodiments of the present application can be applied to any suitable wireless network.

[0139] The technical solutions of the embodiments of the present application can also be applied to various communication systems or networks, for example: a WLAN communication system, a wireless fidelity (Wi-Fi) system, a long term evolution (LTE) system, an LTE frequency division duplex (FDD) system, an LTE TDD system, a universal mobile telecommunication system (UMTS) system, a worldwide interoperability for microwave access (WiMAX) communication system, a 5th generation (5G) system or a new radio (NR) system, a future communication system, an internet of things (IoT) network or a vehicle to x (V2X) network, etc. The above communication systems to which the present application is applicable are only used as examples, and the communication systems to which the present application is applicable are not limited thereto. Here, it is uniformly described that the communication systems to which the present application is applicable are not limited to the above, and the following will not be described in detail.

[0140] The present application supports IEEE protocols, such as IEEE 802.11be / Wi-Fi 7 / EHT protocol, IEEE 802.11bn / UHR / Wi-Fi 8 protocol, IEEE Integrated mmWave / Integrated millimeter wave / IMMW protocol, IEEE 802.15 / UWB protocol, or IEEE 802.11bf / sensing / sensing protocol; the present application can also support starlink / spark link / nearlink standard protocol.

[0141] Currently, nodes working in the unlicensed frequency band using WiFi technology (or Bluetooth technology or cellular network) can compete for channels by using the corresponding contention channel mechanism, so as to use the contended channel for communication. However, if the nodes working in the unlicensed frequency band use starlink communication technology, a contention channel mechanism suitable for starlink communication technology needs to be designed.

[0142] If the nodes working in the unlicensed frequency band use starlink communication technology (such as SLB access technology), the nodes using starlink communication technology may face the problems of multi-domain coexistence (such as multiple G nodes working in the same channel or the same area), multi-system coexistence (such as nodes using starlink communication technology and nodes using WiFi technology sharing the same channel, or nodes using starlink communication technology and nodes using WiFi technology located in the same area). Based on the regulatory requirements of the country in the relevant frequency band (such as 2.4GHz or 5GHz), nodes of different domains or different systems need to compete for channels to realize communication. Therefore, a node using starlink communication technology needs to compete for channels with other nodes working in the same channel (or the same area) to realize its own communication, or needs to compete for channels with nodes working in the unlicensed frequency band using other system technology (such as WiFi technology) to realize its own communication.

[0143] Among them, the regulatory requirements are:

[0144] a. Before occupying the channel each time, a clear channel assessment (CCA) needs to be performed, such as according to the frequency band and the type of device, the evaluation time is not less than 16 microseconds (us) or 25us.

[0145] b. After occupying the channel for a period of time, the channel needs to be released first, and then re-contended to occupy the channel.

[0146] For example, taking the node using starlink communication technology as an example, the node uses the frame-based mechanism of the contention channel mechanism in the cellular network for random access. The frame-based mechanism refers to that, as shown in FIG. 5, CCA is performed before each fixed frame period (FFP) (the fixed frame period is required by regulations to be not less than 1 ms and not more than 10 ms). If the channel assessment result obtained by CCA before a certain FFP is that the channel is idle, the node can occupy the channel to transmit data in the FFP, for example, the node can use a channel occupancy time (COT) in the FFP to transmit data. If the channel assessment result obtained by CCA before the FFP is that the channel is busy, the node will not occupy the channel to transmit data in the FFP, and then CCA is performed again after waiting for an FTP. An idle period is reserved from the end of the COT in the current FFP to the beginning of the next FFP, for example, the idle period is required by regulations to be not less than 5% of the COT and not less than 100 us. If the channel assessment result obtained by CCA before the FFP is that the channel is busy, the node will be muted (or the node is suspended) after failed CCA.

[0147] However, the node using starlink communication technology uses the frame-based mechanism for random access, which has the following problems:

[0148] (1) There is only one opportunity to compete for the channel in one FFP, and if the node using starlink communication technology coexists with the node using WiFi technology, because the channel competition capability of the node using starlink communication technology is lower than that of the node using WiFi technology, the node using starlink communication technology may not be able to compete for the channel all the time.

[0149] (2) When the node using starlink communication technology is located in (or is in) a multi-domain coexistence scene, the frame-based mechanism cannot effectively realize multi-domain coexistence. Specifically, for the frame-based mechanism, the CCA time of different domains is the same, so the other party cannot be detected to occupy the channel, thereby leading to continuous conflict.

[0150] For another example, the node using the star flash communication technology uses the contention channel mechanism (carrier sense multiple access with collision avoidance (CSMA / CA) mechanism) in the WiFi technology for random access. The CSMA / CA mechanism means that when the node has data to send, the node needs to contend for the channel first, and the node needs to select a random number as a backoff counter value in a contention window before contending for the channel. Then, the node continuously detects whether the channel is idle. For example, the node detects whether the channel is idle every time a slot (for example, the slot is 9us). If the channel is idle, the node reduces the backoff counter value by 1; if the channel is busy, the backoff counter value remains unchanged. The node continues to detect whether the channel is idle until the backoff counter value is 0, and then the node contends for the channel and uses the channel to send data. However, because the resource scheduling mode of the node using the star flash communication technology is a continuous timing mode (the timing used by the node using the star flash communication technology when communicating is to configure resources in units of time domain resources (such as a superframe), and the information transmission resource configuration is also designed in a continuous manner), which is very different from the CSMA / CA mechanism in the WiFi technology, and therefore the implementation logic and timing of the star flash communication technology are greatly changed.

[0151] In view of this, the present application provides a communication method for providing a contention channel mechanism suitable for the star flash communication technology, and enabling the node using the star flash communication technology (such as the node using the star flash communication technology working in the unlicensed frequency band) to have a fair probability of contending for the channel.

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

[0153] FIG. 6 schematically shows a flowchart of a communication method provided in an embodiment of the present application. The method is suitable for the network architecture shown in FIG. 4. It can be understood that the communication method shown in FIG. 6 is schematically shown by taking the first node as the execution subject, but the present application does not limit the execution subject of the interaction. It should be understood that, without special description, the "first node" in the present application can refer to the first node itself, or a module (such as a processor, a processing unit, a chip system, a circuit or a chip, etc.) in the first node, or a logical node, a logical module or software capable of realizing all or part of the functions of the first node. For example, the first node can be the first communication device (such as a G node device) shown in FIG. 4.

[0154] As shown in FIG. 6, the method comprises:

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

[0156] The M measurement time domain resources (may also be referred to as measurement resources) are used for measuring the channel state (may be understood as being used for measuring or detecting the busy state of the channel). M is an integer greater than 1. It can be understood that the M measurement time domain resources do not overlap with each other.

[0157] In the embodiments of the present application, the M measurement time domain resources described above can be determined by the first node before entering the first contention channel period. That is, the M measurement time domain resources can be determined in advance by the first node, without temporarily adjusting the state (such as the sending state or the receiving state) of some time domain resources according to the channel state measurement result after entering the first contention channel period. The M measurement time domain resources are located in the first contention channel period. For example, before the first contention channel period, the first node can determine which time domain resources in the time domain resource units included in the first contention channel period are configured as the receiving state for measurement, and which time domain resources are configured as the sending state for sending signals when in the occupied state. In this way, it is not necessary to temporarily change (or adjust) the sending state or the receiving state of the time domain resources according to the channel state measurement result, and it is easy to implement.

[0158] For example, any one of the M measurement time domain resources can include one or more radio frames, or can include one or more time slots, or can include one or more symbols (such as OFDM symbols). Alternatively, any one of the measurement time domain resources described above can also include a part of a radio frame, or can also include a part of a time slot, or can also include at least one radio frame and / or a part of at least one radio frame in a plurality of continuous radio frames (such as the end part of one radio frame and the start part of another radio frame in two continuous radio frames, or one radio frame and the start part of another radio frame in two continuous radio frames, or one radio frame and the end part of another radio frame in two continuous radio frames), or can also include at least one time slot and / or a part of at least one time slot in a plurality of continuous time slots (such as the end part of one time slot and the start part of another time slot in two continuous time slots, or one time slot and the start part of another time slot in two continuous time slots, or one time slot and the end part of another time slot in two continuous time slots).

[0159] The following introduces several possible determination manners of M.

[0160] Manner one: M can be pre-configured, such as pre-configured by the upper layer. Alternatively, M can also be pre-defined, such as pre-defined by a protocol.

[0161] For example, the value of M can be a preset value, such as M=2.

[0162] Option 2: The first node determines M according to at least one channel state measurement result before the first contention channel period and / or communication performance of the first node before the first contention channel period.

[0163] The following describes the implementation process of the first node determining M according to at least one channel state measurement result before the first contention channel period and / or communication performance of the first node before the first contention channel period through the following possible examples.

[0164] Example 1: The first node determines M according to at least one channel state measurement result before the first contention channel period.

[0165] In the embodiment of the present application, the first node can count at least one channel state measurement result (also referred to as channel state result or channel busy / idle result or channel result) of the first node before the first contention channel period to determine the first number or the first proportion. The first number is the number of channel state measurement results in which the channel state measurement result is channel busy in the at least one channel state measurement result, and the first proportion is the proportion of channel state measurement results in which the channel state measurement result is channel busy in the at least one channel state measurement result.

[0166] For example, the at least one channel state measurement result can be a channel state measurement result measured on at least one measurement time domain resource included in one contention channel period before the first contention channel period of the first node, or the at least one channel state measurement result can also be a channel state measurement result measured on at least one measurement time domain resource included in multiple contention channel periods before the first contention channel period of the first node.

[0167] In one example, if the first number is greater than the first number threshold or the first ratio is greater than the first ratio threshold, the first node can determine that, in the first contention channel period, M takes a smaller integer value, which can improve the randomness of the measurement resource location and help reduce the collision. For example, taking the case that M takes the value 5 before the first contention channel period. When the first number is greater than the first number threshold or the first ratio is greater than the first ratio threshold, the first node can adjust M to take the value 2, or the first node can also adjust M to take other integer values smaller than 5. That is, in the first contention channel period, M takes the value 2, or M takes other integer values smaller than 5. It can be understood that when the first number is greater than the first number threshold or the first ratio is greater than the first ratio threshold, it can be considered that the channel is relatively congested. By selecting an integer value that conforms to the actual situation of the channel as the value of M (such as selecting a smaller integer value as the value of M), a reasonable number of measurement time domain resources can be obtained for measuring the channel state, which can help reduce the probability of collision caused by the time domain locations of the measurement time domain resources of different nodes being the same, and can control the probability of collision caused by the time domain locations of all measurement time domain resources of different nodes being the same within a reasonable range.

[0168] In another example, if the first number is less than the first number threshold or the first ratio is less than the first ratio threshold, the first node can determine that, in the first contention channel period, M takes a larger integer value. For example, taking the case that M takes the value 5 before the first contention channel period. When the first number is less than the first number threshold or the first ratio is less than the first ratio threshold, the first node can adjust M to take the value 6, or the first node can also adjust M to take other integer values greater than 5. That is, in the first contention channel period, M takes the value 6, or M takes other integer values greater than 5. Alternatively, when the first number is less than the first number threshold or the first ratio is less than the first ratio threshold, the first node can also determine that, in the first contention channel period, M still takes the value 5. It can be understood that when the first number is less than the first number threshold or the first ratio is less than the first ratio threshold, it can be considered that the channel is not too congested (which can be understood as the channel being relatively idle). By selecting an integer value that conforms to the actual situation of the channel as the value of M (such as selecting a larger integer value as the value of M), a reasonable number of measurement time domain resources can be obtained for measuring the channel state, which can help 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).

[0169] In yet another example, if the first quantity is equal to the first quantity threshold or the first ratio is equal to the first ratio threshold, the first node can determine that the value of M in the first contention channel period can be a larger integer value, or can be a smaller integer value, or can still be the original value (e.g., the value of M in the first contention channel period can still be the value before the first contention channel period).

[0170] Example II: The first node determines M according to the communication performance of the first node before the first contention channel period.

[0171] In embodiments of the present application, the first node can determine the communication performance (e.g., packet loss rate or block error rate, etc.) of the first node before the first contention channel period. Then, the first node can determine M according to the communication performance of the first node before the first contention channel period.

[0172] For example, taking the packet loss rate as the communication performance. The first node can determine the first packet loss rate by counting the packet loss of the first node in the communication state before the first contention channel period.

[0173] In one example, if the first packet loss rate is greater than the first threshold, the first node can determine that the value of M in the first contention channel period is a smaller integer value. For example, continuing with the example that the value of M before the first contention channel period is 5. 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 also adjust the value of M from 5 to another integer value smaller than 5. That is, the value of M in the first contention channel period is 2, or the value of 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, it can be considered that the channel is relatively congested. By selecting an integer value that meets the actual situation of the channel as the value of M (e.g., selecting a smaller integer value as the value of M), a reasonable amount of measurement time domain resources can be obtained for measuring the channel state, which helps to reduce the probability of collision caused by the time domain positions of the measurement time domain resources of different nodes being the same, and can control the probability of collision caused by the time domain positions of all measurement time domain resources of different nodes being the same within a reasonable range.

[0174] In another example, if the first packet loss rate is less than the first threshold, the first node can determine that the value of M in the first contention channel period is a larger integer value. For example, continuing with the example where the value of M before the first contention channel period is 5. 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 also adjust the value of M from 5 to another integer value larger than 5. That is, the value of M in the first contention channel period is 6, or the value of M is another integer value larger than 5. Alternatively, when the first packet loss rate is less than the first threshold, the first node can also determine that the value of M in the first contention channel period is still 5. It can be understood that when the first packet loss rate is less than the first threshold, it can be considered that the channel is not too congested (it can be understood that the channel is relatively idle), and by selecting an integer value that conforms to the actual situation of the channel as the value of M (such as selecting a larger integer value as the value of M), a reasonable amount of measurement time domain resources can be obtained for measuring the channel state, which helps to increase the probability of the first node competing for the channel (it can be understood that the opportunity of the first node competing for the channel increases, and the probability of the first node competing for the channel also increases).

[0175] In yet another example, if the first packet loss rate is equal to the first threshold, the first node can determine that the value of M in the first contention channel period can be a larger integer value, or can also be a smaller integer value, or can still be the original value (such as the value of M is still the value before the first contention channel period).

[0176] Example Three: The first node determines M according to at least one channel state measurement result before the first contention channel period and the communication performance of the first node before the first contention channel period.

[0177] In the embodiments of the present application, the first node can determine the communication performance (such as packet loss rate or block error rate, etc.) of the first node before the first contention channel period, and can also count at least one channel state measurement result of the first node before the first contention channel period to determine the first number or the first proportion. Then, the first node can determine M according to the first number (or the first proportion) and the communication performance of the first node before the first contention channel period.

[0178] For example, taking the first proportion and the communication performance of the packet loss rate as an example. The first node can count the packet loss of the first node in the communication state before the first contention channel period to determine the first packet loss rate, and can also count at least one channel state measurement result of the first node before the first contention channel period to determine the first proportion.

[0179] In one example, if 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 determine that, in the first contention channel period, M takes a smaller integer value. For example, continuing with the example that M takes the value of 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 also adjust the value of M from 5 to another integer value smaller than 5. That is, in the first contention channel period, M takes the value of 2, or M takes another integer value smaller than 5. It can be understood that when the first proportion is greater than the first proportion threshold and the first packet loss rate is greater than the first threshold, it can be considered that the channel is relatively congested, and by selecting an integer value that conforms to the actual situation of the channel as the value of M (such as selecting a smaller integer value as the value of M), a reasonable amount of measurement time domain resources can be obtained for measuring the channel state, which helps to reduce the probability of collision caused by the time domain positions of the measurement time domain resources of different nodes being the same, and can control the probability of collision caused by the time domain positions of all measurement time domain resources of different nodes being the same within a reasonable range.

[0180] 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, in the first contention channel period, M takes a larger integer value. For example, continuing with the example that M takes the value of 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 also adjust the value of M from 5 to another integer value greater than 5. That is, in the first contention channel period, M takes the value of 6, or M takes another integer value greater than 5. Alternatively, 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, in the first contention channel period, M still takes the value of 5. It can be understood that when the first proportion is less than the first proportion threshold and the first packet loss rate is less than the first threshold, it can be considered that the channel is not too congested (it can be understood that the channel is relatively idle), and by selecting an integer value that conforms to the actual situation of the channel as the value of M (such as selecting a larger integer value as the value of M), a reasonable amount of measurement time domain resources can be obtained for measuring the channel state, which helps to increase the probability of the first node contending for the channel (it can be understood that, since the number of measurement time domain resources in one contention channel period is relatively large, the opportunity of the first node contending for the channel in one contention channel period is also increased, and the ability of contending for the channel is also stronger, so the probability of contending for the channel is also increased).

[0181] In yet another example, if the first proportion is equal to the first proportion threshold and the first packet loss rate is equal to the first threshold, the first node can determine that, in the first contention channel period, the value of M can be a larger integer value, or can also be a smaller integer value, or can also remain the original value (for example, the value of M remains the value before the first contention channel period).

[0182] It can be understood that 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, it can be considered that the channel is relatively busy (or relatively congested), and the first node can determine M in the manner described with reference to the above-described example one, which will not be described herein again. 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, it can be considered that the channel is relatively congested, and the first node can determine M in the manner described with reference to the above-described example two, which will not be described herein again.

[0183] It can be understood that the above-described content is only an exemplary introduction to several determination manners of M, and the first node can also determine M in other manners, which will not be listed one by one herein.

[0184] The following describes several possible determination manners of the time domain positions of the M measurement time domain resources.

[0185] Implementation manner one: the time domain position (which can also be referred to as a position) of at least one of the M measurement time domain resources is determined by the first node based on (or according to) a random selection manner (or a random selection algorithm).

[0186] It can be understood that for a multi-domain coexistence scenario (for example, a scenario in which two G nodes contend 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 contending for the same channel, resulting in channel contention and collision, thereby causing continuous conflict. The embodiment of the present application can make the time domain positions of the measurement time domain resources be randomized by designing that the time domain position of at least one of the M measurement time domain resources is determined based on a random selection manner (or a random selection algorithm), which can help to reduce the probability that the time domain positions of all measurement time domain resources of multiple G nodes (for example, the above-described two G nodes) are the same, thereby enabling multiple G nodes to implement multi-domain coexistence by contending for a channel.

[0187] For example, the following takes 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 as an example, and describes the implementation process in which the first node determines the time domain position of at least one of the M measurement time domain resources based on a random selection manner through the following several possible examples.

[0188] Example 1: Taking the location of one of the above-mentioned three measurement time domain resources (such as measurement time domain resource a1) as an example, the location is determined based on a selection manner. The first node can determine the time domain location of the measurement time domain resource a1 based on a random selection manner. Then, the first node can determine the measurement time domain resource a1 according to the time domain location of the measurement time domain resource a1 and the size of the measurement time domain resource a1. It can be understood that for the measurement time domain resource a2 and the measurement time domain resource a3, the first node can determine the time domain location of the measurement time domain resource a2 and the time domain location of the measurement time domain resource a3 respectively according to a preset (or predefined or preconfigured) measurement time domain resource location determination manner. Alternatively, the time domain location of the measurement time domain resource a2 and the time domain location of the measurement time domain resource a3 can also be selected according to a non-random selection manner. For example, the preset measurement time domain resource location determination manner can pre-set the time domain location of one or more of the M measurement time domain resources, such as the time domain location of the measurement time domain resource a2 and the time domain location of the measurement time domain resource a3. For example, taking one superframe as an example, the first contention channel period includes one superframe, the time domain location of the measurement time domain resource a2 is in the radio frame 15 included in the superframe, and the time domain location of the measurement time domain resource a3 is in the radio frame 30 included in the superframe.

[0189] Example 2: Taking the time domain location of the above-mentioned three measurement time domain resources as an example, the time domain location is determined based on a random selection manner. The first node can determine the time domain location of the measurement time domain resource a1, the time domain location of the measurement time domain resource a2 and the time domain location of the measurement time domain resource a3 respectively based on a random selection manner. After obtaining the time domain location of the measurement time domain resource a1, the first node can determine the measurement time domain resource a1 according to the time domain location of the measurement time domain resource a1 and the size of the measurement time domain resource a1. After obtaining the time domain location of the measurement time domain resource a2, the first node can determine the measurement time domain resource a2 according to the time domain location of the measurement time domain resource a2 and the size of the measurement time domain resource a2. After obtaining the time domain location of the measurement time domain resource a3, the first node can determine the measurement time domain resource a3 according to the time domain location of the measurement time domain resource a3 and the size of the measurement time domain resource a3.

[0190] Implementation manner two: The time domain location of the above-mentioned M measurement time domain resources is determined by the first node based on a non-random selection manner.

[0191] For example, continue to take M as 3, and take the 3 measurement time domain resources as measurement time domain resource a1, measurement time domain resource a2 and measurement time domain resource a3. The first node can determine the time domain position of measurement time domain resource a1, the time domain position of measurement time domain resource a2 and the time domain position of measurement time domain resource a3 respectively based on the non-random selection manner. After obtaining the time domain position of measurement time domain resource a1, the first node can determine measurement time domain resource a1 according to the time domain position of measurement time domain resource a1 and the size of measurement time domain resource a1. After obtaining the time domain position of measurement time domain resource a2, the first node can determine measurement time domain resource a2 according to the time domain position of measurement time domain resource a2 and the size of measurement time domain resource a2. After obtaining the time domain position of measurement time domain resource a3, the first node can determine measurement time domain resource a3 according to the time domain position of measurement time domain resource a3 and the size of measurement time domain resource a3.

[0192] For example, the non-random selection manner can be that the first node determines the time domain positions of the M measurement time domain resources in turn according to the time domain resource order included in a section of continuous time domain resources for selecting measurement time domain resources in the first contention channel period, or can be that the first node determines the time domain positions of the M measurement time domain resources from the section of continuous time domain resources for selecting measurement time domain resources at time domain intervals.

[0193] Next, the following describes the implementation process of the first node determining the M measurement time domain resources through the following possible implementation manners.

[0194] Manner 1: The first node selects M time domain resources as measurement time domain resources in the first contention channel period.

[0195] For example, the first contention channel period can contain q time domain resource units. Wherein, q is an integer greater than or equal to 1.

[0196] For example, the time domain resource unit can be one of the following: radio frame, time slot, super frame, transmission time interval (TTI), or other fixed period or configurable period defined by protocol, etc.

[0197] The following describes several possible determination manners of q.

[0198] Manner a: q can be pre-configured, such as pre-configured by the upper layer. Optionally, q can also be pre-defined, such as pre-defined by the protocol.

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

[0200] Option b: the first node determines q according to at least one channel state measurement result before the first contention channel period and / or communication performance of the first node before the first contention channel period.

[0201] The following describes the implementation process of the first node determining q according to at least one channel state measurement result before the first contention channel period and / or communication performance of the first node before the first contention channel period through the following possible examples.

[0202] Example a: the first node determines q according to at least one channel state measurement result before the first contention channel period.

[0203] In the embodiment of the present application, the first node can count at least one channel state measurement result before the first contention channel period to determine the second number or the second proportion. The second number is the number of channel state measurement results in the at least one channel state measurement result that is channel busy, and the second proportion is the proportion of channel state measurement results in the at least one channel state measurement result that is channel busy.

[0204] For example, the at least one channel state measurement result can be a channel state measurement result measured on at least one measurement time domain resource included in one contention channel period before the first contention channel period, or the at least one channel state measurement result can also be a channel state measurement result measured on at least one measurement time domain resource included in multiple contention channel periods before the first contention channel period. Optionally, the channel state measurement result on each measurement time domain resource in the at least one measurement time domain resource can be measured on part of the resources in the measurement time domain resource, or can also be measured on all the resources in the measurement time domain resource. For example, taking one of the at least one measurement time domain resource (such as measurement time domain resource 01) as an example. If part of the resources in the measurement time domain resource 01 are used to measure the channel state, the remaining part of the resources in the measurement time domain resource 01 can be used for the node to perform some internal processing operations after measuring the channel busy / idle (such as can be used for the node to determine the state of the first node on the time domain resource after the measurement time domain resource 01 (such as the state of the first node on the time domain resource after the measurement time domain resource 01 is an occupied state or a released state)), or can also be used for the node to send a signal.

[0205] In one example, if the second number is greater than the second number threshold or the second ratio is greater than the second ratio threshold, the first node can determine that q takes a larger integer value in the first contention channel period. For example, q takes 1 in the first contention channel period. When the second number is greater than the second number threshold or the second ratio is greater than the second ratio threshold, the first node can adjust q from 1 to 2, or the first node can also adjust q from 1 to another integer value greater than 1. That is, q takes 2 in the first contention channel period, or q takes another integer value greater than 1. It can be understood that when the second number is greater than the second number threshold or the second ratio is greater than the second ratio threshold, it can be considered that the channel is relatively congested. By selecting an integer value that conforms to the actual situation of the channel as the value of q (such as selecting a larger integer value as the value of q), the selection range of the measurement time domain resource can be expanded, so as to obtain a more reasonable selection range of the measurement time domain resource, which helps to reduce the probability of conflict caused by the same time domain position of the measurement time domain resource of different nodes, and can control the probability of conflict caused by the same time domain position of all measurement time domain resources of different nodes within a reasonable range.

[0206] In another example, if the second number is less than the second number threshold or the second ratio is less than the second ratio threshold, the first node can determine that q takes a smaller integer value in the first contention channel period. For example, q takes 3 in the first contention channel period. When the second number is less than the second number threshold or the second ratio is less than the second ratio threshold, the first node can adjust q from 3 to 2, or the first node can also adjust q from 3 to another integer value smaller than 3. That is, q takes 2 in the first contention channel period, or q takes another integer value smaller than 3. Alternatively, when the second number is less than the second number threshold or the second ratio is less than the second ratio threshold, the first node can also determine that q still takes 3 in the first contention channel period. It can be understood that when the second number is less than the second number threshold or the second ratio is less than the second ratio threshold, it can be considered that the channel is not too congested (it can be understood that the channel is relatively idle). By selecting an integer value that conforms to the actual situation of the channel as the value of q (such as selecting a smaller integer value as the value of q), it can be ensured that the first contention channel period contains a reasonable number of time domain resources, which helps to avoid wasting time domain resources.

[0207] In yet another example, if the second number is equal to the second number threshold or the second ratio is equal to the second ratio threshold, the first node can determine that q can take a larger integer value, or can take a smaller integer value, or can still take the original value (such as q still takes the value before the first contention channel period) in the first contention channel period.

[0208] Example b: The first node determines q according to the communication performance of the first node before the first contention channel period.

[0209] In the embodiments of the present application, the first node can determine the communication performance (such as packet loss rate or block error rate, etc.) of the first node before the first contention channel period. Then, the first node can determine q according to the communication performance of the first node before the first contention channel period.

[0210] For example, taking the communication performance as the packet loss rate. The first node can determine the second packet loss rate by counting the packet loss of the first node in the communication state before the first contention channel period.

[0211] 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 in the first contention channel period is a larger integer value. For example, continuing to take the value of q as 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 also adjust the value of q from 1 to other integer values greater than 1. That is, the value of q in the first contention channel period 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, it can be considered that the channel is relatively congested. By selecting an integer value that meets the actual situation of the channel as the value of q (such as selecting a larger integer value as the value of q), the selection range of the measurement time domain resource can be expanded, so as to obtain a more reasonable selection range of the measurement time domain resource, which helps to reduce the probability of conflict caused by the same time domain position of the measurement time domain resources of different nodes, and can control the probability of conflict caused by the same time domain position of all measurement time domain resources of different nodes within a reasonable range.

[0212] 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 in the first contention channel period is a smaller integer value. For example, the value of q before the first contention channel period is 3. 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 the first node can also adjust the value of q from 3 to another integer value smaller than 3. That is, the value of q in the first contention channel period is 2, or the value of q is another integer value smaller than 3. Alternatively, when the second packet loss rate is less than the second threshold, the first node can also determine that the value of q in the first contention channel period is still 3. It can be understood that when the second packet loss rate is less than the second threshold, it can be considered that the channel is not too congested (it can be understood as the channel is relatively idle), and by selecting an integer value that conforms to the actual situation of the channel as the value of q (such as selecting a smaller 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.

[0213] In yet another example, if the second packet loss rate is equal to the second threshold, the first node can determine that the value of q in the first contention channel period can be a larger integer value, or can also be a smaller integer value, or can also be the original value (such as the value of q is still the value before the first contention channel period).

[0214] Example c: The first node determines q according to at least one channel state measurement result before the first contention channel period and the communication performance of the first node before the first contention channel period.

[0215] In the embodiments of the present application, the first node can determine the communication performance (such as packet loss rate or block error rate, etc.) of the first node before the first contention channel period, and can also count at least one channel state measurement result of the first node before the first contention channel period to determine the second number or the second proportion. Then, the first node can determine q according to the second number (or the second proportion) and the communication performance of the first node before the first contention channel period.

[0216] For example, taking the second proportion and the communication performance as the packet loss rate. The first node can count the packet loss of the first node in the communication state before the first contention channel period to determine the second packet loss rate, and can also count at least one channel state measurement result of the first node before the first contention channel period to determine the second proportion.

[0217] In one example, if the second proportion is greater than the second proportion threshold and the second packet loss rate is greater than the second threshold, the first node can determine that the value of q in the first contention channel period is a larger integer value. For example, continuing with the example that the value of q before the first contention channel period is 1. When the second proportion is greater than the second proportion 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 also adjust the value of q from 1 to another integer value greater than 1. That is, the value of q in the first contention channel period is 2, or the value of q is another integer value greater than 1. It can be understood that when the second proportion is greater than the second proportion threshold and the second packet loss rate is greater than the second threshold, it can be considered that the channel is relatively congested, and by selecting an integer value that conforms to the actual situation of the channel as the value of q (such as selecting a smaller integer value as the value of q), a reasonable amount of measurement time domain resources can be obtained for measuring the channel state, which helps to reduce the probability of collision caused by the time domain positions of the measurement time domain resources of different nodes being the same, and can control the probability of collision caused by the time domain positions of all measurement time domain resources of different nodes being the same within a reasonable range.

[0218] 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 the value of q in the first contention channel period is a smaller integer value. For example, continuing with the example that the value of q before the first contention channel period is 3. 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 also adjust the value of q from 3 to another integer value smaller than 3. That is, the value of q in the first contention channel period is 2, or the value of q is another integer value smaller than 3. Alternatively, 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 in the first contention channel period is still 3. It can be understood that when the second proportion is less than the second proportion threshold and the second packet loss rate is less than the second threshold, it can be considered that the channel is not too congested (it can be understood that the channel is relatively idle), and by selecting an integer value that conforms to the actual situation of the channel as the value of q (such as selecting a smaller 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.

[0219] In yet another example, if the second proportion is equal to the second proportion threshold and the second packet loss rate is equal to the second threshold, the first node can determine that the value of q in the first contention channel period can be a larger integer value, or can also be a smaller integer value, or can still be the original value (such as the value of q is still the value before the first contention channel period).

[0220] It can be understood that 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, it can be considered that the channel is relatively busy (or relatively congested), and the first node determines q in the manner described with reference to the related description in the above example a, which will not be described herein again. 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, it can be considered that the channel is relatively congested, and the first node determines q in the manner described with reference to the related description in the above example b, which will not be described herein again.

[0221] It can be understood that the above is only an exemplary introduction to several determination manners of q, and the first node can also determine q in other manners, which will not be listed one by one herein.

[0222] The following describes the implementation process of the first node selecting M time domain resources as measurement time domain resources in the first contention channel period through the following possible examples.

[0223] Example 1: Taking an example in which the first contention channel period includes one superframe, the value of M is 5, and the size of one measurement time domain resource is one radio frame. One superframe can include 48 radio frames. The first node can randomly (or non-randomly) select the time domain positions of 5 radio frames in the 48 radio frames as the time domain positions of the measurement time domain resources. Then, the first node can determine 5 measurement time domain resources (such as 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) according to the size of the measurement time domain resource and the time domain positions of the 5 measurement time domain resources. The 5 radio frames (i.e., the 5 measurement time domain resources) are mutually non-overlapping.

[0224] For example, taking the superframe shown in Fig. 3 as an example, which is a superframe including one in the first contention channel period. The first node can randomly select (or non-randomly select) the time domain positions of 5 wireless frames in 48 wireless frames as the time domain positions of the measurement time domain resources. For example, the time domain position of wireless frame 5 as the time domain position of the measurement time domain resource 1, the time domain position of wireless frame 16 as the time domain position of the measurement time domain resource 2, the time domain position of wireless frame 25 as the time domain position of the measurement time domain resource 3, the time domain position of wireless frame 35 as the time domain position of the measurement time domain resource 4, and the time domain position of wireless frame 45 as the time domain position of the measurement time domain resource 5. In the case where the size of one measurement time domain resource is one wireless frame, the first node can determine wireless frame 5 as the measurement time domain resource 1 according to the time domain position of the measurement time domain resource 1. The first node can determine wireless frame 16 as the measurement time domain resource 2 according to the time domain position of the measurement time domain resource 2. The first node can determine wireless frame 25 as the measurement time domain resource 3 according to the time domain position of the measurement time domain resource 3. The first node can determine wireless frame 35 as the measurement time domain resource 4 according to the time domain position of the measurement time domain resource 4. The first node can determine wireless frame 35 as the measurement time domain resource 5 according to the time domain position of the measurement time domain resource 5.

[0225] Alternatively, when the size of one measurement time domain resource is two consecutive wireless frames, the first node can also randomly select (or non-randomly select) the time domain positions of 2 consecutive wireless frames in 48 wireless frames as the time domain position of one measurement time domain resource, so as to randomly select (or non-randomly select) the time domain positions of 10 wireless frames for the time domain positions of 5 measurement time domain resources. Wherein, the time domain position of each of the 5 measurement time domain resources includes the time domain positions of 2 consecutive wireless frames. Wherein, the 10 wireless frames are mutually exclusive, that is, it can be understood that the 5 measurement time domain resources are mutually exclusive. Then, in the case where the size of one measurement time domain resource is two consecutive wireless frames, the first node can determine each measurement time domain resource according to the size of the measurement time domain resource and the time domain position of each of the 5 measurement time domain resources.

[0226] Example 2: taking one wireless frame included in the first contention channel period, the value of M is 2, and the length of one measurement time domain resource is one OFDM symbol as an example. Wherein, one wireless frame can include 10 OFDM symbols. The first node can select (or randomly select) the time domain positions of 2 OFDM symbols in 10 OFDM symbols as the time domain position of the measurement time domain resource. Then, the first node can determine two measurement time domain resources (such as measurement time domain resource a and measurement time domain resource b) according to the size of the measurement time domain resource and the time domain positions of the two measurement time domain resources. Wherein, the two OFDM symbols (i.e. the two measurement time domain resources) are mutually exclusive.

[0227] For example, taking the first contention channel period as the wireless frame 1 shown in Figure 3 as an example. The first node can randomly select (or non-randomly select) the time domain position of 2 OFDM symbols in 10 OFDM symbols as the time domain position of the measurement time domain resource. For example, the time domain position of the first T symbol from left to right in the wireless frame 1 shown in Figure 3 is taken as the time domain position of the measurement time domain resource a, and the time domain position of the third T symbol from left to right in the wireless frame 1 shown in Figure 3 is taken as the time domain position of the measurement time domain resource b. Then, in the case where the size of a measurement time domain resource is one OFDM symbol, the first node can determine the first T symbol from left to right in the wireless frame 1 shown in Figure 3 as the measurement time domain resource a according to the time domain position of the measurement time domain resource a. The first node can determine the third T symbol from left to right in the wireless frame 1 shown in Figure 3 as the measurement time domain resource b according to the time domain position of the measurement time domain resource b.

[0228] Alternatively, the first node can also select the time domain position of the second G symbol from left to right in the wireless frame 1 shown in Figure 3 as the time domain position of the measurement time domain resource 1, and the time domain position of the fourth G symbol from left to right in the wireless frame 1 shown in Figure 3 as the time domain position of the measurement time domain resource 2. Then, in the case where the size of a measurement time domain resource is one OFDM symbol, the first node can determine the second G symbol from left to right in the wireless frame 1 shown in Figure 3 as the measurement time domain resource a according to the time domain position of the measurement time domain resource a. The first node can determine the fourth G symbol from left to right in the wireless frame 1 shown in Figure 3 as the measurement time domain resource b according to the time domain position of the measurement time domain resource b.

[0229] Alternatively, the first node can also select the time domain position of the second G symbol from left to right in the wireless frame 1 shown in Figure 3 as the time domain position of the measurement time domain resource a, and the time domain position of the second T symbol from left to right in the wireless frame 1 shown in Figure 3 as the time domain position of the measurement time domain resource b. Then, in the case where the size of a measurement time domain resource is one OFDM symbol, the first node can determine the second G symbol from left to right in the wireless frame 1 shown in Figure 3 as the measurement time domain resource a according to the time domain position of the measurement time domain resource a. The first node can determine the second T symbol from left to right in the wireless frame 1 shown in Figure 3 as the measurement time domain resource b according to the time domain position of the measurement time domain resource b.

[0230] Optionally, when the size of one measurement time domain resource is two continuous OFDM symbols, the first node can also randomly select (or non-randomly select) the time domain positions of 2 continuous OFDM symbols in the wireless frame 1 as the time domain position of one measurement time domain resource, so as to randomly select (or non-randomly select) the time domain positions of 4 OFDM symbols as the time domain positions of 2 measurement time domain resources. Wherein, the time domain position of each measurement time domain resource in the 2 measurement time domain resources includes the OFDM symbols of 2 continuous wireless frames. Wherein, the 4 OFDM symbols do not overlap with each other, that is, it can be understood that the 2 measurement time domain resources do not overlap with each other. Then, in the case that the size of one measurement time domain resource is two continuous OFDM symbols, the first node can determine each measurement time domain resource according to the size of the measurement time domain resource and the time domain position of each measurement time domain resource in the 2 measurement time domain resources.

[0231] It can be understood that the above is only an exemplary introduction to several implementation manners of the first node selecting M time domain resources as measurement time domain resources in the first contention channel period. The first node can also select M time domain resources as measurement time domain resources in the first contention channel period through other manners (for example, when the first contention channel period contains 2 continuous superframes, the first node can randomly select (or non-randomly select) the time domain positions of M wireless frames in the 2 continuous superframes as the time domain positions of the measurement time domain resources, or for example, when the first contention channel period contains 2 continuous wireless frames, the first node can randomly select (or non-randomly select) the time domain positions of M OFDM symbols in the 2 continuous wireless frames as the time domain positions of the measurement time domain resources), which will not be listed one by one here.

[0232] Manner 2: The first node selects a first time domain resource set (also referred to as a first time domain resource set) in the first contention channel period. Wherein, the first time domain resource set is a continuous time domain resource in the first contention channel period. For example, the first time domain resource set can include at least one wireless frame or at least one time slot or at least one superframe or at least one symbol, etc. Then, the first node can select M time domain resources as measurement time domain resources in the first time domain resource set.

[0233] Wherein, the related introduction about the first contention channel period in manner 2 can refer to the related description in the above manner 1, which will not be repeated here.

[0234] The following is an implementation process of the first node selecting M time domain resources as measurement time domain resources in the first time domain resource set through the following several possible examples.

[0235] Example 1: taking one superframe as an example, the first contention channel period includes one superframe, the first time domain resource set includes 20 continuous wireless frames, the value of M is 5, and the size of one measurement time domain resource is one wireless frame. In one superframe, 48 wireless frames can be included. The first node can select 20 continuous wireless frames from the 48 wireless frames as the first time domain resource set. Then, the first node can randomly select (or non-randomly select) the time domain positions of 5 wireless frames from the 20 continuous wireless frames as the time domain positions of the measurement time domain resources. Then, the first node can determine 5 measurement time domain resources (such as 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') according to the size of the measurement time domain resource and the time domain positions of the 5 measurement time domain resources. The 5 wireless frames (i.e., the 5 measurement time domain resources) do not overlap with each other.

[0236] For example, taking the superframe included in the first contention channel period as the superframe shown in FIG. 3 as an example. The first node can select 20 continuous wireless frames from the 48 wireless frames as the first time domain resource set. For example, the 20 continuous wireless frames include wireless frame 3, wireless frame 4, …, wireless frame 22 shown in FIG. 3. Then, the first node can randomly select (or non-randomly select) the time domain positions of 5 wireless frames from the 20 continuous wireless frames as the time domain positions of the measurement time domain resources. For example, the time domain position of wireless frame 5 is taken as the time domain position of measurement time domain resource 1', the time domain position of wireless frame 8 is taken as the time domain position of measurement time domain resource 2', the time domain position of wireless frame 15 is taken as the time domain position of measurement time domain resource 3', the time domain position of wireless frame 18 is taken as the time domain position of measurement time domain resource 4', and the time domain position of wireless frame 22 is taken as the time domain position of measurement time domain resource 5'. Then, in the case where the size of one measurement time domain resource is one wireless frame, the first node can determine wireless frame 5 as measurement time domain resource 1' according to the time domain position of measurement time domain resource 1'. The first node can determine wireless frame 8 as measurement time domain resource 2' according to the time domain position of measurement time domain resource 2'. The first node can determine wireless frame 15 as measurement time domain resource 3' according to the time domain position of measurement time domain resource 3'. The first node can determine wireless frame 18 as measurement time domain resource 4' according to the time domain position of measurement time domain resource 4'. The first node can determine wireless frame 22 as measurement time domain resource 5' according to the time domain position of measurement time domain resource 5'.

[0237] Optionally, when the size of one measurement time domain resource is two continuous radio frames, the first node can also randomly select (or non-randomly select) the time domain positions of 2 continuous radio frames in the above 20 radio frames as the time domain positions of one measurement time domain resource, so as to randomly select (or non-randomly select) the time domain positions of 10 radio frames as the time domain positions of 5 measurement time domain resources. Among them, the time domain position of each measurement time domain resource in the 5 measurement time domain resources includes the time domain positions of 2 continuous radio frames. Among them, the 10 radio frames do not overlap with each other, that is, it can be understood that the 5 measurement time domain resources do not overlap with each other. Then, in the case that the size of one measurement time domain resource is two continuous radio frames, the first node can determine each measurement time domain resource according to the size of the measurement time domain resource and the time domain position of each measurement time domain resource in the 5 measurement time domain resources.

[0238] Example two: the first contention channel period includes one radio frame, the first time domain resource set includes 6 continuous OFDM symbols, the value of M is 2, and the size of one measurement time domain resource is one OFDM symbol. Among them, one radio frame can include 10 OFDM symbols. The first node can select 6 continuous OFDM symbols in the 10 OFDM symbols as the first time domain resource set. Then, the first node can randomly select (or non-randomly select) the time domain positions of 2 OFDM symbols in the 6 continuous OFDM symbols as the time domain positions of the measurement time domain resource. Then, the first node can determine 2 measurement time domain resources (such as measurement time domain resource a' and measurement time domain resource b') according to the size of the measurement time domain resource and the time domain positions of the 2 measurement time domain resources. Among them, the 2 OFDM symbols (i.e. 2 measurement time domain resources) do not overlap with each other.

[0239] For example, continuing with the example of the first contention channel period including the wireless frame 1 shown in FIG. 3, the first node can select 6 consecutive OFDM symbols in the 10 OFDM symbols as the first time domain resource set. For example, the 6 consecutive OFDM symbols can be the third G symbol, the fourth G symbol,..., and the second T symbol from left to right in the wireless frame 1 shown in FIG. 3. Then, the first node can randomly select (or non-randomly select) the time domain positions of 2 OFDM symbols in the 6 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 in the 6 consecutive OFDM symbols can be selected as the time domain position of the measurement time domain resource a', and the time domain position of the second T symbol in the 6 consecutive OFDM symbols can be selected as the time domain position of the measurement time domain resource b'. Then, in the case that the size of a measurement time domain resource is one OFDM symbol, the first node can determine the fourth G symbol in the 6 consecutive OFDM symbols as the measurement time domain resource a' according to the time domain position of the measurement time domain resource a'. The first node can determine the second T symbol in the 6 consecutive OFDM symbols as the measurement time domain resource b' according to the time domain position of the measurement time domain resource b'.

[0240] Alternatively, the first node can also select the time domain position of the first T symbol in the 6 consecutive OFDM symbols as the time domain position of the measurement time domain resource a', and select the time domain position of the second T symbol in the 6 consecutive OFDM symbols as the time domain position of the measurement time domain resource b'. Then, in the case that the size of a measurement time domain resource is one OFDM symbol, the first node can determine the first T symbol in the 6 consecutive OFDM symbols as the measurement time domain resource a' according to the time domain position of the measurement time domain resource a'. The first node can determine the second T symbol in the 6 consecutive OFDM symbols as the measurement time domain resource b' according to the time domain position of the measurement time domain resource b'.

[0241] It can be understood that the above is only an example of several implementation processes of the above-described manner 2, and the first node can also select M time domain resources as measurement time domain resources through other manners. For example, in the case that the first contention channel period includes 2 consecutive superframes, the first node can select the first time domain resource set in the 2 consecutive superframes, and then randomly select (or non-randomly select) the time domain positions of M wireless frames in the first time domain resource set as the time domain positions of the measurement time domain resources. For another example, in the case that the first contention channel period includes 2 consecutive wireless frames, the first node can select the first time domain resource set in the 2 consecutive wireless frames, and then randomly select (or non-randomly select) the time domain positions of M OFDM symbols in the first time domain resource set as the time domain positions of the measurement time domain resources. Here, it is not enumerated one by one.

[0242] Step 602: The first node determines M time domain resources according to the M measurement time domain resources.

[0243] The M time domain resources are located in the first contention channel period.

[0244] It can be understood that the M time domain resources are continuous in the time domain. That is, there is no interval (or no gap) between the M time domain resources.

[0245] The implementation process of the first node determining the M time domain resources according to the M measurement time domain resources is described below through the following possible implementation manners.

[0246] Implementation manner 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 time domain resources or M+1 time domain resources.

[0247] In an example, when there is at least one measurement time domain resource in the M measurement time domain resources located at the end position of the first contention channel period, the first node uses the M measurement time domain resources to divide the first contention channel period, and can obtain M time domain resources.

[0248] It can be understood that in this example, the M time domain resources are one-to-one corresponding to the M measurement time domain resources. Alternatively, a measurement time domain resource can be located at the end position (also referred to as the tail position or the end) of the time domain resource corresponding to the measurement time domain resource. That is, there can be at least one measurement time domain resource in the M measurement time domain resources located at the end position of the time domain resource corresponding to the at least one measurement time domain resource. This way, by locating a measurement time domain resource at the tail position of the time domain resource corresponding to the measurement time domain resource, 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 after the measurement time domain resource. Alternatively, any measurement time domain resource in the M measurement time domain resources can also be located at the front position (also referred to as the start position) of the time domain resource corresponding to the measurement time domain resource.

[0249] For example, taking the value of M as 3, the three measurement time domain resources as measurement time domain resource c1, measurement time domain resource c2 and measurement time domain resource c3, and the three time domain resources as the first time domain resource, the second time domain resource and the third time domain resource as an example. Among them, the measurement time domain resource c1 corresponds to the first time domain resource, the measurement time domain resource c2 corresponds to the second time domain resource, and the measurement time domain resource c3 corresponds to the third time domain resource.

[0250] For example, one of the three measurement time domain resources (such as measurement time domain resource c1) is located at the end of the segment time domain resource where the measurement time domain resource is located, that is, the measurement time domain resource c1 is located at the end of the first segment time domain resource (which can be understood as being obtained by taking the tail boundary line (also referred to as the tail boundary point or the right boundary line or the right boundary point) of the measurement time domain resource c1 as the cutting position). Optionally, the measurement time domain resource c2 can be located at the front of the second segment time domain resource (which can be understood as being obtained by taking the front boundary line (also referred to as the front boundary point or the left boundary line or the left boundary point) of the measurement time domain resource c3 as the cutting position), and / or the measurement time domain resource c3 can be located at the front of the third segment time domain resource (which can be understood as being obtained by taking the front boundary line of the measurement time domain resource c3 as the cutting position).

[0251] For another example, two of the three measurement time domain resources (such as measurement time domain resources c1 and c2) are respectively located at the end of the segment time domain resource where the measurement time domain resource is located, that is, the measurement time domain resource c1 is located at the end of the first segment time domain resource (which can be understood as being obtained by taking the tail boundary line of the measurement time domain resource c1 as the cutting position) and the measurement time domain resource c2 is located at the end of the second segment time domain resource (which can be understood as being obtained by taking the tail boundary line of the measurement time domain resource c2 as the cutting position). Optionally, the measurement time domain resource c3 can be located at the front of the third segment time domain resource (which can be understood as being obtained by taking the front boundary line of the measurement time domain resource c3 as the cutting position).

[0252] For another example, the three measurement time domain resources are all located at the end of the segment time domain resource where the measurement time domain resource is located (which can be understood as being obtained by taking the tail boundary line of each of the three measurement time domain resources as the cutting position), that is, the measurement time domain resource c1 is located at the end of the first segment time domain resource, the measurement time domain resource c2 is located at the end of the second segment time domain resource, and the measurement time domain resource c3 is located at the end of the third segment time domain resource.

[0253] Optionally, the three measurement time domain resources are all located at the front of the segment time domain resource where the measurement time domain resource is located (which can be understood as being obtained by taking the front boundary line of each of the three measurement time domain resources as the cutting position), that is, the measurement time domain resource c1 is located at the front of the first segment time domain resource, the measurement time domain resource c2 is located at the front of the second segment time domain resource, and the measurement time domain resource c3 is located at the front of the third segment time domain resource.

[0254] Exemplarily, taking the first contention channel period comprising 10 wireless frames (such as wireless frame 1, wireless frame 2, …, wireless frame 10), the value of M being 3, the 3 measurement time domain resources being measurement time domain resource b1, measurement time domain resource b2 and measurement time domain resource b3, and the size of one measurement time domain resource being one wireless frame as an example. As shown in FIG. 7a, wireless frame 2 is used as measurement time domain resource b1, wireless frame 6 is used as measurement time domain resource b2, and wireless frame 10 is used as measurement time domain resource b3. The first node uses the 3 measurement time domain resources to split the first contention channel period, and 3 time domain resources can be obtained, such as the first time domain resource, the second time domain resource and the third time domain resource shown in FIG. 7a. Among them, 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.

[0255] Optionally, there can also be adjacent measurement time domain resources (such as two measurement time domain resources being adjacent or three measurement time domain resources being adjacent) in the M measurement time domain resources. For example, continuing to take the first contention channel period comprising 10 wireless frames (such as wireless frame 1, wireless frame 2, …, wireless frame 10), the value of M being 3, the 3 measurement time domain resources being measurement time domain resource b1, measurement time domain resource b2 and measurement time domain resource b3, and the size of one measurement time domain resource being one wireless frame as an example. As shown in FIG. 7b, wireless frame 2 is used as measurement time domain resource b1, wireless frame 3 is used as measurement time domain resource b2, and wireless frame 10 is used as measurement time domain resource b3. The first node uses the 3 measurement time domain resources to split the first contention channel period, and 3 time domain resources can be obtained, such as the first time domain resource, the second time domain resource and the third time domain resource shown in FIG. 7b. Among them, 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.

[0256] In another example, when there is no measurement time domain resource located at the end of the first contention channel period in the M measurement time domain resources, the first node uses the M measurement time domain resources to split the first contention channel period, and M+1 time domain resources can be obtained.

[0257] For example, continue to take the first contention channel period including 10 wireless frames (such as wireless frame 1, wireless frame 2, …, wireless frame 10), the value of M is 3, the 3 measurement time domain resources are measurement time domain resource b1, measurement time domain resource b2 and measurement time domain resource b3, and the size of one measurement time domain resource is one wireless frame. As shown in FIG. 7c, wireless frame 2 is measurement time domain resource b1, wireless frame 6 is measurement time domain resource b2, and wireless frame 9 is measurement time domain resource b3. The first node uses the 3 measurement time domain resources to divide the first contention channel period, and 4 time domain resources can be obtained, such as the first time domain resource, the second time domain resource, the third time domain resource and the fourth time domain resource shown in FIG. 7c. Among them, 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.

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

[0259] 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 to obtain M time domain resources.

[0260] It can be understood that in this example, the M time domain resources are one-to-one corresponding to the M measurement time domain resources. Alternatively, one measurement time domain resource can be located at the end of the time domain resource corresponding to the measurement time domain resource. That is to say, there can be at least one measurement time domain resource in the M measurement time domain resources corresponding to the end of the time domain resource where the at least one measurement time domain resource is located. Alternatively, any measurement time domain resource in the M measurement time domain resources can also be located at the front of the time domain resource corresponding to the measurement time domain resource.

[0261] Among them, the content not fully described in the implementation 2 that one measurement time domain resource can be located at the end of the time domain resource corresponding to the measurement time domain resource or one measurement time domain resource can also be located at the front of the time domain resource corresponding to the measurement time domain resource can refer to the related introduction in the above implementation 1, which will not be described here.

[0262] For example, the first contention channel period includes 10 wireless frames (such as wireless frame 1, wireless frame 2, …, wireless frame 10), the first time domain resource set includes 7 consecutive wireless frames in the first contention channel period (such as wireless frame 3, wireless frame 4, …, wireless frame 9), the value of M is 3, the 3 measurement time domain resources are measurement time domain resource b1', measurement time domain resource b2', and measurement time domain resource b3', and the size of one measurement time domain resource is one wireless frame. As shown in FIG. 8a, wireless frame 4 is measurement time domain resource b1', wireless frame 6 is measurement time domain resource b2', and wireless frame 9 is measurement time domain resource b3'. The first node uses the 3 measurement time domain resources to split the first time domain resource set, and 3 time domain resources can be obtained, such as the first time domain resource, the second time domain resource, and the third time domain resource shown in FIG. 8a. The measurement time domain resource b1' is located at the end of the first time domain resource, the measurement time domain resource b2' is located at the end of the second time domain resource, and the measurement time domain resource b3' is located at the end of the third time domain resource.

[0263] Optionally, adjacent measurement time domain resources (such as two measurement time domain resources adjacent to each other or three measurement time domain resources adjacent to each other) can also exist in the M measurement time domain resources. For example, the first contention channel period includes 10 wireless frames (such as wireless frame 1, wireless frame 2, …, wireless frame 10), the first time domain resource set includes 7 consecutive wireless frames in the first contention channel period (such as wireless frame 3, wireless frame 4, …, wireless frame 9), the value of M is 3, the 3 measurement time domain resources are measurement time domain resource b1', measurement time domain resource b2', and measurement time domain resource b3', and the size of one measurement time domain resource is one wireless frame. As shown in FIG. 8b, wireless frame 5 is measurement time domain resource b1', wireless frame 6 is measurement time domain resource b2', and wireless frame 9 is measurement time domain resource b3'. The first node uses the 3 measurement time domain resources to split the first time domain resource set, and 3 time domain resources can be obtained, such as the first time domain resource, the second time domain resource, and the third time domain resource shown in FIG. 8b. The measurement time domain resource b1' is located at the end of the first time domain resource, and the measurement time domain resource b3' is located at the end of the third time domain resource.

[0264] In another example, when there is no measurement time domain resource in the M measurement time domain resources located at the end of the first time domain resource set, the first node uses the M measurement time domain resources to split the first time domain resource set, and M+1 time domain resources can be obtained.

[0265] For example, continue to take the first contention channel period including 10 wireless frames (such as wireless frame 1, wireless frame 2, …, wireless frame 10), the first time domain resource set includes 7 consecutive wireless frames (such as wireless frame 3, wireless frame 4, …, wireless frame 9) in the first contention channel period, the value of M is 3, the 3 measurement time domain resources are measurement time domain resource b1', measurement time domain resource b2' and measurement time domain resource b3', and the size of one measurement time domain resource is one wireless frame. As shown in FIG. 8c, wireless frame 4 is measurement time domain resource b1', wireless frame 6 is measurement time domain resource b2', and wireless frame 8 is measurement time domain resource b3'. The first node uses the 3 measurement time domain resources to split the first time domain resource set, and 4 time domain resources can be obtained, such as the first time domain resource, the second time domain resource, the third time domain resource and the fourth time domain resource shown in FIG. 8c. Among them, 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.

[0266] Step 603: The first node determines a channel contention result of the first node in the first contention channel period according to a state of the first node on the kth time domain resource and / or a channel state measurement result on the kth measurement time domain resource.

[0267] Among them, the kth time domain resource can be one of the M time domain resources, and the kth measurement time domain resource can be one of the M measurement time domain resources.

[0268] For example, the channel contention result (also referred to as the contention channel result) can include one of the following: channel contention success (also referred to as contention channel success) and channel contention failure (also referred to as contention channel failure).

[0269] It can be understood that, in the above M time domain resources, the state of the first node on at least one time domain resource can be determined according to the state on a previous time domain resource of the at least one time domain resource and / or a channel state measurement result measured by the first node on the measurement time domain resource included in the previous time domain resource. Alternatively, when the state of the first node on a certain time domain resource is the occupied state, the first node can send a signal on the time domain resource. In this way, the first node can make other nodes measure the energy of the signal sent by the first node on the time domain resource, so as to know that the channel is currently occupied by the node, thereby realizing temporary occupation of the channel by the first node. When the state of the first node on the time domain resource is the released state, the first node will not send a signal on the time domain resource. For example, taking a certain time domain resource (such as the tth time domain resource) in the above M time domain resources as an example. If the state of the first node on the tth time domain resource (such as the tth time domain resource includes the measurement time domain resource and other time domain resources (which can also be referred to as non-measurement time domain resources), which can be used for sending signals) is the occupied state, the first node can send a signal on the tth time domain resource. If the state of the first node on the tth time domain resource is the released state, the first node will not send a signal on the tth time domain resource. It can be understood that, all resources in the measurement time domain resource included in the tth time domain resource are used for measurement, or part of the resources in the measurement time domain resource are used for measurement, and the remaining resources can be used for sending signals and / or can be used for some internal processing operations. Alternatively, if the state of the first node on the tth time domain resource (such as the tth time domain resource only includes the measurement time domain resource) is the occupied state, and there is a resource (or time domain resource) available for sending signals in the tth time domain resource, the first node can also send a signal on the tth time domain resource.

[0270] For example, taking the three time-domain resources shown in FIG. 7a as an example, when the state on a certain time-domain resource (such as the second time-domain resource) in the three time-domain resources is determined based on the state on the previous time-domain resource of the time-domain resource and / or the channel state measurement result obtained by the first node by measuring the measurement time-domain resource included in the previous time-domain resource, the first node can determine the state of the first node on the second time-domain resource according to the state of the first node on the first time-domain resource and / or the channel state measurement result obtained by the first node by measuring the measurement time-domain resource included in the first time-domain resource. When the state on a certain two time-domain resources (such as the second time-domain resource and the third time-domain resource) in the three time-domain resources is determined based on the state on the previous time-domain resource of the two time-domain resources and / or the channel state measurement result obtained by the first node by measuring the measurement time-domain resource included in the previous time-domain resource, the first node can determine the state of the first node on the second time-domain resource according to the state of the first node on the first time-domain resource and / or the channel state measurement result obtained by the first node by measuring the measurement time-domain resource included in the first time-domain resource. The first node can determine the state on the third time-domain resource according to the state of the first node on the second time-domain resource and / or the channel state measurement result obtained by the first node by measuring the measurement time-domain resource included in the second time-domain resource.

[0271] Optionally, in the above M time-domain resources, the state of the first node on at least one time-domain resource can also be determined according to the state on the more previous time-domain resource of the at least one time-domain resource and / or the channel state measurement result obtained by the first node by measuring the measurement time-domain resource included in the more previous time-domain resource. For example, taking the three time-domain resources shown in FIG. 7a as an example, when the state on a certain time-domain resource (such as the third time-domain resource) in the three time-domain resources is determined based on the state on the more previous time-domain resource (such as the first time-domain resource) of the time-domain resource and / or the channel state measurement result obtained by the first node by measuring the measurement time-domain resource included in the more previous time-domain resource (such as the first time-domain resource), the first node can determine the state of the first node on the third time-domain resource according to the state of the first node on the first time-domain resource and / or the channel state measurement result obtained by the first node by measuring the measurement time-domain resource included in the first time-domain resource.

[0272] For example, the first node can determine the state of the first node on the third time domain resource according to the state of the first node on the first time domain resource and / or the channel state measurement result measured by the first node on the measurement time domain resource included in the first time domain resource, when the state on a certain time domain resource (such as the third time domain resource) in the four time domain resources is determined based on the state on the previous time domain resource (such as the first time domain resource) of the certain time domain resource and / or the channel state measurement result measured by the first node on the measurement time domain resource included in the previous time domain resource. The first node can determine the state of the first node on the third time domain resource according to the state of the first node on the first time domain resource and / or the channel state measurement result measured by the first node on the measurement time domain resource included in the first time domain resource, when the states on two time domain resources (such as the third time domain resource and the fourth time domain resource) in the four time domain resources are respectively determined based on the states on the previous time domain resources of the two time domain resources and / or the channel state measurement results measured by the first node on the measurement time domain resources included in the previous time domain resources. The first node can determine the state of the first node on the fourth time domain resource according to the state of the first node on the first time domain resource and / or the channel state measurement result measured by the first node on the measurement time domain resource included in the first time domain resource. Alternatively, the first node can also determine the state of the first node on the fourth time domain resource according to the state of the first node on the second time domain resource and / or the channel state measurement result measured by the first node on the measurement time domain resource included in the second time domain resource. Alternatively, the first node can also determine the state of the first node on the third time domain resource according to the state of the first node on the second time domain resource and / or the channel state measurement result measured by the first node on the measurement time domain resource included in the second time domain resource. Alternatively, the first node can also determine the state of the first node on the second time domain resource according to the state of the first node on the first time domain resource and / or the channel state measurement result measured by the first node on the measurement time domain resource included in the first time domain resource.

[0273] The following describes the implementation process in which the state of the first node on at least one time domain resource is determined according to the state on the previous time domain resource of the at least one time domain resource and / or the channel state measurement result measured by the first node on the measurement time domain resource included in the previous time domain resource, through the following possible implementation manners.

[0274] In an implementation a, the first node determines the state of the first node on the i-th time domain resource according to the state of the first node on the (i-1)-th time domain resource. The implementation a determines (or infers or decides) the state of the first node on the i-th time domain resource according to the state of the first node on the (i-1)-th time domain resource, which can realize the process of the node competing for occupying the channel (for example, if the state of the first node on the i-th time domain resource is the occupying state, the first node immediately occupies the channel, and if the state of the first node on the i-th time domain resource is the releasing state, the first node immediately releases the channel).

[0275] The (i-1)-th time domain resource and the i-th time domain resource are two continuous time domain resources in the M time domain resources.

[0276] In an example, if the state of the first node on the (i-1)-th time domain resource is the releasing state, the first node can determine that the state of the first node on the i-th time domain resource is the releasing state.

[0277] When the state of the first node on the i-th time domain resource is the releasing state, the first node does not send a signal on the i-th time domain resource.

[0278] In another example, if the state of the first node on the (i-1)-th time domain resource is the occupying state, the first node can determine that the state of the first node on the i-th time domain resource is the occupying state. The example can make the probability of the node competing for occupying the channel relatively high, and is suitable for a node with high priority or a service with high priority.

[0279] When the state of the first node on the i-th time domain resource is the occupying state, if the i-th time domain resource includes the i-th measurement time domain resource and other time domain resources (which can also be referred to as non-measurement time domain resources, and the non-measurement time domain resources can be used for sending a signal), the first node can send a signal on the i-th time domain resource. It can be understood that all resources in the i-th measurement time domain resource are used for measurement, or part of the resources in the i-th measurement time domain resource are used for measurement, and the remaining resources can be used for sending a signal and / or can be used for some internal processing operations. Alternatively, when the state of the first node on the i-th time domain resource is the occupying state, if the i-th time domain resource only includes the i-th measurement time domain resource, and the i-th measurement time domain resource includes resources that can be used for sending a signal, the first node can also send a signal on the i-th time domain resource.

[0280] For example, continuing with the first time domain resource and the second time domain resource in the three time domain resources shown in FIG. 7a, if the state of the first node on the first time domain resource shown in FIG. 7a is the release state, the first node can determine that the state of the first node on the second time domain resource shown in FIG. 7a is the release state. When the state of the first node on the second time domain resource is the release state, the first node does not send a signal on the second time domain resource. If the state of the first node on the first time domain resource shown in FIG. 7a is the occupied state, the first node can determine that the state of the first node on the second time domain resource shown in FIG. 7a is the occupied state. When the state of the first node on the second time domain resource is the occupied state, the first node can send a signal on the second time domain resource. For example, the first node can send a signal on the radio frame 3 or the radio frame 4 or the radio frame 5 included in the second time domain resource. Alternatively, if the radio frame 6 (i.e., the measurement time domain resource b2) includes a resource available for sending a signal, the first node can also send a signal on the resource available for sending a signal.

[0281] Implementation manner b: The first node determines the state of the first node on the ith time domain resource according to the channel state measurement result on the (i-1)th measurement time domain resource. The (i-1)th measurement time domain resource and the ith time domain resource correspond to two consecutive time domain resources in the M time domain resources. This implementation manner b determines the state of the first node on the ith time domain resource according to the channel state measurement result measured on the (i-1)th measurement time domain resource, and can realize mutual competition between nodes to occupy the channel.

[0282] In one example, if the channel state measurement result on the (i-1)th measurement time domain resource is channel idle (it can be understood that the channel state measurement result measured by the first node on the (i-1)th measurement time domain resource is channel idle), the first node can determine that the state of the first node on the ith time domain resource is the occupied state. 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 a signal strength threshold, the first node can determine that the channel state measurement result is channel idle, and if the RSSI is greater than the signal strength threshold, the first node can determine that the channel state measurement result is channel busy.

[0283] When the state of the first node on the ith time domain resource is the occupied state, if the ith time domain resource includes the ith measurement time domain resource and other time domain resources, the first node can send a signal on the ith time domain resource. It can be understood that all resources in the ith measurement time domain resource are used for measurement, or part of the resources in the ith measurement time domain resource are used for measurement, and the remaining resources can be used for sending a signal and / or can be used for some internal processing operations. Alternatively, when the state of the first node on the ith time domain resource is the occupied state, if the ith time domain resource only includes the ith measurement time domain resource, and the ith measurement time domain resource includes resources that can be used for sending a signal, the first node can also send a signal on the ith time domain resource.

[0284] In another example, if the channel state measurement result on the (i-1)th measurement time domain resource is that the channel is busy (it can be understood that the channel state measurement result measured by the first node on the (i-1)th measurement time domain resource is that the channel is busy), the first node can determine that the state of the first node on the ith time domain resource is the released state.

[0285] When the state of the first node on the ith time domain resource is the released state, the first node will not send a signal on the ith time domain resource.

[0286] For example, continuing with the first time domain resource and the second time domain resource in the three time domain resources shown in FIG. 7a as an example, if the channel state measurement result measured by the first node on the radio frame 2 (i.e., the measurement time domain resource b1) included in the first time domain resource shown in FIG. 7a is that the channel is idle, the first node can determine that the state of the first node on the second time domain resource is the occupied state. When the state of the first node on the second time domain resource is the occupied state, the first node can send a signal on the second time domain resource. For example, the first node can send a signal on the radio frame 3 or the radio frame 4 or the radio frame 5 included in the second time domain resource. Alternatively, if the radio frame 6 (i.e., the measurement time domain resource b2) includes resources that can be used for sending a signal, the first node can also send a signal on the resources that can be used for sending a signal. If the channel state measurement result measured by the first node on the radio frame 2 (i.e., the measurement time domain resource b1) included in the first time domain resource shown in FIG. 7a is that the channel is busy, the first node can determine that the state of the first node on the second time domain resource 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.

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

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

[0289] When the state of the first node on the ith time domain resource is the occupied state, if the ith time domain resource includes the ith measurement time domain resource and other time domain resources, the first node can send a signal on the ith time domain resource. It can be understood that all resources in the ith measurement time domain resource are used for measurement, or part of the resources in the ith measurement time domain resource are used for measurement, and the remaining resources can be used for sending a signal and / or can be used for some internal processing operations. Alternatively, when the state of the first node on the ith time domain resource is the occupied state, if the ith time domain resource only includes the ith measurement time domain resource, and the ith measurement time domain resource includes resources that can be used for sending a signal, the first node can also send a signal on the ith time domain resource.

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

[0291] Alternatively, if the state of the first node on the (i-1)th time domain resource is the released state and the channel state measurement result on the (i-1)th measurement time domain resource is that the channel is busy, or if the state of the first node on the (i-1)th time domain resource is the released state and the channel state measurement result on the (i-1)th measurement time domain resource is that the channel is idle, the first node can also determine that the state of the first node on the ith time domain resource is the released state.

[0292] When the state of the first node on the ith time domain resource is the released state, the first node will not send a signal on the ith time domain resource.

[0293] For example, continuing with the first segment of time domain resources and the second segment of time domain resources in the three-segment time domain resources shown in FIG. 7a as an example, if the state of the first node on the first segment of time domain resources shown in FIG. 7a is the occupied state, and the channel state measurement result obtained by the first node on the radio frame 2 (i.e., the measurement time domain resource b1) included in the first segment of time domain resources shown in FIG. 7a is the channel idle, the first node can determine that the state of the first node on the second segment of time domain resources is the occupied state. When the state of the first node on the second segment of time domain resources is the occupied state, the first node can send a signal on the second segment of time domain resources. For example, the first node can send a signal on the radio frame 3 or the radio frame 4 or the radio frame 5 included in the second segment of time domain resources. Alternatively, if the radio frame 6 (i.e., the measurement time domain resource b2) includes a resource available for sending a signal, the first node can also send a signal on the resource available for sending a signal.

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

[0295] Next, the following describes the implementation process of the first node determining the channel contention result of the first contention channel period according to the state of the first node on the kth segment of time domain resources and / or the channel state measurement result on the kth measurement time domain resource through the following possible implementation manners.

[0296] Manner A: The first node determines the channel contention result of the first node in the first contention channel period according to the state of the first node on the kth time domain resource. Since the state of the kth time domain resource can reflect the channel state measurement result obtained by one or more measurements before the kth time domain resource, the channel contention result of the first node in the first contention channel period can be accurately determined according to the state of the first node on the kth time domain resource.

[0297] It can be understood that the manner of determining the state on the kth time domain resource can refer to the related description of the above implementation manner a to implementation manner c, which will not be described here again. Alternatively, the state on the kth time domain resource can also be determined according to the state on a time domain resource before the kth time domain resource (such as the k-2th time domain resource or the k-3th time domain resource, etc.) and / or the channel state measurement result obtained by the first node in the measurement time domain resource included in the time domain resource, which can refer to the related description above, which will not be described here again.

[0298] Alternatively, the first node can also determine the channel contention result of the first node in the first contention channel period according to the state of the first node on the kth time domain resource and the channel state measurement result on the second measurement time domain resource. In this way, this manner can further make the channel contention result more accurate by comprehensively considering the state of the first node on the kth 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 being based on the state of the first node on the kth time domain resource and combining the channel state measurement result obtained by the first node on the second measurement time domain resource), so as to further improve the success rate of the node occupying the channel, and can avoid the interference caused by other nodes to a certain extent. The M measurement time domain resources are the first measurement time domain resources, and the second measurement time domain resource is different from the first measurement time domain resource. That is, the second measurement time domain resource is different from the M measurement time domain resources.

[0299] In one example, if the state of the first node on the kth time domain resource is the occupation state, the first node can determine that the channel contention result of the first node in the first contention channel period is channel contention success.

[0300] In another example, if the state of the first node on the kth time domain resource is the release state, the first node can determine that the channel contention result of the first node in the first contention channel period is channel contention failure.

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

[0302] In yet another example, if the state of the first node on the kth time domain resource is the occupied state, and the channel state measurement result obtained by the first node on the second measurement time domain resource is the channel busy, the first node can determine that the channel competition result of the first node in the first contention channel period is the channel competition failure.

[0303] In yet another example, if the state of the first node on the kth 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, the first node can determine that the channel competition result of the first node in the first contention channel period is the channel competition success or the channel competition failure.

[0304] In yet another example, if the state of the first node on the kth 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, the first node can determine that the channel competition result of the first node in the first contention channel period is the channel competition success or the channel competition failure.

[0305] Optionally, when the first node determines that the channel competition result of the first node in the first contention channel period is the channel competition success according to the state of the first node on the kth time domain resource being the occupied state, the first node can determine (or set or maintain) the state of the first node on the time domain resource located after the kth time domain resource as the occupied state without measuring the channel state on the subsequent measurement time domain resource. Or, even if the first node measures the channel state on the subsequent measurement time domain resource, the state of the first node on the time domain resource located after the kth time domain resource is maintained as the occupied state regardless of the channel state measurement result. In this way, it can be applicable to some high-priority nodes or high-priority services, and it is helpful to improve the success rate of node occupying the channel.

[0306] Method B: The first node determines the channel competition result of the first node in the first contention channel period according to the channel state measurement result on the kth measurement time domain resource. Since the channel state measurement result on the kth measurement time domain resource can reflect the channel busy / idle situation corresponding to the kth time domain resource, the channel competition result of the first node in the first contention channel period can be accurately determined according to the channel state measurement result on the kth measurement time domain resource.

[0307] Optionally, the first node can also determine the channel contention result of the first node in the first contention channel period according to the channel state measurement result on the kth measurement time domain resource and the channel state measurement result on the second measurement time domain resource. In this way, this method can further make the channel contention result more accurate by comprehensively considering the channel state measurement result measured by the first node on the kth measurement time domain resource and the channel state measurement result measured by the first node on the second measurement time domain resource (it can be understood that the channel state measurement result measured by the first node on the kth measurement time domain resource is combined with the channel state measurement result measured by the first node on the second measurement time domain resource), so as to further improve the success rate of the node occupying the channel, and to avoid the interference caused by other nodes to a certain extent.

[0308] For example, the kth measurement time domain resource can be the measurement time domain resource included in the kth time domain resource, or the kth measurement time domain resource can also be the measurement time domain resource included in another time domain resource of the M time domain resources, and the present application does not limit this.

[0309] In one example, if the channel state measurement result measured by the first node on the kth measurement time domain resource is channel idle, the first node can determine that the channel contention result of the first node in the first contention channel period is channel contention success.

[0310] In another example, if the channel state measurement result measured by the first node on the kth measurement time domain resource is channel busy, the first node can determine that the channel contention result of the first node in the first contention channel period is channel contention failure.

[0311] In yet another example, if the channel state measurement result measured by the first node on the kth measurement time domain resource is channel idle, and the channel state measurement result measured by the first node on the second measurement time domain resource is channel idle, the first node can determine that the channel contention result of the first node in the first contention channel period is channel contention success.

[0312] In yet another example, if the channel state measurement result measured by the first node on the kth measurement time domain resource is channel idle, and the channel state measurement result measured by the first node on the second measurement time domain resource is channel busy, the first node can determine that the channel contention result of the first node in the first contention channel period is channel contention failure.

[0313] In yet another example, if the channel state measurement result measured by the first node on the kth measurement time domain resource is channel busy, and the channel state measurement result measured by the first node on the second measurement time domain resource is channel busy, the first node can determine that the channel contention result of the first node in the first contention channel period is channel contention failure.

[0314] In yet another example, if the channel state measurement result measured by the first node on the kth measurement time domain resource is channel busy, and the channel state measurement result measured by the first node on the second measurement time domain resource is channel idle, the first node can determine that the channel contention result of the first node in the first contention channel period is channel contention success or channel contention failure.

[0315] Optionally, when the first node determines that the channel contention result of the first node in the first contention channel period is channel contention success according to the channel state measurement result measured by the first node on the kth measurement time domain resource being channel idle, the first node can determine the state of the first node on the time domain resource after the kth time domain resource as occupied state without measuring the channel state on the subsequent measurement time domain resource. Or, even if the first node measures the channel state on the subsequent measurement time domain resource, the state of the first node on the time domain resource after the kth time domain resource is maintained as occupied state regardless of the channel state measurement result. In this way, it can be applicable to some high-priority nodes or high-priority services, and it is helpful to improve the success rate of node occupying the channel.

[0316] Mode C: The first node determines the channel contention result of the first node in the first contention channel period according to the state of the first node on the kth time domain resource and the channel state measurement result on the kth measurement time domain resource.

[0317] Optionally, the first node can also determine the channel contention result of the first node in the first contention channel period according to the state of the first node on the kth time domain resource, the channel state measurement result on the kth measurement time domain resource, and the channel state measurement result on the second measurement time domain resource. In this way, this mode comprehensively considers the state of the first node on the kth time domain resource, the channel state measurement result measured by the first node on the kth measurement time domain resource, and the channel state measurement result measured by the first node on the second measurement time domain resource (which can be understood as being based on the state of the first node on the kth time domain resource and the channel state measurement result measured by the first node on the kth measurement time domain resource, and combining the channel state measurement result measured by the first node on the second measurement time domain resource), which can further make the channel contention result more accurate, thereby further improving the success rate of node occupying the channel, and can to some extent avoid the interference caused by other nodes.

[0318] For example, the kth measurement time domain resource can be a measurement time domain resource included in the kth time domain resource, or the kth measurement time domain resource can also be a measurement time domain resource included in another time domain resource of the M time domain resources, and the present application does not make any limitation.

[0319] In one example, if the state of the first node on the kth time domain resource is the occupied state, and the channel state measurement result measured by the first node on the kth measurement time domain resource is the channel idle, 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.

[0320] Optionally, when the state of the first node on the kth time domain resource is the occupied state, and the channel state measurement result measured by the first node on the kth measurement time domain resource is the channel busy, 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.

[0321] In another example, if the state of the first node on the kth time domain resource is the released state, and the channel state measurement result measured by the first node on the kth measurement time domain resource is the channel busy, 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.

[0322] Optionally, when the state of the first node on the kth time domain resource is the released state, and the channel state measurement result measured by the first node on the kth 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.

[0323] In yet another example, if the state of the first node on the kth time domain resource is the occupied state, and the channel state measurement result measured by the first node on the kth measurement time domain resource is the channel idle, and the channel state measurement result measured by the first node on the second measurement time domain resource is the channel idle or the channel busy, 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.

[0324] In yet another example, if the state of the first node on the kth time domain resource is the occupied state, and the channel state measurement result measured by the first node on the kth measurement time domain resource is the channel busy, and the channel state measurement result measured by the first node on the second measurement time domain resource is the channel idle, 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.

[0325] In yet another example, if the state of the first node on the kth time domain resource is the occupied state, and the channel state measurement result measured by the first node on the kth measurement time domain resource is the channel busy, and the channel state measurement result measured by the first node on the second measurement time domain resource is the channel busy, 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.

[0326] In yet another example, if the state of the first node on the kth time domain resource is the released state, and the channel state measurement result measured by the first node on the kth measurement time domain resource is the channel idle, and the channel state measurement result measured by the first node on the second measurement time domain resource is the channel idle, 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.

[0327] In yet another example, if the state of the first node on the kth time domain resource is the released state, and the channel state measurement result measured by the first node on the kth measurement time domain resource is the channel busy, and the channel state measurement result measured by the first node on the second measurement time domain resource is the channel busy or the channel idle, 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] In yet another example, if the state of the first node on the kth time domain resource is the released state, and the channel state measurement result measured by the first node on the kth measurement time domain resource is the channel idle, and the channel state measurement result measured by the first node on the second measurement time domain resource is the channel busy, 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.

[0329] Optionally, when the kth time domain resource is the last time domain resource in the M time domain resources (i.e., the Mth measurement time domain resource), or the kth time domain resource is the last time domain resource in the M+1 time domain resources (i.e., the M+1th measurement time domain resource), the determination time (or the judgment time) of the channel contention result can be made relatively late, so that the number of measurement times affecting the channel contention result is also relatively large, so that the possibility of the first node competing for the channel is higher, and the probability of the nodes colliding due to competing for the channel is lower.

[0330] In the embodiments of the present application, if the first node determines that the channel contention result of the first node in the first contention channel period is channel contention success, the first node can update the state of the first node from the contention channel state to the communication state (which can also be understood as the first node switching from the contention channel state to the communication state) after the end of the first contention channel period. It should be understood that the contention channel state represents the state of the first node before transmitting data (or signals) and the need to contend for the channel. For example, the first node is in the contention channel state in the first contention channel period. The communication state represents the state of the first node contending for the channel and being able to communicate using the contended channel. When the first node is in the communication state, the first node can transmit scheduling signaling and / or data on the contended channel.

[0331] For example, the duration of the communication state can include s time domain resource units, which can match the timing of the communication and be easy to implement. Wherein s is an integer greater than or equal to 1.

[0332] Optionally, if the state of the first node is the idle state, the first node can not transmit signals, which can effectively avoid the first node unnecessarily occupying the channel due to channel contention or invalid communication. For example, the duration of the idle state can include h time domain resource units, which can match the timing of the communication and be easy to implement. Wherein h is an integer greater than or equal to 1.

[0333] For example, if the first node determines that the channel contention result of the first node in the first contention channel period is channel contention failure, and the first node has not entered the channel contention of the next contention channel period, or if the first node does not transmit data (or signals), the first node can be in the idle state. Optionally, the first node can also switch from the communication state to the idle state when there is no data transmission.

[0334] 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 first one or more of the M time domain resources (which can be understood as the state of the first one or more of the M time domain resources needs to be initialized), which can adjust the starting point (also referred to as the starting position) of the node contending for the channel.

[0335] The state of the first one or more of the M time domain resources is introduced below through the following possible examples.

[0336] Example a1: The state of the first node on the first p time domain resources of the M time domain resources is all released.

[0337] Optionally, when determining the M+1 time domain resources based on the M measurement time domain resources, the state of the first p time domain resources of the M+1 time domain resources can also be all released.

[0338] The example a1 can adjust the starting point of the channel competition of the node (which can be understood as the starting point of the channel competition of one or more nodes), and can adjust the probability of the channel competition of the node (for example, when the starting point of the channel competition is early, the number of the measured time domain resources is relatively large, the opportunity of the channel competition of the first node is also large, and the probability of the channel competition of the first node is also large, or when the starting point of the channel competition is late, the number of the measured time domain resources is relatively small, the opportunity of the channel competition of the first node is also relatively small, and the probability of the channel competition of the first node is also relatively small).

[0339] Example a2: The state of the first node on the first p-1 time domain resources in the M time domain resources is an occupied state, and the state of the first node on the p time domain resource in the M time domain resources is a released state.

[0340] Optionally, when the M+1 time domain resources are determined based on the 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 also be an occupied state, and the state of the first node on the p time domain resource in the M+1 time domain resources is a released state.

[0341] The example a2 can adjust the starting point of the channel competition of the node (one or more nodes start to compete for the channel from the p time domain resource, the value of p changes, and the starting point of the channel competition of the node also changes), and does not change the probability of the channel competition of the node (because the state of the first node on the first p-1 time domain resources is an occupied state, the p time domain resource is left for the channel competition between nodes).

[0342] For example, p can be determined by the first node based on the priority of the first node, or p can also be determined by the first node based on the priority of the to-be-transmitted service. For example, when the value of p is a relatively small integer value, it is helpful to make the probability of the channel competition of the high-priority node or the high-priority service higher.

[0343] In a 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, the first node can determine that the state of the first node on the first p-1 time domain resources of the M time domain resources is the occupied state, and the state of the first node on the pth time domain resource of the M time domain resources is the released state. This implementation can randomize the start point of the contention channel, thereby effectively avoiding the situation that, when multiple domains (for example, multiple G nodes) contend for the channel, the start time of the time domain resource (for example, the first time domain resource set) for channel contention of one or more domains is long after the end time of the time domain resource (for example, the second time domain resource set) for channel contention of the other one or more domains, and one or more domains continuously occupy the channel with high probability, and the other one or more domains cannot contend for the channel with high probability. For example, taking two G nodes (for example, G1 node and G2 node) as an example. The start time of the first time domain resource set of the G1 node is after the end time of the second time domain resource set of the G2 node. This implementation can avoid the situation that, when the G1 node and the G2 node contend for the channel, the G1 node continuously occupies the channel with high probability, and the G2 node cannot contend for the channel with high probability, because the start time of the first time domain resource set of the G1 node is after the end time of the second time domain resource set of the G2 node. The second time domain resource set is a continuous time domain resource in the contention channel period of the G2 node. For example, the second time domain resource set can include at least one radio frame, at least one time slot, at least one super frame, at least one symbol, or the like.

[0344] 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, the first node can determine that the state of the first node on the first p-1 time domain resources of the M time domain resources is the occupied state, and the state of the first node on the pth time domain resource of the M time domain resources is the released state.

[0345] The first condition can be a restriction condition (or limiting condition) of a time domain resource position of the first contention channel period. For example, the first condition can include one of the following: a first time domain resource (or a first time domain resource unit) included in the first contention channel period has an odd number, a first time domain resource (or a first time domain resource unit) included in the first contention channel period has an even number, a number obtained by performing a remainder operation (or a modulus operation) on a number of a first time domain resource (or a first time domain resource unit) included in the first contention channel period and a first preset value is a second preset value (for example, the number of the first time domain resource (or the first time domain resource unit) mod the first preset value = the second preset value), a start time of the first contention channel period is greater than or equal to a preset time, or a number of a first time domain resource (or a first time domain resource unit) included in the first contention channel period is greater than or equal to a preset threshold or a protocol-defined condition. For example, the first preset value is 3, and the second preset value is 2.

[0346] Alternatively, in the M segments of time domain resources, the state of the first node on the first p segments of time domain resources or the state of the first node on 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 on the last segment of time domain resources in the O segments of time domain resources or the state of the first node on the last e segments of time domain resources in the second contention channel period. The second contention channel period is the most recent contention channel period before the first contention channel period corresponding to the first node, and e is an integer greater than 1.

[0347] For example, the state of the first node on the first p segments of time domain resources is determined based on the state of the first node on the last segment of time domain resources in the O segments of time domain resources. If the state of the last segment of time domain resources in the O segments of time domain resources is a release state, the first node can determine that the state of the first p segments of time domain resources is a release state. If the state of the last segment of time domain resources in the O segments of time domain resources is an occupation state, the first node can determine that the state of the first p segments of time domain resources is an occupation state.

[0348] For another example, the state of the first node on the first p segments of time domain resources is determined based on the state of the first node on the last e segments of time domain resources in the O segments of time domain resources. If the number of time domain resources in the last e segments of time domain resources in the O segments of time domain resources that are in a release state is greater than or equal to a third quantity threshold (or the proportion of time domain resources in a release state is greater than or equal to a third proportion threshold), the first node can determine that the state of the first p segments of time domain resources is a release state. If the number of time domain resources in the last e segments of time domain resources in the O segments of time domain resources that are in an occupation state is greater than or equal to a fourth quantity threshold (or the proportion of time domain resources in an occupation state is greater than or equal to a fourth proportion threshold), the first node can determine that the state of the first p segments of time domain resources is an occupation state.

[0349] 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.

[0350] For example, taking the first node competing on N channels as an example. Wherein, N is an integer greater than or equal to 1. In the first competition channel period, the first node determines the channel competition result of the first node in the first competition channel period based on the M time domain resources corresponding to the N channels. It should be understood that the time domain position of the measurement time domain resource corresponding to the N channels in the M time domain resources is the same, so as to avoid the occurrence of duplex conflict due to the different configuration of the transceiving state of different channels (for example, for a certain time domain resource on the M time domain resources, the first node uses the time domain resource as a measurement time domain resource for measuring the channel state on a certain channel (such as channel 1), but the first node uses the time domain resource as a resource available for transmitting signals for transmitting signals on another channel (such as channel 2)). Optionally, for each of the M time domain resources, the state of the first node on the time domain resource in the N channels can be different or can be the same. For example, taking two channels (such as channel 1 and channel 2) and two time domain resources (such as a time domain resource 1 and another time domain resource 2) as an example. Wherein, channel 1 corresponds to a time domain resource 1 and another time domain resource 2, and channel 2 also corresponds to a time domain resource 1 and another time domain resource 2. In one example, for channel 1, the state of the first node on the time domain resource 1 is an occupied state; for channel 2, the state of the first node on the time domain resource 1 is a released state. In another example, for channel 1, the state of the first node on the time domain resource 1 is a released state; for channel 2, the state of the first node on the time domain resource 1 is a released state. In yet another example, for channel 1, the state of the first node on the other time domain resource 2 is an occupied state; for channel 2, the state of the first node on the other time domain resource 2 is an occupied state. In yet another example, for channel 1, the state of the first node on the other time domain resource 2 is a released state; for channel 2, the state of the first node on the other time domain resource 2 is an occupied state. In yet another example, for channel 1, the state of the first node on the other time domain resource 2 is an occupied state; for channel 2, the state of the first node on the other time domain resource 2 is a released state.

[0351] Optionally, when the first node competes on N channels in the first competition channel period, the first node can perform one of the following modes a1 to a3 on each of the N channels:

[0352] Mode a1: The first node determines the state of the first node on the i-th time domain resource according to the state of the first node on the (i-1)-th time domain resource.

[0353] Manner a2: The first node determines the state of the first node on the ith time domain resource according to the channel state measurement result on the (i-1)th measurement time domain resource.

[0354] Manner a3: The first node determines the state of the first node on the ith time domain resource according to 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.

[0355] The (i-1)th time domain resource and the ith time domain resource are two continuous time domain resources in the M time domain resources.

[0356] It can be understood that the specific description of manners a1 to a3 above can correspond to the relevant introduction of the above implementation manners a to c, which will not be described here.

[0357] For example, the following takes the first node competing on N channels in the first contention channel period as an example, and introduces the implementation process of the first node determining the channel contention result of the first node in the first contention channel period through the following several possible examples.

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

[0359] Wherein, g is the target number of channels required for the first node to communicate. Wherein, f, N and g are positive integers.

[0360] For example, the second condition can include at least one of the following: the state of the first node on the kth time domain resource is the occupied state, and the channel state measurement result on the kth measurement time domain resource is channel idle. Wherein, the determination manner of the state of the first node on the kth time domain resource can refer to the relevant introduction in the foregoing, and the determination manner of the channel state measurement result on the kth measurement time domain resource can refer to the relevant introduction in the foregoing, which will not be described here.

[0361] In one example, after the first node determines that the channel contention result of the first node in the first contention channel period is channel contention success, the first node can select g channels from the f channels. Then, the first node can communicate on the g channels. In this way, after the first node successfully competes for a channel each time, the first node can use the target number of channels in all channels obtained by competition to communicate, so that the communication bandwidth of each communication is relatively fixed, and the communication process is relatively simple.

[0362] In another example, after the first node determines that the channel contention result of the first node in the first contention channel period is channel contention success, the first node can communicate on the f channels. In this way, after each time the first node successfully contends for a channel, the first node can communicate using all the channels obtained by contention, and can also occupy as many resources as possible, so that the communication bandwidth of each communication can be different, and the communication process is relatively complex.

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

[0364] For example, taking three channels (such as channel 1, channel 2, and channel 3), the kth time domain resource is the second time domain resource shown in FIG. 7a, and the value of g is 1. If one of the three channels (such as channel 1) satisfies at least one of the following conditions: the state of the first node on the second time domain resource is an occupied state, or the channel state measurement result measured by the first node on the wireless frame 6 (i.e., the measurement time domain resource b2) is channel idle, the first node can determine that the channel contention result of the first node in the first contention channel period is channel contention success. Then, the first node can communicate on channel 1, such as the first node transmitting data on channel 1. That is, it can be understood that on channel 1, if the state of the first node on the second time domain resource is an occupied state and / or the channel state measurement result measured by the first node on the wireless frame 6 (i.e., the measurement time domain resource b2) is channel idle, the first node can contend for channel 1 successfully, and since the number of channels contended successfully by the first node is 1, which is equal to the value of g, the first node can communicate on channel 1.

[0365] If two of the three channels (e.g., channel 1 and channel 2) satisfy at least one of the following: the state of the first node on the second time domain resource is the occupied state or the channel state measurement result obtained by the first node on the radio frame 6 (i.e., the measurement time domain resource b2) is the channel idle, the first node can determine that the channel competition result of the first node on the first channel competition period is the channel competition success. That is, it can be understood that, on the channel 1, if the state of the first node on the second time domain resource is the occupied state and / or the channel state measurement result obtained by the first node on the radio frame 6 (i.e., the measurement time domain resource b2) is the channel idle, the first node can compete successfully for the channel 1. On the channel 2, if the state of the first node on the second time domain resource is the occupied state and / or the channel state measurement result obtained by the first node on the radio frame 6 (i.e., the measurement time domain resource b2) is the channel idle, the first node can also compete successfully for the channel 2. Since the number of channels that compete successfully is 2, which is greater than the value 1 of g, the first node can communicate on the channel 1 and / or the channel 2. For example, in one example, the first node can select one channel (such as channel 2) from the channel 1 and the channel 2. Then, the first node can communicate on the channel 2, such as the first node transmitting data on the channel 2. In another example, the first node can communicate on the channel 1 and the channel 2 respectively, such as the first node transmitting data on the channel 1 and the channel 2 respectively.

[0366] 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 the occupied state or the channel state measurement result obtained by the first node on the radio frame 6 (i.e., the measurement time domain resource b2) is the channel idle, the first node can determine that the channel competition result of the first node on the first channel competition period is the channel competition failure.

[0367] For another example, taking three channels (such as channel 1, channel 2 and channel 3), the kth time domain resource is the second time domain resource shown in FIG. 7a, and the value of g is 2 as an example. If two of the three channels (such as channel 1 and channel 2) satisfy at least one of the following: the state of the first node on the second time domain resource is the occupied state or the channel state measurement result obtained by the first node on the radio frame 6 (i.e., the measurement time domain resource b2) is the channel idle, the first node can determine that the channel competition result of the first node on the first channel competition period is the channel competition success. Then, the first node can communicate on the channel 1 and the channel 2 respectively, such as the first node transmitting data on the channel 1 and the channel 2 respectively.

[0368] If the three channels each satisfy at least one of the following: the state of the first node on the second time domain resource is the occupied state or the channel state measurement result obtained by the first node on the radio frame 6 (i.e., the measurement time domain resource b2) is the channel idle, the first node can determine that the channel competition result of the first node on the first contention channel period is the channel competition success. In an example, the first node can select two channels (such as channel 2 and channel 3) from the channel 1, the channel 2 and the channel 3. Then, the first node can respectively communicate on the channel 2 and the channel 3, such as the first node respectively sends data on the channel 2 and the channel 3. In another example, the first node can respectively communicate on the channel 1, the channel 2 and the channel 3, such as the first node respectively sends data on the channel 1, the channel 2 and the channel 3.

[0369] If only one of the three channels or 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 the occupied state or the channel state measurement result obtained by the first node on the radio frame 6 (i.e., the measurement time domain resource b2) is the channel idle, the first node can determine that the channel competition result of the first node on the first contention channel period is the channel competition failure.

[0370] It can be seen from the above steps 601 to 603 that after the first node determines the M time domain resources according to the M measurement time domain resources, the first node can determine the channel competition result of the first node on the first contention channel period according to the state of the first node on the kth time domain resource of the M time domain resources and / or the channel state measurement result on the kth measurement time domain resource, so as to provide a corresponding contention channel mechanism for the nodes using the star flash communication technology. The state of the first node on the kth time domain resource can reflect the channel state measurement result obtained by one or more times of measurement before the kth time domain resource, and the channel state measurement result on the kth measurement time domain resource can reflect the busy and idle situation of the channel corresponding to the kth time domain resource. There are more measurement time domain resources for measuring the channel state in the first contention channel period, and the channel competition result of the first node on the first contention channel period can be more accurately determined by comprehensively considering the multiple channel state measurement results. In addition, since there are more measurement time domain resources for measuring the channel state in the first contention channel period, the first node has more opportunities to contend for the channel, so that the probability of the first node contending for the channel is also relatively large, thereby the first node (such as the first node working in the unlicensed frequency band) has a relatively large probability to contend for the channel.

[0371] It should be noted that, in order to realize the functions in the above embodiments, the first node comprises the hardware structure and / or software module corresponding to the functions. Those skilled in the art should easily realize that, in combination with the units and method steps of the examples described in the embodiments disclosed in the present application, the present application can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is realized in the form of hardware or computer software driving hardware depends on the specific application scenario and design constraints of the technical solution.

[0372] FIG. 9 and FIG. 10 are structural schematic diagrams of possible communication apparatuses provided by the embodiments of the present application. The communication apparatuses can be used to realize the functions of the first node in the above method embodiments, and thus can also realize the beneficial effects possessed by the above method embodiments. In the embodiments of the present application, the communication apparatus can be the first node, and can also be a module (such as a chip) applied to the first node.

[0373] The communication apparatus 900 shown in FIG. 9 comprises a processing unit 910 (or can be referred to as a processing module). Optionally, the communication apparatus 900 shown in FIG. 9 can also comprise a transceiver unit 920 (or can be referred to as a communication module or a transceiver module or a communication module, used for transmitting and receiving data). The communication apparatus 900 can be used to realize the functions of the first node in the above method embodiments shown in FIG. 6. For example, the transceiver unit 920 can perform the receiving actions and the transmitting actions performed by the first node in the above method embodiments. The processing unit 910 can perform other actions of the first node in the above method embodiments except the transmitting actions and the receiving actions.

[0374] When the communication apparatus 900 is used to realize the functions of the first node in the above method embodiments shown in FIG. 6: the processing unit 910 is configured to determine M measurement time domain resources. The M measurement time domain resources can be used to measure channel states, and M is an integer greater than 1. The processing unit 910 is further configured to determine M time domain resources according to the M measurement time domain resources. The processing unit 910 is further configured to determine a channel contention result of the first node in a first contention channel period according to a state of the first node on a kth time domain resource and / or a channel state measurement result on a kth measurement time domain resource. 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. The transceiver unit 920 is configured to perform corresponding transceiving operations, such as can be used to transmit signals on a certain time domain resource or can be used to transmit data or signaling on a channel, etc.

[0375] For more detailed descriptions of the processing unit 910 and the transceiver unit 920, reference can be made to the related descriptions in the above method embodiments shown in FIG. 6, which will not be repeated here.

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

[0377] It should be noted that the division of the modules in the embodiments of the present application is illustrative, and is merely a logical functional division. Actual implementation can have another division manner. In addition, each functional unit in each embodiment of the present application can be integrated in one processing unit, or can be physically separated, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0378] If the integrated unit is realized in the form of 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 solutions of the present application, essentially or the part that makes a contribution to the prior art, or all or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium, and includes several instructions to make a computer device (which can be a personal computer, a server, or the like) or a processor execute all or part of the steps of the embodiments of the method of the present application. The foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various program codes that can be stored in the medium.

[0379] The communication apparatus 1000 shown in FIG. 10 includes a processor 1010. Optionally, the communication apparatus 1000 can also include at least one of a memory 1020, a transceiver 1030, and an antenna 1040.

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

[0381] The memory 1020 can store computer programs or software codes or instructions 1050, which can also be referred to as firmware. The processor 1010 can control the communication apparatus 1000 by running the computer programs or software codes or instructions 1060 of the processor 1010, or by invoking the computer programs or software codes or instructions 1050 stored in the memory 1020, to implement the embodiments of the present application described above. The processor 1010 can be a central processing unit (CPU), and the memory 1020 can be a read-only memory (ROM) or a random access memory (RAM).

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

[0383] The modules included in the communication apparatus 1000 are only illustrative, and the present application is not limited thereto.

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

[0385] Based on the same idea, the embodiments of the present application further provide a possible communication system. The communication system can include one or more first nodes. The first node can be used to implement the technical solutions related to the first node in the above embodiments. Optionally, the communication system can further include one or more second nodes. For example, the second node can be a second communication device (such as a T-node device) as shown in FIG. 4.

[0386] Based on the same idea, the embodiments of the present application further provide a computer program product, which includes computer programs or instructions, and when the computer programs or instructions run on a communication apparatus (or a computer), the communication apparatus (or the computer) executes the method provided in the above embodiments.

[0387] Based on the same idea, the embodiments of the present application further provide a computer readable storage medium, which stores computer programs or instructions, and when the computer programs or instructions are executed by a communication device (or a computer), the communication device (or the computer) executes the method provided by the above embodiments.

[0388] The storage medium can be any available medium that can be accessed by a computer. By way of example, and not limitation, such computer readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code means in the form of instructions or data structures and that can be accessed by a computer.

[0389] Based on the same idea, the embodiments of the present application further provide a chip, which can include a processor, and can further include a memory (or the chip is coupled with the memory), the processor executes program instructions in the memory, so that the chip executes the method provided by the above embodiments. Wherein, "coupled" means that two components are directly or indirectly combined with each other, such as the coupling can mean that the electrical connection between the two components.

[0390] Based on the same idea, the embodiments of the present application further provide a chip system, which includes a processor, and is used to support a computer device to realize the functions related to the first node in the above embodiments. In a possible implementation manner, the chip system further includes a memory, and the memory is used to save necessary programs and data of the computer device. The chip system can be composed of a chip, or can include the chip and other discrete devices.

[0391] It can be understood that the processor in the embodiments of the present application can be a central processing unit (CPU), and can also be other general-purpose processors, digital signal processors (DSP), application specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. The general-purpose processor can be a microprocessor, or any conventional processor.

[0392] 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.

[0393] 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.

[0394] In the various embodiments of the present application, the terms and / or descriptions between different embodiments are consistent and can be referred to each other if there is no special description and logical conflict, and the technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0395] In the present application, "at least one" means one or more, and "multiple" means two or more. The association relationship between the associated objects is described, which means that there can be three relationships, for example, A and / or B, which can represent the following three cases: A exists alone, A and B exist together, and B exists alone, where A and B can be singular or plural. In the textual description of the present application, the character " / " generally represents an "or" relationship between the associated objects before and after it; in the formula of the present application, the character " / " represents a "division" relationship between the associated objects before and after it.

[0396] It can be understood that various numbers involved in the embodiments of the present application are only distinguished for convenience of description, and are not used to limit the scope of the embodiments of the present application. The size of the serial number of the above processes does not mean the order of execution, and the execution order of the processes should be determined according to their functions and inherent logic.

Claims

1. A communication method characterized by comprising: The method is applied to a first node, and the method comprises: determining M measurement time domain resources, the M measurement time domain resources being used for measuring a channel state, M being an integer greater than 1; determining M time domain resources according to the M measurement time domain resources; determining a channel contention result of the first node in a first contention channel period according to a state of the first node on a kth time domain resource and / or a channel state measurement result on a kth measurement time domain resource, the kth time domain resource being one of the M time domain resources, and the kth measurement time domain resource being one of the M measurement time domain resources.

2. The method of claim 1, wherein, The method further comprises: determining a state of the first node on an ith time domain resource according to a state of the first node on an (i-1)th time domain resource, the (i-1)th time domain resource and the ith time domain resource being two continuous time domain resources of the M time domain resources.

3. The method of claim 2, wherein, determining the state of the first node on the ith time domain resource according to the state of the first node on the (i-1)th time domain resource comprises: if the state of the first node on the (i-1)th time domain resource is a release state, determining that the state of the first node on the ith time domain resource is the release state; or if the state of the first node on the (i-1)th time domain resource is an occupation state, determining that the state of the first node on the ith time domain resource is the occupation state.

4. The method of claim 1, wherein, The method further comprises: determining the state of the first node on the ith time domain resource according to a channel state measurement result on an (i-1)th measurement time domain resource, the (i-1)th measurement time domain resource corresponding to an (i-1)th time domain resource and the ith time domain resource being two continuous time domain resources of the M time domain resources.

5. The method of claim 4, wherein, determining the state of the first node on the ith time domain resource according to the channel state measurement result on the (i-1)th measurement time domain resource comprises: if the channel state measurement result on the (i-1)th measurement time domain resource is channel idle, determining that the state of the first node on the ith time domain resource is the occupation state; or if the channel state measurement result on the (i-1)th measurement time domain resource is channel busy, determining that the state of the first node on the ith time domain resource is the release state.

6. The method of claim 1, wherein, The method further comprises: determining the state of the first node on the ith time domain resource according to 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 (i-1)th time domain resource and the ith time domain resource being two continuous time domain resources of the M time domain resources.

7. The method of claim 6, wherein, determining the state of the first node on the ith time domain resource according to 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 comprises: If the state of the first node on the i-1th time domain resource is the occupied state, and the channel state measurement result on the i-1th measurement time domain resource is the channel idle, it is determined that the state of the first node on the i th time domain resource is the occupied state; or, If the state of the first node on the i-1th time domain resource is the occupied state, and the channel state measurement result on the i-1th measurement time domain resource is the channel busy, it is determined that the state of the first node on the i th time domain resource is the released state.

8. The method according to any one of claims 1 to 7, wherein The method further comprises: If the state of the first node on the t th time domain resource is the occupied state, a signal is sent on the t th time domain resource, the t th time domain resource being one of the M time domain resources; or, If the state of the first node on the t th time domain resource is the occupied state, and there is a resource for sending a signal in the t th time domain resource, a signal is sent on the t th time domain resource, the t th time domain resource being one of the M time domain resources.

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

10. The method of any one of claims 1-9, wherein, The M time domain resources correspond to the M measurement time domain resources one by one, and one measurement time domain resource is located at the end of the corresponding time domain resource.

11. The method of any one of claims 1-10, wherein, The time domain position of at least one measurement time domain resource in the M measurement time domain resources is determined based on a random selection manner.

12. The method of any one of claims 1-11, wherein, The M measurement time domain resources do not overlap with each other, and the M time domain resources are continuous in time domain.

13. The method of any one of claims 1-12, wherein, The channel state measurement result on the measurement time domain resource is measured on part or all of the resources in the measurement time domain resource.

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

15. The method of any one of claims 1-14, wherein, The state of the first node on the first p time domain resources in the M time domain resources is the released state; or, The state of the first node on the first p-1 time domain resources in the M time domain resources is the occupied state, and the state of the first node on the p th time domain resource in the M time domain resources is the released state.

16. The method of claim 15, wherein, The p is determined based on the priority of the first node; or, The p is determined based on the priority of the to-be-transmitted service.

17. The method of claim 15 or 16, wherein, If the first node is in the communication state before the first contention channel period and / or the first contention channel period satisfies the first condition, 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 resource is the released state; 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, 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 resource is the released state.

18. The method of any one of claims 1-17, wherein, The first contention channel period comprises q time domain resource units, and q is an integer greater than or equal to 1; The q is pre-configured; or The q is determined according to at least one channel state measurement result before the first contention channel period and / or communication performance of the first node before the first contention channel period.

19. The method of any one of claims 1-18, wherein, The method further comprises: According to the state of the first node on the kth time domain resource and / or the channel state measurement result on the kth measurement time domain resource and the channel state measurement result on a second measurement time domain resource, the channel contention result is determined, wherein the M measurement time domain resources are first measurement time domain resources, and the second measurement time domain resource is different from the first measurement time domain resource.

20. The method of any one of claims 1-19, wherein, If the channel contention result is channel contention success, after the end of the first contention channel period, the state of the first node is updated from the contention channel state to the communication state, and the duration of the communication state comprises s time domain resource units, and s is an integer greater than or equal to 1.

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

22. The method of any one of claims 1-21, wherein, The first node competes on N channels in the first contention channel period, and each channel in the N channels corresponds to the M time domain resources; The method further comprises: If f channels in the N channels all satisfy a second condition, and f is greater than or equal to g, it is determined that the channel contention result is channel contention success, g is the target number of channels required for communication of the first node, and f, N and g are positive integers; The second condition comprises at least one of the following: the state of the first node on the kth time domain resource is an occupied state, and the channel state measurement result on the kth measurement time domain resource is channel idle.

23. The method of claim 22, wherein, After determining that the channel contention result is channel contention success, the method further comprises: Selecting g channels from the f channels and communicating on the g channels; or Communicating on the f channels.

24. The method of any one of claims 1-23, wherein, The first node competes on N channels in the first contention channel period, and the first node performs the following step on each channel in the N channels: According to the state of the first node on the i-1th time domain resource, the state of the first node on the ith time domain resource is determined, and the i-1th time domain resource and the ith time domain resource are two continuous time domain resources in the M time domain resources; or According to the channel state measurement result on the i-1th measurement time domain resource, the state of the first node on the ith time domain resource is determined, and the i-1th time domain resource corresponding to the i-1th measurement time domain resource and the ith time domain resource are two continuous time domain resources in the M time domain resources; or According to a state of the first node on an i-1th time domain resource and a channel state measurement result on an i-1th measurement time domain resource, a state of the first node on an ith time domain resource is determined, the i-1th time domain resource and the ith time domain resource being two continuous time domain resources in the M time domain resources.

25. A communications device, characterized by comprise means or units for performing the method of any one of claims 1-24.

26. A communications device, characterized by comprise a processor and a memory; the memory is configured to store a computer program; the processor is configured to execute the computer program in the memory, so that the method of 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, when the computer program or instructions are executed by a communication device, so that the method of any one of claims 1-24 is implemented.

28. A computer program product, characterised in that, The computer program product comprises computer programs or instructions, when the computer programs or instructions run on a communication device, so that the method of any one of claims 1-24 is implemented.

29. A chip, characterized by The chip comprises a processor, the processor is coupled with a memory, and the processor is configured to execute program instructions stored in the memory, so that the method of any one of claims 1-24 is implemented.

Images