A data communication method, system, electronic device, and storage medium

Abstract

The application discloses a data communication method, system, electronic equipment and storage medium, wherein a winning node in competition is determined according to a TDC stage, an uplink sender or a downlink receiver is determined through an RTS-FD / CTS-FD mode; the downlink receiver is determined through an FDC stage according to the uplink sender and QoS requirements; or the uplink sender is determined through the FDC stage according to the downlink receiver and the QoS requirements; and the transmission of the uplink and the downlink is executed in parallel through a data transmission and ACK stage according to the uplink sender and the downlink receiver; the node competition of the two stages of the uplink and the downlink can be processed, and the optimal node can be scheduled to become the uplink sender and the downlink receiver, the QoS requirements of the node can be met, and the interference can be reduced while complete wireless full-duplex transmission is realized. The application can be widely applied in the technical field of data communication.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of data communication, and particularly relates to a data communication method, system, electronic device and storage medium. BACKGROUND

[0002] Existing FD MAC protocols mainly consider how to solve the interference problem of partial FD networks. Partial FD MAC protocols mainly focus on two-node FD design (not considering three-node FD), when the sender initiates a transmission to the receiver, the receiver will immediately start to perform reverse transmission to the sender. Both the sender and the receiver use SIC self-interference cancellation technology. Some scholars have proposed interference-based contention protocols, in their protocols, nodes that are subject to lower interference set a smaller contention window size (CW), so the possibility of participating in full-duplex transmission is higher. In another FD MAC protocol, when the receiver receives an uplink frame from the sender, if there is no sender frame, it will randomly select a node for potential downlink transmission. When the interference between the selected node and the sender is less than a predefined threshold, the receiver performs simulated uplink and downlink transmission; otherwise, it only receives the uplink frame. Some techniques focus on specific scenarios of three-node full-duplex MAC, in which the uplink sender and downlink receiver of the AP (wireless access point) are hidden nodes, so interference is avoided. All the above protocols do not consider the QoS (quality of service) requirements of nodes, nor do they design QoS delivery mechanisms.

[0003] However, existing FD MAC protocols mainly consider providing limited or specific QoS support for partial FD networks. For example, hybrid cellular networks (one FD base station coexists with multiple FD and HD users) are considered, aiming to meet the minimum bandwidth requirements of each user through time / frequency resource allocation and power adjustment. Some techniques mainly focus on two-node FD design (not considering three-node FD), aiming to provide heterogeneous delay constraint guarantees. Some other FD MAC designs assume that the AP knows all channel state information. In this design, when one link is assigned, another link will be forced to be assigned. This will lead to poor interference management and limited QoS support. SUMMARY

[0004] Therefore, the embodiments of the present application provide a data communication method, system, electronic device and storage medium.

[0005] Embodiments of the present application provide a data communication method, comprising: in a TDC phase, determining an uplink sender or a downlink receiver by an RTS-FD / CTS-FD mode; wherein the TDC phase represents a time domain contention phase; the RTS-FD / CTS-FD mode is used for reserving a channel and carrying QoS requirements; in a FDC phase, determining a downlink receiver according to the uplink sender and the QoS requirements; or in the FDC phase, determining an uplink sender according to the downlink receiver and the QoS requirements; wherein the FDC phase represents a frequency domain contention phase; in a data transmission and ACK phase, performing data transmission on uplink and downlink in parallel according to the uplink sender and the downlink receiver.

[0006] Optionally, the determining the uplink sender or the downlink receiver by the RTS-FD / CTS-FD mode in the TDC phase comprises: when a channel is idle after listening to DIFS, all nodes and an AP generate a random backoff value; wherein the DIFS is a distributed interframe space; the AP is a wireless access point; a backoff counter is used to count backoff times; a binary exponential backoff algorithm is used to compete for the channel according to the random backoff value; when the channel is idle, the backoff counter is decremented; when the channel is busy, the backoff counter is suspended; when the backoff counter is reduced to 0, an uplink sender or a downlink receiver is determined by a handshake between a node and the AP.

[0007] Optionally, the determining the uplink sender or the downlink receiver by the handshake between the node and the AP when the backoff counter is reduced to 0 comprises at least one of: when the backoff counter is reduced to 0, the node sends an RTS-FD frame to the AP, and when the node receives a CTS-FD frame, the node wins the competition and is determined as the uplink sender; when the backoff counter is reduced to 0, the AP sends an RTS-FD frame to the node, and when the AP receives a CTS-FD frame, the node wins the competition and is determined as the downlink receiver; wherein the RTS-FD frame is a request to send frame under wireless full duplex; the CTS-FD frame is a clear to send frame under wireless full duplex.

[0008] Optionally, the determining the downlink receiver or the uplink transmitter in the FDC stage according to the uplink transmitter and the QoS requirement comprises: configuring a contention condition and a node marker; the contention condition comprises at least one of a condition of contending for the uplink transmitter and a condition of contending for the downlink receiver; determining a node participating in the contention according to the contention condition; determining a node priority according to the QoS requirement of the node and a current TDC transmission type; determining a subcarrier size of the node according to the node priority; determining a node needing to send the node marker to the AP according to the subcarrier size of the node; and determining the uplink transmitter or the downlink receiver by detecting the node marker.

[0009] Optionally, the determining the uplink transmitter or the downlink receiver by detecting the node marker comprises at least one of the following: when the AP detects one node marker, directly broadcasting the node marker; when the AP detects a plurality of node markers, randomly determining one node marker from the plurality of node markers to broadcast; and determining the node to be broadcast as the uplink transmitter or the downlink receiver according to a current transmission type.

[0010] Optionally, the condition of contending for the uplink transmitter comprises: the node having a frame to the AP; a transmission time of the node not exceeding a predetermined network allocation vector time; a signal-to-interference ratio of the node on the determined downlink transmitter being greater than a predetermined threshold; and the condition of contending for the downlink receiver comprises: a bit value representing the node in a bitmap field of a CTS-FD frame being 1; and a signal-to-interference ratio of the node being greater than a predetermined threshold.

[0011] Optionally, the performing the data transmission and ACK on the uplink and the downlink in parallel according to the uplink transmitter and the downlink receiver in the data transmission and ACK stage comprises: when the uplink transmitter performs the uplink FD transmission to the AP, the AP performs the downlink FD transmission of the downlink receiver in parallel; and when no node performs the contention in the FDC stage, the FD transmission becomes the HD transmission; wherein the FD transmission represents wireless full-duplex transmission; and the HD transmission represents wireless half-duplex transmission.

[0012] The embodiment of the present application further provides a data communication system, comprising: a first module, used for determining an uplink sender or a downlink receiver through an RTS-FD / CTS-FD mode in a TDC stage; wherein the TDC stage represents a time domain contention stage; the RTS-FD / CTS-FD mode is used for reserving a channel and carrying a QoS requirement; a second module, used for determining a downlink receiver according to the uplink sender and the QoS requirement in a FDC stage, or determining an uplink sender according to the downlink receiver and the QoS requirement in the FDC stage; wherein the FDC stage represents a frequency domain contention stage; and a third module, used for performing data transmission on the uplink and the downlink in parallel according to the uplink sender and the downlink receiver in a data transmission and ACK stage.

[0013] The embodiment of the present application further provides an electronic device, comprising a processor and a memory; the memory is used for storing a program; and the processor executes the program to realize the method as described above.

[0014] The embodiment of the present application further provides a computer readable storage medium, which stores a program; and the program is executed by a processor to realize the method as described above.

[0015] The embodiment of the present application has the following beneficial effects: the winning node in contention is determined according to a TDC stage; an uplink sender or a downlink receiver is determined through an RTS-FD / CTS-FD mode; wherein the TDC stage is a time domain contention stage; the RTS-FD / CTS-FD mode is used for reserving a channel and carrying a QoS requirement; a downlink receiver is determined through a FDC stage according to an uplink sender and the QoS requirement, or an uplink sender is determined through the FDC stage according to a downlink receiver and the QoS requirement; wherein the FDC stage is a frequency domain contention stage; data transmission on the uplink and the downlink is performed in parallel through a data transmission and ACK stage according to the uplink sender and the downlink receiver; the node contention in two stages of the uplink and the downlink can be processed, and the optimal node can be scheduled to become the uplink sender and the downlink receiver; the QoS requirement of the node can be met, and interference can be reduced while complete wireless full duplex network transmission is realized. BRIEF DESCRIPTION OF DRAWINGS

[0016] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed in the embodiment description will be briefly introduced. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without any creative effort.

[0017] Figure 1 is a method step flowchart provided by an embodiment of the application;

[0018] Figure 2 is a structure diagram of the IDA-FDMA C protocol provided by an embodiment of the application;

[0019] Figure 3 is a CTS-FD frame structure diagram provided by an embodiment of the application;

[0020] Figure 4 is a selection range diagram of a subcarrier of a UD node uplink transmission in an application scenario provided by an embodiment of the application;

[0021] Figure 5 is a simulation experiment topology diagram in an application scenario provided by an embodiment of the application;

[0022] Figure 6 is a UD node average uplink and downlink throughput curve diagram in an application scenario provided by an embodiment of the application;

[0023] Figure 7 is a DD node average uplink and downlink throughput curve diagram in an application scenario provided by an embodiment of the application;

[0024] Figure 8 is a theoretical system and simulation system throughput curve diagram in an application scenario provided by an embodiment of the application;

[0025] Figure 9 is a UD node simulation uplink and downlink throughput comparison curve diagram of a data communication method based on an interference FD protocol, a data communication method of a CSMA / CA HD protocol and a data communication method of an embodiment of the application in an application scenario provided by an embodiment of the application;

[0026] Figure 10 is a DD node simulation uplink and downlink throughput comparison curve diagram of a data communication method based on an interference FD protocol, a data communication method of a CSMA / CA HD protocol and a data communication method of an embodiment of the application in an application scenario provided by an embodiment of the application;

[0027] Figure 11 is a simulation system throughput comparison curve diagram of a data communication method based on an interference FD protocol, a data communication method of a CSMA / CA HD protocol and a data communication method of an embodiment of the application in an application scenario provided by an embodiment of the application. DETAILED DESCRIPTION

[0028] In order to make the objects, technical solutions and advantages of the present application clearer, the present application will be further described in detail below with reference to the drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and should not be used to limit the present application.

[0029] In view of the problems of poor interference management and limited QoS support in the prior art, embodiments of the present application provide a data communication method, referring to Figure 1 , Figure 1 is a method step flowchart of the embodiments of the present application, comprising: in a TDC phase, determining an uplink sender or a downlink receiver through an RTS-FD / CTS-FD mode; wherein the TDC phase represents a time domain contention phase; the RTS-FD / CTS-FD mode is used to reserve a channel and carry QoS requirements; in a FDC phase, determining a downlink receiver according to an uplink sender and QoS requirements; or in the FDC phase, determining an uplink sender according to a downlink receiver and QoS requirements; wherein the FDC phase represents a frequency domain contention phase; in a data transmission and ACK phase, performing data transmission on uplink and downlink in parallel according to an uplink sender and a downlink receiver; wherein the data transmission and ACK phase represents a data transmission and acknowledgement character phase.

[0030] Specifically, in a data communication process, wireless full duplex (FD) can simultaneously perform uplink and downlink transmission without using additional bandwidth, thereby significantly improving system throughput, but severe interference may occur between nodes in full duplex transmission. The embodiments of the present application meet the QoS requirements of nodes and can reduce interference while transmitting in a complete wireless full duplex network.

[0031] The data communication method of the embodiments of the present application is based on the IDA-FDMAC protocol, which is a protocol with interference management and QoS service guarantee capability for a complete FD IoT network.

[0032] The IDA-FDMAC protocol based on which the embodiments of the present application are introduced as follows:

[0033] Referring to Figure 2 , Figure 2 is a structure diagram of the IDA-FDMAC protocol provided by the embodiments of the present application, which extends the RTS / CTS mode based on CSMA / CA and comprises a TDC phase (time domain contention phase), a FDC phase (frequency domain contention phase) and a data transmission and ACK phase (data transmission and acknowledgement character phase).

[0034] In the TDC phase including the RTS-FD frame and the CTS-FD frame, the RTS-FD frame and the CTS-FD frame in the IDA-FD MAC protocol are specifically introduced as follows:

[0035] Before the introduction, it is necessary to explain that the UD in the embodiment of the present application represents an uplink dominant node, and the uplink bandwidth requirement of the UD node is greater than the downlink bandwidth requirement; the DD represents a downlink dominant node, and the downlink bandwidth requirement of the DD node is greater than the uplink bandwidth requirement.

[0036] (1) RTS-FD frame

[0037] The RTS-FD frame can carry an RTS-FD sender type, which can be optionally one of the UD node, the DD node or the AP. In addition, the RTS-FD frame can be used to set a NAV (Network Allocation Vector) time for reserving a channel; wherein the NAV time includes the transmission time of the RTS-FD frame and the CTS-FD frame in the TDC phase, the contention time in the FDC phase, and the data transmission time in the data transmission and ACK phase.

[0038] The RTS-FD frame contains a frame control field, which contains a 2-bit 'type' field and a 4-bit'subtype' field. In the 2-bit type field, three values '00', '01' and '10' are used to represent the types of management, control and data frames, and the value '11' is reserved. In the IDA-FD MAC, the last 2 bits of the 4-bit subtype field are used to represent the RTS-FD frame sender type. For example, if the sender of the RTS-FD frame is the AP, the last 2 bits can be set to 00; if the sender of the RTS-FD frame is the UD node, it is set to 01; if the sender of the RTS-FD frame is the DD node, it is set to 10. By checking the value of the 2 bits, the receiver can parse the RTS-FD frame sender type.

[0039] (2) CTS-FD frame

[0040] The CTS-FD frame can be used to reserve a channel, and also to notify the entire network of the information carried; wherein the message notifying the entire network includes the current TDC transmission type, the nodes allowed to participate in the FDC contention, and the interference between the RTS-FD frame sender and the CTS-FD frame sender.

[0041] Reference Figure 3 , Figure 3 is a CTS-FD frame structure provided by the embodiment of the present application. Compared with the conventional CTS frame framework, the CTS-FD frame has three new fields: TX type, Bit Map and CSI.

[0042] The following introduces the three new fields:

[0043] ① TX type. In the CTS-FD frame, the UD→AP transmission type, the DD→AP transmission type, the AP→UD transmission type, and the AP→DD transmission type are mapped into two binary bits, as shown in Table 1, which is a TDC transmission type mapping table provided by an embodiment of the present application:

[0044] Table 1

[0045] TDC Transmission Type UD→AP DD→AP AP→UD AP→DD TX Type 00 01 10 11

[0046] According to Table 1, for example, the value “00” of the TX type indicates that the current TDC transmission type is UD→AP. It should be noted that the mapping relationship shown in Table 1 is one of the TDC transmission type mapping manners, and other mapping manners can also be used, for example, using the value “00” to represent the UD→AP transmission type.

[0047] After determining the transmission type, the sender of the CTS-FD frame directly sets the value of the TX type to the corresponding binary bit, and the node receiving the CTS-FD frame can obtain the current transmission type by analyzing the two bit values in the CTS-FD frame.

[0048] When the sender of the CTS-FD frame is an AP, i.e., the transmission type is the UD→AP type or the UD→AP type, the AP can determine the transmission type by checking the modified 2-bit value in the RTS-FD frame; when the sender of the CTS-FD frame is a node, i.e., the transmission type is AP→UD or AP→DD, the node can directly determine the transmission type according to its own node type.

[0049] ② Bit map

[0050] The sender of the CTS-FD frame notifies the entire network which nodes can participate in the FDC phase competition through the bit map. In the bitmap, the i-th bit value is 1, which indicates that the i-th node can participate in the FDC competition, and when the i-th bit value is 0, it indicates that the i-th node cannot participate in the FDC competition. For example, the bit map sequence '00100010' indicates that the 3rd node and the 7th node can participate in the FDC competition, and other nodes cannot participate. In the IDA-FD MAC protocol, the length of the bit map is set to 6 bytes, so the AP can support up to 48 nodes.

[0051] ③ Channel state information

[0052] The channel state information records channel state information between the RTS-FD frame sender and the CTS-FD frame sender, for example, channel coefficients which can be measured according to the receiving power of the RTS-FD frame. The CTS-FD frame sender informs all other nodes of the channel state information, and all other nodes determine whether their respective transmissions will interfere with the reception of the CTS-FD sender in the data transmission and ACK phase.

[0053] The data communication method of the embodiment of the application comprises the following steps S100-S300:

[0054] S100, determining an uplink sender or a downlink receiver by an RTS-FD / CTS-FD mode in a TDC phase; wherein the TDC phase represents a time domain contention phase; the RTS-FD / CTS-FD mode is used for reserving a channel and carrying QoS requirements.

[0055] Specifically, the purpose of the TDC phase is to determine whether a node wins in the contention, and all nodes and APs perform contention to become an uplink sender or a downlink receiver of full duplex transmission. When a node wins in the contention, the node becomes an uplink sender; when the AP wins in the contention, the node becomes a downlink receiver. The contention mode of the TDC phase is an RTS-FD / CTS-FD mode, which is specifically DIFS / Contention / RTS-FD / SIFS / CTS-FD; wherein DIFS is a distributed interframe space, and SIFS is a short interframe space.

[0056] In the embodiment of the application, the RTS-FD frame and the CTS-FD frame are used for setting a network allocation vector time (NAV) for other nodes to keep the nodes silent and reserve the channel; the RTS-FD frame and the CTS-FD frame are also used for carrying QoS information to inform the entire network which nodes are allowed to participate in subsequent FDC contention; and the RTS-FD frame and the CTS-FD frame are also used for coordinating time / frequency synchronization and measuring interference.

[0057] Specifically, the step S100 comprises the following steps S110-S150:

[0058] S110, generating a random backoff value by all nodes and an AP when a channel is idle for DIFS; wherein DIFS is a distributed interframe space; and the AP is a wireless access point.

[0059] S120, counting the backoff times by using a backoff counter.

[0060] S130, according to the random backoff value, a binary exponential backoff (BEB) algorithm is used to compete for the channel.

[0061] Specifically, the binary exponential backoff algorithm is a method for processing heavy load, specifically: the time after the collision is divided into time slots with length of 2t; after the first collision, each station waits for 0 or 1 time slot and then starts retransmission; after the second collision, each station randomly selects to wait for 0, 1, 2 or 3 time slots and then starts retransmission; after the ith collision, a waiting time slot number is randomly selected from 0 to 2i-1 and then retransmission is started; after 10 collisions, the waiting time slot number is fixed to 0 to 1023 (2^10-1); after 16 collisions, it is determined that the transmission fails and the upper layer is reported.

[0062] S140, when the channel is idle, the backoff counter is decremented; when the channel is busy, the backoff counter is suspended.

[0063] S150, when the backoff counter is reduced to 0, the uplink sender or the downlink receiver is determined through the handshake between the node and the AP.

[0064] Specifically, for steps S110-S150, after listening to the DIFS channel idle, all nodes and APs generate a random backoff value in [0, CW-1], use the backoff counter to calculate the backoff times, and use the binary exponential backoff algorithm to compete for the channel, wherein CW represents the size of the contention window. When detecting that the channel is idle, the backoff counter is decremented, and when detecting that the channel is busy, the backoff counter is suspended. When the backoff counter of a node is reduced to 0, the uplink sender or the downlink receiver is determined through the handshake between the node and the AP. Step S150 includes at least one of steps S151-S152:

[0065] S151, when the backoff counter is reduced to 0, the node sends an RTS-FD frame to the AP, and when the node receives a CTS-FD frame after SIFS time, the node is determined to win the competition and the node is determined as the uplink sender.

[0066] S152, when the backoff counter is reduced to 0, the AP sends an RTS-FD frame to the node, and when the AP receives a CTS-FD frame, the node is determined to win the competition and the node is determined as the downlink receiver.

[0067] In the embodiment of the application, according to the above description, it can be understood that there are four transmission types in the TDC phase:

[0068] (1) UD→AP type, i.e. the UD node sends an RTS-FD frame to the AP and successfully receives a CTS-FD frame returned by the AP after a SIFS time, successfully reserving the channel, in which case this UD node will be the uplink sender in the full-duplex transmission and the downlink receiver cannot be determined until the FDC phase is completed.

[0069] (2) DD→AP type, i.e. the DD node sends an RTS-FD frame to the AP and successfully receives a CTS-FD frame returned by the AP after a SIFS time, successfully reserving the channel, in which case this DD node will be the uplink sender in the full-duplex transmission and the downlink receiver cannot be determined until the FDC phase is completed.

[0070] (3) AP→UD type, i.e. the AP sends an RTS-FD frame to the UD node and successfully receives a CTS-FD frame returned by the node after a SIFS time, successfully reserving the channel, in which case this UD node will be the downlink receiver in the full-duplex transmission and the uplink receiver cannot be determined until the FDC phase is completed.

[0071] (4) AP→DD type, i.e. the AP sends an RTS-FD frame to the DD node and successfully receives a CTS-FD frame returned by the node after a SIFS time, successfully reserving the channel, in which case this DD node will be the downlink receiver in the full-duplex transmission and the uplink receiver cannot be determined until the FDC phase is completed.

[0072] S200, determining the downlink receiver according to the uplink sender and the QoS requirement in the FDC phase; or, determining the uplink sender according to the downlink receiver and the QoS requirement in the FDC phase; wherein, the FDC phase represents a frequency domain contention phase.

[0073] Specifically, referring to Figure 2 , the IDA-FDMA MAC protocol defines three rounds R1, R2, R3 in the FDC phase, and the step S200 includes the following steps S210-S260:

[0074] S210, configuring a contention condition and a node label; wherein, the contention condition includes at least one of a condition for contending for an uplink sender and a condition for contending for a downlink receiver.

[0075] S220, determining a node participating in contention according to the contention condition.

[0076] Specifically, for steps S210-S220, in round R1, the competition condition and the node label are configured, and the node first checks whether it satisfies the FDC competition condition, and when it satisfies the competition condition, the node performs the priority-based frequency competition. The node label is used to distinguish different nodes, and it can be understood that all nodes have mutually different node labels; in addition, the complete node label information is known to the AP, and the AP can distinguish different nodes.

[0077] In the embodiment of the present application, for two-node wireless full-duplex (FD) transmission (i.e., j=i), SIC can be used to solve the self-interference at node j; wherein SIC is a method for serial interference cancellation. After interference cancellation, the remaining self-interference RSI at node j j can be expressed as a fixed part of the transmission power (i.e., RSI j = g j P j→AP , wherein g j is determined by hardware) and P j→AP is the fixed transmission power of node j to the AP. The calculation formula of SIR j is:

[0078]

[0079] In formula (1), SIR j is the signal-to-interference ratio of node j; P AP→j is the transmission power of the AP to node j; P j→AP is the transmission power of node j to the AP; h AP→j is the channel coefficient between the AP and node j.

[0080] For three-node wireless full-duplex (FD) transmission (i.e., j≠i), the calculation formula of the non-self-interference SIR j of node j is:

[0081]

[0082] In formula (2), SIR j is the signal-to-interference ratio of node j; P i→AP is the transmission power of node i to the AP; P AP→j is the transmission power of the AP to node j; h i,j is the channel coefficient between node i and node j; h AP→j is the channel coefficient between the AP and node j.

[0083] For different TDC transmission types, each node needs to meet different competition conditions. If the current transmission type is UD→AP type or DD→AP type, it indicates that the uplink sender in the data transmission and ACK phase has been determined, and the downlink receiver is not determined, i.e. the nodes in the current FDC phase compete for the potential downlink receiver. The conditions for competing for the downlink receiver include:

[0084] (1) the bit value representing node j in the bitmap field of the CTS-FD frame is 1;

[0085] (2) the signal-to-interference ratio SIR of node j j is greater than a predetermined threshold γ, i.e. SIR j > γ.

[0086] When SIR j > γ, the uplink transmission of node i will not interfere with the reception of node j. Node j can measure h i,j based on the power of the signal (RTS-FD frame) received from node i.

[0087] If the current transmission type is AP→UD type or AP→DD type, it indicates that the downlink receiver in the data transmission and ACK phase has been determined, and the uplink sender is not determined, i.e. the nodes in the current FDC phase compete for the potential uplink sender.

[0088] The conditions for competing for the uplink sender include:

[0089] (1) node i has a frame to the AP;

[0090] (2) the transmission time of node i does not exceed the predetermined network allocation vector (NAV) time;

[0091] (3) the signal-to-interference ratio SIR of node i on the determined downlink sender j j is greater than a predetermined threshold γ, i.e. SIR j > γ.

[0092] When the node meets the conditions for competing for the uplink sender, the uplink transmission of node i will not interfere with the reception of node j; when j≠i, node i can measure h i,j based on the power of the signal (CTS-FD frame) received from node j, and obtain h AP→j from the interference field of node i.

[0093] S230, determining the node priority according to the QoS requirement of the node and the current TDC transmission type.

[0094] S240, determining the subcarrier size of the node according to the node priority.

[0095] Specifically, for steps S230-S240, in round R1, a random OFDM (Orthogonal Frequency Division Multiplexing) subcarrier is allocated to each node satisfying the competition condition in a designated subcarrier range in a distributed manner, and the node transmits a signal on the allocated subcarrier; wherein the OFDM used in the embodiment of the application is a multi-carrier transmission method, and OFDM realizes parallel transmission of high-speed serial data through frequency division multiplexing, and has good anti-multipath fading capability and can support multi-user access.

[0096] In the embodiment of the application, the node priority is dynamically determined according to the QoS requirement of the node and the current TDC transmission type, and Table 2 is a node dynamic priority example table in the embodiment of the application:

[0097] Table 2

[0098] Current UD Node Current DD Node Other UD Nodes Other DD Nodes UD→AP Medium / Lowest Highest DD→AP / Highest Lowest Medium AP→UD Highest / Medium Lowest AP→DD / Medium Highest Lowest

[0099] Taking the UD→AP transmission type as an example, the node (including the current uplink sender, referred to as the current UD node) satisfying the FDC phase competition condition will compete for the downlink receiver. For the DD node, since it has more requirements for downlink resources, the priority of the DD node is determined as the highest priority; and for the current UD node, even if the node does not need more downlink resources, since the node is the winner of the TDC competition, the priority of the node is determined as the medium priority; and for other UD nodes, neither of which needs more downlink resources nor wins the TDC competition, the priority of the node is determined as the lowest priority.

[0100] The subcarrier size of the node is determined according to the priority of the node. First, the subcarrier range is allocated to the above priority: the subcarrier range allocated to the highest priority is [1, a]; the subcarrier range allocated to the medium priority is [1, b]; and the subcarrier range allocated to the lowest priority is [1, c]; wherein a, b, and c are three integers, and a < b < c.

[0101] As can be understood from the above description, the subcarrier size of the node is determined according to the priority of the node, specifically: when the priority of the node is the highest, a random OFDM subcarrier is allocated to the node in the subcarrier range [1, a]; when the priority of the node is the medium, a random OFDM subcarrier is allocated to the node in the subcarrier range [1, b]; and when the priority of the node is the lowest, a random OFDM subcarrier is allocated to the node in the subcarrier range [1, c].

[0102] S250, determining the node which needs to send the node marker to the AP according to the size of the subcarrier of the node.

[0103] Specifically, in round R2, the node which needs to send the node marker to the AP is determined according to the size of the subcarrier of the node, for example, the node with the smallest subcarrier is determined as the node which needs to send the node marker to the AP, and the node sends its node marker to the AP through the whole channel. It should be noted that when multiple nodes are allocated to the same smallest subcarrier, these nodes send their markers to the AP at the same time.

[0104] S260, determining the uplink sender or the downlink receiver by detecting the node marker.

[0105] Specifically, in round R3, the AP determines the uplink sender or the downlink receiver by detecting the node marker. In the embodiment of the application, the AP distinguishes the received node marker by calculating the correlation value between the received signal and the marker s i of the node i, and the expression of the correlation value is:

[0106]

[0107] In formula (3), corr i (L s ) is the correlation value between the received signal and the marker s i of the node i; s i (k) is the kth symbol in the marker of the node i; is the complex conjugate of s i (k); y(k+Δ) is the kth symbol of the received signal with a shift position of Δ; L s is the length of the node marker.

[0108] When corr i (L s ) is higher than a predefined threshold, it is considered that the node i sends its node marker to the AP in round R2.

[0109] Specifically, step S260 includes at least one of the following steps S261-S263:

[0110] S261, when the AP detects one node marker, directly broadcasting the node marker.

[0111] S262, when the AP detects multiple node markers, randomly determining one node marker from the multiple node markers to broadcast.

[0112] S263, determining the broadcasted node as the uplink sender or the downlink receiver according to the current transmission type.

[0113] Specifically, if the current transmission type is UD→AP or DD→AP, the node marked by the node in round R2 is determined as a downlink receiver; if the current transmission type is AP→UD or AP→DD, the node marked by the node in round R2 is determined as an uplink receiver.

[0114] By step S200, the conflict in the FDC phase can be completely eliminated, so as to further improve the competition efficiency.

[0115] S300, in the data transmission and ACK phase, data transmission on the uplink and the downlink is performed in parallel according to the uplink sender and the downlink receiver; wherein the data transmission and ACK phase represents a data transmission and acknowledgement character phase.

[0116] Specifically, step S300 includes the following steps S310-S320:

[0117] S310, when the uplink sender performs uplink FD transmission to the AP, the AP performs downlink FD transmission of the downlink receiver in parallel.

[0118] Specifically, after the TSC phase and the FDC phase, the determined uplink sender and the determined downlink receiver will both start FD transmission in the data transmission and ACK phase, that is, when the uplink sender performs uplink FD transmission to the AP, the AP performs downlink FD transmission of the downlink receiver in parallel.

[0119] S320, when no node performs competition in the FDC phase, the FD transmission becomes HD transmission.

[0120] In steps S310-S320, the FD transmission represents wireless full-duplex transmission; the HD transmission represents wireless half-duplex transmission.

[0121] Embodiments of the present application also provide a data communication system, comprising: a first module, the first module is used for determining an uplink sender or a downlink receiver in a TDC phase through an RTS-FD / CTS-FD mode; wherein the TDC phase represents a time domain competition phase; the RTS-FD / CTS-FD mode is used for reserving a channel and carrying a QoS requirement; a second module, the second module is used for determining a downlink receiver according to the uplink sender and the QoS requirement in an FDC phase, or determining an uplink sender according to the downlink receiver and the QoS requirement in the FDC phase; wherein the FDC phase represents a frequency domain competition phase; a third module, the third module is used for performing data transmission on the uplink and the downlink in parallel according to the uplink sender and the downlink receiver in a data transmission and ACK phase; wherein the data transmission and ACK phase represents a data transmission and acknowledgement character phase.

[0122] An electronic device is also provided, including a processor and a memory; the memory is configured to store a program; the processor executes the program to implement the method as above.

[0123] A computer readable storage medium is also provided, which stores a program; the program is executed by a processor to implement the method as above.

[0124] The embodiments of the present application have the following beneficial effects: the two-stage node competition of uplink and downlink can be processed, and the optimal node can be scheduled to be the uplink sender and the downlink receiver, the QoS requirement of the node can be met, and the interference can be reduced while the complete wireless full-duplex network transmission is performed.

[0125] The application effect of the data communication method of the present application in the scenario of a saturated IoT network (i.e., an IoT network in which each node always has frames to be transmitted) having one AP (node 0), N UD nodes (nodes 1 to N), and M DD nodes (nodes N+1 to N+M) is exemplarily described as follows:

[0126] First, the analysis of the TDC phase and the FDC phase is introduced, and the throughput of each node is calculated:

[0127] (1) Analysis of the TDC phase

[0128] Let Ω be a generic slot (i.e., the time elapsed while the backoff counter is decremented by one). The expression of Ω is:

[0129]

[0130] In formula (4), β i is the attempt rate of node i (i.e., the average number of times that node i attempts to transmit an RTS-FD frame in a slot); σ is the duration of a MAC slot; T s is the entire transmission time when node i wins the TDC competition; T c is the collision time when multiple nodes simultaneously transmit RTS-FD frames. T s and T c are calculated respectively, and the following formulas are obtained:

[0131] The calculation formula of T s is:

[0132]

[0133] The calculation formula of T c is:

[0134] T c=DIFS+RTS+SIFS+CTS (6)

[0135] In equations (5) and (6): T Ri T is the competition time of the i-th round (i = 1, 2, 3) in the FDC phase. DATA It refers to the data transmission time during the data transmission and ACK phases.

[0136] The definitions in equation (4) can be explained by combining equations (5) and (6) as follows:

[0137] P e It is the idle probability that all nodes do not send RTS-FD frames in a general time slot, i.e., Ω = σ;

[0138] Let Ω be the probability that node i wins the TDC contention (i.e., only node i sends an RTS-FD frame), therefore Ω = T s ;definition in, It is the probability that AP (node ​​0) successfully sends an RTS-FD frame to node i, and:

[0139]

[0140] In equation (7), β 0i It is the attempt rate of AP to send RTS-FD frames to node i.

[0141] P c It is the collision probability of multiple nodes simultaneously sending RTS-FD frames, i.e., Ω = T c .

[0142] From equation (4), the formula for calculating the average general time slot can be derived as follows:

[0143]

[0144] In 802.11 networks, by setting the minimum and maximum contention windows (CW)... min and CW max The attempt rate can be adjusted, where CW max =2 m CW min m represents the maximum retreat phase. The attempt rate β for each node. i and minimum CW per node min,i The relationship is as follows:

[0145]

[0146] When m = 0 (i.e., CW) max =CW min =CWi ) can be simplified as:

[0147]

[0148] (2) FDC phase analysis

[0149] In the FDC phase, according to the current TDC transmission type, the nodes satisfying the contention condition described in the embodiments of the present application will perform FDC contention to compete for the contention rule of the potential uplink sender or downlink receiver according to the priority-based contention (as shown in Table 2).

[0150] In the following two cases, a node will become an uplink sender or a downlink receiver:

[0151] Case 1: Only the node wins the contention in R1;

[0152] Case 2: The node collides with another node in R1, and the AP selects the node as the winner in R3.

[0153] Referring to Figure 4 , Figure 4 is a schematic diagram of the selection range of the subcarriers of the UD node i in an application scenario provided by the embodiments of the present application. The subcarrier range of the DD node is [1, a], which has the highest priority; the subcarrier range of the current UD node i is [1, b], which is at a general priority; and the priority of other UD nodes (except the UD node i) is the lowest, and the subcarrier range is [1, c].

[0154] In the present example scenario, the probability that the UD node i is the uplink sender in the TDC phase and the node j is the downlink receiver in the FDC phase is represented as

[0155]

[0156] In formula (11), is the probability that only the node j wins the contention in R1 and all other nodes fail; is the probability that the node j and another node both win the contention in R1 (i.e., the node j collides with another node), and the AP only selects the node j as the winner in R3.

[0157] In the present example scenario, in order to simplify the analysis, it is assumed that only two nodes selecting the same subcarrier will cause a collision.

[0158] Next, when the node j is the current UD node (j = i), the probabilities that the node j is the uplink sender in the TDC phase and the node j is the downlink receiver in the FDC phase are calculated as and ​Another UD node (1≤j≤N, j≠i), DD node (N+1≤j≤N+M).

[0159] When the current UD node j (e.g. j=i) is the downlink receiver, The calculation formula is:

[0160]

[0161] The calculation formula is:

[0162]

[0163] In formula (12) and formula (13), and is the set of UD and DD nodes that have the qualification to participate in FDC competition when node i wins TDC competition. and is the absolute value of the two sets.

[0164] The meaning of formula (13) is that the UD node i can collide with the DD node or another UD node, and the AP still selects the UD node i as its downlink receiver.

[0165] Each definition in formula (12) and formula (13) is explained as follows:

[0166] Referring to Figure 4 , assuming that the number of selected subcarriers of the UD node i is k, and k is the minimum number among all the selection numbers of other nodes, then:

[0167] [1, a-1] is the range in which the UD node i can win the FDC competition. If the node selects the subcarrier number that is the smallest compared with other nodes, it can win the competition. Therefore, the UD node i can be the winner if and only if k is in the range of [1, a-1]; if k is in [a, b], the UD node will fail in the competition because the range of DD nodes is [1, a].

[0168] 1 / b is the probability that the UD node i selects a certain subcarrier from the range of [1, b]. This is because each subcarrier is uniformly distributed in the subcarrier pool. In addition, 1 / a and 1 / c in the calculation formula of are respectively the probability that the DD node and another UD node select a certain subcarrier number from the range of [1, a] and [1, c].

[0169] (a-k) / a is the probability that the selected subcarrier number of the DD node is in the range of [k+1, a]. In order to ensure that the UD node i wins the FDC competition, the selected subcarrier number of the DD node should be greater than k. Therefore, and the probability that the selected number of all DD nodes is greater than k, while represents the probability that the selected number of all DD nodes of node i is greater than k.

[0170] (c-k) / c is the probability that the selected subcarrier number of the UD node is in the range [k+1, c]. and have the same interpretation as .

[0171] and are the total number of only one DD node and only one UD node (except for the UD node i). The same subcarrier number is selected as the UD node i.

[0172] After each definition in the calculation formula in formula (12) and formula (13) is made clear, there can be:

[0173] When another UD node j (for example, but j≠i) is the downlink receiver, the can be expressed as:

[0174]

[0175] The

[0176]

[0177] The definition interpretation in formula (14) and formula (15) can be as each definition interpretation in formula (12) and formula (13), but it needs to be explained that the meaning of formula (15) is that node j can collide with the UD node i, another UD node, so there are three definitions in formula (15):

[0178] When the DD node j (for example, ) is the downlink receiver, the can be expressed as:

[0179]

[0180] The can be expressed as:

[0181]

[0182] Let be the probability that the DD node i is the uplink transmitter in the TDC phase and the node j is the downlink receiver in the FDC phase. Let ​​The probability that the AP selects UD node i as its downlink receiver at the TDC phase, while node j is the uplink sender at the FDC phase. Let The probability that the AP selects DD node i as its downlink receiver at the TDC phase, while node j is the uplink sender at the FDC phase. According to equation (11), we have

[0183]

[0184]

[0185]

[0186] The term in equation (18), equation (19), equation (20) is the probability that only node j wins the contention at the FDC end, The term is the probability that multiple nodes contend, and the AP selects node j as the winner.

[0187] The calculation of equation (18), equation (19), equation (20) is explained as follows:

[0188] In equation (18), when j = i, the current DD node i is the downlink receiver at the FDC phase, so

[0189]

[0190]

[0191] When It indicates that UD node i is the downlink receiver, so

[0192]

[0193]

[0194] When But j ≠ i, it indicates that another DD node j becomes the downlink receiver, so

[0195]

[0196]

[0197] In equation (19), when j = i, UD node i is the uplink sender at the FDC phase,

[0198]

[0199] ​

[0200] where and are the sets of nodes UD and DD, respectively, that participate in the FDC contention, when node i decides to be a downlink receiver in the TDC phase. and are the cardinalities of the two sets.

[0201] When but j≠i, it means that another UD node j becomes an uplink transmitter, so that

[0202]

[0203]

[0204] When it means that a DD node j becomes a downlink receiver, so that

[0205]

[0206]

[0207] In equation (20), when j=i, it means that the current DD node i can become an uplink transmitter in the FDC phase, so that:

[0208]

[0209]

[0210] When it means that a UD node j becomes an uplink transmitter in the FDC phase

[0211]

[0212]

[0213] When but j≠i, it means that another DD node j becomes an uplink transmitter, so that:

[0214]

[0215]

[0216] The throughput of each node is defined as the number of bits successfully transmitted by each node in the duration of E(Ω). In the data transmission and ACK phase, a node i, 1≤i≤N+M, can perform uplink transmission to the AP in two cases:

[0217] Case 1: Node i wins the TDC contention and becomes an uplink sender (e.g., UD→AP type for UD node i, or DD→AP type for DD node i);

[0218] Case 2: Node i wins the FDC contention and becomes an uplink sender (e.g., AP→UD type and AP→DD type for node i).

[0219] Let be the throughput of node i, 1≤i≤N+M, then we have:

[0220]

[0221] In equation (39), s represents the frame size, and E(Ω) represents the average common slot, which can be obtained from equation (8).

[0222] In addition, in the following case three and case four, the AP can perform downlink transmission to i:

[0223] Case three: the AP wins the TDC contention and selects node i as its downlink receiver (e.g., AP→UD type and AP→DD type for node i);

[0224] Case four: node i wins the FDC contention and becomes a downlink receiver (e.g., UD→AP type and DD→AP type for node i).

[0225] Let be the throughput from the AP to node i, 1≤i≤N+M, then we have:

[0226]

[0227] Let Γ represent the system throughput, which is the sum of the throughputs of each node, then we have:

[0228]

[0229] The following specific data are substituted into the application scenario to simulate and analyze the embodiments of the application:

[0230] In the simulation, there is one AP, three (N=3) UD nodes (UD1, UD2, UD3), and three (M=3) DD nodes (DD4, DD5, DD6). All nodes are randomly distributed around the AP, referring to Figure 5 , Figure 5 is a simulation experiment topology graph provided by an embodiment of the application in an application scenario. The parameter values of the simulation experiment are listed in Table 3, which is a simulation experiment parameter table provided by an embodiment of the application. Each simulation run lasts for 200 seconds.

[0231] Table 3

[0232] Parameter Value Parameter Value DIFS 28us [CAT R1 ]]> 8us SIFS 28us T R2 / T R3 ]]> 2us Slot time 9us Payload 1500bytes RTS / RTS-FD 38 / 38bytes [R basic ]]> 6Mbps CTS / CTS-FD 44 / 52bytes [R DATA ]]> 54Mbps ACK 38bytes [CAT DATA ]]> 222us

[0233] Wherein, DIFS is the inter-frame interval for priority in DCF (Distributed Coordination Function) access mode; SIFS is the inter-frame interval for the host's response frame to polling when using PCF (Point Coordination Function); Slot time is the slot time; RTS represents the length of the RTS frame when using RTS frames, RTS-FD represents the length of the RTS-FD frame when using RTS-FD frames; ACK represents the length of the ACK frame; T R1 It is the duration of round R1; T R2 / T R3 It represents the duration of rounds R2 and R3; Payload is the payload; T DATA This refers to the data transmission time during the data transmission and ACK phases.

[0234] When using different priority values ​​(a, b, c), the objective of verifying the effectiveness of the embodiments of the present invention in this application scenario is: for UD nodes, the system needs to provide more resources for its uplink than its downlink; for DD nodes, the system needs to provide more resources for its downlink than its uplink. In the simulation verification phase, refer to... Figure 6 Assuming strong interference between any two adjacent nodes, when a node is determined in the TDC phase, its neighboring nodes (because SIR < γ) will be unable to participate in the subsequent FDC contention. For example, when UD1 becomes an uplink sender in the TDC phase, its neighboring nodes (DD5 and DD6) cannot participate in the FDC contention because SIR5 < γ and SIR6 < γ. Additionally, each node has the same attempt rate β. i , 1≤i≤N+M (obtained from equation (10)), the trial rate of AP is β0=(N+M)β i Furthermore, their uplink and downlink traffic are equal. The simulation results obtained are referenced... Figure 6 .

[0235] Figure 6 These are the average uplink throughput and average downlink throughput of the UD node when CW changes from 100 to 500, where the priority values ​​of (a, b, c) are set to (10, 10, 10), (50, 50, 50), and (10, 30, 50).

[0236] from Figure 6 The following conclusions can be drawn:

[0237] The simulated uplink throughput from the nodes to the AP and the simulated downlink throughput from the AP to the nodes match the corresponding theoretical uplink throughput and theoretical downlink throughput curves closely, regardless of the changes in CW (contention window size) and priority. This shows that the above analysis is accurate.

[0238] With the priority of (a, b, c) given, the uplink and downlink throughput of the UD nodes decreases as the CW increases. For example, when the priority value is (10, 10, 10), the simulated uplink throughput (10, 10, 10) decreases from 3.7320 Mbps to 2.8009 Mbps as the CW changes from 100 to 500. This is because the attempt rate of the UD nodes decreases as the CW increases, which increases the contention overhead in the TDC phase and eventually reduces the performance.

[0239] Given the CW value, the throughput varies with the priority setting.

[0240] In addition, when the priority value is set to the same number (i.e., (10, 10, 10) or (50, 50, 50)), the uplink throughput is almost equal to the downlink throughput. The reason is that once the priority value is set to the same number, the priority rule is disabled, so all nodes have the same probability in the TDC phase and the FDC phase, and finally, the uplink throughput is equal to the downlink throughput.

[0241] The throughput of the priority value (50, 50, 50) is always higher than the throughput of the priority value (10, 10, 10). This is because the larger the value of the priority value, the smaller the collision probability in the FDC contention, and therefore the higher the throughput of each node.

[0242] When the priority is set to unequal values (e.g., (10, 30, 50)), the uplink throughput is not equal to the downlink throughput at all. In particular, the uplink throughput of the UD nodes is always higher than its downlink throughput. For example, as the CW changes from 100 to 500, the uplink throughput decreases from 5.1202 Mbps to 3.8668 Mbps and is always higher than its downlink throughput, which decreases from 2.5914 Mbps to 2.0064 Mbps. This shows that the data communication method of the embodiment of the application can provide differentiated services for the UD nodes, i.e., more resources are allocated for the uplink transmission, rather than for the downlink transmission.

[0243] Reference Figure 7When priority values (a, b, c) are set as (10, 10, 10), (50, 50, 50) and (10, 30, 50) respectively, and when the CW of the node changes from 100 to 500, the average uplink throughput and the average downlink throughput of the DD node are almost the same as Figure 6 the theoretical average uplink throughput and the theoretical average downlink throughput except for the case of priority value (10, 30, 50). In this case, the downlink throughput of the DD node is always higher than the uplink throughput of the DD node regardless of the change of the CW. For example, as the CW changes between 100 and 500, the downlink throughput of the DD node decreases from 5.2445 Mbps to 3.8948 Mbps, while the uplink throughput of the DD node only decreases from 2.7699 Mbps to 2.0414 Mbps. This shows that the data communication method of the embodiment of the application can provide differentiated services for the DD node, i.e. more resources are allocated for the downlink transmission of the DD node than for the uplink transmission of the DD node.

[0244] Referring to Figure 8 It can be seen that: first, the system throughput curve of the simulation matches the theoretical system throughput curve perfectly, which again shows that the analysis in the application scenario is very accurate and shows the effectiveness of the priority mechanism of the embodiment of the application. Secondly, the system throughput is the highest when the priority value is (50, 50, 50), the system throughput is the lowest when the priority value is (10, 10, 10), and the system throughput when the priority value is (10, 30, 50) is in the middle. This is because a larger priority value can reduce the collision probability in the FDC phase, thereby improving the throughput efficiency.

[0245] The performance evaluation comparison of the data communication method of the embodiment of the application based on the IDC-FDMA C protocol with the data communication methods based on the interference-based FD protocol and the CSMA / CA HD protocol is as follows:

[0246] Since both the interference-based FD protocol and the CSMA / CA HD protocol only support half-duplex nodes, in order to be fair, in this comparison, when a node is determined to be an uplink sender or a downlink receiver in the TDC phase, the node is not allowed to participate in the FDC competition, which can simulate a half-duplex node scheme. In addition, when comparing, the topology diagram shown in Figure 6 is still used, but the attempt rates of all nodes and APs are the same, and the priority values are set to (8, 12, 16), and the comparison results are as shown in Figure 9-11 .

[0247] Figure 9 The average uplink and downlink throughputs of the UD nodes of the three data communication methods are compared, and Figure 10The average uplink and downlink throughput of the DD nodes is compared, from which it can be concluded that the data communication method of the embodiment of the present application can provide better services according to the uplink and downlink requirements of the UD nodes and the DD nodes. In particular, as shown in Figure 9 , the embodiment of the present application can provide more uplink throughput for the UD nodes, as shown in Figure 10 , and can also provide more downlink throughput for the DD nodes. For example, when the CW changes from 100 to 500, the uplink throughput of the UD nodes decreases from 4.0438 Mbps to 2.6072 Mbps, and is always higher than its downlink throughput, which decreases from 2.9043 Mbps to 1.8885 Mbps, while the uplink throughput of the DD nodes decreases from 3.7306 Mbps to 2.4151 Mbps, and is always lower than its downlink throughput (decreases from 4.8701 Mbps to 3.1339 Mbps).

[0248] In the data communication methods of the interference-based FD protocol and the CSMA / CA-based HD protocol, the uplink throughput of each node is always higher than its downlink throughput, regardless of the type of the node. In particular, for the DD nodes, as shown in Figure 10 , the downlink throughput is even lower than the uplink throughput, which is contradictory to the uplink and downlink requirements. This is because the interference-based FD protocol is only a full-duplex protocol based on interference management, without considering the QoS requirements of the nodes.

[0249] From the above analysis, it can be understood that the data communication methods of the interference-based FD protocol and the CSMA / CA-based HD protocol cannot provide differentiated services, while the data communication method of the embodiment of the present application can provide differentiated services.

[0250] Figure 11 The system throughput of the data communication method of the present application and the data communication methods of the interference-based FD protocol and the CSMA / CA-based HD protocol are compared. As can be seen from Figure 11 , the data communication method of the present application can maximize the system throughput. For example, on average, the throughput of the data communication method of the embodiment of the present application is increased by 95.3% compared to the communication method based on the CSMA / CA-based HD protocol, and the throughput is increased by 15.4% compared to the data communication method based on the interference-based FD protocol. There are three reasons for this:

[0251] First, in the data communication method based on the interference-based FD protocol, the transmission is initiated only by the nodes, that is, there are only two types of transmission: UD→AP type and DD→AP type, while the data communication method of the embodiment of the present application has four types of transmission: UD→AP type, DD→AP type, AP→UD type and AP→DD type.

[0252] Second, when one node is determined, the embodiment of the present application uses frequency domain contention to determine another node, and the cost is less than 2 time slots. However, the data communication method of the interference-based FD protocol still uses time domain contention, and it takes more than 2 time slots to select another node.

[0253] Third, in the second round of contention (FDC contention phase), the embodiment of the present application can completely exclude conflicts through association marks, while the data communication method of the interference-based FD protocol cannot.

[0254] The above shows that the data communication method of the embodiment of the present application can significantly improve the throughput efficiency.

[0255] In some alternative embodiments, the functions / operations mentioned in the block diagram can not occur in the order mentioned in the operation diagram. For example, depending on the functions / operations involved, two blocks shown in succession can actually be executed substantially simultaneously with each other, or the blocks can sometimes be executed in reverse order. In addition, the embodiments presented and described in the flowcharts of the present application are provided by way of example, and the purpose is to provide a more comprehensive understanding of the technology. The disclosed method is not limited to the operations and logical flows presented herein. Alternative embodiments are contemplated in which the order of various operations is changed and in which sub-operations described as part of larger operations are independently executed.

[0256] In addition, although the present application is described in the context of functional modules, it should be understood that, unless otherwise stated to the contrary, one or more of the described functions and / or features can be integrated in a single physical device and / or software module, or one or more functions and / or features can be implemented in separate physical devices or software modules. It can also be understood that detailed discussion of the actual implementation of each module is unnecessary for understanding the present application. Rather, given the properties, functions, and internal relationships of the various functional modules in the devices disclosed herein, the actual implementation of the module will be understood within the routine skill of an engineer. Therefore, those skilled in the art can implement the present application as set forth in the claims without undue experimentation using ordinary skill. It can also be understood that the disclosed specific concepts are merely illustrative and are not intended to limit the scope of the present application, which is determined by the full scope of the appended claims and their equivalents.

[0257] If the functions are implemented in the form of software function units and sold or used as independent products, they can be stored in a computer readable storage medium. Based on this understanding, the technical solutions of the present application or the parts of the technical solutions that essentially contribute to the prior art or the parts 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 a plurality of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a magnetic disk or an optical disk, and various media that can store program codes.

[0258] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered a list of executable instructions for implementing logic functions, and can be specifically embodied in any computer-readable medium for use by an instruction execution system, apparatus, or device, such as a computer-based system, a system including a processor, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions, or in conjunction with these instructions execution systems, apparatuses, or devices. For the purpose of this specification, "computer-readable medium" can be any device that can contain, store, communicate, propagate, or transport programs for use by an instruction execution system, apparatus, or device, or in conjunction with these instruction execution systems, apparatuses, or devices.

[0259] More specific examples (a non-exhaustive list) of the computer-readable medium include the following: an electrical connection having one or more wires (electrical devices), a portable computer diskette (magnetic devices), a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). In addition, the computer-readable medium can even be paper or other suitable medium on which the program can be printed, as the program can be electronically obtained, for example, by optical scanning of the paper or other medium, followed by editing, interpreting, or otherwise processing, if necessary, in other suitable ways to be electronically obtained, and then stored in the computer memory.

[0260] It should be understood that aspects of the application can be implemented in hardware, software, firmware or a combination thereof. In the above embodiments, various steps or methods can be implemented in software or firmware which is stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, and in another embodiment, any of the following technologies, known in the art, can be used: a combination of discrete logic circuits having logic gates for implementing logic functions upon an application of data signals, application specific integrated circuits having logic gates, field programmable gate arrays (FPGA), or other components, in combination or as the case can be.

[0261] In the description of the specification, the description of the terms "one embodiment", "some embodiments", "an example", "a specific example", or "some examples" etc. means that the specific features, structures, materials or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of the application. In the specification, the illustrative description of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any appropriate manner in one or more embodiments or examples.

[0262] Although the embodiments of the present application have been shown and described, it would be appreciated by those skilled in the art that changes, modifications, alternatives and variations can be made to the embodiments without departing from the principles and spirit of the application, and the scope of the present application is defined by the claims and their equivalents.

[0263] The above is a specific description of the preferred embodiments of the present application, but the present application is not limited to the described embodiments, and those skilled in the art can make various equivalent modifications or replacements without departing from the spirit of the present application, and these equivalent modifications or replacements are all included in the scope defined by the claims of the present application.

Claims

1. A method of data communication, characterized by, The method comprises: In a TDC phase, determining a winning node as an uplink sender or a downlink receiver through an RTS-FD / CTS-FD mode; wherein the TDC phase represents a time domain contention phase; the RTS-FD / CTS-FD mode is used for reserving a channel and carrying QoS requirements; In a FDC phase, determining a downlink receiver according to the uplink sender and the QoS requirements; or, in the FDC phase, determining an uplink sender according to the downlink receiver and the QoS requirements; wherein the FDC phase represents a frequency domain contention phase; In a data transmission and ACK phase, performing data transmission on uplink and downlink in parallel according to the uplink sender and the downlink receiver.

2. A data communication method according to claim 1, characterized in that, The method of determining a winning node as an uplink sender or a downlink receiver through an RTS-FD / CTS-FD mode in a TDC phase comprises: When a channel is idle after listening to DIFS, all nodes and an AP generate a random backoff value; wherein the AP is a wireless access point; Counting the number of backoff times by using a backoff counter; Competing for the channel by using a binary exponential backoff algorithm according to the random backoff value; When the channel is idle, the backoff counter is decremented; when the channel is busy, the backoff counter is suspended; When the backoff counter is reduced to 0, determining an uplink sender or a downlink receiver through a handshake between a node and the AP.

3. A data communication method according to claim 2, wherein, The method of determining an uplink sender or a downlink receiver through a handshake between a node and an AP when the backoff counter is reduced to 0 comprises at least one of the following: When the backoff counter is reduced to 0, the node sends an RTS-FD frame to the AP, and when the node receives a CTS-FD frame, the node wins the competition and is determined as an uplink sender; When the backoff counter is reduced to 0, the AP sends an RTS-FD frame to the node, and when the AP receives a CTS-FD frame, the node wins the competition and is determined as a downlink receiver; Wherein the RTS-FD frame is a request to send frame under wireless full duplex; the CTS-FD frame is a clear to send frame under wireless full duplex.

4. A data communication method according to claim 2 or 3, characterised in that, The method of determining a downlink receiver according to an uplink sender and QoS requirements in a FDC phase; or, determining an uplink sender according to a downlink receiver and QoS requirements in a FDC phase, comprises: Configuring a contention condition and a node marker; wherein the contention condition comprises at least one of a condition of competing for an uplink sender and a condition of competing for a downlink receiver; Determining nodes participating in the competition according to the contention condition; Determining node priorities according to QoS requirements of the nodes and current TDC transmission types; Determining subcarrier sizes of the nodes according to the node priorities; Determining nodes that need to send the node markers to the AP according to the subcarrier sizes of the nodes; Determining an uplink sender or a downlink receiver by detecting the node markers.

5. A data communication method according to claim 4, wherein, The determining the uplink sender or the downlink receiver by detecting the node marker comprises at least one of: broadcasting the node marker directly when the AP detects one node marker; broadcasting a node marker randomly selected from a plurality of node markers when the AP detects a plurality of node markers; determining the node marker as the uplink sender or the downlink receiver according to a current transmission type.

6. The data communication method of claim 4, wherein the condition for contending for the uplink sender comprises: the node has a frame to the AP; the transmission time of the node does not exceed a predetermined network allocation vector time; the signal-to-interference ratio of the node on the determined downlink receiver is greater than a predetermined threshold value; the condition for contending for the downlink receiver comprises: the bit value representing the node in the bitmap field of the CTS-FD frame is 1; the signal-to-interference ratio of the node is greater than a predetermined threshold value.

7. The data communication method of claim 1, wherein, The performing the data transmission on the uplink and the downlink in parallel according to the uplink sender and the downlink receiver in the data transmission and ACK phase comprises: when the uplink sender performs the uplink FD transmission to the AP, the AP performs the downlink FD transmission of the downlink receiver in parallel; when no node performs contention in the FDC phase, the FD transmission becomes the HD transmission; wherein, the FD transmission represents wireless full-duplex transmission; the HD transmission represents wireless half-duplex transmission.

8. A data communication system, comprising: a first module for determining a winning node as an uplink sender or a downlink receiver by an RTS-FD / CTS-FD mode in a TDC phase; wherein, the TDC phase represents a time domain contention phase; the RTS-FD / CTS-FD mode is used for reserving a channel and carrying QoS requirements; a second module for determining a downlink receiver according to the uplink sender and QoS requirements in a FDC phase; or determining an uplink sender according to the downlink receiver and QoS requirements in the FDC phase; wherein, the FDC phase represents a frequency domain contention phase; a third module for performing data transmission on the uplink and the downlink in parallel according to the uplink sender and the downlink receiver in a data transmission and ACK phase.

9. An electronic device, comprising: comprising a processor and a memory; the memory is used for storing a program; the processor executes the program to implement the method of any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, the storage medium stores a program, and the program is executed by a processor to implement the method of any one of claims 1 to 7.

Images