Distributed time division multiple access time slot allocation method, electronic device, medium and system

Abstract

The application provides a distributed time division multiple access time slot allocation method, an electronic device, a medium and a system, the method numbers all nodes in sequence in turn, gives each node a unique ID, constructs a node mapping relationship of "sending node number->receiving node number", forms two inverted isosceles triangle arrays according to certain rules, can guarantee the fairness of the distributed time division multiple access network, and any two nodes in the network have equal communication opportunities; there is only one transceiving communication pair in each time slot, and each transceiving communication pair in the two inverted isosceles triangle arrays is arranged in the corresponding time slot position according to the arrangement rule, so that any node in the time slot table cannot be in the transmitting state in two continuous time slots, thereby reducing the continuous transmitting time length of the wireless communication device and relieving the heating of the communication device. The technical scheme of the application is used to solve the technical problem that the communication device continuously transmits for a long time in the prior art, which causes serious heating.

Description

Technical Field

[0001] This invention relates to the field of data link technology, and in particular to a distributed time-division multiple access time slot allocation method, electronic device, medium and system. Background Technology

[0002] In distributed time-division multiple access (TDMA) mobile ad hoc networks, data exchange between nodes relies on wireless communication devices. The time slot allocation algorithm for TDMA must consider not only the fairness of access opportunities between nodes but also the actual heat generation of the communication devices. Heat generation is related to both the macroscopic communication duty cycle and the microscopic continuous transmission duration. Given a fixed macroscopic communication duty cycle, the microscopic continuous transmission duration should be minimized. Simultaneously, advanced cooling technologies should be employed to ensure that the wireless communication devices operate within a comfortable temperature range. The time slot allocation method proposed in this invention primarily aims to reduce the continuous transmission duration of wireless communication devices. Summary of the Invention

[0003] This invention provides a distributed time division multiple access time slot allocation method, electronic device, medium and system, which can solve the technical problem of severe heat generation caused by long continuous transmission time of communication equipment in the prior art.

[0004] According to one aspect of the present invention, a distributed time division multiple access (TDMA) time slot allocation method is provided, the method comprising:

[0005] S1, number all nodes sequentially, each node is both a sending node and a receiving node;

[0006] S2, construct the node mapping relationship of "sending node number -> receiving node number", where if the sending node number is i, the corresponding receiving node number starts from i+1 and ends at the maximum node number. The value of node number i is incremented from 1 to the maximum node number minus 1. The Ni node mapping relationships obtained each time are arranged separately from left to right as the i-th row, forming the first inverted isosceles triangle matrix, where N is the total number of all nodes.

[0007] S3, swap the sending node number and receiving node number of each node mapping relationship in the first inverted isosceles triangle matrix to form a new node mapping relationship of "sending node number -> receiving node number", thus forming the second inverted isosceles triangle matrix.

[0008] S4. For the first inverted isosceles triangular matrix, starting from "1->N", follow the diagonal line to "(N-1)->N" to obtain N-1 node mapping relationships. Then, starting from "1->(N-1)", follow the diagonal line to "(N-2)->(N-1)" to obtain N-2 node mapping relationships. Continue in this manner until "1->2", to obtain one node mapping relationship.

[0009] S5. For the second inverted isosceles triangle, starting from "N->1", follow the horizontal line to "2->1" to obtain N-1 node mapping relationships; then, starting from "N->2", follow the horizontal line to "3->2" to obtain N-2 node mapping relationships, and so on, until "N->(N-1)" to obtain one node mapping relationship;

[0010] The transmit and receive node pairs in each node mapping relationship obtained by S6, S4 and S5 occupy a time slot in sequence to obtain a continuous time slot arrangement sequence.

[0011] According to another aspect of the present invention, an electronic device is provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the steps of the distributed time division multiple access time slot allocation method proposed above in the present invention.

[0012] According to another aspect of the present invention, a computer-readable storage medium storing a computer program is provided, wherein when the computer program is executed by a processor, it implements the steps of the distributed time division multiple access time slot allocation method proposed above.

[0013] According to another aspect of the present invention, a distributed time division multiple access time slot allocation system is provided, the system including a node numbering module, a transceiver node design module and a time slot arrangement rule design module;

[0014] The node numbering module is used to number all nodes sequentially. Each node is both a sending node and a receiving node.

[0015] The transceiver node design module is used to construct the node mapping relationship of "transmitter node number -> receiver node number". If the sender node number is i, the corresponding receiver node number starts from i+1 and ends at the maximum node number. The value of node number i is incremented from 1 to the maximum node number minus 1. The resulting Ni node mapping relationships are arranged separately from left to right as the i-th row, forming the first inverted isosceles triangle matrix, where N is the total number of all nodes. The sender node number and receiver node number of each node mapping relationship in the first inverted isosceles triangle matrix are swapped to form a new node mapping relationship of "transmitter node number -> receiver node number", forming the second inverted isosceles triangle matrix.

[0016] The time slot arrangement rule design module is used to, for the first inverted isosceles triangular matrix, start from "1->N", follow the diagonal line to "(N-1)->N", and obtain N-1 node mapping relationships in sequence. Then, start from "1->(N-1)", follow the diagonal line to "(N-2)->(N-1)", and obtain N-2 node mapping relationships in sequence. This process continues until "1->2", where a node mapping relationship is obtained. For the second inverted isosceles triangular matrix, start from "N->1", follow the horizontal line to "2->1", and obtain N-1 node mapping relationships in sequence. Then, start from "N->2", follow the horizontal line to "3->2", and obtain N-2 node mapping relationships in sequence. This process continues until "N->(N-1)", where a node mapping relationship is obtained. The transmit and receive node pairs in each obtained node mapping relationship occupy one time slot in sequence to obtain a continuous time slot arrangement sequence.

[0017] The present invention provides a distributed time division multiple access (TDMA) time slot allocation method, electronic device, medium, and system. This method sequentially numbers all nodes, assigning each node a unique ID. By constructing a node mapping relationship of "sending node number -> receiving node number," two inverted isosceles triangular matrices are formed according to certain rules. This ensures the fairness of the distributed TDMA network, guaranteeing that any two nodes within the network have equal communication opportunities. Each time slot contains one and only one transmit / receive communication pair. By arranging the transmit / receive communication pairs in the two inverted isosceles triangular matrices according to the arrangement rules, the node transmission time slots are discretized. This ensures that no node in the time slot table is in a transmitting state for two consecutive time slots. While ensuring the fairness of distributed TDMA, the continuous transmission time of nodes is compressed to the length of a single time slot, thereby reducing the continuous transmission duration of wireless communication equipment and alleviating the overheating caused by continuous transmission. Attached Figure Description

[0018] The accompanying drawings, which form part of this specification, are provided to further illustrate embodiments of the invention and, together with the textual description, explain the principles of the invention. It is obvious that the drawings described below are merely some embodiments of the invention, and those skilled in the art can obtain other drawings based on these drawings without any creative effort.

[0019] Figure 1 (a) shows a schematic diagram of the first inverted isosceles triangular array in the distributed time division multiple access time slot allocation method provided according to a specific embodiment of the present invention;

[0020] Figure 1(b) shows a schematic diagram of the second inverted isosceles triangular array in the distributed time division multiple access time slot allocation method provided according to a specific embodiment of the present invention;

[0021] Figure 2 (a) in the figure shows the results according to Figure 1 (a) is a schematic diagram of time slot allocation.

[0022] Figure 2 (b) shows the results according to Figure 1 (b) is a schematic diagram of time slot allocation.

[0023] Figure 3 (a) shows one of the five-node time slot allocation diagrams provided according to a specific embodiment of the present invention;

[0024] Figure 3 (b) shows a second schematic diagram of five-node time slot allocation according to a specific embodiment of the present invention;

[0025] Figure 4 A schematic diagram of the five-node time slot arrangement provided according to a specific embodiment of the present invention is shown. Detailed Implementation

[0026] It should be noted that, unless otherwise specified, the embodiments and features described in this application can be combined with each other. The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, and not all of them. The following description of at least one exemplary embodiment is merely illustrative and is in no way intended to limit the present invention or its application or use. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0027] It should be noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the exemplary embodiments according to this application. As used herein, the singular form is intended to include the plural form as well, unless the context clearly indicates otherwise. Furthermore, it should be understood that when the terms "comprising" and / or "including" are used in this specification, they indicate the presence of features, steps, operations, devices, components, and / or combinations thereof.

[0028] Unless otherwise specifically stated, the relative arrangement, numerical expressions, and values ​​of the components and steps set forth in these embodiments do not limit the scope of the invention. It should also be understood that, for ease of description, the dimensions of the various parts shown in the drawings are not drawn to actual scale. Techniques, methods, and devices known to those skilled in the art may not be discussed in detail, but where appropriate, such techniques, methods, and devices should be considered part of the specification. In all examples shown and discussed herein, any specific values ​​should be interpreted as merely exemplary and not as limitations. Therefore, other examples of exemplary embodiments may have different values. It should be noted that similar reference numerals and letters in the following figures denote similar items; therefore, once an item is defined in one figure, it need not be further discussed in subsequent figures.

[0029] like Figure 1 (a) Figure 1 (b) Figure 2 (a) Figure 2 As shown in (b) of the present invention, a distributed time division multiple access (TDMA) time slot allocation method is provided according to a specific embodiment of the present invention, the method comprising:

[0030] S1, number all nodes sequentially, each node is both a sending node and a receiving node;

[0031] S2, construct the node mapping relationship of "sending node number -> receiving node number", where if the sending node number is i, the corresponding receiving node number starts from i+1 and ends at the maximum node number. The value of node number i is incremented from 1 to the maximum node number minus 1. The Ni node mapping relationships obtained each time are arranged separately from left to right as the i-th row, forming the first inverted isosceles triangle matrix, where N is the total number of all nodes.

[0032] S3, swap the sending node number and receiving node number of each node mapping relationship in the first inverted isosceles triangle matrix to form a new node mapping relationship of "sending node number -> receiving node number", thus forming the second inverted isosceles triangle matrix.

[0033] S4. For the first inverted isosceles triangular matrix, starting from "1->N", follow the diagonal line to "(N-1)->N" to obtain N-1 node mapping relationships. Then, starting from "1->(N-1)", follow the diagonal line to "(N-2)->(N-1)" to obtain N-2 node mapping relationships. Continue in this manner until "1->2", to obtain one node mapping relationship.

[0034] S5. For the second inverted isosceles triangle, starting from "N->1", follow the horizontal line to "2->1" to obtain N-1 node mapping relationships; then, starting from "N->2", follow the horizontal line to "3->2" to obtain N-2 node mapping relationships, and so on, until "N->(N-1)" to obtain one node mapping relationship;

[0035] The transmit and receive node pairs in each node mapping relationship obtained by S6, S4 and S5 occupy a time slot in sequence to obtain a continuous time slot arrangement sequence.

[0036] This configuration provides a distributed time-division multiple access (TDMA) time slot allocation method. This method sequentially numbers all nodes, assigning each node a unique ID. By constructing a node mapping relationship of "sending node number -> receiving node number," two inverted isosceles triangular matrices are formed according to certain rules. This ensures the fairness of the distributed TDMA network, guaranteeing equal communication opportunities for any two nodes. Each time slot contains exactly one transmit / receive communication pair. By arranging the transmit / receive pairs in the two inverted isosceles triangular matrices according to a set rule, the node transmission time slots are discretized. This ensures that no node in the time slot table is in a transmitting state for two consecutive time slots. While maintaining the fairness of distributed TDMA, the continuous transmission time of nodes is compressed to the length of a single time slot, thereby reducing the continuous transmission duration of wireless communication equipment and alleviating the overheating caused by continuous transmission. Compared with existing technologies, the technical solution of this invention solves the technical problem of severe overheating caused by long continuous transmission times in existing communication equipment.

[0037] In the above embodiments, numbering all nodes sequentially is to avoid conflicts in multiple access. Therefore, each node's number is mutually exclusive and unique, serving as a unique identifier for each node. The node number is also known as the node ID, and each node has a unique node ID. The specific steps for designing transceiver nodes based on node IDs are as follows:

[0038] a) Arrange the first row of the first inverted isosceles triangle:

[0039] 1) The node with node ID 1 acts as the sending node, and the node with node ID 2 acts as the receiving node, forming the first send-receive communication pair "1-2";

[0040] 2) The node with node ID 1 acts as the sending node, and the node with node ID 3 acts as the receiving node, forming the second send-receive communication pair "1-3";

[0041] 3) Continue in this manner until the node with node ID 1 is used as the sending node and the node with node ID N is used as the receiving node, forming the (N-1)th transmit-receive communication pair;

[0042] 4) Arrange the first to the (N-1)th transmit and receive pairs in a row from left to right, forming the first row of the first inverted isosceles triangle.

[0043] b) Arrange the second row of the first inverted isosceles triangle:

[0044] 1) The node with node ID 2 acts as the sending node, and the node with node ID 3 acts as the receiving node, forming the first transmit-receive communication pair "2-3";

[0045] 2) The node with node ID 2 acts as the sending node, and the node with receiving ID 4 acts as the receiving node, forming the second send-receive communication pair "2-4";

[0046] 3) Continue in this manner until the node with node ID 2 is used as the sending node and the node with node ID N is used as the receiving node to form the (N-2)th transmit and receive communication pair;

[0047] 4) Arrange the first to the (N-2)th transmit and receive pairs in a row from left to right, forming the second row of the first inverted isosceles triangle. The position of the first transmit and receive pair in the second row is between the first transmit and receive pair in the first row and the second transmit and receive pair in the first row, to ensure that the final configuration is an inverted isosceles triangle.

[0048] c) Following this pattern, arrange the last row of the first inverted isosceles triangle:

[0049] The last line contains only one send / receive communication pair, with the sending node's node ID being N-1 and the receiving node's node ID being N.

[0050] d) Arrange the first row of the second inverted isosceles triangle:

[0051] 1) The node with node ID 2 acts as the sending node, and the node with node ID 1 acts as the receiving node, forming the first send-receive communication pair;

[0052] 2) The node with node ID 3 acts as the sending node, and the node with node ID 1 acts as the receiving node, forming the second send-receive communication pair;

[0053] 3) Continue in this manner until the node with node ID N becomes the sending node and the node with node ID 1 becomes the receiving node, forming the (N-1)th send-receive communication pair;

[0054] 4) Arrange the first to the (N-1)th transmit and receive pairs in a row from left to right, forming the first row of the second inverted isosceles triangle.

[0055] e) Arrange the second row of the second inverted isosceles triangle:

[0056] 1) The node with node ID 3 acts as the sending node, and the node with node ID 2 acts as the receiving node, forming the first send-receive communication pair;

[0057] 2) The node with node ID 4 acts as the sending node, and the node with node ID 2 acts as the receiving node, forming the second send-receive communication pair;

[0058] 3) Continue in this manner until the node with node ID N becomes the sending node and the node with node ID 2 becomes the receiving node, forming the (N-2)th send-receive communication pair;

[0059] 4) Arrange the first to the N-2th transmit and receive pairs in a row from left to right, forming the second row of the second inverted isosceles triangle.

[0060] f) Following this pattern, arrange the last row of the second inverted isosceles triangle:

[0061] The last line contains only one send / receive communication pair, with the sending node's node ID being N and the receiving node's node ID being N-1.

[0062] The first inverted isosceles triangle array formed by the sending and receiving nodes of an N-node network is as follows: Figure 1 As shown in (a) in the diagram, the second inverted isosceles triangle array is as follows: Figure 1 As shown in (b), steps d) to f) actually involve swapping the sending node ID and receiving node ID of each transmit / receive communication pair in the first inverted isosceles triangle matrix. That is, the node originally used for transmitting becomes the node used for receiving, and the node originally used for receiving becomes the node used for transmitting. The positions of the transmit / receive communication pairs in the triangle matrix remain unchanged, resulting in the second inverted isosceles triangle matrix.

[0063] Based on the above embodiments, the time-division multiple access network completes multiple access according to a time slot table. The time slot table allocation process involves arranging all transmit and receive communication pairs in the two inverted isosceles triangular matrices into the time slot table according to certain rules. The time slot arrangement rules determine in which time slot a node completes information transmission and in which time slot it completes information reception. In this embodiment of the invention, the time slot arrangement rules are as follows:

[0064] a) Arrange the rightmost diagonal line of the first inverted isosceles triangle array into the time slot table:

[0065] 1) The first transmit / receive communication pair on the right diagonal of the first inverted isosceles triangle array is the last transmit / receive communication pair in the first row of the first inverted isosceles triangle array. Its sending node ID is 1 and its receiving node ID is N.

[0066] 2) The second transmit / receive communication pair on the right diagonal of the first inverted isosceles triangle array is the last transmit / receive communication pair in the second row of the first inverted isosceles triangle array. Its transmitting node ID is 2 and its receiving node ID is N.

[0067] 3) Similarly, the last transmit / receive communication pair on the right diagonal of the first inverted isosceles triangle array is the transmit / receive communication pair in the last row of the first inverted isosceles triangle array, with the sending node ID being N-1 and the receiving node ID being N.

[0068] 4) Place the first transmit / receive communication pair on the right diagonal line into the first time slot of the time slot table, place the second transmit / receive communication pair on the right diagonal line into the second time slot of the time slot table, and so on until the last transmit / receive communication pair on the right diagonal line is placed into the time slot table.

[0069] b) Arrange the second diagonal line from the right of the first inverted isosceles triangle array into the time slot table:

[0070] 1) The first transmit and receive communication pair on the right second diagonal line of the first inverted isosceles triangle array is the second to last transmit and receive communication pair in the first row of the first inverted isosceles triangle array. Its transmitting node is 1 and its receiving node is N-1.

[0071] 2) The second transmit / receive communication pair on the right diagonal line of the first inverted isosceles triangle array is the second to last transmit / receive communication pair in the second row of the first inverted isosceles triangle array, with the sending node being 2 and the receiving node being N-1.

[0072] 3) By analogy, the last transmit / receive communication pair on the right second diagonal of an isosceles triangle is the first transmit / receive communication pair in the second-to-last row of the first inverted isosceles triangle array, with the sending node ID being N-2 and the receiving node ID being N-1.

[0073] 4) Next, in the time slot of the last transmit / receive communication pair on the right-hand diagonal line, the transmit / receive communication pairs on the right-hand second diagonal line are sequentially added to the time slot table.

[0074] c) By analogy, the first inverted isosceles triangle array is placed into the time slot table.

[0075] d) Arrange the second inverted isosceles triangle array into the time slot table:

[0076] 1) Arrange the transmit and receive communication pairs of the first row of the second inverted isosceles triangle array into the time slot table in order from right to left;

[0077] 2) Arrange the transmit and receive communication pairs of the second row of the second inverted isosceles triangle array into the time slot table in order from right to left;

[0078] 3) By analogy, the transmit and receive communication pairs in the last row of the second inverted isosceles triangle array are added to the time slot table.

[0079] e) Time slot allocation is complete.

[0080] The time slot arrangement process for the first inverted isosceles triangular matrix is ​​as follows: Figure 2 As shown in (a) above, the time slot arrangement process for the second inverted isosceles triangular matrix is ​​as follows: Figure 2 As shown in (b) of the diagram.

[0081] To gain a further understanding of the present invention, the following description is provided in conjunction with... Figure 3 and Figure 4 The time slot allocation method of the present invention will be described in detail using a 5-node network as an example.

[0082] Five nodes communicate in a network, with node IDs (numbers) ranging from 1 to 5. Following the aforementioned steps, two isosceles triangles are formed as follows: Figure 3 As shown. For the first isosceles triangle, the transmit and receive communication pairs along the right diagonal lines from right 1 to right 4 are sequentially arranged into the time slot table, as follows. Figure 4 The first row of the time slot table is shown; for the second isosceles triangle, the transmit and receive communication pairs from row 1 to row 4 are sequentially added to the time slot table from right to left, as follows: Figure 4 The second row of the time slot table shown represents the final time slot table as follows: Figure 4 As shown. From Figure 4 As can be seen, the time slot allocation scheme formed by this method ensures that there is a communication time slot between any two nodes, and the continuous transmission duration of any node is the time slot length. That is, no node has two consecutive time slots for transmission.

[0083] According to another aspect of the present invention, an electronic device is provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the steps of the distributed time division multiple access time slot allocation method proposed above in the present invention.

[0084] According to another aspect of the present invention, a computer-readable storage medium storing a computer program is provided, wherein when the computer program is executed by a processor, it implements the steps of the distributed time division multiple access time slot allocation method proposed above.

[0085] According to another aspect of the present invention, a distributed time division multiple access time slot allocation system is provided, the system including a node numbering module, a transceiver node design module and a time slot arrangement rule design module;

[0086] The node numbering module is used to number all nodes sequentially. Each node is both a sending node and a receiving node.

[0087] The transceiver node design module is used to construct the node mapping relationship of "transmitter node number -> receiver node number". If the sender node number is i, the corresponding receiver node number starts from i+1 and ends at the maximum node number. The value of node number i is incremented from 1 to the maximum node number minus 1. The resulting Ni node mapping relationships are arranged separately from left to right as the i-th row, forming the first inverted isosceles triangle matrix, where N is the total number of all nodes. The sender node number and receiver node number of each node mapping relationship in the first inverted isosceles triangle matrix are swapped to form a new node mapping relationship of "transmitter node number -> receiver node number", forming the second inverted isosceles triangle matrix.

[0088] The time slot arrangement rule design module is used to, for the first inverted isosceles triangular matrix, start from "1->N", follow the diagonal line to "(N-1)->N", and obtain N-1 node mapping relationships in sequence. Then, start from "1->(N-1)", follow the diagonal line to "(N-2)->(N-1)", and obtain N-2 node mapping relationships in sequence. This process continues until "1->2", where a node mapping relationship is obtained. For the second inverted isosceles triangular matrix, start from "N->1", follow the horizontal line to "2->1", and obtain N-1 node mapping relationships in sequence. Then, start from "N->2", follow the horizontal line to "3->2", and obtain N-2 node mapping relationships in sequence. This process continues until "N->(N-1)", where a node mapping relationship is obtained. The transmit and receive node pairs in each obtained node mapping relationship occupy one time slot in sequence to obtain a continuous time slot arrangement sequence.

[0089] In summary, this invention provides a distributed time division multiple access (TDMA) time slot allocation method, electronic device, medium, and system. This method sequentially numbers all nodes, assigning each node a unique ID. By constructing a node mapping relationship of "sending node number -> receiving node number," and forming two inverted isosceles triangular matrices according to certain rules, it ensures the fairness of the distributed TDMA network, guaranteeing that any two nodes within the network have equal communication opportunities. Each time slot contains exactly one transmit / receive communication pair. By arranging the transmit / receive communication pairs in the two inverted isosceles triangular matrices according to the arrangement rules, it achieves the discretization of node transmission time slots, ensuring that no node in the time slot table is in a transmitting state for two consecutive time slots. While ensuring the fairness of distributed TDMA, it compresses the continuous transmission time of nodes to the length of a single time slot, thereby reducing the continuous transmission duration of wireless communication equipment and alleviating the heat generated by continuous transmission. Compared with existing technologies, the technical solution of this invention can solve the technical problem of severe heat generation caused by long continuous transmission times in existing communication equipment.

[0090] For ease of description, spatial relative terms such as "above," "on top of," "on the upper surface of," "above," etc., are used herein to describe the spatial positional relationship of a device or feature as shown in the figures to other devices or features. It should be understood that spatial relative terms are intended to encompass different orientations in use or operation beyond the orientation of the device as described in the figures. For example, if the device in the figures were inverted, a device described as "above" or "on top of" other devices or structures would subsequently be positioned as "below" or "under" other devices or structures. Thus, the exemplary term "above" can include both "above" and "below." The device may also be positioned in other different ways (rotated 90 degrees or in other orientations), and the spatial relative descriptions used herein will be interpreted accordingly.

[0091] Furthermore, it should be noted that the use of terms such as "first" and "second" to define components is merely for the purpose of distinguishing the corresponding components. Unless otherwise stated, the above terms have no special meaning and therefore should not be construed as limiting the scope of protection of this invention.

[0092] The above description is merely a preferred embodiment of the present invention and is not intended to limit the invention. Various modifications and variations can be made to the present invention by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.

Claims

1. A method for distributed time division multiple access time slot assignment, characterized by, The method comprises: S1, sequentially numbering all nodes in order, each node being both a sending node and a receiving node; S2, constructing a node mapping relationship of "sending node number->receiving node number", wherein if the sending node number is i, the corresponding receiving node number starts from i+1 and ends at the maximum node number, the value of node number i is incremented from 1 to the maximum node number minus 1, and N-i node mapping relationships obtained each time are arranged from left to right as the ith row to form a first inverted isosceles triangular array, wherein N is the total number of all nodes; S3, inverting the sending node number and the receiving node number of each node mapping relationship in the first inverted isosceles triangular array to serve as a new node mapping relationship of "sending node number->receiving node number" to form a second inverted isosceles triangular array; S4, for the first inverted isosceles triangular array, starting from "1->N" and ending at "(N-1)->N", N-1 node mapping relationships are sequentially obtained, then starting from "1->(N-1)" and ending at "(N-2)->(N-1)", N-2 node mapping relationships are sequentially obtained, and the process is sequentially repeated until "1->2" to obtain one node mapping relationship; S5, for the second inverted isosceles triangular array, starting from "N->1" and ending at "2->1", N-1 node mapping relationships are sequentially obtained; then, starting from "N->2" and ending at "3->2", N-2 node mapping relationships are sequentially obtained, and the process is sequentially repeated until "N->(N-1)" to obtain one node mapping relationship; S6, sequentially occupying a time slot in order of the transceiving node pairs in each node mapping relationship obtained in S4 and S5 to obtain a continuous time slot arrangement sequence.

2. An electronic device, comprising: The computer program is executed by the processor to implement the steps of the distributed time division multiple access time slot allocation method of claim 1.

3. A computer readable storage medium storing a computer program, characterized in that, The computer program is executed by the processor to implement the steps of the distributed time division multiple access time slot allocation method of claim 1.

4. A distributed time division multiple access time slot allocation system, characterized by The system comprises a node numbering module, a transceiving node design module, and a time slot arrangement rule design module; The node numbering module is configured to sequentially number all nodes in order, each node being both a sending node and a receiving node; The node numbering module is configured to sequentially number all nodes in order, each node being both a sending node and a receiving node; The transceiver node design module is used to construct a node mapping relationship of "sending node number -> receiving node number". If the sending node number is i, the corresponding receiving node number starts from i+1 and ends at the maximum node number. The value of node number i is incremented from 1 to the maximum node number minus 1. The resulting Ni node mapping relationships are arranged separately from left to right as the i-th row, forming a first inverted isosceles triangle matrix, where N is the total number of all nodes. The sending node number and receiving node number of each node mapping relationship in the first inverted isosceles triangle matrix are swapped to form a new node mapping relationship of "sending node number -> receiving node number", forming a second inverted isosceles triangle matrix. The time slot arrangement rule design module is used to, for the first inverted isosceles triangular matrix, start from "1->N", follow the diagonal line to "(N-1)->N", and obtain N-1 node mapping relationships in sequence. Then, start from "1->(N-1)", follow the diagonal line to "(N-2)->(N-1)", and obtain N-2 node mapping relationships in sequence. This process continues until "1->2", where a node mapping relationship is obtained. For the second inverted isosceles triangular matrix, start from "N->1", follow the horizontal line to "2->1", and obtain N-1 node mapping relationships in sequence. Then, start from "N->2", follow the horizontal line to "3->2", and obtain N-2 node mapping relationships in sequence. This process continues until "N->(N-1)", where a node mapping relationship is obtained. The transmit and receive node pairs in each obtained node mapping relationship occupy one time slot in sequence to obtain a continuous time slot arrangement sequence.

Images