A time slot resource allocation method, apparatus, device and medium

Abstract

The application discloses a time slot resource allocation method and device, equipment and medium, and relates to the technical field of wireless communication. According to the method, the position codes of nodes in a train-ground wireless communication system are set, the neighbor table and the routing table corresponding to the nodes are constructed, the neighbor relationship between the nodes and other nodes and the corresponding data forwarding path information are determined, and thus the real-time network topology structure is obtained. When a node confirms that there is a communication demand, the target routing corresponding to the node is selected according to the corresponding neighbor table and routing table, and the time slot resource corresponding to the node is determined according to the target routing, so that the cooperation of the best routing discovery and dynamic time slot allocation is realized, the network topology change can be better adapted to, the flexible grouping demand can be met, and the time slot resource utilization rate and the communication service carrying capacity are improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of wireless communication, in particular to a time slot resource allocation method and device, equipment and medium. BACKGROUND

[0002] In a train-ground wireless system, fixed time slot allocation provides dedicated communication resources for each vehicle or device, avoiding interference and conflict. However, the rail transit system faces the problem of waste of transport capacity caused by uneven passenger flow distribution and fixed marshalling. The passenger flow difference between peak and off-peak periods is significant, and the fixed marshalling mode also brings high energy consumption.

[0003] Specifically, in terms of communication, the spectrum below 6GHz is in short supply and has low utilization, and the existing routing strategy does not fully utilize the rail topology regularity. When high-speed maglev trains are virtually coupled, the safety interval exceeds the coverage range of direct train-to-train communication, and train-to-ground multi-hop routing is needed to achieve communication. However, the fixed time slot allocation of the existing train-ground wireless system cannot adapt to the network topology changes brought by flexible marshalling, resulting in time slot waste and insufficient business carrying capacity.

[0004] In view of the above, how to solve the problem that the fixed time slot allocation of the existing train-ground wireless system cannot adapt to the network topology changes brought by flexible marshalling, resulting in time slot waste and insufficient business carrying capacity, is a problem that technicians in this field need to solve. SUMMARY

[0005] The purpose of the present application is to provide a time slot resource allocation method, device, equipment and medium to solve the problem that the fixed time slot allocation of the existing train-ground wireless system cannot adapt to the network topology changes brought by flexible marshalling, resulting in time slot waste and insufficient business carrying capacity.

[0006] To solve the above technical problems, the present application provides a time slot resource allocation method applied to a train-ground wireless communication system; the train-ground wireless communication system includes a plurality of nodes, and the nodes are communicatively connected; wherein the nodes at least include a ground wireless unit and a vehicle-mounted wireless terminal; the method comprises:

[0007] Setting the position code of each node, and constructing the neighbor table corresponding to each node according to each position code; wherein the neighbor table contains the neighbor relationship between the corresponding node and other nodes;

[0008] Constructing a routing table corresponding to each node according to each neighbor table; wherein the routing table contains the data forwarding path information of the corresponding node;

[0009] Selecting a master node in each node, and determining whether each node has a communication demand;

[0010] If yes, a target route corresponding to the node is selected according to the corresponding neighbor table and the routing table, a time slot resource corresponding to the node is determined according to the target route, and preliminary occupation information of the time slot resource is sent to the master node;

[0011] The master node broadcasts a wireless control message to the remaining nodes; wherein the wireless control message at least contains final occupation information of the time slot resource and backoff information.

[0012] On the one hand, the position code of each node is set, and the neighbor table corresponding to each node is constructed according to the position code of each node, including:

[0013] The track section number and the marshalling sequence number of each node are obtained, and the position code of each node is determined according to the track section number and the marshalling sequence number of each node;

[0014] The signal strength, the bit error rate, the CPU load and the direction information of the corresponding adjacent node of each node are collected;

[0015] The neighbor table corresponding to each node is generated according to the position code of each node and the signal strength, the bit error rate, the CPU load and the direction information of the corresponding adjacent node of each node.

[0016] On the other hand, the routing table corresponding to each node is constructed according to each neighbor table, including:

[0017] The link survival period corresponding to the node is determined according to the current speed of the train, the braking coefficient and the curve radius of the track section where the node is located;

[0018] The destination node of the corresponding communication service is determined according to the communication demand of the node;

[0019] The next hop address, the next hop load and the hop count of the destination node are determined according to the corresponding neighbor table, so as to determine the routing link and determine the real-time signal strength and the real-time bit error rate corresponding to the routing link;

[0020] The link stability value of the routing link is determined according to the real-time signal strength and the real-time bit error rate;

[0021] The routing table corresponding to the node is generated according to the destination node, the next hop address, the next hop load, the hop count, the link survival period and the link stability value.

[0022] On the other hand, the master node is selected in each node, including:

[0023] The neighbor table and the routing table corresponding to each node are obtained;

[0024] The node whose update time of the corresponding routing table meets the preset requirement, whose CPU load is less than the load threshold, and whose signal strength is greater than the signal strength threshold is determined as the master node according to each neighbor table and the routing table;

[0025] The update time is an average value of update times of valid routing entries in the routing table.

[0026] On the other hand, the target route corresponding to the node is selected according to the corresponding neighbor table and the routing table, and the target route comprises:

[0027] According to the corresponding neighbor table and the routing table, the bend flag, the CPU load and the link stability value of the node are determined.

[0028] The bend flag, the CPU load and the link stability value are input into a state space of a dynamic weight routing selection model to determine a routing comprehensive score weight corresponding to the node, wherein the dynamic weight routing selection model is a Q value function model trained in advance based on historical data and used for predicting the routing comprehensive score weight.

[0029] According to the routing comprehensive score weight and a routing comprehensive score calculation formula, a routing comprehensive score of each route corresponding to the node is determined.

[0030] The route with the highest corresponding routing comprehensive score is determined as the target route of the node.

[0031] On the other hand, the time slot resource corresponding to the node is determined according to the target route, and the time slot resource comprises:

[0032] The protection time slot interval is determined according to the current speed of the train.

[0033] The three-dimensional resource matrix is globally allocated according to the target route and the Hungarian algorithm, and the frequency points or time slots of adjacent nodes are controlled to be different, so as to generate the time slot resource corresponding to the node, wherein the dimensions of the three-dimensional resource matrix comprise time slots, frequency bands and track section numbers.

[0034] The protection time slot interval is inserted into the time slot resource corresponding to the node.

[0035] On the other hand, before the protection time slot interval is inserted into the time slot resource corresponding to the node, after the time slot resource corresponding to the node is generated, the method further comprises:

[0036] When the master node receives the occupation information of the corresponding preliminary time slot resource unicast by each node, whether there is a resource conflict is judged by the master node according to the occupation information of the time slot resource corresponding to each node, wherein the occupation information of the time slot resource comprises the routing comprehensive score of the target route of the corresponding node.

[0037] If yes, the node occupying the corresponding time slot resource is controlled among the nodes with a resource conflict and a distance from the train head satisfying a preset distance.

[0038] The rest of the nodes perform a binary exponential backoff strategy, and return to the step of globally allocating the three-dimensional resource matrix according to the target route and the Hungarian algorithm after a preset time delay; wherein the specific process of the nodes performing the binary exponential backoff strategy comprises: determining the current count value of the conflict counter; uniformly randomly selecting an integer as a target integer from a preset integer set according to the count value; each integer in the preset integer set is a positive integer; determining the preset time corresponding to each node according to the time slot unit value, the target integer, the route comprehensive score of the target route of each node, and the average value of the route comprehensive score of the target route of each node;

[0039] If not, go to the step of inserting the protection time slot interval into the time slot resource corresponding to the node.

[0040] On the other hand, the master node broadcasts a wireless control message to the rest of the nodes, including:

[0041] The master node broadcasts a wireless control message to the rest of the nodes at a preset period;

[0042] The wireless control message includes a consistency protocol header, a route update flag, a time slot update flag, direction information, link state, CPU load, route data, and time slot occupation data.

[0043] On the other hand, before selecting the target route corresponding to the node according to the corresponding neighbor table and the route table, after confirming that the node has a communication demand, it further includes:

[0044] Determine whether the node has a valid route according to the corresponding route table;

[0045] If yes, go to the step of selecting the target route corresponding to the node according to the corresponding neighbor table and the route table;

[0046] If not, output a prompt information indicating that the node does not have a valid route, and return to the step of determining whether the node has a valid route according to the corresponding route table.

[0047] On the other hand, it further includes:

[0048] Determine whether there is a route invalid node;

[0049] If yes, trigger the route update of the route invalid node, release the time slot resource occupied by the route invalid node, and update the corresponding time slot table;

[0050] Update the neighbor table and the route table corresponding to the route invalid node, and broadcast the updated part of the route table and the time slot table of the route invalid node through the master node;

[0051] According to the updated neighbor table and the route table of the route invalid node, re-allocate the corresponding time slot resource to the route invalid node.

[0052] In another aspect, the method further comprises:

[0053] determining whether the utilization rate of the three-dimensional resource matrix is greater than a utilization rate threshold;

[0054] If yes, increasing the hop weight of the dynamic weight routing model by the master node.

[0055] In another aspect, after broadcasting the wireless control message to the remaining nodes by the master node, the method further comprises:

[0056] synchronizing the corresponding routing table and time slot table to the remaining nodes by the master node.

[0057] To solve the above technical problems, the application further provides a time slot resource allocation device applied to a train-ground wireless communication system; the train-ground wireless communication system comprises a plurality of nodes, and the nodes are communicatively connected; wherein, the nodes at least comprise a ground wireless unit and a vehicle-mounted wireless terminal; the device comprises:

[0058] a first construction module for setting position encodings of the nodes and constructing corresponding neighbor tables of the nodes according to the position encodings; wherein, the neighbor table contains neighbor relationships between the corresponding node and other nodes;

[0059] a second construction module for constructing corresponding routing tables of the nodes according to the neighbor tables; wherein, the routing table contains data forwarding path information of the corresponding node;

[0060] a judgment module for selecting a master node in the nodes and determining whether there is a communication demand in the nodes; if yes, triggering a selection determination module;

[0061] the selection determination module for selecting a target route corresponding to the node according to the corresponding neighbor table and routing table, determining time slot resources corresponding to the node according to the target route, and sending initial occupation information of the time slot resources to the master node;

[0062] a broadcasting module for broadcasting a wireless control message to the remaining nodes by the master node; wherein, the wireless control message at least contains final occupation information of the time slot resources and backoff information.

[0063] To solve the above technical problems, the application further provides a time slot resource allocation device, comprising:

[0064] a memory for storing a computer program;

[0065] a processor for executing the computer program to realize the steps of the above time slot resource allocation method.

[0066] To solve the above technical problems, the application further provides a computer readable storage medium, and the computer readable storage medium stores a computer program.

[0067] The time slot resource allocation method provided by the application, by setting the position code of each node in the train-ground wireless communication system, constructing the neighbor table and the routing table corresponding to each node, clarifying the neighbor relationship of each node and other nodes and the corresponding data forwarding path information, thus obtaining the real-time network topology; when the node confirms that there is a communication demand, according to the corresponding neighbor table and routing table, the target routing corresponding to the node is selected, and the time slot resource corresponding to the node is determined according to the target routing, realizing the cooperation of the best routing discovery and dynamic time slot allocation, which can better adapt to the network topology change, meet the flexible marshalling demand, improve the time slot resource utilization rate and the communication service carrying capacity.

[0068] In addition, the application further provides a time slot resource allocation device, equipment and medium, and the effects are the same as above. BRIEF DESCRIPTION OF DRAWINGS

[0069] In order to more clearly illustrate the embodiments of the application, the drawings needed in the embodiments will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the application, and other drawings can be obtained by those skilled in the art without creative labor.

[0070] Figure 1 The schematic diagram of the train-ground wireless communication system provided by the embodiments of the application;

[0071] Figure 2 The flowchart of the time slot resource allocation method provided by the embodiments of the application;

[0072] Figure 3 The schematic diagram of the train-ground train communication scene caused by the curve of the train-ground train communication scene provided by the embodiments of the application;

[0073] Figure 4 The schematic diagram of the train-ground train communication scene provided by the embodiments of the application when the safety interval is large;

[0074] Figure 5 The schematic diagram of the routing and time slot system execution process provided by the embodiments of the application.

[0075] Figure 6 The schematic diagram of the time slot resource allocation device provided by the embodiments of the application;

[0076] Figure 7 The structural diagram of the time slot resource allocation device provided by the embodiments of the application. DETAILED DESCRIPTION

[0077] The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all the embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by a person of ordinary skill in the art without creative work fall within the protection scope of the present application.

[0078] The core of the present application is to provide a time slot resource allocation method, device, equipment and medium, so as to solve the problem that the fixed time slot allocation of the existing train-ground wireless system cannot adapt to the network topology change caused by flexible marshalling, resulting in time slot waste and insufficient service carrying capacity.

[0079] In order to enable personnel in the technical field to better understand the present application scheme, the present application will be further described in detail below with reference to the drawings and specific embodiments.

[0080] Figure 1 A schematic diagram of a train-ground wireless communication system provided by the embodiments of the present application is shown in FIG. 1. As shown in FIG. 1, the train-ground wireless communication system includes a plurality of nodes, and the nodes are communicatively connected. It should be noted that the nodes at least include a ground wireless unit and a vehicle-mounted wireless terminal; the vehicle-mounted wireless terminal and the ground wireless unit support train-to-train (T2T) and train-to-ground (T2G) dual-mode communication. Figure 1

[0081] Further, the central operation control system formulates a marshalling strategy according to a passenger flow level (peak level, flat peak level, etc.), the vehicle-mounted operation control system executes a coupling / decoupling instruction, and triggers dynamic adjustment of routing and time slots. The train-ground wireless communication system realizes dynamic update of network topology and time-frequency resource allocation through broadcast wireless control messages. The method provided by the present application is applied to a train-ground wireless communication system. The time slot resource allocation method will be specifically described below in combination with specific embodiments:

[0082] Figure 2 A flowchart of a time slot resource allocation method provided by the embodiments of the present application is shown in FIG. 2. As shown in FIG. 2, the method includes: Figure 2

[0083] S10: setting a position code of each node, and constructing a neighbor table corresponding to each node according to the position code.

[0084] The neighbor table contains the neighbor relationship of the corresponding node and other nodes.

[0085] ​​In order to better determine the network topology of the vehicle-ground wireless communication system, in specific implementation, firstly, a unique location code needs to be allocated to each node in the system, so as to determine the position of each node in the network topology. It should be noted that the specific setting mode of the node location code in the embodiment is not limited, and is determined according to the specific implementation.

[0086] At the same time, according to each location code, a neighbor table corresponding to each node is constructed. It should be noted that the neighbor table contains the neighbor relationship of the corresponding node and other nodes, and can also contain other information of the corresponding node, such as signal strength, resource utilization, etc. After the neighbor table of each node is determined, the routing relationship between the corresponding node and other nodes can be further determined according to the neighbor table, which is helpful for subsequent time slot allocation. The specific construction process of the node neighbor table in the embodiment is not limited, and is determined according to the specific implementation.

[0087] S11: Construct a routing table corresponding to each node according to each neighbor table.

[0088] The routing table contains the data forwarding path information of the corresponding node.

[0089] Further, after the neighbor table of each node is determined, a routing table corresponding to each node is constructed according to each neighbor table. It should be noted that the routing table contains the data forwarding path information of the corresponding node, such as the packet destination node, the next hop information, the link information, etc. The specific construction process of the node routing table in the embodiment is not limited, and is determined according to the specific implementation.

[0090] S12: Select a master node in each node, and determine whether there is a communication demand; if yes, go to step S13; if no, end.

[0091] In order to ensure the stability of the communication system, in the embodiment, a consensus protocol is used to select a master node in all nodes, which is responsible for maintaining the consistency of the routing table and time slot allocation of the whole system. In the embodiment, the specific consensus protocol used is not limited, for example, it can be a raft protocol. It should be noted that the specific process of selecting the master node in the embodiment is not limited, which can be selected according to the node resource utilization, or can be selected according to the node signal strength, and is determined according to the specific implementation.

[0092] Subsequently, each node determines whether there is a communication demand, for example, it can detect whether a train operation organization message or a service data message is received. If it is confirmed that there is no communication demand, the current process is ended. If the node confirms that there is a communication demand, the next step is entered.

[0093] S13: Select a target route corresponding to the node according to the corresponding neighbor table and the routing table, determine the time slot resource corresponding to the node according to the target route, and send the preliminary time slot resource occupation information to the master node.

[0094] S14: Broadcast the wireless control message by the master node to the remaining nodes.

[0095] The wireless control message at least contains the final time slot resource occupation information and the backoff information.

[0096] After the node confirms the existence of the communication demand, the corresponding time slot resource needs to be allocated to the node. Specifically, the target route corresponding to the node is selected according to the corresponding neighbor table and the routing table. It can be understood that there can be multiple routes for each node, but the communication quality or stability of each route cannot guarantee normal communication, so a best route needs to be selected from the multiple routes corresponding to the node for communication. It should be noted that the specific selection method of the target route in the embodiment is not limited.

[0097] Subsequently, after the target route corresponding to the node is determined, the time slot resource corresponding to the node is determined according to the target route, the node sends the corresponding preliminary time slot resource occupation information to the master node, and the wireless control message is broadcast by the master node to the remaining nodes. It should be noted that the wireless control message at least contains the final time slot resource occupation information of all nodes and the backoff information of the time slot allocation, so as to realize the allocation of the time sequence resource of each node, integrate the route discovery and the time slot allocation, and be more adaptive to the flexible grouping demand.

[0098] It should be noted that the specific process of determining the time slot resource corresponding to the node according to the target route in the embodiment is not limited, and is determined according to the specific implementation. The backoff process is also not limited, and is determined according to the specific implementation.

[0099] In the embodiment, the position codes of the nodes in the train-ground wireless communication system are set, the neighbor table and the routing table corresponding to each node are constructed, the neighbor relationship of each node and other nodes and the corresponding data forwarding path information are determined, and the real-time network topology structure is obtained. When the node confirms that there is a communication demand, the target route corresponding to the node is selected according to the corresponding neighbor table and the routing table, the time slot resource corresponding to the node is determined according to the target route, the cooperation of the best route discovery and the dynamic time slot allocation is realized, the network topology change can be more adapted, the flexible grouping demand can be met, the time slot resource utilization rate and the communication service carrying capacity are improved.

[0100] On the basis of the above embodiment, in some embodiments, the position codes of the nodes are set, and the neighbor table corresponding to each node is constructed according to the position codes, including:

[0101] S101: Obtain each track section number and grouping sequence number, and determine the position code of each node according to each track section number and grouping sequence number.

[0102] S102: Control each node to collect the signal strength, error rate, CPU load and direction information of the corresponding adjacent node.

[0103] S103: According to the position code of each node, and the signal strength, error rate, CPU load and direction information of the corresponding adjacent node, generate the neighbor table corresponding to each node.

[0104] In order to construct the neighbor table of the node, in the embodiment, first, the track section number and the grouping sequence number are needed to be obtained, and a unique position code is assigned to each node according to the track section number and the grouping sequence number. The format of the position code is track section number-grouping sequence number, for example, 003-02, which represents the 3rd section and the 2nd grouping.

[0105] It should be noted that the track section number divides the whole track into multiple sections, and each section is assigned a unique number (for example, "003" represents the 3rd section). In the embodiment, the specific way of dividing the track is not limited, for example, for straight tracks or regions with gentle channel fading, fixed division can be performed according to the coverage diameter of the ground wireless unit, and for curved tracks or complex electromagnetic environment regions, more detailed division can be performed according to the specific channel variation characteristics.

[0106] Further, control each node to collect the signal strength (Received Signal Strength Indicator, RSSI), error rate, CPU load and direction information of the corresponding adjacent node. Finally, according to the position code of each node, and the signal strength, error rate, CPU load and direction information of the corresponding adjacent node, generate the neighbor table corresponding to each node. An example of the neighbor table is given below:

[0107] Table 1 Neighbor table

[0108] ;

[0109] As shown in the above table, the signal strength, error rate, CPU load and direction information of the corresponding adjacent node together constitute the neighbor table corresponding to each node. It should be noted that the direction information is actually used to represent which directional antenna of which grouping node sends the message. The current grouping node determines the relative position of the sending node and the node (which direction in the current grouping) according to the antenna of the received message.

[0110] In this way, by constructing the neighbor table of the node, the neighbor relationship between the node and other nodes is determined, so as to further determine the routing relationship between the corresponding nodes and other nodes according to the neighbor table, which is helpful for subsequent time slot allocation.

[0111] On the basis of the above-mentioned embodiments, in some embodiments, a routing table corresponding to each node is constructed according to each neighbor table, including:

[0112] S110: determining a link survival period corresponding to the node according to the current speed of the train, the brake coefficient and the curve radius of the track section where the node is located.

[0113] S111: determining a destination node of the corresponding communication service according to the communication requirement of the node.

[0114] S112: determining the next hop address, the next hop load and the hop count of the destination node according to the corresponding neighbor table, so as to determine the routing link, and determining the real-time signal strength and the real-time error code rate corresponding to the routing link.

[0115] S113: determining the link stability value corresponding to the routing link according to the real-time signal strength and the real-time error code rate.

[0116] S114: generating the routing table corresponding to the node according to the destination node, the next hop address, the next hop load, the hop count, the link survival period and the link stability value.

[0117] In order to construct the routing table of the node, in the present embodiment, it is first necessary to determine the link survival period corresponding to the node according to the current speed of the train, the brake coefficient and the curve radius of the track section where the node is located. It should be noted that the link survival period refers to the time from the establishment to the expiration of the wireless link, and the specific formula is as follows:

[0118] ;

[0119] wherein, is the link survival period, is the train speed, unit m / s; is the curve radius, unit m; is the brake coefficient, and the default is 1.2. It should be noted that in the specific implementation, only the effective route of may be retained. is the service duration.

[0120] Further according to the communication requirement of the node, a destination node of the corresponding communication service is determined, a next hop address, a next hop load and a hop count of the destination node are determined according to the corresponding neighbor table, a routing link is determined, and a real-time signal strength and a real-time error code rate corresponding to the routing link are determined. It should be noted that the destination node is a target device or address to which data finally reaches. The next hop address is an address of a next intermediate node to which data is about to be sent in the routing process. The hop count is the number of intermediate nodes through which data passes from the source node to the destination node. The next hop load refers to the current CPU usage rate of the next hop node of the data, indicating the busy state of the next hop node.

[0121] Subsequently, according to the real-time signal strength and the real-time error code rate, a link stability value corresponding to the routing link is determined. It should be noted that the link stability value refers to the stability degree of the wireless link from the current node to the next hop node, and the calculation formula is as follows:

[0122] ;

[0123] wherein, is the link stability value, is the real-time signal strength, , the bending scenario improves the weight. is the real-time error code rate. An example of routing is given below:

[0124] Table 2 Routing table

[0125] ;

[0126] In this way, by constructing the routing table, the routing relationship between the corresponding node and other nodes is determined, so as to select the best routing corresponding to the node based on the routing table and perform time slot allocation.

[0127] On the basis of the above-mentioned embodiments, in some embodiments, a master node is selected in each node, comprising:

[0128] S121: Obtain the neighbor table and the routing table corresponding to each node.

[0129] S122: According to each neighbor table and routing table, the node whose update time of the corresponding routing table meets the preset requirement, and the CPU load is less than the load threshold, and the signal strength is greater than the signal strength threshold is determined as the master node.

[0130] wherein, the update time is the average value of the update time of the valid routing entry in the routing table.

[0131] In a specific implementation, a lightweight Raft protocol is used to select a master node, and the consistency of the routing table and the time slot table is maintained. Specifically, when selecting a master node, the neighbor table and the routing table corresponding to each node are obtained. According to each neighbor table and the routing table, a node whose update time of the corresponding routing table meets a preset requirement, whose CPU load is less than a load threshold, and whose signal strength is greater than a signal strength threshold is determined as the master node. The update time is the average of the update times of the valid routing entries in the routing table.

[0132] It should be noted that the preset requirement, the load threshold, and the signal strength threshold are not limited in the embodiment. For example, a node in each track section whose routing table update time is the latest, whose CPU load is less than 40%, and whose signal strength is greater than -70 dBm can be selected as the master node, which is responsible for coordinating time slot allocation and participating in voting by adjacent sections. In this way, the selection of the master node is realized.

[0133] On the basis of the above embodiment, in some embodiments, the target route corresponding to the node is selected according to the corresponding neighbor table and the routing table, including:

[0134] S131: According to the corresponding neighbor table and the routing table, the bend flag, the CPU load, and the link stability value of the node are determined.

[0135] S132: The bend flag, the CPU load, and the link stability value are input into the state space of the dynamic weight routing selection model to determine the routing comprehensive score weight corresponding to the node.

[0136] The dynamic weight routing selection model is a Q value function model that is trained in advance based on historical data and is used to predict the routing comprehensive score weight.

[0137] S133: According to the routing comprehensive score weight and the routing comprehensive score calculation formula, the routing comprehensive score of each route corresponding to the node is determined.

[0138] S134: The route with the highest corresponding routing comprehensive score is determined as the target route of the node.

[0139] In order to determine the target route of the node, the dynamic weight routing selection model driven by Q-learning is implemented in the embodiment. Specifically, first, the bend flag, the CPU load, and the link stability value of the node are determined according to the corresponding neighbor table and the routing table. It should be noted that the bend flag s1 ∈ {0, 1} (0 = straight, 1 = bend), the CPU load s2 ∈ {0, 1, 2} (0 = low load < 30%, 1 = medium load 30-70%, 2 = high load > 70%), and the link stability value s3 = (RSSI dBm + 100) / 10 (discretized into 6 levels from -100 dBm to -40 dBm).

[0140] Further, the bend sign, CPU load and link stability value are input into the state space of the dynamic weight routing selection model to determine the routing comprehensive score weight corresponding to the node. It should be noted that the dynamic weight routing selection model is a Q value function model trained in advance based on historical data, used to predict the routing comprehensive score weight. The Q value function is defined as:

[0141] ;

[0142] ;

[0143] wherein Q(s, a) is the Q value of the current state-action pair, is the learning rate, by default 0.8, used to control the update speed of new and old knowledge; is the discount factor, by default 0.9, used to balance the immediate reward and long-term benefit; r is the current reward value, specifically the output of the reward function ; is the new state after executing the action a. is the optimal Q value of the next state. At the same time, the reward function is used to optimize the Q-learning strategy, is the time delay reduction rate, is the service completion rate, is the spectrum utilization rate, . The model is trained in real time by historical data to adjust the routing comprehensive score weight and reward function weight parameters, ensuring that the routing selection adapts to high-speed scenarios and dynamic grouping requirements.

[0144] Further, the routing comprehensive score weight is dynamically adjusted, and according to the routing comprehensive score weight and the routing comprehensive score calculation formula, the routing comprehensive score of each route corresponding to the node is determined. The routing comprehensive score calculation formula is specifically as follows:

[0145] ;

[0146] wherein C is the routing comprehensive score, is the routing stability score, L is the node load level, N is the hop count, is the routing stability weight, is the load balancing weight, is the hop count weight. It should be further noted that the routing stability score and the node load level respectively refer to the mean value of the link stability value of all links / all nodes on a route and the mean value of the CPU load.

[0147] Finally, the routing comprehensive scores of the routes are compared, and the route corresponding to the highest routing comprehensive score is determined as the target route of the node. In this way, the determination of the target route of the node is realized.

[0148] On the basis of the above-mentioned embodiments, in some embodiments, the time slot resource corresponding to the node is determined according to the target route, comprising:

[0149] S135: determining the guard time slot interval according to the current speed of the train.

[0150] S136: performing global allocation on the three-dimensional resource matrix according to the target route and the Hungarian algorithm, and controlling the frequency points or time slots of adjacent nodes to be different, to generate the time slot resource corresponding to the node.

[0151] The dimensions of the three-dimensional resource matrix include time slots, frequency bands and track section numbers.

[0152] S137: inserting the guard time slot interval into the time slot resource corresponding to the node.

[0153] After the target route of the node is determined, the time slot allocation is performed on the node. Firstly, the dynamic adjustment of the elastic guard time slot is performed, and the guard time slot interval is determined according to the current speed of the train, and the formula is as follows:

[0154] ;

[0155] Wherein, is the guard time slot interval, is the current speed of the train, and c is the speed of light.

[0156] Further, the three-dimensional resource matrix Resource[t][f][s] is globally allocated according to the target route and the Hungarian algorithm. It should be noted that the three-dimensional resource matrix Resource[t][f][s] is also a time-frequency cube, and the dimensions thereof include time slots t, frequency bands f and track section numbers s. At the same time, the frequency points or time slots of adjacent nodes are controlled to be different, or when the adjacent nodes use the same frequency point, the difference value of the section numbers thereof must satisfy (i.e. at least 2 complete sections are separated), and the time slot interval of the same frequency band is ≥3 time slot units (Δt≥3). When the time slot allocation is triggered by the new service, the node with a load <60% is preferentially selected as a relay, so as to avoid the same frequency interference, and finally the time slot resource corresponding to the node is generated.

[0157] Finally, the determined guard time slot interval is dynamically inserted into the time slot resource corresponding to the node to compensate for the high-speed Doppler effect. For example, when the train runs at 600km / h, a 27.83ms guard time slot interval is generated to ensure that there is no interference between time slots. The following gives an example of a time slot allocation table:

[0158] Table 3 Time slot allocation table

[0159] ;

[0160] As shown in Table 3, service 001 is allocated to time slot t1, frequency band f2, and orbital position s3, and service 002 is allocated to time slot t2, frequency band f1, and orbital position s5. Through the above time slot allocation mode, spatial isolation and spectrum efficient multiplexing are ensured.

[0161] On the basis of the above embodiment, in some embodiments, after generating the time slot resource corresponding to each node, before inserting the guard time slot interval into the time slot resource corresponding to the node, the method further comprises:

[0162] S138: When the master node receives the unicast occupation information of the corresponding preliminary time slot resource of each node, the master node determines whether there is a resource conflict according to the occupation information of the time slot resource corresponding to each node; wherein the occupation information of the time slot resource contains the route comprehensive score of the target route of the corresponding node; if yes, go to step S139; if no, go to step S137.

[0163] S139: Control the nodes with head distance satisfying the preset distance to occupy the corresponding time slot resource among the nodes with resource conflict.

[0164] S140: Control the remaining nodes to execute a binary exponential backoff strategy, and return to step S136 after a delay of a preset time; wherein the specific process of the node executing the binary exponential backoff strategy includes: determining the current count value of the conflict counter; selecting an integer as a target integer from a set of preset integers uniformly according to the count value; each integer in the set of preset integers is a positive integer; according to the time slot unit value, the target integer, the route comprehensive score of the target route of each node, and the average value of the route comprehensive score of the target route of each node, the preset time corresponding to each node is determined respectively.

[0165] In order to avoid multiple nodes competing for the same resource, after generating the time slot resource corresponding to each node, the master node receives the unicast occupation information of the corresponding preliminary time slot resource of each node, and also needs to determine whether there is a resource conflict according to the occupation information of the time slot resource corresponding to each node by the master node, that is, to check whether there is a time slot and frequency band conflict, and whether the distance between the orbital segments of adjacent nodes is not greater than 2. It should be noted that the occupation information of the time slot resource contains the route comprehensive score of the target route of the corresponding node.

[0166] If it is confirmed that the current allocation does not exist resource conflict, the allocation of the current time slot resource is executed. If it is confirmed that the current allocation exists resource conflict, the node occupying the corresponding time slot resource is controlled among the nodes existing resource conflict, and the distance from the vehicle head meets the preset distance. For example, the node close to the vehicle head (such as 001-01) is preferentially occupied, and the remaining nodes adopt a binary exponential backoff strategy, and retry time slot allocation after delaying for a preset time to avoid continuous conflict.

[0167] In order to realize the binary exponential backoff, in the specific implementation, it is necessary to set a conflict counter k, the initial value of which is 0, and the value k is increased by 1 every time there is a conflict, and the upper limit is 10. When performing binary exponential backoff, it is necessary to first determine the current value of the conflict counter, and then uniformly randomly select an integer as a target integer r from a preset integer set according to the value. For example, the preset integer set can be [0, 1, ……, (2 k - 1)], and when the value k is 2, the preset integer set is [0, 1, 3]. It can be understood that each integer in the preset integer set is a positive integer. Further, according to the time slot unit value Slot Time, the target integer r, the route comprehensive score C i of the target route of each node, and the average value C avg of the route comprehensive score of the target route of each node, the preset time corresponding to each node, that is, the actual backoff time, is determined, and the formula is as follows:

[0168] T = r ×C avg / C i × Slot Time;

[0169] Wherein, T is the actual backoff time.

[0170] On the basis of the above embodiment, in some embodiments, the master node broadcasts a wireless control message to the remaining nodes, including:

[0171] S141: The master node broadcasts a wireless control message to the remaining nodes at a preset period.

[0172] Wherein, the wireless control message includes a consistency protocol header, a route update flag, a time slot update flag, direction information, link state, CPU load, route data and time slot occupation data.

[0173] In a specific implementation, the master node broadcasts a wireless control message to the remaining nodes at a preset period. In this embodiment, the preset period is not limited, for example, it can be 100 ms. The wireless control message is composed of a consistency protocol header (including the current Raft term number, the committed log index number, and the log type mask), a routing update flag, a time slot update flag, direction information, link state (RSSI, packet loss rate), CPU load, routing data, and time slot occupation data. If the routing update flag is set to 1, it means that there is routing data update. If the time slot update flag is set to 1, it means that there is time slot occupation data update. If both are set to 0, it is a neighbor detection message.

[0174] In this embodiment, the master node broadcasts at a preset period to realize synchronization of the routing and time slot tables, thereby avoiding communication interruption caused by network topology changes.

[0175] On the basis of the above embodiment, in some embodiments, after confirming that the node has a communication demand, the method further includes:

[0176] S15: determining whether the node has a valid route according to the corresponding routing table; if yes, proceeding to step S13; if no, proceeding to step S16.

[0177] S16: outputting prompt information indicating that the node does not have a valid route, and returning to the step of determining whether the node has a valid route according to the corresponding routing table.

[0178] In a specific implementation, in order to ensure successful selection of the target route, after confirming that the node has a communication demand, it is further needed to determine whether the node has a valid route according to the corresponding routing table, specifically to check whether the routing table has a target node entry and to verify whether the hop count and the link survival period meet the requirements. If it is confirmed that the node has a valid route, the step of selecting the target route corresponding to the node according to the corresponding neighbor table and the routing table is entered. If it is confirmed that the node does not have a valid route, prompt information indicating that the node does not have a valid route is outputted to prompt the user to maintain the node route in a timely manner, and after the maintenance is completed, the step of determining whether the node has a valid route according to the corresponding routing table is returned to.

[0179] Figure 3 A schematic diagram of a train-to-ground communication scenario caused by a curve-to-straight switching of a train is provided for the embodiments of the present application. Figure 4 A schematic diagram of a train-to-ground communication scenario with a large safety interval is provided for the embodiments of the present application. As shown in Figure 3 and Figure 4 In the process of train operation, the topology structure of the train-ground wireless communication system can change, at which time it is needed to trigger routing update to ensure node communication connection. Therefore, on the basis of the above embodiment, in some embodiments, the method further includes:

[0180] S17: Determine if there is a node with a failed route; if yes, proceed to step S18; otherwise, end.

[0181] S18: Trigger route update for the failed route node, release the time slot resources occupied by the failed route node, and update the corresponding time slot table.

[0182] S19: Update the neighbor table and routing table corresponding to the route failure node, and broadcast the updated routing table and timeslot table of the route failure node through the master node.

[0183] S20: Based on the updated neighbor table and routing table of the route-failed node, reallocate the corresponding time slot resources to the route-failed node.

[0184] Specifically, during the operation of the vehicle-to-ground wireless communication system, it is determined whether any node's routing has failed due to link interruption or topology changes. If it is confirmed that no node's routing has failed, the current process ends.

[0185] If it is confirmed that a node's route has failed due to link interruption or topology change, a route update for the failed node is triggered, releasing the time slot resources originally occupied by the failed node's route and updating the corresponding time slot table. The neighbor table and routing table corresponding to the failed node are further updated, and the updated portions of the routing table and time slot table of the failed node are broadcast through the master node. Finally, based on the updated neighbor table and routing table of the failed node, the corresponding time slot resources are reallocated to the failed node. For example, when a train enters a curve, causing the train-to-train through link to be interrupted, the system automatically switches to train-to-ground logical communication, selects a multi-hop route relayed through the ground radio unit, and synchronously updates the time slot allocation table. This ensures the stability of communication between system nodes.

[0186] Figure 5 This is a schematic diagram illustrating the execution flow of the routing and time-slot system provided in an embodiment of this application. Figure 5 As shown, in some embodiments, after completing the allocation of time slot resources, it can be further determined whether the utilization rate of the three-dimensional resource matrix is ​​greater than the utilization rate threshold. In this embodiment, there is no limit to the size of the utilization rate threshold, for example, it can be 75%. When it is confirmed that the utilization rate of the three-dimensional resource matrix exceeds the threshold, the hop count weight of the dynamic weighted routing selection model is increased through the master node, thereby encouraging the selection of short-hop routes.

[0187] It should also be noted that after the time slot resources are allocated, the consistency between the routing table and the time slot table needs to be maintained through a distributed synchronization mechanism. Specifically, the master node synchronizes the corresponding routing table and time slot table with the other nodes. Simultaneously, during service transmission, the master node monitors the link quality in real time and records relevant logs until the service transmission is completed or the system is shut down.

[0188] In the above embodiments, the time slot resource allocation method is described in detail, and the application also provides corresponding embodiments of a time slot resource allocation device.

[0189] Figure 6 A schematic diagram of a time slot resource allocation device provided by the embodiments of the application is shown. The device is applied to a train-ground wireless communication system; the train-ground wireless communication system includes a plurality of nodes, and the nodes are communicatively connected; wherein, the nodes at least include a ground wireless unit and a vehicle-mounted wireless terminal; as shown in the figure, the device includes: Figure 6

[0190] A first construction module 10 is configured to set a position code of each node and construct a neighbor table corresponding to each node according to the position code; wherein, the neighbor table contains the neighbor relationship between the corresponding node and other nodes;

[0191] A second construction module 11 is configured to construct a routing table corresponding to each node according to each neighbor table; wherein, the routing table contains the data forwarding path information of the corresponding node;

[0192] A judgment module 12 is configured to select a master node in each node and determine whether each node has a communication demand; if yes, a selection determination module 13 is triggered;

[0193] The selection determination module 13 is configured to select a target route corresponding to the node according to the corresponding neighbor table and routing table, determine the time slot resource corresponding to the node according to the target route, and send the preliminary occupation information of the time slot resource to the master node;

[0194] A broadcast module 14 is configured to broadcast a wireless control message through the master node to the remaining nodes; wherein, the wireless control message at least contains the final occupation information of the time slot resource and the backoff information.

[0195] In some embodiments, the first construction module 10 includes:

[0196] A first acquisition module is configured to acquire each track section number and marshalling sequence number, and determine the position code of each node according to each track section number and marshalling sequence number;

[0197] A collection submodule is configured to control each node to collect the signal strength, bit error rate, CPU load and direction information of the corresponding adjacent node;

[0198] A first generation submodule is configured to generate the neighbor table corresponding to each node according to the position code of each node and the signal strength, bit error rate, CPU load and direction information of the corresponding adjacent node.

[0199] In some embodiments, the second construction module 11 includes:

[0200] ​The first determining sub-module is configured to determine a link survival period corresponding to the node according to a current speed of the train, a brake coefficient, and a curve radius of a track section where the node is located; and determine a destination node of a corresponding communication service according to a communication requirement of the node;

[0201] The second determining sub-module is configured to determine a next-hop address, a next-hop load, and a hop count of the destination node according to the corresponding neighbor table, to determine a routing link, and to determine a real-time signal strength and a real-time bit error rate corresponding to the routing link;

[0202] The third determining sub-module is configured to determine a link stability value corresponding to the routing link according to the real-time signal strength and the real-time bit error rate.

[0203] The second generating sub-module is configured to generate a routing table corresponding to the node according to the destination node, the next-hop address, the next-hop load, the hop count, the link survival period, and the link stability value.

[0204] In some embodiments, the judging module 12 comprises:

[0205] The second obtaining sub-module is configured to obtain the neighbor table and the routing table corresponding to each node.

[0206] The fourth determining sub-module is configured to determine a node as a master node according to each neighbor table and routing table, if the update time of the corresponding routing table meets a preset requirement, the CPU load is less than a load threshold, and the signal strength is greater than a signal strength threshold.

[0207] The update time is an average value of update times of valid routing entries in the routing table.

[0208] In some embodiments, the selecting determining module 13 comprises:

[0209] The fifth determining sub-module is configured to determine a curve flag, a CPU load, and a link stability value of the node according to the corresponding neighbor table and routing table.

[0210] The sixth determining sub-module is configured to input the curve flag, the CPU load, and the link stability value into a state space of a dynamic weight routing selection model, to determine a routing comprehensive score weight corresponding to the node. The dynamic weight routing selection model is a Q value function model trained in advance based on historical data, and is used to predict the routing comprehensive score weight.

[0211] The seventh determining sub-module is configured to determine a routing comprehensive score of each routing corresponding to the node according to the routing comprehensive score weight and a routing comprehensive score calculation formula.

[0212] The eighth determining sub-module is configured to determine a routing corresponding to the highest routing comprehensive score as a target routing of the node.

[0213] In some embodiments, the selection determining module 13 comprises:

[0214] a guard interval determining module configured to determine a guard interval according to a current speed of the train;

[0215] a third generating submodule configured to perform global allocation on a three-dimensional resource matrix according to the target route and the Hungarian algorithm, and control the frequency points or time slots of adjacent nodes to be different, so as to generate time slot resources corresponding to the nodes; wherein the dimensions of the three-dimensional resource matrix include time slots, frequency bands, and track segment numbers;

[0216] a guard interval inserting submodule configured to insert the guard interval into the time slot resources corresponding to the nodes.

[0217] In some embodiments, the method further comprises:

[0218] a conflict judging module configured to, when the master node receives the occupation information of the corresponding preliminary time slot resources unicast by each node, judge whether there is resource conflict according to the occupation information of the time slot resources corresponding to each node by the master node; wherein the occupation information of the time slot resources contains the route comprehensive score of the target route of the corresponding node; if yes, trigger the time slot occupation module, and if no, trigger the guard interval inserting submodule;

[0219] a time slot occupation module configured to control the nodes whose distances to the train head satisfy the preset distance among the nodes with resource conflict to occupy the corresponding time slot resources;

[0220] a backoff strategy executing module configured to control the remaining nodes to execute a binary exponential backoff strategy, and trigger the third generating submodule after delaying for a preset time. Wherein the specific process of the nodes executing the binary exponential backoff strategy comprises: determining a current count value of a conflict counter; uniformly randomly selecting an integer as a target integer from a preset integer set according to the count value; each integer in the preset integer set is a positive integer; determining the preset time corresponding to each node according to the time slot unit value, the target integer, the route comprehensive score of the target route of each node, and the average value of the route comprehensive scores of the target routes of the nodes.

[0221] In some embodiments, the broadcasting module 14 comprises:

[0222] a message broadcasting submodule configured to broadcast a wireless control message by the master node to the remaining nodes at a preset period;

[0223] wherein the wireless control message comprises a consistency protocol header, a route update flag, a time slot update flag, direction information, link state, CPU load, route data, and time slot occupation data.

[0224] In some embodiments, the method further comprises:

[0225] The effective route judgment module is configured to judge whether there is an effective route for the node according to the corresponding route table; if yes, the selection determination module 13 is triggered; if no, the prompt module is triggered.

[0226] The prompt module is configured to output prompt information indicating that there is no effective route for the node, and trigger the effective route judgment module.

[0227] In some embodiments, the method further comprises:

[0228] The route invalidation judgment module is configured to judge whether there is route invalidation for the node; if yes, the route update module is triggered.

[0229] The route update module is configured to trigger route update of the route invalidation node, release time slot resources occupied by the route invalidation node, and update the corresponding time slot table.

[0230] The entry update module is configured to update the neighbor table and the route table corresponding to the route invalidation node, and broadcast the updated part of the route table and the time slot table of the route invalidation node through the master node.

[0231] The time slot re-allocation module is configured to re-allocate corresponding time slot resources for the route invalidation node according to the updated neighbor table and the route table of the route invalidation node.

[0232] In some embodiments, the method further comprises:

[0233] The utilization rate judgment module is configured to judge whether the utilization rate of the three-dimensional resource matrix is greater than a utilization rate threshold; if yes, increase the hop weight of the dynamic weight route selection model through the master node.

[0234] In some embodiments, the method further comprises:

[0235] The entry synchronization module is configured to synchronize the corresponding route table and time slot table to the remaining nodes through the master node.

[0236] Since the embodiments of the device part correspond to the embodiments of the method part, the embodiments of the device part are described in the description of the embodiments of the method part, and will not be described here.

[0237] Figure 7 A structural diagram of a time slot resource allocation device provided by an embodiment of the present application is shown in FIG. 1. Figure 7 As shown in FIG. 1, the time slot resource allocation device comprises:

[0238] The memory 20 is configured to store a computer program.

[0239] The processor 21 is configured to implement the steps of the time slot resource allocation method mentioned in the above embodiments when executing the computer program.

[0240] The processor 21 can include one or more processing cores, such as a 4-core processor, an 8-core processor, etc. The processor 21 can be implemented in at least one of a hardware form of a digital signal processor (DSP), a field-programmable gate array (FPGA), a programmable logic array (PLA), etc. The processor 21 can also include a main processor and a coprocessor. The main processor is a processor for processing data in a wake-up state, also referred to as a central processing unit (CPU). The coprocessor is a low-power processor for processing data in a standby state. In some embodiments, the processor 21 can be integrated with a graphics processing unit (GPU) that is responsible for rendering and drawing content required to be displayed on the display screen. In some embodiments, the processor 21 can further include an artificial intelligence (AI) processor for processing computing operations related to machine learning.

[0241] The memory 20 can include one or more computer-readable storage media that can be non-transitory. The memory 20 can further include a high-speed random access memory, and a nonvolatile memory such as one or more disk storage devices, flash storage devices. In this embodiment, the memory 20 is at least used to store the following computer program 201, wherein the computer program is loaded and executed by the processor 21, and can implement the related steps of the time slot resource allocation method disclosed in any of the preceding embodiments. In addition, the resources stored by the memory 20 can further include an operating system 202 and data 203, etc., and the storage manner can be temporary storage or permanent storage. The operating system 202 can include Windows, Unix, Linux, etc. The data 203 can include but is not limited to data related to the time slot resource allocation method.

[0242] In some embodiments, the time slot resource allocation device can further include a display screen 22, an input / output interface 23, a communication interface 24, a power supply 25, and a communication bus 26.

[0243] Those skilled in the art can understand that, Figure 7 The structure shown in the figure does not constitute a limitation on the time slot resource allocation device, and can include more or fewer components than those shown in the figure.

[0244] Finally, the present application also provides an embodiment corresponding to a computer-readable storage medium. The computer-readable storage medium stores a computer program. The computer program is executed by a processor to implement the steps in the above method embodiments.

[0245] It can be understood that if the method in the above embodiments is implemented in the form of a software function unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on such understanding, the technical solutions of the present application essentially or the part that contributes to the prior art or the whole or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium, and executes all or part of the steps of the methods described in the various embodiments of the present application. The foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various media that can store program codes.

[0246] The above provides a time slot resource allocation method, device, equipment and medium. The description of the embodiments of the present application is described in detail. The embodiments of the present application adopt a progressive manner, and each embodiment mainly describes the difference from other embodiments. The same or similar parts of each embodiment can be referred to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, it is described simply, and the related part is referred to the method part. It should be pointed out that for ordinary skilled in the art, without departing from the principle of the present application, some improvements and modifications can be made to the present application, and these improvements and modifications also fall within the protection scope of the present application.

[0247] It should be further noted that in the present specification, the relationship terms such as first and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply that there is any such actual relationship or order between the entities or operations. Moreover, the terms "include", "contain" or any other variants thereof are intended to cover non-exclusive inclusion, so that the process, method, article or equipment including a series of elements not only includes those elements, but also includes other elements not explicitly listed or inherent to such process, method, article or equipment. Without more limitations, the element defined by the statement "including a" does not exclude the presence of other identical elements in the process, method, article or equipment including the element.

Claims

1. A method of allocating time slot resources, characterized by, The application is applied to a train-ground wireless communication system; the train-ground wireless communication system comprises a plurality of nodes, and each node is communicatively connected; wherein the node comprises at least a ground wireless unit and a vehicle-mounted wireless terminal; the method comprises: Setting the position code of each node, and constructing the neighbor table corresponding to each node according to each position code; wherein the neighbor table contains the neighbor relationship between the corresponding node and other nodes; According to each neighbor table, a routing table corresponding to each node is constructed; wherein the routing table contains the data forwarding path information of the corresponding node; Selecting a master node in each node, and judging whether each node has a communication demand; If yes, according to the corresponding neighbor table and the routing table, a target route corresponding to the node is selected, and a time slot resource corresponding to the node is determined according to the target route, and the initial occupation information of the time slot resource is sent to the master node; Through the master node, a wireless control message is broadcasted to the remaining nodes; wherein the wireless control message at least contains the final occupation information of the time slot resource and the backoff information; According to each neighbor table, a routing table corresponding to each node is constructed, comprising: According to the current speed of the train, the braking coefficient and the curve radius of the track section where the node is located, the link survival period corresponding to the node is determined, and the formula is as follows: ； wherein, is the link life cycle, is the train speed, unit m / s; is the curve radius, unit m; is the braking coefficient; According to the communication demand of the node, the destination node of the corresponding communication service is determined; According to the corresponding neighbor table, the next hop address, the next hop load and the hop count of the destination node are determined to determine the routing link, and the real-time signal strength and the real-time bit error rate corresponding to the routing link are determined; According to the real-time signal strength and the real-time bit error rate, the link stability value corresponding to the routing link is determined, and the formula is as follows: ； wherein, is a link stability value, is a real-time signal strength, , is a real-time bit error rate; According to the destination node, the next hop address, the next hop load, the hop count, the link survival period and the link stability value, the routing table corresponding to the node is generated.

2. The time slot resource allocation method of claim 1, wherein, Setting the position code of each node, and constructing the neighbor table corresponding to each node according to each position code, comprising: Obtaining each track section number and grouping serial number, and determining the position code of each node according to each track section number and the grouping serial number; Controlling each node to collect the signal strength, bit error rate, CPU load and direction information of the corresponding adjacent node; According to the position code of each node, and the signal strength, bit error rate, CPU load and direction information of the corresponding adjacent node, the neighbor table corresponding to each node is generated.

3. The time slot resource allocation method of claim 1, wherein, Selecting a master node in each node, comprising: Obtaining the neighbor table and the routing table corresponding to each node; According to each neighbor table and the routing table, the node whose update time of the corresponding routing table meets the preset requirement, and the CPU load is less than the load threshold, and the signal strength is greater than the signal strength threshold is determined as the master node; Wherein, the update time is the average value of the update time of the valid routing entry in the routing table.

4. The time slot resource allocation method of claim 1, wherein, According to the corresponding neighbor table and the routing table, the target route corresponding to the node is selected, comprising: determine a detour flag, a CPU load and the link stability value of the node according to the corresponding neighbor table and the routing table; input the detour flag, the CPU load and the link stability value into a state space of a dynamic weight routing selection model to determine a routing comprehensive score weight corresponding to the node, wherein the dynamic weight routing selection model is a Q value function model trained in advance based on historical data and used for predicting a routing comprehensive score weight; determine a routing comprehensive score of each route corresponding to the node according to the routing comprehensive score weight and a routing comprehensive score calculation formula; determine the target route of the node as the route corresponding to the highest routing comprehensive score.

5. The time slot resource allocation method of claim 1, wherein, determine the time slot resource corresponding to the node according to the target route, including: determine a protection time slot interval according to a current speed of a train; perform global allocation on a three-dimensional resource matrix according to the target route and a Hungarian algorithm, and control the frequency points or time slots of adjacent nodes to be different, to generate the time slot resource corresponding to the node, wherein the dimensions of the three-dimensional resource matrix include time slots, frequency bands and track section numbers; insert the protection time slot interval into the time slot resource corresponding to the node.

6. The time slot resource allocation method of claim 5, wherein, Before the protection time slot interval is inserted into the time slot resource corresponding to the node, after the time slot resource corresponding to the node is generated, further including: when the master node receives the occupation information of the preliminary time slot resource corresponding to each node unicast, determine whether there is a resource conflict according to the occupation information of the time slot resource corresponding to each node through the master node, wherein the occupation information of the time slot resource includes the routing comprehensive score of the target route corresponding to the node; if yes, control the nodes corresponding to the time slot resource whose distance from the train head meets a preset distance among the nodes with resource conflicts to occupy the corresponding time slot resource; control the remaining nodes to perform a binary exponential backoff strategy and return to the step of performing global allocation on the three-dimensional resource matrix according to the target route and the Hungarian algorithm after a preset time; wherein the specific process of the binary exponential backoff strategy performed by the nodes includes: determining a current count value of a conflict counter; uniformly randomly selecting an integer as a target integer from a preset integer set according to the count value; each integer in the preset integer set is a positive integer; determining the preset time corresponding to each node according to a time slot unit value, the target integer, the routing comprehensive score of the target route of each node, and the average value of the routing comprehensive score of the target route of each node; if no, enter the step of inserting the protection time slot interval into the time slot resource corresponding to the node.

7. The time slot resource allocation method of claim 1, wherein, broadcast a wireless control packet to the remaining nodes through the master node, including: broadcast the wireless control packet to the remaining nodes at a preset period by the master node; wherein the wireless control packet includes a consistency protocol header, a route update flag, a time slot update flag, direction information, link state, CPU load, route data and time slot occupation data.

8. The time slot resource allocation method of claim 1, wherein, Before selecting a target route corresponding to the node according to the corresponding neighbor table and the route table, after confirming that the node has a communication demand, the method further comprises: determining whether the node has a valid route according to the corresponding route table; if yes, entering the step of selecting a target route corresponding to the node according to the corresponding neighbor table and the route table; if no, outputting prompt information representing that the node does not have a valid route, and returning to the step of determining whether the node has a valid route according to the corresponding route table.

9. The time slot resource allocation method of claim 1, wherein, The method further comprises: determining whether the route of the node is invalid; if yes, triggering route update of the route invalid node, releasing the time slot resource occupied by the route invalid node, and updating the corresponding time slot table; updating the neighbor table and the route table corresponding to the route invalid node, and broadcasting the updated part of the route table and the time slot table of the route invalid node by the master node; re-allocating the corresponding time slot resource for the route invalid node according to the updated neighbor table and the route table of the route invalid node.

10. The time slot resource allocation method of claim 5, wherein, The method further comprises: determining whether the utilization rate of the three-dimensional resource matrix is greater than a utilization rate threshold; if yes, increasing the hop weight of the dynamic weight routing selection model by the master node.

11. The time slot resource allocation method according to any one of claims 1 to 10, characterized by, After broadcasting the wireless control packet to the remaining nodes by the master node, the method further comprises: synchronizing the corresponding route table and time slot table to the remaining nodes by the master node.

12. A time slot resource allocation apparatus characterized by comprising: The method is applied to a train-ground wireless communication system; the train-ground wireless communication system comprises a plurality of nodes, and each node is communicatively connected with other nodes; wherein, the nodes at least comprise a ground wireless unit and a vehicle-mounted wireless terminal; the device comprises: a first construction module, configured to set the position code of each node, and construct a neighbor table corresponding to each node according to the position code of each node; wherein, the neighbor table comprises the neighbor relationship between the corresponding node and other nodes; a second construction module, configured to construct a route table corresponding to each node according to each neighbor table; wherein, the route table comprises the data forwarding path information of the corresponding node; a determination module, configured to select a master node in each node, and determine whether each node has a communication demand; if yes, trigger a selection determination module; the selection determination module, configured to select a target route corresponding to the node according to the corresponding neighbor table and the route table, determine the time slot resource corresponding to the node according to the target route, and send the initial occupation information of the time slot resource to the master node; a broadcasting module, configured to broadcast a wireless control packet to the remaining nodes by the master node; wherein, the wireless control packet at least comprises the final occupation information of the time slot resource and backoff information; constructing a route table corresponding to each node according to each neighbor table comprises: determining the link survival period corresponding to the node according to the current speed of the train, the brake coefficient and the curve radius of the track section where the node is located, and the formula is as follows: ； wherein, is the link life cycle, is the train speed, unit m / s; is the curve radius, unit m; is the braking coefficient; determining the destination node of the corresponding communication service according to the communication demand of the node; determining a next hop address, a next hop load and a hop number of the destination node according to the corresponding neighbor table, to determine a routing link, and determining a real-time signal strength and a real-time error code rate corresponding to the routing link; determining a link stability value corresponding to the routing link according to the real-time signal strength and the real-time error code rate, and the formula is as follows: ； wherein, is a link stability value, is a real-time signal strength, , is a real-time bit error rate; generating the routing table corresponding to the node according to the destination node, the next hop address, the next hop load, the hop number, the link lifetime and the link stability value.

13. A time slot resource allocation apparatus characterized by comprising: comprising: a memory for storing a computer program; a processor for implementing the steps of the time slot resource allocation method as claimed in any one of claims 1 to 11 when executing the computer program.

14. A computer-readable storage medium, characterized in that, The computer program is stored on the computer readable storage medium, and the computer program is executed by the processor to implement the steps of the time slot resource allocation method as claimed in any one of claims 1 to 11.

Images