Method for data transmission between nodes, electronic device and node communication system

Abstract

The application discloses a method for data transmission between nodes, an electronic device and a node communication system, and belongs to the communication field. The method for data transmission between nodes comprises the following steps: a source node acquires a backoff time under the condition that an idle time of a target channel is greater than a threshold value; the target channel is a common available channel between the source node and a target node, and the backoff time is related to the number of common available channels between the source node and the target node; if the target channel is in an idle state within the backoff time after the idle time, the source node sends a request to send frame to the target node after the end of the backoff time, and the request to send frame is used for initiating reservation of the target channel; and the source node performs data transmission with the target node by using the target channel under the condition that an allow to send frame sent by the target node is received.

Description

TECHNICAL FIELD

[0001] The present application belongs to the field of communication, and particularly relates to a method for data transmission between nodes, an electronic device and a node communication system. BACKGROUND

[0002] In a multi-channel communication environment, there are multiple available channels in a self-organizing network, and nodes can communicate in parallel on multiple channels. Nodes reserve channels for data transmission by interacting with control information on the channels. After successful reservation, data is transmitted on the reserved channel.

[0003] During the channel reservation process between the source node and the destination node, some source nodes may easily reserve channels, while others may not. Thus, the source nodes that cannot easily reserve channels may become bottleneck nodes, thereby affecting the network performance in the self-organizing network. SUMMARY

[0004] The embodiments of the present application provide a method for data transmission between nodes, an electronic device and a node communication system. The number of common available channels of the source node and the target node is used to set the backoff time of the source node, so that the time at which the source node sends a request to send frame for reserving a target channel after the backoff time ends has a certain correlation with the number of common available channels. This avoids the situation that the source node with a small number of common available channels can only compete with other nodes in a small number of common available channels with a fixed probability, which leads to the situation that the source node cannot achieve data transmission for a long time in the case of failing to reserve a target channel, thereby becoming a bottleneck node and affecting the network performance.

[0005] In a first aspect, the embodiments of the present application provide a method for data transmission between nodes, which comprises:

[0006] The source node acquires a backoff time in the case that the idle time of a target channel is greater than a threshold value. The target channel is one of the common available channels between the source node and the target node, and the backoff time is related to the number of common available channels between the source node and the target node.

[0007] If the target channel is in an idle state within the backoff time after the idle time, the source node sends a request to send frame to the target node after the end of the backoff time. The request to send frame is used to initiate reservation of the target channel.

[0008] The source node performs data transmission with the target node by using the target channel in the case of receiving an allow to send frame sent by the target node.

[0009] In a second aspect, the embodiments of the present application provide another method for data transmission between nodes, the method comprising:

[0010] If the target channel is in an idle state within a back-off time after the idle time, the target node receives a request to send frame sent by the source node after the end of the back-off time, the request to send frame being used to initiate reservation of the target channel, the target channel being one of the common available channels between the source node and the target node, and the back-off time being related to the number of common available channels between the source node and the target node;

[0011] The target node sends an allow to send frame to the source node in response to the request to send frame, the allow to send frame being used to indicate that the source node successfully reserves the target channel;

[0012] The target node performs data transmission with the source node by using the target channel.

[0013] In a third aspect, the embodiments of the present application provide a node communication system, the system comprising:

[0014] The source node acquires a back-off time in a case where the source node detects that the idle time of a target channel is greater than a threshold value, the target channel being one of the common available channels between the source node and a target node, and the back-off time being related to the number of common available channels between the source node and the target node;

[0015] If the target channel is in an idle state within the back-off time after the idle time, the source node sends a request to send frame to the target node after the end of the back-off time, the request to send frame being used to initiate reservation of the target channel;

[0016] The target node sends an allow to send frame to the source node in response to the request to send frame after receiving the request to send frame sent by the source node after the end of the back-off time, the allow to send frame being used to indicate that the source node successfully reserves the target channel;

[0017] The source node and the target node perform data transmission by using the target channel in a case where the source node receives the allow to send frame sent by the target node.

[0018] In a fourth aspect, the embodiments of the present application provide an electronic device, the electronic device comprising a processor and a memory, the memory storing programs or instructions executable on the processor, and the programs or instructions being executed by the processor to implement the steps of the method according to the first aspect.

[0019] In a fifth aspect, an embodiment of the present application provides a readable storage medium, wherein a program or instruction is stored on the readable storage medium, and the program or instruction is executed by a processor to implement the steps of the method in the first aspect.

[0020] In a sixth aspect, an embodiment of the present application provides a computer program product, wherein the computer program product comprises a computer program, and the computer program is executed by the processor to implement the steps of the method in the first aspect.

[0021] In the embodiment of the present application, the source node acquires a backoff time when the idle time of the target channel is greater than a threshold, the target channel is a common available channel between the source node and the target node, the backoff time is related to the number of common available channels between the source node and the target node, the source node sends a request to send frame to the target node after the backoff time ends if the target channel is in an idle state within the backoff time after the idle time, the request to send frame is used to initiate reservation of the target channel, and the source node performs data transmission with the target node by using the target channel when receiving a clear to send frame sent by the target node. In this process, the source node sends the request to send frame to the target node to reserve the target channel for data transmission with the target node when the target channel is in an idle state within the backoff time after the idle time is greater than a threshold. The backoff time is used to avoid collision of the request to send frame, and the backoff time is related to the number of common available channels between the source node and the target node. In this way, the backoff time of the source node is set according to the number of common available channels between the source node and the target node, so that the time when the source node sends the request to send frame to reserve the target channel after the backoff time ends is related to the number of common available channels, and the source node with a small number of common available channels can only compete with other nodes in a small number of common available channels with a fixed probability, which causes the source node to fail to reserve the target channel and cannot perform data transmission for a long time, thereby becoming a bottleneck node and affecting network performance. BRIEF DESCRIPTION OF DRAWINGS

[0022] Figure 1 FIG. 1 is a schematic diagram of an overall process of data transmission between nodes provided by an embodiment of the present application;

[0023] Figure 2 FIG. 2 is a flowchart of a method of data transmission between nodes provided by an embodiment of the present application;

[0024] Figure 3 FIG. 3 is a flowchart of another method of data transmission between nodes provided by an embodiment of the present application;

[0025] Figure 4 is a flowchart of another method for data transmission between nodes provided by an embodiment of the present application;

[0026] Figure 5 is a structural block diagram of a node communication system provided by an embodiment of the present application;

[0027] Figure 6 is a structural block diagram of an electronic device provided by an embodiment of the present application. DETAILED DESCRIPTION

[0028] The technical solutions in the embodiments of the present application will be clearly described below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only some of the embodiments of the present application, but not all of them. Based on the embodiments in the present application, all other embodiments obtained by a person of ordinary skill in the art belong to the scope of protection of the present application.

[0029] The terms "first", "second", and the like in the specification and claims of the present application are used to distinguish similar objects, and are not used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged under appropriate circumstances, so that the embodiments of the present application can be implemented in an order other than those illustrated or described herein, and the objects distinguished by "first", "second", etc. are usually a category, and are not limited to the number of objects, for example, the first object can be one or more. In addition, "and / or" in the specification and claims means at least one of the connected objects, and the character " / ", generally indicates that the front and rear associated objects are in an "or" relationship.

[0030] Figure 1 is a whole flowchart of data transmission between nodes provided by an embodiment of the present application, which intuitively shows the interaction process of the source node and the target node in the data transmission process. As shown in Figure 1 , when the nodes interact, the source node and the target node realize data transmission through three steps of information synchronization, channel reservation and data transmission. In the embodiments of the present application, each node is provided with two antennas, i.e. a control antenna and a transmission antenna. In the data transmission process between nodes, channel synchronization and data transmission are realized through the transmission antenna of the node, and channel reservation is realized through the control antenna of the node.

[0031] In the process of information synchronization, as shown in the transmission antenna part of Figure 1 , the source node and the target node perform channel frequency hopping based on the transmission antenna, and interact channel status frames (CSF) to synchronize the channel status information of each other, so that the source node and the target node can obtain the available channel information of each other, and further obtain the common available channel information of the source node and the target node.

[0032] At this point, assuming Figure 1 In this context, channel Cj is a publicly available channel between the source and destination nodes. For example... Figure 1 As shown in the control antenna section, during the channel reservation process, when the source node's control antenna hops to channel Cj, the source node first listens to channel Cj through its control antenna. If the channel idle time is greater than the Distributed Inter-frame Spacing (DIFS), to reduce the probability of collisions caused by the target node receiving multiple Request To Send (RTS) frames from different sources, the source node will not directly send an RTS frame, but will instead perform a random backoff for a period of time. If channel Cj remains idle during the backoff time, the source node will send an RTS frame in the target channel after the backoff time ends, initiating a channel reservation with the target node. After this, if the source node receives a Clear To Send (CTS) frame from the target node in the target channel, then it can be considered that the source node and the target node have successfully reserved channel Cj.

[0033] In this embodiment, regardless of whether data transmission is in progress, the control antennas of all nodes listen for information on the frequency hopping control channel using synchronous frequency hopping. Therefore, after the source and target nodes have reserved a channel, neighboring nodes (all nodes within one hop of the source or target node's communication range) will know the reserved communication channel and reservation time. Thus, during communication between the source and target nodes, when a neighboring node hops to the currently communicating channel Cj with the frequency hopping sequence, it will not send any control information on channel Cj, avoiding interference with data transmission between the source and target nodes. Afterward, upon hearing the acknowledgment character sent by the target node indicating successful data reception, the neighboring node can resume normal reservation on channel Cj. Furthermore, this reservation method effectively avoids the hidden terminal problem, which refers to the issue where nodes cannot eavesdrop on each other, but when simultaneous transmission is not allowed, two or more nodes transmit simultaneously, leading to conflicts.

[0034] During data transmission, such as Figure 1 As shown in the transmission antenna section, after the source node and target node successfully reserve a channel through the channel reservation step, their transmission antennas exit the synchronous frequency hopping mode and switch to the reserved channel Cj for data transmission. Subsequently, if data transmission has ended, the transmission antennas of the source node and target node switch back to the synchronous frequency hopping mode.

[0035] In the process of data transmission between the nodes, the nodes in the network can achieve the data transmission task without the aid of a fixed global public control channel, and the channel state can be synchronized in time through the channel synchronization step, thereby improving the invulnerability of the network. However, there are still some problems in the above method. When the nodes make channel reservations, if all the nodes compete for the channel with the same probability, the nodes with fewer available channels will be more difficult to reserve successfully, and after a long time, such nodes may become bottleneck nodes in the network, limiting the network performance.

[0036] To avoid this problem, an embodiment of the present application provides a method for data transmission between nodes based on the number of common available channels. Specifically as follows:

[0037] Figure 2 is a flowchart of a method for data transmission between nodes provided by an embodiment of the present application, as shown in Figure 2 The method for data transmission between nodes provided by the embodiment of the present application comprises the following steps:

[0038] Step 210: The source node acquires a backoff time when it detects that the idle time of the target channel is greater than a threshold value; the target channel is a common available channel between the source node and the target node, and the backoff time is related to the number of common available channels between the source node and the target node.

[0039] In this step, the threshold value can refer to the DIFS described above, and the common channel refers to an available channel that can be used by the source node and the target node. In the embodiment of the present application, the source node determines the random backoff time when reserving communication based on the number of common available channels between the source node and the target node. The more the number of common available channels between the source node and the target node, the longer the backoff time; the smaller the number of common available channels between the source node and the target node, the shorter the backoff time. The number of common available channels is the number of channels commonly used by the source node and the target node. Specifically, as shown in Table 1:

[0040]

[0041]

[0042] Referring to the content in Table 1, assuming that node N1 is the source node and node N2 is the target node. The available channels of node N1 are C2, C3 and C4, and the available channels of node N2 are C3 and C4, so the common available channels of node N1 and node N2 are C3 and C4, and the number of common available channels is 2. Similarly, if it is assumed that node N3 is the source node and node N4 is the target node, then it can be known that the number of common available channels of node N3 and node N4 is 3.

[0043] Therefore, in the case that the target node is the same node, for N (N is a positive integer) source nodes intending to communicate with the target node, the reservation backoff time of the i (i is a positive integer less than or equal to N) source node can be calculated by the following formula:

[0044] Backoff Time = Random() × aBaseTime × ChannelNum

[0045] wherein, Backoff Time is the reservation backoff time, Random() represents a pseudo-random integer uniformly distributed in [0, CW], CW is a set base contention window value, aBaseTime is a base backoff time value, and ChannelNum is the number of common available channels between the i source node and the target node. In the IEEE 802.11 protocol, the contention window (CW) is set to a certain fixed value at initialization, and CW is a key to congestion control in the 802.11 protocol. The base backoff time can be set according to requirements, for example, 20 ns, 25 ns, or 30 ns.

[0046] For example, referring to Table 1, assume that the source node is N3 and the target node is N4. The common available channels between node N3 and node N4 are C2, C3, and C4, so the backoff time when N3 makes a reservation through C2, C3, or C4 is 3 × Random() × aBaseTime. Assume that the source node is N1 and the target node is N7. Since the only common available channel between node N1 and node N7 is C2, the backoff time when they make a reservation through C2 is Random() × aBaseTime.

[0047] Step 220: If the target channel is in an idle state within the backoff time after the idle time, the source node sends a request to send frame to the target node after the end of the backoff time, and the request to send frame is used to initiate a reservation for the target channel.

[0048] The source node determines the reservation backoff time for the target node as shown in step 210. At this time, it is assumed that the node N1 and the node N3 wait for reserving the channel at the same time, and their control antennas jump to the channel C2 according to the common frequency hopping sequence. Then, since the number of common available channels of the node N1 and the node N7 is 1, and the number of common available channels of the node N3 and the node N4 is 3, the backoff time of the node N1 and the node N7 is Random() x aBaseTime, which has a greater chance of successfully reserving the channel C2 than the backoff time of the node N3 and the node N4, which is 3 x Random() x aBaseTime. At this time, the node N3 and the node N4 can still perform the data transmission task on the channels C3 and C4 even if the channel C2 is failed to be reserved.

[0049] In this way, the situation that the node N1 has to wait for the communication of the node N3 and the node N4 to end before reserving the communication task can be avoided, and the probability of the bottleneck node can be effectively reduced.

[0050] Step 230: The source node performs data transmission with the target node on the target channel when receiving the CTS frame sent by the target node.

[0051] In this step, the target node sends the CTS frame on the target channel when the control antenna of the target node detects the RTS frame of the source node on the target channel.

[0052] Therefore, the control antenna of the source node considers that the channel reservation is successful when detecting the CTS frame sent by the target node on the target channel. At this time, the transmission antenna of the source node exits the synchronous frequency hopping mode and performs data transmission on the target channel.

[0053] In addition, in the embodiment of the present application, if the available channel state of the source node changes, the source node hops to the target common available channel between the source node and the neighbor node when the channel state of the source node changes, and the source node sends a channel state frame on the target common available channel, where the channel state frame is used for channel state synchronization. The source node hops the channel and synchronizes the channel state through the transmission antenna. The change of the channel state of the source node can be that one or more channels in the self-organizing network are interfered and cannot be used for data transmission, which reduces the number of available channels of the source node. The neighbor node can include all nodes in the self-organizing network within one-hop communication range of the source node, or all nodes within one-hop communication range of the target node. The nodes within one-hop communication range of the source node refer to all nodes that can be reached by the data sent by the source node without forwarding.

[0054] Specifically, after the channel state information of the source node changes, the source node starts a timer, which is set to ensure that all one-hop neighbor nodes receive the channel state information of the source node. At this time, compared with the way of broadcasting the channel state of the node itself on all available channels when the node enters the network, the source node does not need to send the channel state information on all available channels, but only needs to send the channel state frame on the common available channel between the transmission antenna and the neighbor node. The source node broadcasts the channel state frame in the target common available channel, so that all neighbor nodes that have a common available channel with the source node can detect the channel state of the source node through the transmission antenna. Among them, the target common available channel is the common available channel between the source node and the neighbor node (one or more).

[0055] For example, if the available channels of the source node are C1, C2, C3, C4 and C5, the neighbor nodes of the source node are N2 and N3, the common available channel between N2 and the source node is C2, and the common available channel between N3 and the source node is C3 and C4, then the target common available channel is C2, C3 and C4, and the source node only needs to send the channel state frame in the above three channels to achieve the purpose of synchronizing the channel state of the source node to the neighbor nodes, without the need for broadcasting in all available channels of the source node.

[0056] In the embodiment of the present application, the source node acquires backoff time when the idle time of the target channel is greater than the threshold; the target channel is one of the common available channels between the source node and the target node, and the backoff time is related to the number of common available channels between the source node and the target node; if the target channel is in the idle state within the backoff time after the idle time, the source node sends a request to send frame to the target node after the end of the backoff time, and the request to send frame is used to initiate reservation of the target channel; and the source node performs data transmission with the target node by using the target channel when receiving the clear to send frame sent by the target node. In this process, the source node determines that the target channel is still in the idle state within the backoff time after the idle time when the idle time of the target channel is greater than the threshold, and sends a request to send frame to the target node to reserve the target channel for data transmission with the target node. The backoff time is used to avoid collision of the request to send frame, and the backoff time is related to the number of common available channels between the source node and the target node. In this way, the backoff time of the source node is set according to the number of common available channels between the source node and the target node, so that the time when the source node sends the request to send frame to reserve the target channel after the end of the backoff time is related to the number of common available channels, avoiding that the source node with a small number of common available channels can only compete with other nodes in a small number of common available channels with a fixed probability, resulting in that the source node cannot achieve data transmission for a long time when the reservation of the target channel fails, and thus becomes a bottleneck node, affecting network performance.

[0057] Figure 3 is a flowchart of another method for data transmission between nodes provided by the embodiment of the present application, as shown in Figure 3 The method for data transmission between nodes provided by the embodiment of the present application comprises the following steps.

[0058] Step 310: The source node acquires backoff time when the idle time of the target channel is greater than the threshold; the target channel is one of the common available channels between the source node and the target node, and the backoff time is related to the number of common available channels between the source node and the target node.

[0059] Step 320: If the target channel is in the idle state within the backoff time after the idle time, the source node sends a request to send frame to the target node after the end of the backoff time, and the request to send frame is used to initiate reservation of the target channel.

[0060] Step 330: The source node performs data transmission with the target node by using the target channel when receiving the clear to send frame sent by the target node.

[0061] The detailed explanation of steps 310, 320 and 330 can refer to the detailed description of the corresponding steps in the foregoing embodiment. Figure 1

[0062] Steps 340 and 350 are not necessarily related to the process of data transmission between the nodes of the application. In any case that meets the execution conditions of steps 340 and 350, the source node can execute steps 340 and 350.

[0063] Step 340: In the case that the channel state of the source node changes, the source node hops to a target common available channel between the source node and the neighbor node;

[0064] In this step, the source node realizes channel hopping and channel state synchronization through the transmission antenna. The change of the channel state of the source node can be that one or more channels in the self-organizing network are interfered and cannot be used for data transmission, resulting in a decrease in the number of available channels of the source node. The neighbor node can include all nodes in the self-organizing network within one-hop communication range of the source node, or all nodes within one-hop communication range of the target node. The nodes within one-hop communication range of the source node refer to all nodes that can be reached by the data transmitted by the source node without forwarding.

[0065] In this step, after the channel state information of the source node changes, the source node starts a timer. The timer is set to ensure that all one-hop neighbor nodes receive the channel state information of the node. At this time, compared with the way of broadcasting the channel state of the node on all available channels when the node enters the network, the source node does not need to send the channel state information on all available channels, but only needs to send the channel state frame on the common available channel with the neighbor node through the transmission antenna.

[0066] Step 350: The source node sends a channel state frame through the target common available channel, and the channel state frame is used for channel state synchronization.

[0067] In this step, the source node broadcasts and sends the channel state frame in the target common available channel, so that all neighbor nodes that have a common available channel with the source node can detect the channel state of the source node through the transmission antenna. The target common available channel is the common available channel of the source node and the neighbor node (one or more).

[0068] ​For example, if the available channels of the source node are C1, C2, C3, C4 and C5, the neighbor nodes of the source node are N2 and N3, the common available channel between N2 and the source node is C2, and the common available channels between N3 and the source node are C3 and C4, the target common available channels are C2, C3 and C4, and the source node only needs to send channel state frames in the above three channels to achieve the purpose of synchronizing the channel state of the source node to the neighbor nodes, without broadcasting in all available channels of the source node.

[0069] Before performing the method for data transmission between nodes provided by the embodiments of the present application as shown in Figure 2 or Figure 3 Before performing the method for data transmission between nodes provided by the embodiments of the present application as shown in

[0070] I. Initial channel sensing: after being powered on, the source node actively senses all channels in the network to generate a list of available channels of the node.

[0071] II. Network building and network entry: the node generates a frequency hopping sequence according to the list of available channels obtained through initial channel sensing, and builds a network or enters a network through slow frequency hopping.

[0072] Generally, the control antenna of the in-network node switches channels with a time slot as a frequency hopping residence time. When the out-of-network node enters the network, it performs slow frequency hopping with the global channel number N as the frequency hopping residence time, and through slow frequency hopping, the out-of-network node can realize intersection with the in-network node on the global N channels within N 2 time slots. If none of the network entry request frames within N 2 time slots receives a reply of the network entry synchronization frame of other nodes, it is determined that the node is a network building node.

[0073] At this time, the node selects a frequency hopping seed as a frequency hopping phase and generates a frequency hopping sequence as a network building node according to the frequency hopping sequence generation method, and performs frequency hopping with 1 time slot as a frequency hopping residence time according to the frequency hopping sequence, and enters an in-network state. When the in-network node receives the network entry request frame of other nodes, it replies with a network entry synchronization frame, and the network entry synchronization frame contains the frequency hopping phase and the time slot phase. The out-of-network node receiving the network entry synchronization frame synchronizes the frequency hopping phase and the time slot phase according to the network entry synchronization frame, to realize synchronized frequency hopping between nodes.

[0074] The frequency hopping sequence generation method is as follows: in order to prevent the common control channel frequency hopping rule from being learned by a disturbed node, each node determines the frequency hopping sequence of the common control channel through a random seed. All nodes internally store a group of random seeds set in advance: {Seed1, Seed2... Seed KThe first frequency hopping period generates a frequency hopping sequence by Seed 1, the second period generates a frequency hopping sequence by Seed 2, and so on, and the Mth period uses M (in the case where M is greater than K, M is taken modulo) Seeds. The sequence number of the random seed used is referred to as the frequency hopping phase, and the order of the current time slot in the current frequency hopping period is referred to as the time slot phase. Therefore, as long as the frequency hopping phase and the time slot phase of two nodes are consistent, the nodes can keep synchronized frequency hopping starting from the current time slot. By using the globally common synchronized frequency hopping control channel generated by the random seed array, on the one hand, the nodes can still perform data transmission in the case where part of the channels are interfered, and on the other hand, the problem that the regular globally common frequency hopping pattern is easily discovered is avoided.

[0075] In the embodiments of the present application, the channel reservation for data transmission by using the globally common frequency hopping sequence can realize the communication task without relying on the fixed globally common available channel, and compared with the blind frequency hopping convergence mode, the convergence time is more controllable, and the hidden terminal problem which is difficult to avoid in the regular frequency hopping convergence mode and the multi-control channel mode can be avoided.

[0076] III. Channel state synchronization: When the following two conditions occur, the nodes need to synchronize the channel state information with the neighbor nodes. Node entry: After the node enters the network, the node broadcasts the channel state information in all available channels, and synchronizes the channel state with the neighbor nodes, on the one hand, to inform the neighbor nodes of the available channel information of the node, and on the other hand, to learn the channel state of the neighbor nodes. Channel state change: The specific content can be referred to the detailed description of steps 340 and 350 in Figure 3

[0077] In the embodiments of the present application, in the case where the idle time of the source node on the target channel is greater than a threshold, the source node determines that the target channel is still in the idle state in the backoff time after the idle time, and sends a request to send frame to the target node to reserve the target channel for data transmission. The backoff time is used to avoid the collision of the request to send frame, and the backoff time is related to the number of common available channels between the source node and the target node, so that the backoff time of the source node is set specifically by the number of common available channels between the source node and the target node, so that the time when the source node sends the request to send frame for reserving the target channel after the backoff time ends has a certain correlation with the number of common available channels, avoiding the case where the source node with a small number of common available channels can only compete with other nodes in a small number of common available channels with a fixed probability, resulting in that the source node cannot realize data transmission for a long time in the case where the target channel is reserved unsuccessfully, and thus becomes a bottleneck node, affecting the network performance. In addition, the source node sends a channel state frame to all neighbor nodes to synchronize the channel state when the channel state changes, to avoid the occurrence of the hidden terminal problem.

[0078] ​Figure 4 is a flow chart of another method for data transmission between nodes provided by an embodiment of the present application, as shown in Figure 4 The method for data transmission between nodes provided by an embodiment of the present application comprises the following steps.

[0079] Step 410: If the target channel is in an idle state within a back-off time after an idle time, the target node receives a request to send frame sent by the source node after the end of the back-off time, the request to send frame is used to initiate reservation of the target channel, the target channel is one of the common available channels between the source node and the target node, and the back-off time is related to the number of common available channels between the source node and the target node.

[0080] In this step, the target node listens to information in the multiple available channels (including the target channel) through a control antenna, and after listening to the RTS frame sent by the source node in the target channel, step 420 is performed.

[0081] Step 420: The target node sends a clear to send frame to the source node in response to the request to send frame, the clear to send frame is used to indicate that the source node successfully reserves the target channel.

[0082] In this step, after receiving the RTS frame in the target channel, the target node sends a CTS frame in the target channel in response to the RTS frame. It should be noted that in this process, multiple source nodes can participate in the process of reserving the communication channel, and the node that first sends the RTS frame can reserve the target channel in priority.

[0083] Generally, after the idle time of the target channel is greater than a threshold (i.e., DIFS), the node that has a demand for the target channel can reserve the channel. However, in order to avoid the situation of RTS frame collision, after the idle time of the target channel is greater than DIFS, the source node will wait for a random time, i.e., the source node will wait for a back-off time after DIFS. In this process, since the back-off time is related to the number of common available channels between the source node and the target node, the more the number of common available channels between the source node and the target node, the longer the back-off time; the less the number of common available channels between the source node and the target node, the shorter the back-off time.

[0084] Therefore, the shorter the backoff time of the source node with less number of common available channels with the target node is, the greater the possibility of successful channel reservation is. In this way, the source node and the target node with less number of common available channels can obtain greater channel reservation success probability, and thus, the source node with less number of common available channels is prevented from becoming a bottleneck node due to long-term competition on less number of common available channels and failure in competition, thereby affecting the network performance of the self-organizing network.

[0085] Step 430: The target node performs data transmission with the source node by using the target channel.

[0086] In this step, after successful channel reservation, the transmission antennas of the source node and the target node exit the synchronous frequency hopping mode and perform data transmission in the target channel. After data transmission is completed, the transmission antennas of the source node and the target node are switched back to the synchronous frequency hopping mode.

[0087] In the embodiment of the present application, if the target channel is in an idle state within the backoff time after the idle time, the target node receives a request to send frame sent by the source node after the end of the backoff time, the request to send frame is used to initiate reservation of the target channel, the target channel is one of the common available channels between the source node and the target node, the backoff time is related to the number of common available channels between the source node and the target node; the target node sends a clear to send frame to the source node in response to the request to send frame, the clear to send frame is used to indicate that the source node successfully reserves the target channel; and the target node performs data transmission with the source node by using the target channel. In this process, the target node sends a clear to send frame in response to the received request to send frame, successfully reserves the target channel, and performs data transmission. In this way, by using the backoff time related to the number of common available channels between the source node and the target node, the source node with less number of common available channels is prevented from being able to only compete with other nodes in less number of common available channels with a fixed probability, so that the source node cannot achieve the purpose of data transmission in the case of failure in reserving the target channel for a long time, thereby becoming a bottleneck node and affecting the network performance.

[0088] Figure 5 is a structural block diagram of a node communication system provided by the embodiment of the present application, as shown in Figure 5 The node communication system 500 provided by the embodiment of the present application includes a source node 510, a target node 520, and a neighbor node 530. Wherein:

[0089] The source node 510 acquires a backoff time in a case that the idle time of the target channel is greater than a threshold value; the target channel is a common available channel between the source node 510 and the target node 520, and the backoff time is related to the number of common available channels between the source node 510 and the target node 520;

[0090] The source node 510 sends a request to send frame to the target node 520 after the end of the backoff time, in a case that the target channel is in an idle state within the backoff time after the idle time; the request to send frame is used to initiate reservation of the target channel;

[0091] The target node 520 sends an allow to send frame to the source node 510 in response to the request to send frame, after receiving the request to send frame sent by the source node 510 after the end of the backoff time; the allow to send frame is used to indicate that the source node 510 successfully reserves the target channel;

[0092] The source node 510 and the target node 520 perform data transmission by using the target channel, in a case that the source node 510 receives the allow to send frame sent by the target node 520;

[0093] The neighbor node 530 of the source node 510 learns the target channel by listening, and resumes reservation of the target channel after the source node 510 and the target node 530 complete data transmission by using the target channel.

[0094] In the node communication system provided by the embodiments of the present application, the source node determines that the target channel is still in an idle state within a backoff time after the idle time of the target channel is greater than a threshold value, and sends a request to send frame to the target node to reserve the target channel for data transmission with the target node. The backoff time is used to avoid collision of the request to send frame, and the backoff time is related to the number of common available channels between the source node and the target node. Thus, the backoff time of the source node is set according to the number of common available channels between the source node and the target node, so that the time when the source node sends the request to send frame to reserve the target channel after the end of the backoff time is related to the number of common available channels, avoiding that the source node with a small number of common available channels can only compete with other nodes in a small number of common available channels with a fixed probability, resulting in that the source node cannot achieve the purpose of data transmission for a long time in a case that the source node fails to reserve the target channel, and thus becomes a bottleneck node, affecting network performance. In addition, the neighbor node synchronously listens to the channel state of the target channel, and determines a data transmission strategy of the neighbor node on the target channel, avoiding affecting data transmission of the source node and the target node on the target channel.

[0095] AsFigure 6 As shown, the embodiments of the present application provide an electronic device 600, which comprises a processor 610 and a memory 620, the memory 620 stores a program, and the program is executed by the processor 610 to implement the steps of any one of the methods described above. For example, the program is executed by the processor 610 to implement a process of: obtaining a target recommendation task transmitted by a terminal; obtaining target identification embedding information of the target recommendation task from a target recommendation system, the target identification embedding information being used to improve a uniqueness indication of a target object representation by a target deep learning model, the target object including at least one of a user and an item; the target deep learning model being used for content semantic understanding; obtaining target text embedding information of the target recommendation task from the target deep learning model; merging the target identification embedding information and the target text embedding information to obtain overall embedding features of the target recommendation task; and processing the overall embedding features by a large language model subject in the target deep learning model to obtain a target processing result, the target processing result being used for data transmission between nodes.

[0096] In the electronic device provided by the embodiments of the present application, the source node obtains a backoff time in the case that the idle time of the target channel is greater than the threshold value; the target channel is one of the common available channels between the source node and the target node, and the backoff time is related to the number of common available channels between the source node and the target node; if the target channel is in an idle state within the backoff time after the idle time, the source node sends a request to send frame to the target node after the end of the backoff time, and the request to send frame is used to initiate a reservation of the target channel; and the source node performs data transmission with the target node by using the target channel in the case that an allow to send frame sent by the target node is received. In this process, the source node determines that the target channel is still in an idle state within the backoff time after the idle time in the case that the idle time of the target channel is greater than the threshold value, and sends a request to send frame to the target node to reserve the target channel for data transmission with the target node. The backoff time is used to avoid collision of the request to send frame, and the backoff time is related to the number of common available channels between the source node and the target node. In this way, the backoff time of the source node is set specifically according to the number of common available channels between the source node and the target node, so that the time when the source node sends the request to send frame to reserve the target channel after the end of the backoff time has a certain correlation with the number of common available channels, avoiding the case that the source node with a small number of common available channels can only compete with other nodes in a small number of common available channels with a fixed probability, resulting in the case that the source node cannot achieve data transmission for a long time in the case of failure to reserve the target channel, and thus becomes a bottleneck node, affecting network performance.

[0097] The embodiment of the present application also provides a computer readable storage medium, wherein the computer readable storage medium stores a program or instructions, and the program or instructions are executed by a processor to realize each process of the method for data transmission between nodes and achieve the same technical effects. To avoid repetition, details are not described herein.

[0098] The processor is the processor in the electronic device in the above embodiment. The readable storage medium includes a computer readable storage medium, such as a computer readable only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0099] In the readable storage medium provided by the embodiment of the present application, the source node acquires a backoff time when the idle time of the target channel is greater than a threshold value. The target channel is a common available channel between the source node and the target node, and the backoff time is related to the number of common available channels between the source node and the target node. If the target channel is in an idle state within the backoff time after the idle time, the source node sends a request to send frame to the target node after the end of the backoff time, and the request to send frame is used to initiate a reservation for the target channel. If the source node receives an allowed to send frame sent by the target node, the source node performs data transmission with the target node by using the target channel. In this process, the source node determines that the target channel is still in an idle state within the backoff time after the idle time of the target channel is greater than a threshold value, and sends a request to send frame to the target node to reserve the target channel for data transmission with the target node. The backoff time is used to avoid collision of the request to send frame, and the backoff time is related to the number of common available channels between the source node and the target node. In this way, the backoff time of the source node is set specifically according to the number of common available channels between the source node and the target node, so that the time when the source node sends the request to send frame to reserve the target channel after the end of the backoff time is related to the number of common available channels. This avoids the situation that the source node with a small number of common available channels can only compete with other nodes in a small number of common available channels with a fixed probability, which leads to the situation that the source node cannot achieve data transmission for a long time when the source node fails to reserve the target channel, and thus becomes a bottleneck node, affecting network performance.

[0100] The embodiment of the present application also provides a computer program product, which is stored in a storage medium and is executed by at least one processor to realize each process of the above method embodiment and achieve the same technical effects. To avoid repetition, details are not described herein.

[0101] The processor is the processor in the electronic device in the above embodiments. The readable storage medium includes a computer readable storage medium, such as a computer readable only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.

[0102] In the computer program product provided in the embodiments of the present application, the source node acquires a backoff time in the case that the idle time of the target channel is greater than a threshold value; the target channel is one of the common available channels between the source node and the target node, and the backoff time is related to the number of common available channels between the source node and the target node; if the target channel is in an idle state within the backoff time after the idle time, the source node sends a request to send frame to the target node after the end of the backoff time, and the request to send frame is used to initiate reservation of the target channel; and the source node performs data transmission with the target node by using the target channel in the case that an allow to send frame sent by the target node is received. In this process, the source node determines that the target channel is still in an idle state within the backoff time after the idle time in the case that the idle time of the target channel is greater than a threshold value, and sends a request to send frame to the target node to reserve the target channel for data transmission with the target node. The backoff time is used to avoid collision of the request to send frame, and the backoff time is related to the number of common available channels between the source node and the target node. In this way, the backoff time of the source node is set specifically according to the number of common available channels between the source node and the target node, so that the time when the source node sends the request to send frame for reserving the target channel after the end of the backoff time has a certain correlation with the number of common available channels, and the source node with a small number of common available channels can avoid only competing with other nodes in a small number of common available channels with a fixed probability, which leads to the fact that the source node cannot achieve the purpose of data transmission for a long time in the case that the source node fails to reserve the target channel, and thus becomes a bottleneck node, affecting network performance.

[0103] It should be noted that, in the present document, the terms "comprises", "comprising", or any other variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but can include other elements not expressly listed or inherent to such process, method, article, or apparatus. An element proceeded by "comprises... a" does not, without more constraints, exclude the presence of additional identical elements in the process, method, article, or apparatus that comprises the element. Furthermore, it is to be understood that the method and apparatus of the present application can be carried out by more than one process, method, article, or apparatus either simultaneously, concurrently, or with intervening action that are carried out at the same time, either in a simultaneous fashion or in a fashion that is carried out sequentially. For example, the method described herein can be carried out by one or more of the processes described herein, either in the order described or in a different order, and with additional, intervening, or omitted steps. Furthermore, features that are described in connection with certain examples can be combined with features of other examples.

[0104] From the above description of the embodiments, it is apparent that the above-mentioned method can be realized by means of software and necessary universal hardware platform, of course, it can also be realized by hardware, but in many cases, the former is a better embodiment. Based on such understanding, the technical solution of the present application can be embodied in the form of computer software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk), and includes a plurality of instructions for making a terminal (which can be a mobile phone, computer, server, or network equipment, etc.) execute the method described in various embodiments of the present application.

[0105] The embodiments of the present application are described above in conjunction with the accompanying drawings, but the present application is not limited to the above-described specific embodiments, and the above-described specific embodiments are merely illustrative, rather than limiting, and those skilled in the art can make many forms under the inspiration of the present application without departing from the scope of the present application and the scope protected by the claims.

Claims

1. A method of data transmission between nodes, characterized in that, The method comprises the following steps: The source node acquires a backoff time when the source node detects that the idle time of a target channel is greater than a threshold value; The target channel is one of the common available channels between the source node and a target node, and the backoff time is related to the number of common available channels between the source node and the target node; If the target channel is in an idle state within the backoff time after the idle time, the source node sends a request to send frame to the target node after the end of the backoff time, and the request to send frame is used to initiate reservation of the target channel; If the target node sends an allow to send frame to the source node in response to the request to send frame, the source node performs data transmission with the target node by using the target channel.

2. The method of claim 1, wherein, The more the number of common available channels between the source node and the target node, the longer the backoff time; the less the number of common available channels between the source node and the target node, the shorter the backoff time.

3. The method of claim 2, wherein, The method further comprises the following steps: When the channel state of the source node changes, the source node hops to a target common available channel between the source node and a neighbor node; The source node sends a channel state frame by using the target common available channel, and the channel state frame is used for channel state synchronization. The method comprises the following steps:

4. The method according to any one of claims 1 to 3, characterized in that, If the target channel is in an idle state within the backoff time after the idle time, the target node receives a request to send frame sent by the source node after the end of the backoff time, and the request to send frame is used to initiate reservation of the target channel, the target channel is one of the common available channels between the source node and the target node, and the backoff time is related to the number of common available channels between the source node and the target node; The target node sends an allow to send frame to the source node in response to the request to send frame, and the allow to send frame is used to indicate that the source node successfully reserves the target channel; The target node performs data transmission with the source node by using the target channel.

5. A method of data transmission between nodes, characterized in that, The more the number of common available channels between the source node and the target node, the longer the backoff time; the less the number of common available channels between the source node and the target node, the shorter the backoff time. The method further comprises the following steps: The method further comprises the following steps: The method further comprises the following steps:

6. The method of claim 5, wherein, ​ 7. The method of claim 6, wherein, ​ ​ ​ Backoff Time = aBaseTime + Random() * (CW - 1) + 1, wherein the Backoff Time is a reservation backoff time, Random() represents a pseudo-random integer uniformly distributed in [0, CW], CW is a set basic contention window value, aBaseTime is a basic backoff time value, and ChannelNum is a number of common available channels between the source node and the target node.

8. A node communication system, characterized by The method comprises the following steps: The source node acquires a backoff time when the source node detects that the idle time of a target channel is greater than a threshold value; The target channel is a common available channel between the source node and the target node, and the backoff time is related to the number of common available channels between the source node and the target node; If the target channel is in an idle state within the backoff time after the idle time, the source node sends a request to send frame to the target node after the end of the backoff time, and the request to send frame is used to initiate reservation of the target channel; The target node sends an allow to send frame to the source node in response to the request to send frame after receiving the request to send frame sent by the source node after the end of the backoff time, and the allow to send frame is used to indicate that the source node successfully reserves the target channel; If the source node receives the allow to send frame sent by the target node, the source node and the target node perform data transmission by using the target channel; A neighbor node of the source node learns the target channel by listening, and restores reservation of the target channel after the source node and the target node complete data transmission by using the target channel.

9. An electronic device, comprising: The device comprises a processor and a memory, the memory stores a program or instructions running on the processor, and the program or instructions are executed by the processor to realize the steps of the method according to any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, The medium stores a program or instructions, and the program or instructions are executed to realize the steps of the method according to any one of claims 1-7.

11. A computer program product, characterised in that, The computer program is executed by the processor to realize the method according to any one of claims 1-7.

Images