Time slot allocation method, controller, medium and product

Abstract

The embodiment of the invention provides a time slot allocation method, a controller, a medium and a product, and the method comprises the steps: a center node responds to a control message instruction before a scheduling period starts, and collects node messages of all nodes; then, acquiring a network message, constructing according to the network message to obtain a topological graph of a plurality of nodes, and further constructing the topological graph to obtain a non-interference graph; and then, for each time slot in a service period, the non-interference graph is calculated according to the node message to obtain a simultaneous transmission group, so that the time slots are allocated according to the simultaneous transmission group, and the simultaneous transmission group is a node set for simultaneously sending data. Therefore, according to the embodiment of the invention, the time slot can be allocated through the calculated simultaneous transmission group, so that efficient time slot allocation can be realized.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a time slot allocation method, controller, medium and product. Background Art

[0002] Among related technologies, with the rapid development of cellular networks and wireless local area networks, wireless network technology has been widely studied in academia. The market of the fifth-generation mobile communication technology and the advent of WiFi6 have also made wireless network technology have a greater leap forward, but these network technologies have high requirements for infrastructure (base stations) and are not suitable for some temporary networks.

[0003] In view of the above problems, a mobile ad hoc network technology is proposed. This type of network is a type of wireless local area network without fixed infrastructure. It has the advantages of flexible networking, strong anti-destruction capability, and rapid networking. It can not only meet the communication needs of temporary occasions such as emergency search and rescue, conference activities, etc., but also serve as an extension of existing wireless and wired networks to further broaden the network coverage.

[0004] However, in mobile ad hoc networks, when nodes use omnidirectional antennas, although the use of omnidirectional antennas allows signals to evenly cover all directions, thereby enhancing the flexibility of communication, it also poses a higher challenge to time slot allocation. Therefore, how to achieve efficient time slot allocation is the main problem currently facing the industry. Summary of the invention

[0005] The present application aims to solve at least one of the technical problems existing in the prior art. To this end, the present application proposes a time slot allocation method, a controller, a medium and a product, aiming to achieve efficient time slot allocation.

[0006] In a first aspect, an embodiment of the present application provides a time slot allocation method, characterized in that the method includes: In response to the control message instruction, collecting node messages of each node; Acquire network information, and construct according to the network information to obtain a topology diagram of the plurality of nodes; Constructing according to the topological graph to obtain an interference-free graph; For each time slot in a service cycle, the interference-free graph is calculated according to the node message by a clustering algorithm to obtain a simultaneous transmission group, wherein the simultaneous transmission group is a set of nodes for simultaneously sending data; Time slots are allocated according to the simultaneous transmission groups.

[0007] According to some embodiments of the present application, constructing according to the topological graph to obtain an interference-free graph includes: Using each node in the topological graph as a node of the interference-free graph; Connecting each node of the non-interference graph in pairs to obtain edges of the non-interference graph; The non-interference graph is obtained according to the nodes of the non-interference graph and the edges of the non-interference graph.

[0008] According to some embodiments of the present application, obtaining the non-interference graph according to the nodes of the non-interference graph and the edges of the non-interference graph includes: Obtaining the distance between two nodes represented by the edges of each of the interference-free graphs; Obtaining weights of edges of each of the interference-free graphs according to the distances; When the weight is equal to the preset weight, the corresponding edge of the interference-free graph is used as the target edge; A non-interference graph is obtained according to the nodes of each non-interference graph and the target edge.

[0009] According to some embodiments of the present application, obtaining the weight of each edge of the interference-free graph according to the distance includes one of the following: When the distance is greater than or equal to a preset threshold, the weight is zero; When the distance is less than the preset threshold, the weight is equal to one.

[0010] According to some embodiments of the present application, for each time slot in the service cycle, calculating the interference-free graph according to the node message by a clustering algorithm to obtain a simultaneous transmission group includes: Calculating each node in the interference-free graph to obtain a node weight; Obtaining a first simultaneous transmission group according to a first node corresponding to one of the time slots in the service cycle; Obtaining a node that is not adjacent to the first node according to the node message corresponding to the first node; Removing the first node from the non-interference graph, and removing nodes that are not adjacent to the first node; The simultaneous transmission group is obtained according to the node weights corresponding to the remaining nodes in the interference-free graph and the first simultaneous transmission group.

[0011] According to some embodiments of the present application, obtaining the simultaneous transmission group according to the node weights corresponding to the remaining nodes in the interference-free graph and the first simultaneous transmission group includes: Sort the remaining nodes in the interference-free graph according to the corresponding node weights, and obtain the second node with the largest node weight; adding the second node to the first simultaneous propagation group to obtain a second simultaneous propagation group; removing the second node from the interference-free graph; The simultaneous transmission group is obtained according to the interference-free graph and the second simultaneous transmission group.

[0012] According to some embodiments of the present application, obtaining the simultaneous transmission group according to the interference-free graph and the second simultaneous transmission group includes: If the interference-free graph has no remaining nodes, using the second simultaneous propagation group as the simultaneous propagation group; If there are remaining nodes in the non-interference graph, return to step to sort the remaining nodes in the non-interference graph according to the corresponding node weights, and obtain the second node with the largest node weight until there are no remaining nodes in the non-interference graph.

[0013] In a second aspect, an embodiment of the present application provides a controller, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the time slot allocation method of the first aspect when executing the computer program.

[0014] In a third aspect, an embodiment of the present application provides a computer-readable storage medium storing computer-executable instructions, wherein the computer-executable instructions are used to execute the time slot allocation method as described in the first aspect above.

[0015] In a fourth aspect, an embodiment of the present application provides a computer program product, comprising a computer program or computer instructions, characterized in that the computer program or the computer instructions are stored in a computer-readable storage medium, a processor of a computer device reads the computer program or the computer instructions from the computer-readable storage medium, and the processor executes the computer program or the computer instructions, so that the computer device executes the time slot allocation method as described in the first aspect above.

[0016] According to the technical solution of the embodiment of the present application, at least the following beneficial effects are achieved: the embodiment of the present application proposes a time slot allocation method, a controller, a medium and a product, the method comprising: before a scheduling cycle starts, the central node will respond to the control message instruction to collect the node messages of each node; then, the network message is acquired, and then a topology map of multiple nodes is obtained according to the network message, and then the topology map is constructed to obtain a non-interference graph; then, for each time slot in a service cycle, the non-interference graph is calculated according to the node message to obtain a simultaneous transmission group, and then the time slot is allocated according to the simultaneous transmission group, wherein the simultaneous transmission group is a set of nodes for simultaneously sending data. Therefore, the embodiment of the present application can allocate time slots by calculating the simultaneous transmission group, so as to achieve efficient time slot allocation.

[0017] Additional aspects and advantages of the present application will be given in part in the description below, and in part will become apparent from the description below, or will be learned through the practice of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] The accompanying drawings are used to provide further understanding of the technical solution of the present application and constitute a part of the specification. Together with the embodiments of the present application, they are used to explain the technical solution of the present application and do not constitute a limitation on the technical solution of the present application.

[0019] Figure 1 is a flowchart of a time slot allocation method provided by an embodiment of the present application; Figure 2 is a flowchart of a time slot allocation method provided by another embodiment of the present application; Figure 3 is a flowchart of a time slot allocation method provided by another embodiment of the present application; Figure 4 is a flowchart of a time slot allocation method provided by another embodiment of the present application; Figure 5 is a flowchart of a time slot allocation method provided by another embodiment of the present application; Figure 6 is a flowchart of a time slot allocation method provided by another embodiment of the present application; Figure 7 is a flowchart of a time slot allocation method provided by another embodiment of the present application; Figure 8 is a flow chart of a time slot allocation method provided by an overall embodiment of the present application; Fig. 9 is a topological diagram provided by an embodiment of the present application; Fig.10 It is an initialization interference-free graph provided by an embodiment of the application itself; Fig.11 It is an interference-free graph provided by an embodiment of the application itself; Fig.12 It is a schematic diagram of a controller for executing a time slot allocation method provided by an embodiment of the present application. DETAILED DESCRIPTION

[0020] The embodiments of the present application are described in detail below, and examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present application, and cannot be understood as limiting the present application.

[0021] In the description of the present application, it should be understood that descriptions involving orientation, such as up, down, front, back, left, right, etc., indicating orientations or positional relationships, are based on the orientations or positional relationships shown in the accompanying drawings, and are only for the convenience of describing the present application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore should not be understood as a limitation on the present application.

[0022] In the description of this application, "several" means one or more, "more" means more than two, "greater than", "less than", "exceed", etc. are understood to exclude the number itself, and "above", "below", "within", etc. are understood to include the number itself. If there is a description of "first" or "second", it is only used for the purpose of distinguishing technical features, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features or implicitly indicating the order of the indicated technical features.

[0023] In the description of this application, unless otherwise clearly defined, terms such as setting, installing, connecting, etc. should be understood in a broad sense, and technicians in the relevant technical field can reasonably determine the specific meanings of the above terms in this application based on the specific content of the technical solution.

[0024] In some cases, with the rapid development of cellular networks and wireless local area networks, wireless network technology has been widely studied in academia. The market of the fifth-generation mobile communication technology and the advent of WiFi6 have also made wireless network technology have a greater leap, but these network technologies have high requirements for infrastructure (base stations) and are not suitable for some temporary networks.

[0025] In view of the above problems, a mobile ad hoc network technology is proposed. This type of network is a type of wireless local area network without fixed infrastructure. It has the advantages of flexible networking, strong anti-destruction capability, and rapid networking. It can not only meet the communication needs of temporary occasions such as emergency search and rescue, conference activities, etc., but also serve as an extension of existing wireless and wired networks to further broaden the network coverage.

[0026] However, in mobile ad hoc networks, when nodes use omnidirectional antennas, although the use of omnidirectional antennas allows signals to evenly cover all directions, thereby enhancing the flexibility of communication, it also poses a higher challenge to time slot allocation. Therefore, how to achieve efficient time slot allocation is the main problem currently facing the industry.

[0027] Based on the above situation, the embodiments of the present application propose a time slot allocation method, controller, medium and product, aiming to achieve efficient time slot allocation.

[0028] The following further describes various embodiments of the time slot allocation method of the present application in conjunction with the accompanying drawings.

[0029] like Figure 1As shown, Figure 1 It is a flowchart of a time slot allocation method provided by an embodiment of the present application; the time slot allocation method may include but is not limited to step S110, step S120, step S130, step S140 and step S150.

[0030] Step S110, in response to the control message instruction, collecting node messages of each node; Step S120: Obtain network information, construct according to the network information, and obtain a topology diagram of multiple nodes; Step S130, constructing according to the topological map to obtain an interference-free map; Step S140: For each time slot in the service cycle, the interference-free graph is calculated according to the node message by using a clustering algorithm to obtain a simultaneous transmission group, wherein the simultaneous transmission group is a set of nodes for simultaneously sending data; Step S150: Allocate time slots according to the simultaneous transmission group.

[0031] In one embodiment, before a scheduling cycle begins, the central node will respond to the control message instruction to collect the node messages of each node; then, the network message is obtained, and a topology map of multiple nodes is constructed according to the network message, and then the topology map is constructed to obtain an interference-free graph; then, for each time slot in a service cycle, the interference-free graph is calculated according to the node message to obtain a simultaneous transmission group, and the time slot is allocated according to the simultaneous transmission group, wherein the simultaneous transmission group is a set of nodes used to send data simultaneously.

[0032] It is worth noting that the embodiments of the present application can allocate time slots through the calculated simultaneous transmission groups, thereby achieving efficient time slot allocation.

[0033] It is understandable that the central node will periodically calculate the time slot allocation method, that is, the time slot allocation method will be calculated once in one scheduling cycle to obtain a new simultaneous propagation group. If the node does not receive a new simultaneous propagation group, the node will use the old simultaneous propagation group for time slot allocation.

[0034] It is understandable that each service cycle within the same scheduling cycle will be assigned time slots according to a consistent simultaneous propagation group.

[0035] It can be understood that a scheduling cycle is divided into several small service cycles.

[0036] It can be understood that the length of the service cycle is equal to the number of nodes in the network. When the remaining time of the scheduling cycle is not enough to complete a complete service cycle, the service cycle is truncated.

[0037] It can be understood that the above-mentioned node message may include node location message, one-hop neighbor message of the node, and business data volume of different priorities of the node.

[0038] It can be understood that each time slot in the service cycle corresponds to a communication node, and the time slots and communication nodes in the service cycle correspond one to one.

[0039] In addition, if Figure 2 As shown, Figure 2 It is a flowchart of a time slot allocation method provided by another embodiment of the present application; regarding the above-mentioned step S130, it may include but is not limited to step S210, step S220 and step S230.

[0040] Step S210, taking each node in the topology graph as a node of the non-interference graph; Step S220, connecting the nodes of each non-interference graph in pairs to obtain the edges of the non-interference graph; Step S230: Obtain a non-interference graph according to the nodes and edges of the non-interference graph.

[0041] In one embodiment, first, the embodiment of the present application initializes the interference-free graph, and uses each node in the topology graph as a node in the interference-free graph; then, any two nodes in the interference-free graph are connected to each other to obtain the edge of the interference-free graph; finally, the interference-free graph is obtained based on the nodes and edges of the interference-free graph.

[0042] In addition, if Figure 3 As shown, Figure 3 It is a flowchart of a time slot allocation method provided by another embodiment of the present application; regarding the above-mentioned step S230, it may include but is not limited to step S310, step S320, step S330 and step S340.

[0043] Step S310, obtaining the distance between two nodes represented by the edge of each non-interference graph; Step S320, obtaining the weight of each edge of the interference-free graph according to the distance; Step S330: When the weight is equal to the preset weight, the corresponding edge of the non-interference graph is used as the target edge; Step S340: Obtain a non-interference graph according to the nodes and target edges of each non-interference graph.

[0044] In one embodiment, first, the embodiment of the present application obtains the distance between the two nodes represented by the edge of each interference-free graph, thereby obtaining the weight of the edge of each interference-free graph through the distance; then, when the weight is equal to the preset weight, the edge of the corresponding interference-free graph is used as the target edge, thereby obtaining the interference-free graph based on the nodes and target edges of each interference-free graph.

[0045] It is understandable that the above-mentioned preset weights can be set according to actual needs, and the embodiment of the present application does not specifically limit the size of the preset weights.

[0046] In addition, if Figure 4 As shown, Figure 4 It is a flowchart of a time slot allocation method provided by another embodiment of the present application; regarding the above-mentioned step S320, it may include but is not limited to step S410 and step S420.

[0047] Step S410: When the distance is greater than or equal to a preset threshold, the weight is zero; Step S420: When the distance is less than a preset threshold, the weight is equal to one.

[0048] It is understandable that the above-mentioned preset threshold can be set according to actual needs, and the embodiment of the present application does not specifically limit the size of the preset threshold. Exemplarily, the preset weight is set to one, and when the distance is less than a preset threshold, the weight is equal to one, that is, the weight is equal to the preset weight, and the edge of the non-interference graph is used as the target edge.

[0049] It can be understood that when the distance is greater than or equal to the preset threshold, it can be considered that the two nodes can send messages simultaneously, thereby ignoring the edges with zero weight in the non-interference graph.

[0050] In addition, if Figure 5 As shown, Figure 5 It is a flowchart of a time slot allocation method provided by another embodiment of the present application; regarding the above-mentioned step S140, it may include but is not limited to step S510, step S520, step S530, step S540 and step S550.

[0051] Step S510, calculating the nodes in each non-interference graph to obtain the node weight; Step S520, obtaining a first simultaneous transmission group according to a first node corresponding to a time slot in a service cycle; Step S530: obtaining nodes that are not adjacent to the first node according to the node message corresponding to the first node; Step S540: remove the first node from the non-interference graph, and remove nodes that are not adjacent to the first node; Step S550: Obtain a simultaneous transmission group according to the node weights corresponding to the remaining nodes in the interference-free graph and the first simultaneous transmission group.

[0052] In one embodiment, for each node in the interference-free graph, the node weight of each node is calculated; then, a first simultaneous transmission group is obtained based on the first node corresponding to a time slot in a service cycle; since the node message of each node includes a node position message, the nodes that are not adjacent to the first node can be obtained based on the node message corresponding to the first node; then, the first node and the nodes that are not adjacent to the first node are removed from the interference-free graph; finally, a simultaneous transmission group is obtained based on the weights corresponding to the remaining nodes in the interference-free graph and the first simultaneous transmission group.

[0053] It is understandable that the node weight is recorded as ,in, Represented as node weight, Indicates the business weight of the node, Represented as the number of times the node is scheduled.

[0054] Understandably, , where k represents different priorities, represents the priority weight, Representation Node The payload size of the packet with priority k.

[0055] In addition, if Figure 6 As shown, Figure 6 It is a flowchart of a time slot allocation method provided by another embodiment of the present application; regarding the above-mentioned step S550, it may include but is not limited to step S610, step S620, step S630 and step S640.

[0056] Step S610, sort the remaining nodes in the non-interference graph according to the corresponding node weights, and obtain the second node with the largest node weight; Step S620: adding the second node to the first simultaneous propagation group to obtain a second simultaneous propagation group; Step S630, removing the second node from the non-interference graph; Step S640: Obtain a simultaneous transmission group according to the interference-free graph and the second simultaneous transmission group.

[0057] In one embodiment, the remaining nodes in the non-interference graph are sorted according to the corresponding node weights to obtain the remaining sorted nodes, thereby obtaining the node with the largest node weight to obtain the second node; then, the second node is added to the first simultaneous propagation group to obtain the second simultaneous propagation group, and the second node is removed from the non-interference graph; In addition, if Figure 7 As shown, Figure 7 It is a flowchart of a time slot allocation method provided by another embodiment of the present application; regarding the above-mentioned step S640, it may include but is not limited to step S710 and step S720.

[0058] Step S710: If there are no remaining nodes in the non-interference graph, the second simultaneous propagation group is used as the simultaneous propagation group; Step S720: If there are any remaining nodes in the non-interference graph, return to step S720 to sort the remaining nodes in the non-interference graph according to the corresponding node weights, and obtain the second node with the largest node weight until there are no remaining nodes in the non-interference graph.

[0059] It can be understood that when there are no remaining nodes in the interference-free graph, the second simultaneous propagation group is used as the simultaneous propagation group; when there are still remaining nodes in the interference-free graph, the process returns to the step of sorting the remaining nodes in the interference-free graph according to the corresponding node weights, and obtaining the second node with the largest node weight, until there are no remaining nodes in the interference-free graph, and the second simultaneous propagation group at this time is used as the simultaneous propagation group, thereby allocating time slots according to the simultaneous propagation group.

[0060] Based on the time slot allocation methods of the above-mentioned various embodiments, overall embodiments of the time slot allocation method of the present application are respectively proposed below.

[0061] like Figure 8 , Fig. 9 , Fig.10 and Fig.11 As shown, Figure 8 is a flowchart of a time slot allocation method provided by an overall embodiment of the present application, Fig. 9 is a topological diagram provided by an embodiment of the present application, Fig.10 An embodiment of the present invention provides an initialization non-interference graph. Fig.11 It is an interference-free graph provided by an embodiment of the application itself.

[0062] (1) The central node will periodically calculate the simultaneous transmission group, and the scheduling period is set to 100 time slots.

[0063] (2) Before a scheduling cycle begins, the central node collects individual information from each node through control message instructions. Then, the central node starts calculation.

[0064] (3) The central node constructs a topology map based on the known network information, and regards a certain communication node in the network as a node in the topology map. If two communication nodes can communicate with each other, then in the topology map, the two nodes are connected by an edge. In the embodiment of the present application, the topology map is as follows: Fig. 9 As shown, it is concluded that the business cycle is 6 nodes. There are 16 business cycles in a scheduling cycle.

[0065] (4) The central node constructs an interference-free graph based on the topological graph. The sub-steps are as follows: 1. Initialize the non-interference graph. Record a node in the topology graph as a node in the non-interference graph. Connect any two nodes in the non-interference graph to each other and record them as an edge in the non-interference graph. Fig.10 shown.

[0066] 2. For each edge in the interference-free graph, calculate the weight of the edge. When the distance between the two nodes of the edge is lower than the preset threshold, the weight of the edge is 1; when the distance is higher than the preset threshold, it is recorded as 0. Ignore the edges with a weight of 0 in the interference-free graph. In the embodiment of the present application, the preset threshold is defined as 3 hops between the two sending nodes.

[0067] (5) For a time slot in a service cycle, each node is regarded as a scheduling node to perform a clustering algorithm. In the embodiment of the present application, the first scheduling node is node 1.

[0068] (6) Through the clustering algorithm, the simultaneous transmission group of the time slot can be found. The sub-steps are as follows: 1. For each node in the interference-free graph, calculate the node weight of the node and sort them from large to small according to the weight. In the embodiment of the present application, the node weight is set to 1.

[0069] 2. The node corresponding to the time slot is added to the simultaneous propagation group and removed from the interference-free graph point set.

[0070] 3. Remove the nodes that are not adjacent to the node in the interference-free graph.

[0071] 4. From the remaining nodes in the interference-free graph, select the node with the largest weight and add it to the simultaneous transmission group.

[0072] 5. Delete the non-adjacent nodes of the node with the largest weight from the non-interference graph. Delete the node with the largest weight from the non-interference graph.

[0073] 6. If there are no more remaining nodes in the interference-free graph, end; otherwise, jump to sub-step 4.

[0074] 7. Update the node scheduling times.

[0075] In the embodiment of the present application, the final simultaneous transmission groups of node 1 are 1, 5, and 6, which is equivalent to node 1, node 5, and node 6 being able to send data simultaneously in time slot 0.

[0076] (7) The center sends the time slot allocation results to all nodes.

[0077] It is worth noting that the embodiment of the present application utilizes the interference-free graph clustering method to achieve spatial multiplexing, thereby greatly improving channel utilization; in addition, by dividing the scheduling cycle and the service cycle, the computational complexity and time complexity are reduced, thereby better meeting the communication requirements; in addition, the embodiment of the present application ensures that each node can send data within a cycle, thereby better meeting the latency requirements.

[0078] Based on the time slot allocation methods of the above-mentioned various embodiments, various embodiments of the controller, computer-readable storage medium and computer program product of the present application are respectively proposed below.

[0079] like Fig.12 As shown, Fig.12 700 is a schematic diagram of a controller for executing a time slot allocation method provided by an embodiment of the present application. The controller 700 implemented in the present application includes: a processor 710, a memory 720, and a computer program stored in the memory 720 and executable on the processor 710, wherein: Fig.12 In the figure, a processor 710 and a memory 720 are taken as an example.

[0080] The processor 710 and the memory 720 may be connected via a bus or other means. Fig.12 The example of connecting through bus is taken in the following.

[0081] The memory 720, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs and non-transitory computer executable programs. In addition, the memory 720 may include a high-speed random access memory, and may also include a non-transitory memory, such as at least one disk storage device, a flash memory device, or other non-transitory solid-state storage device. In some embodiments, the memory 720 may optionally include a memory 720 remotely arranged relative to the processor 710, and these remote memories 720 may be connected to the controller 700 via a network. Application embodiments of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0082] Those skilled in the art will understand that Fig.12 The device structure shown in the figure does not constitute a limitation on the controller 700, and may include more or less components than shown in the figure, or combine certain components, or arrange the components differently.

[0083] exist Fig.12 In the controller 700 shown, the processor 710 can be used to call the control program stored in the memory 720, so as to implement the above-mentioned time slot allocation method. Specifically, the non-transient software program and instructions required to implement the time slot allocation method of the above-mentioned embodiment are stored in the memory 720, and when executed by the processor 710, the time slot allocation method of the above-mentioned embodiment is executed.

[0084] It is worth noting that since the controller 700 of the embodiment of the present application can execute the time slot allocation method of any of the above-mentioned embodiments, the specific implementation manner and technical effects of the controller 700 of the embodiment of the present application can refer to the specific implementation manner and technical effects of the time slot allocation method of any of the above-mentioned embodiments.

[0085] In addition, an embodiment of the present application further provides a computer-readable storage medium, which stores computer-executable instructions, and the computer-executable instructions are used to execute the above-described time slot allocation method. Figures 1 to 7 The method steps in .

[0086] It is worth noting that since the computer-readable storage medium of the embodiments of the present application can execute the time slot allocation method of any of the above embodiments, the specific implementation methods and technical effects of the computer-readable storage medium of the embodiments of the present application can refer to the specific implementation methods and technical effects of the time slot allocation method of any of the above embodiments.

[0087] In addition, an embodiment of the present application further provides a computer program product, including a computer program or a computer instruction, the computer program or the computer instruction is stored in a computer-readable storage medium, the processor of the computer device reads the computer program or the computer instruction from the computer-readable storage medium, and the processor executes the computer program or the computer instruction, so that the computer device executes the above-described time slot allocation method. Figures 1 to 7 The method steps in .

[0088] It is worth noting that since the computer program product of the embodiments of the present application can execute the time slot allocation method of any of the above embodiments, the specific implementation methods and technical effects of the computer program product of the embodiments of the present application can refer to the specific implementation methods and technical effects of the time slot allocation method of any of the above embodiments.

[0089] It will be appreciated by those skilled in the art that all or some of the steps and systems in the methods disclosed above may be implemented as software, firmware, hardware, and appropriate combinations thereof. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-transitory medium) and a communication medium (or transient medium). As known to those skilled in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically include computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0090] It should be understood that in the present application, "at least one (item)" means one or more, and "plurality" means two or more. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the objects associated before and after are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.

[0091] In several embodiments provided in the present application, it should be understood that the disclosed systems, apparatuses and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely schematic, for example, the division of units is only a logical function division, and there may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of apparatuses or units, which can be electrical, mechanical or other forms. The units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the scheme of this embodiment.

[0092] It should also be understood that the various implementations provided in the embodiments of the present application can be combined arbitrarily to achieve different technical effects.

[0093] The above is a specific description of the preferred implementation of the present application, but the present application is not limited to the above implementation mode. Technical personnel familiar with the field can also make various equivalent modifications or substitutions under the shared conditions without violating the spirit of the present application. These equivalent modifications or substitutions are all included in the scope defined by the claims of the present application.

Claims

1. A time slot allocation method, characterized in that: The method comprises: In response to the control message instruction, collecting node messages of each node; Acquire network information, and construct according to the network information to obtain a topology diagram of the plurality of nodes; Constructing according to the topological graph to obtain an interference-free graph; For each time slot in a service cycle, the interference-free graph is calculated according to the node message by a clustering algorithm to obtain a simultaneous transmission group, wherein the simultaneous transmission group is a set of nodes for simultaneously sending data; Time slots are allocated according to the simultaneous transmission groups.

2. A time slot allocation method according to claim 1, characterized in that: The step of constructing according to the topological graph to obtain an interference-free graph includes: Using each node in the topological graph as a node of the interference-free graph; Connecting each node of the non-interference graph in pairs to obtain edges of the non-interference graph; The non-interference graph is obtained according to the nodes of the non-interference graph and the edges of the non-interference graph.

3. A time slot allocation method according to claim 2, characterized in that: The obtaining the non-interference graph according to the nodes of the non-interference graph and the edges of the non-interference graph comprises: Obtaining the distance between two nodes represented by the edges of each of the interference-free graphs; Obtaining weights of edges of each of the interference-free graphs according to the distances; When the weight is equal to the preset weight, the corresponding edge of the interference-free graph is used as the target edge; A non-interference graph is obtained according to the nodes of each non-interference graph and the target edge.

4. A time slot allocation method according to claim 3, characterized in that: The step of obtaining the weight of each edge of the interference-free graph according to the distance includes one of the following: When the distance is greater than or equal to a preset threshold, the weight is zero; When the distance is less than the preset threshold, the weight is equal to one.

5. A time slot allocation method according to claim 1, characterized in that: For each time slot in the service cycle, the interference-free graph is calculated according to the node message by using a clustering algorithm to obtain a simultaneous transmission group, including: Calculating each node in the interference-free graph to obtain a node weight; Obtaining a first simultaneous transmission group according to a first node corresponding to one of the time slots in the service cycle; Obtaining a node that is not adjacent to the first node according to the node message corresponding to the first node; Removing the first node from the non-interference graph, and removing nodes that are not adjacent to the first node; The simultaneous transmission group is obtained according to the node weights corresponding to the remaining nodes in the interference-free graph and the first simultaneous transmission group.

6. A time slot allocation method according to claim 5, characterized in that: The obtaining the simultaneous transmission group according to the node weights corresponding to the remaining nodes in the non-interference graph and the first simultaneous transmission group comprises: Sort the remaining nodes in the interference-free graph according to the corresponding node weights, and obtain the second node with the largest node weight; adding the second node to the first simultaneous propagation group to obtain a second simultaneous propagation group; removing the second node from the interference-free graph; The simultaneous transmission group is obtained according to the interference-free graph and the second simultaneous transmission group.

7. A time slot allocation method according to claim 6, characterized in that: The obtaining the simultaneous transmission group according to the interference-free graph and the second simultaneous transmission group comprises: If the interference-free graph has no remaining nodes, using the second simultaneous propagation group as the simultaneous propagation group; If there are remaining nodes in the non-interference graph, return to step to sort the remaining nodes in the non-interference graph according to the corresponding node weights, and obtain the second node with the largest node weight until there are no remaining nodes in the non-interference graph.

8. A controller, characterized in that: include: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the time slot allocation method according to any one of claims 1 to 7 when executing the computer program.

9. A computer-readable storage medium, characterized in that: Computer executable instructions are stored, and the computer executable instructions are used to execute the time slot allocation method according to any one of claims 1 to 7.

10. A computer program product comprising a computer program or computer instructions, characterized in that The computer program or the computer instructions are stored in a computer-readable storage medium, and a processor of a computer device reads the computer program or the computer instructions from the computer-readable storage medium. The processor executes the computer program or the computer instructions, so that the computer device executes the time slot allocation method as described in any one of claims 1 to 7.

Images