Chain network based on time division duplex and communication method thereof
By adopting time division duplex and dual-frequency multiplexing strategies in chain networks, the utilization rate of time domain resources is improved, the problem of low throughput of chain networks is solved, and more efficient communication efficiency is achieved.
Patent Information
- Application Number
- CN202411384272.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-30
- Publication Date
- 2024-12-10
AI Technical Summary
The system throughput of existing chain networks is relatively low and cannot effectively utilize time domain resources, resulting in low communication efficiency.
Using a chain network based on time division duplex, by adding dual-frequency multiplexing and routing control strategies based on time domain resource multiplexing, nodes use wireless communication to interact, and use multiple frequency points to interact to improve time Utilization of domain resources.
It improves the throughput of the entire network, enhances the utilization rate of time domain resources, and solves the problem of low system throughput.
Smart Images

Figure CN119110403A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of communication, and in particular to a chain network based on time division duplex and a communication method thereof. Background Art
[0002] With the increase of communication demand and the complexity of communication environment, wireless communication network comes into being. There are many ways to form wireless communication network, which can be divided into any network topology such as chain, star, mesh, hybrid dynamic networking, etc.
[0003] As a common network topology, chain networks are widely used in various communication scenarios. Each node in the chain network transmits information in sequence to achieve stable information transmission and ensure the accuracy of communication results. However, the current chain network still has the problem of low system throughput. Summary of the invention
[0004] The object of the present invention is to provide a chain network based on time division duplex and a communication method thereof to improve the above-mentioned problem.
[0005] In order to achieve the above purpose, the technical solution adopted by the embodiment of the present invention is as follows:
[0006] In a first aspect, an embodiment of the present invention provides a chain network based on time division duplexing, wherein the chain network includes N nodes, and the nodes interact with each other using wireless communication;
[0007] When i%5=K%5&&i≠K, node K is used to use the first set of frequency points to send data on time domain resource number i, and the first type of node is used to use the first set of frequency points to receive data on time domain resource number i, wherein 0≤K≤N-1, 0≤i≤N-1, the first type of node is a node located in the first type of window adjacent to the node K in the chain network, and the length of the first type of window is 1;
[0008] When i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+2 and node K+3 are used to use the second set of frequency points for data interaction on time domain resource number i.
[0009] Optionally, when the data flow direction is forward, when i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+2 is used to use the second set of frequency points on time domain resource number i to send data, and node K+3 is used to use the second set of frequency points on time domain resource number i to receive data;
[0010] When the data flow direction is reverse, when i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+3 is used to send data using the second set of frequencies on time domain resource number i, and node K+2 is used to receive data using the second set of frequencies on time domain resource number i.
[0011] Optionally, when i=K, node K is used to use a first set of frequency points to send data on time domain resource number i, and the second type of node is used to use the first set of frequency points to receive data on time domain resource number i;
[0012] The second type of node is a node located in a second type of window adjacent to the node K in the chain network, and the length of the second type of window is 2.
[0013] Optionally, when i%5=K%5&&i≠K, and i%5=3 or 4, if K≤4, node K-2 and node K-3 are used to use the second set of frequency points on time domain resource number i for data interaction.
[0014] Optionally, when the data flow direction is forward, when i%5=K%5&&i≠K, and i%5=3 or 4, if K≤4, node K-3 is used to use the second set of frequency points on time domain resource number i to send data, and node K-2 is used to use the second set of frequency points on time domain resource number i to receive data;
[0015] When the data flow direction is reverse, when i%5=K%5&&i≠K, and i%5=3 or 4, if K≤4, node K-2 is used to use the second set of frequencies to send data on time domain resource number i, and node K-3 is used to use the second set of frequencies to receive data on time domain resource number i.
[0016] Optionally, in the chain network, the routing node of node K is the next node in the upward data flow.
[0017] In a second aspect, an embodiment of the present invention provides a chain network communication method based on time division duplexing, wherein the chain network includes N nodes, and the nodes interact with each other using wireless communication, and the chain network communication method includes:
[0018] When i%5=K%5&&i≠K, node K uses the first set of frequency points to send data on time domain resource number i, and the first type of node uses the first set of frequency points to receive data on time domain resource number i, wherein 0≤K≤N-1, 0≤i≤N-1, the first type of node is a node located in the first type of window adjacent to the node K in the chain network, and the length of the first type of window is 1;
[0019] When i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+2 and node K+3 use the second set of frequencies on time domain resource number i to exchange data.
[0020] Optionally, the step of the node K+2 and the node K+3 using a second set of frequency points on the time domain resource number i to perform data interaction includes:
[0021] In the case where the data flow direction is forward, when i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+2 uses the second set of frequency points on time domain resource No. i to send data, and node K+3 uses the second set of frequency points on time domain resource No. i to receive data;
[0022] When the data flow direction is reverse, when i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+3 uses the second set of frequencies to send data on time domain resource number i, and node K+2 uses the second set of frequencies to receive data on time domain resource number i.
[0023] Optionally, the method further includes: when i=K, node K uses a first set of frequency points to send data on time domain resource number i, and the second type of node uses the first set of frequency points to receive data on time domain resource number i;
[0024] The second type of node is a node located in a second type of window adjacent to the node K in the chain network, and the length of the second type of window is 2.
[0025] Optionally, the method also includes: when i%5=K%5&&i≠K, and i%5=3 or 4, if K≤4, node K-2 and node K-3 use a second set of frequencies on time domain resource number i to perform data exchange.
[0026] Compared with the prior art, the embodiment of the present invention provides a chain network based on time division duplex and a communication method thereof, wherein the chain network includes N nodes, and the nodes interact with each other by wireless communication; when i%5=K%5&&i≠K, node K is used to use the first set of frequency points to send data on the time domain resource No. i, and the first type of node is used to use the first set of frequency points to receive data on the time domain resource No. i, wherein 0≤K≤N-1, 0≤i≤N-1, the first type of node is a node located in the first type of window adjacent to node K in the chain network, and the length of the first type of window is 1; when i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+2 and node K+3 are used to use the second set of frequency points to interact with data on the time domain resource No. i. The chain network based on time division duplex increases dual-frequency multiplexing and routing control strategy methods on the basis of time domain resource reuse, so as to improve the utilization rate of time domain resources, thereby achieving the effect of improving the throughput of the entire network.
[0027] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, preferred embodiments are given below and described in detail with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS
[0028] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for use in the embodiments will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present invention and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.
[0029] Figure 1 A schematic diagram of the architecture of a time division duplex-based chain network provided in an embodiment of the present invention.
[0030] Figure 2 One of the flowcharts of the chain network communication method provided in an embodiment of the present invention.
[0031] Figure 3 The second flowchart of the chain network communication method provided by the embodiment of the present invention. DETAILED DESCRIPTION
[0032] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Generally, the components of the embodiments of the present invention described and shown in the drawings here can be arranged and designed in various different configurations.
[0033] Therefore, the following detailed description of the embodiments of the present invention provided in the accompanying drawings is not intended to limit the scope of the invention claimed for protection, but merely represents selected embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0034] It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in the subsequent drawings. At the same time, in the description of the present invention, the terms "first", "second", etc. are only used to distinguish the description and cannot be understood as indicating or implying relative importance.
[0035] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.
[0036] In the description of the present invention, it should be noted that the terms "upper", "lower", "inside", "outside", etc. indicate directions or positional relationships based on the directions or positional relationships shown in the accompanying drawings, or are directions or positional relationships in which the product of the invention is usually placed when in use. They are only for the convenience of describing the present invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific direction, be constructed and operated in a specific direction, and therefore should not be understood as a limitation on the present invention.
[0037] In the description of the present invention, it is also necessary to explain that, unless otherwise clearly specified and limited, the terms "disposed" and "connected" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be an indirect connection through an intermediate medium, or it can be the internal communication of two elements. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.
[0038] Some embodiments of the present invention are described in detail below in conjunction with the accompanying drawings. In the absence of conflict, the following embodiments and features in the embodiments can be combined with each other.
[0039] Please refer to Figure 1 , Figure 1 A schematic diagram of the architecture of a time division duplex-based chain network provided in an embodiment of the present invention. Figure 1 In the example, a chain network including 10 nodes from node 0 to node 9 is taken, but this is not a limitation.
[0040] From the perspective of underlying signal reception, each node can receive signals from the two nodes immediately to the left and the two nodes immediately to the right. For example, node 0 can receive signals from nodes 1 and 2; node 1 can receive signals from nodes 0, 2, and 3; node 2 can receive signals from nodes 0, 1, 3, and 4; node 3 can receive signals from nodes 1, 2, 4, and 5; node 4 can receive signals from nodes 2, 3, 5, and 6; node 5 can receive signals from nodes 3, 4, 6, and 7; node 6 can receive signals from nodes 4, 5, 7, and 8; node 7 can receive signals from nodes 5, 6, 8, and 9; node 8 can receive signals from nodes 6, 7, and 9; and node 9 can receive signals from nodes 7 and 8.
[0041] It should be noted that when node 4 receives the signal from node 2, node 5 can receive the signal from node 7 without any interference. It can be seen that node 2 and node 7 can reuse the same time domain resources; similarly, node 0 and node 5 can reuse the same time domain resources; node 1 and node 6 can reuse the same time domain resources; node 3 and node 8 can reuse the same time domain resources; node 4 and node 9 can reuse the same time domain resources. It can be seen Figure 1 In the chain network shown, node K and node K+5 can occupy the same time domain resources for transmission. This is equivalent to allocating all time domain resources within the multi-frame period to the five nodes. No matter how the five nodes randomly divide the time domain resources, the probabilistic normalization process will show that as long as the resources are evenly divided, it is equivalent to polling to occupy the time domain resources. Then nodes 0 / 5 / 10 / 15 occupy the (5×M)th time domain resource unit, nodes 1 / 6 / 11 / 16 occupy the (5×M+1)th time domain resource unit, nodes 2 / 7 / 12 / 17 occupy the (5×M+2)th time domain resource unit, nodes 3 / 8 / 13 / 18 occupy the (5×M+3)th time domain resource unit, and nodes 4 / 9 / 14 / 19 occupy the (5×M+4)th time domain resource unit, 1≤M≤M max , when N is an integer multiple of 5, M max=N÷5-1, when N is not an integer multiple of 5, M max N÷5 is rounded down. For example, when N=26, M max =6.
[0042] Based on the above resource allocation method, in a chain network composed of N nodes, the network throughput is calculated as follows. Assuming that the time domain resource unit is Pms, the multiframe period is N×Pms; the amount of data that can be sent in each subframe is Gbyte, then the amount of data that can be generated by a single node in the multiframe period is The network throughput is In fact, frequency multiplexing is only possible with more than 5 nodes, and the system throughput will be low.
[0043] In order to overcome the above problems, the time division duplex-based chain network provided in the embodiment of the present invention adds dual-frequency multiplexing and routing control strategy methods on the basis of time domain resource multiplexing, so as to improve the utilization rate of time domain resources and achieve the effect of improving the throughput of the entire network. For details, please refer to the following.
[0044] In the chain network based on time division duplexing provided in an embodiment of the present invention, the chain network includes N nodes, and the nodes interact with each other by wireless communication. The routing node of node R is the next node in the data flow direction, that is, the routing node of node R can only be node R+1 or node R-1, which can be specifically determined in combination with the data flow direction. Among them, the data flow direction includes forward and reverse, the forward direction refers to the data being sent from low to high along the node order, and the reverse direction refers to the data being sent from high to low along the node order. When the data flow direction is forward, 0≤R≤N-2, the routing node of node R is node R+1; when the data flow direction is reverse, 1≤R≤N-1, the routing node of node R is node R-1, and N represents the total number of nodes in the chain network.
[0045] When i%5=K%5&&i≠K, node K is used to send data using the first set of frequencies on time domain resource number i, and the first type of node is used to receive data using the first set of frequencies on time domain resource number i, wherein 0≤K≤N-1, 0≤i≤N-1, the first type of node is a node located in the first type of window adjacent to node K in the chain network, the length of the first type of window is 1, and % represents the modulo operator.
[0046] When K=0, the first type of node corresponding to node K is node K+1;
[0047] When K=N-1, the first type of node corresponding to node K is node K-1;
[0048] When 1≤K≤N-2, the first type of nodes corresponding to node K are node K+1 and node K-1.
[0049] When i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+2 and node K+3 are used to use the second set of frequency points for data interaction on time domain resource number i.
[0050] The time division duplex-based chain network provided by the embodiment of the present invention adds dual-frequency multiplexing and routing control strategy methods on the basis of time domain resource multiplexing, thereby improving the utilization rate of time domain resources and achieving the effect of improving the throughput of the entire network.
[0051] Optionally, when the data flow direction is forward, when i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+2 is used to send data using the second set of frequencies on time domain resource number i, and node K+3 is used to receive data using the second set of frequencies on time domain resource number i.
[0052] When the data flow direction is reverse, when i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+3 is used to send data using the second set of frequencies on time domain resource number i, and node K+2 is used to receive data using the second set of frequencies on time domain resource number i.
[0053] Optionally, when i=K, node K is used to send data using the first set of frequencies on time domain resource number i, and the second type of node is used to receive data using the first set of frequencies on time domain resource number i.
[0054] The second type of node is a node located in a second type of window adjacent to the node K in the chain network, and the length of the second type of window is 2.
[0055] When K=0, the second type of nodes corresponding to node K are node K+1 and node K+2;
[0056] When K=1, the second type of nodes corresponding to node K are node K+1, node K+2, and node K-1;
[0057] When 2≤K≤N-3, the second type of nodes corresponding to node K are node K+1, node K+2, node K-1 and node K-2;
[0058] When K=N-2, the second type of nodes corresponding to node K are node K-1, node K-2, and node K+1;
[0059] When K=N-1, the second type of nodes corresponding to node K are node K-1 and node K-2.
[0060] In an optional implementation, when i%5=K%5&&i≠K, and i%5=3 or 4, if K≤4, node K-2 and node K-3 are used to use the second set of frequencies for data interaction on time domain resource number i.
[0061] Optionally, when the data flow direction is forward, when i%5=K%5&&i≠K, and i%5=3 or 4, if K≤4, node K-3 is used to use the second set of frequency points to send data on time domain resource number i, and node K-2 is used to use the second set of frequency points to receive data on time domain resource number i.
[0062] When the data flow direction is reverse, when i%5=K%5&&i≠K, and i%5=3 or 4, if K≤4, node K-2 is used to use the second set of frequencies to send data on time domain resource number i, and node K-3 is used to use the second set of frequencies to receive data on time domain resource number i.
[0063] The following example uses K=10 to illustrate the timing resources used by node K. Assuming there are 20 nodes in the chain network (N=20), there are 20 time domain resources in the multiframe period (the multiframe period is N×Pms), the data flow direction is reverse, and the id of the destination node is 0.
[0064] In the time domain resource i=10, node 10 uses the first set of frequency points for transmission, and nodes 8, 9, 11, and 12 use the first set of frequency points for reception.
[0065] On the time domain resource i=0 / 5 / 15 (i%5=K%5&&i≠K), node 10 uses the first set of frequency points for transmission, and nodes 9 and 11 receive on the first set of frequency points;
[0066] On the time domain resource of i=3 / 18 (i%5=K%5&&i≠K&&i≠(K+5)), the node 10 uses the second set of frequencies for transmission, and the node 9 uses the second set of frequencies for reception.
[0067] The transmission status of the node 10 for different time domain resources is shown in Table 1. The time domain resources occupied are idx=0, 3, 5, 10, 15, 18 respectively.
[0068] Table 1 Schematic diagram of time domain resource multiplexing method
[0069] 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 t B_t t t t B_t
[0070] From the above description, we can know that, assuming that there are N nodes in the chain network, the time domain transmittable resources on the first set of frequency points are N / 5; the transmittable time domain resources on the second set of frequency points are (N / 5)-1 for edge and sub-edge nodes and (N / 5)-2 for non-edge nodes. If the time domain resource unit is Pms and the amount of data transmitted is Gbyte, the minimum amount of data that can be generated by a single node within the multiframe period is:
[0071] The throughput of the entire network is:
[0072] Compared with the original problem description, the throughput of the entire network has increased From the above formula, we can see that when N is an integer multiple of 5, and the larger N is, the higher the rate is. For example, when N = 50, the overall throughput provides
[0073] The embodiment of the present invention also provides a chain network communication method based on time division duplex, which is applied to the above chain network, wherein the chain network includes N nodes, and the nodes interact with each other by wireless communication. Figure 2 The chain network communication method includes: S20 and S30, which are specifically described as follows.
[0074] S20, when i%5=K%5&&i≠K, node K uses the first set of frequencies to send data on time domain resource number i, and the first type of node uses the first set of frequencies to receive data on time domain resource number i.
[0075] Among them, 0≤K≤N-1, 0≤i≤N-1, the first type of node is a node in the chain network that is located in the first type of window adjacent to the node K in the chain network, and the length of the first type of window is 1.
[0076] S30, when i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+2 and node K+3 use the second set of frequencies on time domain resource number i to exchange data.
[0077] Optionally, S20, the step of node K+2 and node K+3 using the second set of frequency points on time domain resource No. i to exchange data includes: when the data flow direction is forward, when i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+2 uses the second set of frequency points on time domain resource No. i to send data, and node K+3 uses the second set of frequency points on time domain resource No. i to receive data; when the data flow direction is reverse, when i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+3 uses the second set of frequency points on time domain resource No. i to send data, and node K+2 uses the second set of frequency points on time domain resource No. i to receive data.
[0078] Please refer to Figure 3 The chain network communication method also includes: S10 and S40, which are described in detail as follows.
[0079] S10, when i=K, node K uses the first set of frequency points to send data on time domain resource number i, and the second type of node uses the first set of frequency points to receive data on time domain resource number i.
[0080] The second type of node is a node located in a second type of window adjacent to the node K in the chain network, and the length of the second type of window is 2.
[0081] S40, when i%5=K%5&&i≠K, and i%5=3 or 4, if K≤4, node K-2 and node K-3 use the second set of frequencies on time domain resource number i to exchange data.
[0082] It should be noted that Figure 3 There is no limitation on the order in which steps S10, S20, S30 and S40 are executed.
[0083] It should be noted that the chain network communication method provided in this embodiment can perform the functions and uses shown in the above chain network embodiment to achieve the corresponding technical effects. For the sake of brief description, for parts not mentioned in this embodiment, please refer to the corresponding contents in the above embodiment.
[0084] In summary, the embodiment of the present invention provides a chain network based on time division duplex and a communication method thereof, wherein the chain network includes N nodes, and the nodes interact with each other by wireless communication; when i%5=K%5&&i≠K, node K is used to use the first set of frequency points to send data on the time domain resource No. i, and the first type of node is used to use the first set of frequency points to receive data on the time domain resource No. i, wherein 0≤K≤N-1, 0≤i≤N-1, the first type of node is a node located in the first type of window adjacent to node K in the chain network, and the length of the first type of window is 1; when i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+2 and node K+3 are used to use the second set of frequency points to interact with data on the time domain resource No. i. The chain network based on time division duplex increases dual-frequency multiplexing and routing control strategy methods on the basis of time domain resource reuse, so as to improve the utilization rate of time domain resources, thereby achieving the effect of improving the throughput of the entire network.
[0085] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.
[0086] It will be apparent to those skilled in the art that the invention is not limited to the details of the exemplary embodiments described above and that the invention can be implemented in other specific forms without departing from the spirit or essential features of the invention. Therefore, the embodiments should be considered exemplary and non-limiting in all respects, and the scope of the invention is defined by the appended claims rather than the foregoing description, and it is intended that all variations falling within the meaning and scope of the equivalent elements of the claims be included in the invention. Any reference numeral in a claim should not be considered as limiting the claim to which it relates.
Claims
1. A chain network based on time division duplex, It is characterized in that The chain network includes N nodes, and the nodes interact with each other by wireless communication; When i%5=K%5&&i≠K, node K is used to use the first set of frequency points to send data on time domain resource number i, and the first type of node is used to use the first set of frequency points to receive data on time domain resource number i, wherein 0≤K≤N-1, 0≤i≤N-1, the first type of node is a node located in the first type of window adjacent to the node K in the chain network, and the length of the first type of window is 1; When i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+2 and node K+3 are used to use the second set of frequency points for data interaction on time domain resource number i.
2. The time division duplex-based chain network as claimed in claim 1, It is characterized in that In the case where the data flow direction is forward, when i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+2 is used to use the second set of frequency points on time domain resource number i to send data, and node K+3 is used to use the second set of frequency points on time domain resource number i to receive data; When the data flow direction is reverse, when i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+3 is used to send data using the second set of frequencies on time domain resource number i, and node K+2 is used to receive data using the second set of frequencies on time domain resource number i.
3. The time division duplex-based chain network as claimed in claim 1, It is characterized in that When i=K, node K is used to send data using the first set of frequency points on time domain resource number i, and the second type of node is used to receive data using the first set of frequency points on time domain resource number i; The second type of node is a node located in a second type of window adjacent to the node K in the chain network, and the length of the second type of window is 2.
4. The time division duplex-based chain network as claimed in claim 1, It is characterized in that When i%5=K%5&&i≠K, and i%5=3 or 4, if K≤4, node K-2 and node K-3 are used to use the second set of frequency points for data exchange on time domain resource number i.
5. The time division duplex-based chain network as claimed in claim 4, It is characterized in that In the case where the data flow direction is forward, when i%5=K%5&&i≠K, and i%5=3 or 4, if K≤4, node K-3 is used to use the second set of frequency points on time domain resource number i to send data, and node K-2 is used to use the second set of frequency points on time domain resource number i to receive data; When the data flow direction is reverse, when i%5=K%5&&i≠K, and i%5=3 or 4, if K≤4, node K-2 is used to use the second set of frequencies to send data on time domain resource number i, and node K-3 is used to use the second set of frequencies to receive data on time domain resource number i.
6. The time division duplex based chain network as claimed in claim 1, It is characterized in that In the chain network, the routing node of node K is the next node in the upward direction of data flow.
7. A chain network communication method based on time division duplex, It is characterized in that The chain network includes N nodes, and the nodes interact with each other by wireless communication. The chain network communication method includes: When i%5=K%5&&i≠K, node K uses the first set of frequency points to send data on time domain resource number i, and the first type of node uses the first set of frequency points to receive data on time domain resource number i, wherein 0≤K≤N-1, 0≤i≤N-1, the first type of node is a node located in the first type of window adjacent to the node K in the chain network, and the length of the first type of window is 1; When i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+2 and node K+3 use the second set of frequencies on time domain resource number i to exchange data.
8. The chain network communication method based on time division duplexing as claimed in claim 7, It is characterized in that The step of the node K+2 and the node K+3 using the second set of frequency points to perform data interaction on the time domain resource number i includes: In the case where the data flow direction is forward, when i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+2 uses the second set of frequency points on time domain resource No. i to send data, and node K+3 uses the second set of frequency points on time domain resource No. i to receive data; When the data flow direction is reverse, when i%5=K%5&&i≠K&&i≠(K+5), if K<N-3, node K+3 uses the second set of frequencies to send data on time domain resource number i, and node K+2 uses the second set of frequencies to receive data on time domain resource number i.
9. The chain network communication method based on time division duplexing as claimed in claim 7, It is characterized in that The method further comprises: When i=K, node K uses the first set of frequency points on time domain resource number i to send data, and the second type of node uses the first set of frequency points on time domain resource number i to receive data; The second type of node is a node located in a second type of window adjacent to the node K in the chain network, and the length of the second type of window is 2.
10. The chain network communication method based on time division duplexing as claimed in claim 7, It is characterized in that The method further comprises: When i%5=K%5&&i≠K, and i%5=3 or 4, if K≤4, node K-2 and node K-3 use the second set of frequencies on time domain resource number i to exchange data.
