Time slot resource allocation method, device, equipment and medium

Abstract

The invention discloses a time slot resource allocation method and device, equipment and a medium, and relates to the technical field of wireless communication. According to the scheme, the neighbor table and the routing table corresponding to each node are constructed by setting the position code of each node in the train-ground wireless communication system, and the neighbor relationship between each node and other nodes and the corresponding data forwarding path information are clarified, so that a real-time network topology structure is obtained; when the node confirms that the node has a communication requirement, the target route corresponding to the node is selected according to the corresponding neighbor table and the routing table, and the time slot resource corresponding to the node is determined according to the target route, so that the coordination of optimal route discovery and dynamic time slot allocation is realized, the method can be more adaptive to the network topology change, and the flexible marshalling requirement is met; and the time slot resource utilization rate and the communication service bearing capacity are improved.

Description

Technical Field

[0001] This application relates to the field of wireless communication technology, and in particular to a time slot resource allocation method, apparatus, device and medium. Background Technology

[0002] In vehicle-to-ground wireless systems, fixed time slots are allocated to provide dedicated communication resources for each vehicle or device, avoiding interference and conflicts. However, rail transit systems face the problem of uneven passenger flow distribution and wasted capacity due to fixed train formations. The difference in passenger flow between peak and off-peak periods is significant, and the fixed train formation mode also leads to high energy consumption.

[0003] Specifically, in terms of communication, spectrum resources below 6 GHz are scarce and underutilized, and existing routing strategies do not fully utilize the characteristics of track topology. When high-speed maglev trains are virtually coupled together, the safety interval exceeds the coverage of direct train-to-train communication, requiring multi-hop train-to-ground routing for communication. However, the fixed time slot allocation of the existing train-to-ground wireless system cannot adapt to the network topology changes brought about by flexible train formations, resulting in wasted time slots and insufficient service carrying capacity.

[0004] Given the above, how to solve the problem that the fixed time slot allocation of the existing vehicle-to-ground wireless system cannot adapt to the network topology changes brought about by flexible grouping, resulting in wasted time slots and insufficient service carrying capacity, is an urgent problem for technical personnel in this field. Summary of the Invention

[0005] The purpose of this application is to provide a time slot resource allocation method, apparatus, device and medium to solve the problem that the fixed time slot allocation of existing vehicle-to-ground wireless systems cannot adapt to network topology changes caused by flexible grouping, resulting in time slot waste and insufficient service carrying capacity.

[0006] To address the aforementioned technical problems, this application provides a time slot resource allocation method applied to a vehicle-to-ground wireless communication system. The vehicle-to-ground wireless communication system includes multiple nodes, with communication connections between the nodes. Each node includes at least a ground wireless unit and a vehicle-mounted wireless terminal. The method includes:

[0007] Set the location code for each node, and construct the neighbor table for each node based on the location code; the neighbor table contains the neighbor relationships between the corresponding node and other nodes;

[0008] Construct a routing table for each node based on each neighbor table; the routing table contains the data forwarding path information for the corresponding node.

[0009] Select a master node from among the nodes and determine whether each node has a communication requirement;

[0010] If so, the target route corresponding to the node is selected according to the corresponding neighbor table and routing table, and the time slot resources corresponding to the node are determined according to the target route. The initial time slot resource occupancy information is then sent to the master node.

[0011] The master node broadcasts radio control messages to the other nodes; the radio control messages contain at least the final time slot resource occupancy information and backoff information.

[0012] On the one hand, the location code of each node is set, and a neighbor table corresponding to each node is constructed based on the location code, including:

[0013] Obtain the track segment number and group number, and determine the position code of each node based on the track segment number and group number;

[0014] Control each node to collect signal strength, bit error rate, CPU load and direction information of its corresponding adjacent nodes;

[0015] Based on the location code of each node, as well as the signal strength, bit error rate, CPU load and direction information of the corresponding adjacent nodes, a neighbor table is generated for each node.

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

[0017] The link lifecycle corresponding to the node is determined based on the train's current speed, braking coefficient, and the curve curvature radius of the track section where the node is located.

[0018] Determine the destination node for the corresponding communication service based on the node's communication requirements;

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

[0020] Determine the link stability value of the routing link based on real-time signal strength and real-time bit error rate;

[0021] Generate a routing table for each node based on the destination node, next-hop address, next-hop load, hop count, link lifetime, and link stability value.

[0022] On the other hand, selecting a master node from among the nodes includes:

[0023] Obtain the neighbor table and routing table for each node;

[0024] Based on each neighbor table and routing table, the nodes whose corresponding routing table update time meets the preset requirements, whose CPU load is less than the load threshold, and whose signal strength is greater than the signal strength threshold are determined as the master nodes.

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

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

[0027] Based on the corresponding neighbor table and routing table, determine the node's bend flag, CPU load, and link stability value;

[0028] Curve markers, CPU load, and link stability values ​​are input into the state space of the dynamic weighted routing model to determine the overall routing score weight corresponding to each node. The dynamic weighted routing model is a Q-value function model pre-trained based on historical data to predict the overall routing score weight.

[0029] Based on the route comprehensive score weight and the route comprehensive score calculation formula, determine the route comprehensive score for each route corresponding to the node;

[0030] The route with the highest overall score is determined as the target route for the node.

[0031] On the other hand, the time slot resources corresponding to the node are determined based on the target route, including:

[0032] The protection time slot interval is determined based on the train's current speed;

[0033] The three-dimensional resource matrix is ​​globally allocated based on the target route and the Hungarian algorithm, and the frequency points or time slots of adjacent nodes are controlled to be different in order to generate the 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;

[0034] Insert the protection time slot interval into the time slot resource corresponding to the node.

[0035] On the other hand, before inserting the protection time slot interval into the time slot resource corresponding to the node, and after generating the time slot resource corresponding to the node, the process also includes:

[0036] When the master node receives the preliminary time slot resource occupancy information unicast by each node, it determines whether there is a resource conflict based on the time slot resource occupancy information of each node. The time slot resource occupancy information includes the comprehensive routing score of the target route of the corresponding node.

[0037] If so, then among the nodes with resource conflicts, the node whose distance from the front of the train meets the preset distance will occupy the corresponding time slot resources;

[0038] The remaining nodes are controlled to execute a binary exponential backoff strategy, and after a preset delay, the process returns to the step of globally allocating the three-dimensional resource matrix based on the target route and the Hungarian algorithm. The specific process of the nodes executing the binary exponential backoff strategy includes: determining the current count value of the conflict counter; uniformly and randomly selecting an integer from a preset integer set as the target integer based on the count value; all integers in the preset integer set are positive integers; and determining the preset time corresponding to each node based on the time slot unit value, the target integer, the route comprehensive score of the target route of each node, and the average of the route comprehensive scores of the target route of each node.

[0039] If not, proceed 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 radio control messages to the other nodes, including:

[0041] The master node broadcasts wireless control messages to the other nodes at a preset period;

[0042] The radio control message includes a conformance protocol header, a route update flag, a timeslot update flag, direction information, link status, CPU load, routing data, and timeslot occupancy data.

[0043] On the other hand, before selecting the target route corresponding to the node based on the corresponding neighbor table and routing table, after confirming that the node has communication needs, the process also includes:

[0044] Determine whether a node has a valid route based on the corresponding routing table;

[0045] If so, proceed to the step of selecting the target route corresponding to the node based on the corresponding neighbor table and routing table;

[0046] If not, output a message indicating that the node does not have a valid route, and return to the step of determining whether the node has a valid route based on the corresponding routing table.

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

[0048] Determine if any nodes have experienced routing failures;

[0049] If so, then trigger the route update of the route failure node, release the time slot resources occupied by the route failure node, and update the corresponding time slot table;

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

[0051] Based on the updated neighbor table and routing table of the route-failed node, the corresponding time slot resources are reassigned to the route-failed node.

[0052] On the other hand, it also includes:

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

[0054] If so, then the hop count weight of the dynamic weighted routing model is increased through the master node.

[0055] On the other hand, after broadcasting the radio control message to the other nodes through the master node, it also includes:

[0056] The master node synchronizes the corresponding routing table and time slot table with the other nodes.

[0057] To address the aforementioned technical problems, this application also provides a time slot resource allocation device applied to a vehicle-to-ground wireless communication system; the vehicle-to-ground wireless communication system includes multiple nodes, and the nodes are interconnected; wherein, each node includes at least a ground wireless unit and a vehicle-mounted wireless terminal; the device includes:

[0058] The first construction module is used to set the location code of each node and build the neighbor table corresponding to each node according to the location code; wherein, the neighbor table contains the neighbor relationship between the corresponding node and other nodes;

[0059] The second construction module is used to construct the routing table corresponding to each node based on each neighbor table; wherein, the routing table contains the data forwarding path information of the corresponding node;

[0060] The judgment module is used to select the master node among the nodes and determine whether each node has a communication requirement; if so, the selection confirmation module is triggered.

[0061] The selection and determination module is used to select the target route corresponding to the node based on the corresponding neighbor table and routing table, determine the time slot resource corresponding to the node based on the target route, and send the preliminary time slot resource occupancy information to the master node.

[0062] The broadcast module is used to broadcast radio control messages to other nodes through the master node; wherein the radio control message contains at least the final time slot resource occupancy information and backoff information.

[0063] To address the aforementioned technical problems, this application also provides a time slot resource allocation device, comprising:

[0064] Memory, used to store computer programs;

[0065] The processor is used to implement the above-described time slot resource allocation method when executing computer programs.

[0066] To address the aforementioned technical problems, this application also provides a computer-readable storage medium storing a computer program, which, when executed by a processor, implements the steps of the aforementioned time slot resource allocation method.

[0067] The time slot resource allocation method provided in this application establishes the location codes of each node in the vehicle-to-ground wireless communication system, constructs a neighbor table and a routing table for each node, clarifies the neighbor relationships between each node and other nodes, and the corresponding data forwarding path information, thereby obtaining a real-time network topology. When a node confirms that it has a communication need, it selects the target route corresponding to the node according to the corresponding neighbor table and routing table, and determines the time slot resource corresponding to the node according to the target route. This achieves the coordination of optimal route discovery and dynamic time slot allocation, which can better adapt to network topology changes, meet the requirements of flexible grouping, and improve the utilization rate of time slot resources and the carrying capacity of communication services.

[0068] In addition, this application also provides a time slot resource allocation device, equipment and medium, with the same effect as above. Attached Figure Description

[0069] To more clearly illustrate the embodiments of this application, the accompanying drawings used in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0070] Figure 1 A schematic diagram of a vehicle-to-ground wireless communication system provided in an embodiment of this application;

[0071] Figure 2 A flowchart illustrating a time slot resource allocation method provided in an embodiment of this application;

[0072] Figure 3 A schematic diagram illustrating a scenario where a curve causes a vehicle-to-vehicle straight-through traffic transition to vehicle-to-ground communication, as provided in an embodiment of this application.

[0073] Figure 4 A schematic diagram illustrating a vehicle-to-ground / vehicle communication scenario with a large safety interval provided in this application embodiment;

[0074] Figure 5 This is a schematic diagram of the execution flow of the routing and time slot system provided in the embodiments of this application.

[0075] Figure 6 A schematic diagram of a time slot resource allocation device provided in an embodiment of this application;

[0076] Figure 7 This is a structural diagram of a time slot resource allocation device provided in an embodiment of this application. Detailed Implementation

[0077] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the protection scope of this application.

[0078] The core of this application is to provide a time slot resource allocation method, apparatus, device and medium to solve the problem that the fixed time slot allocation of existing vehicle-to-ground wireless systems cannot adapt to network topology changes brought about by flexible grouping, resulting in time slot waste and insufficient service carrying capacity.

[0079] To enable those skilled in the art to better understand the present application, the present application will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0080] Figure 1 This is a schematic diagram of a vehicle-to-ground wireless communication system provided in an embodiment of this application. Figure 1 As shown, the vehicle-to-ground wireless communication system includes multiple nodes, which are interconnected. It should be noted that each node includes at least a ground wireless unit and an in-vehicle wireless terminal; the in-vehicle wireless terminal and the ground wireless unit support both vehicle-to-vehicle (T2T) and vehicle-to-ground (T2G) dual-mode communication.

[0081] Furthermore, the central operation control system formulates a train formation strategy based on passenger flow levels (peak-hour, off-peak, etc.), and the onboard operation control system executes coupling / decoupling commands, triggering dynamic adjustments to routes and time slots. The vehicle-to-ground wireless communication system achieves dynamic updates to the network topology and allocation of time-frequency resources by broadcasting wireless control messages. The method provided in this application is applied to a vehicle-to-ground wireless communication system. The time slot resource allocation method is described in detail below with reference to specific embodiments:

[0082] Figure 2 This is a flowchart illustrating a time slot resource allocation method provided in an embodiment of this application. Figure 2 As shown, the method includes:

[0083] S10: Set the location code for each node and build the neighbor table corresponding to each node based on the location code.

[0084] The neighbor table contains the neighbor relationships between the corresponding node and other nodes.

[0085] To better determine the network topology of the vehicle-to-ground wireless communication system, in practical implementation, it is first necessary to assign a unique location code to each node in the system, thereby clarifying the position of each node in the network topology. It should be noted that this embodiment does not restrict the specific method of setting the node location codes; it depends on the specific implementation situation.

[0086] Simultaneously, a neighbor table is constructed for each node based on its location code. It's important to note that the neighbor table contains the neighbor relationships between the corresponding node and other nodes, and may also include other information about the corresponding node, such as signal strength and resource utilization. After clarifying the neighbor table for each node, the routing relationships between the corresponding node and other nodes can be further determined based on the neighbor table, which is helpful for subsequent time slot allocation. This embodiment does not impose restrictions on the specific construction process of the node neighbor table; it depends on the specific implementation.

[0087] S11: Construct the routing table for each node based on the neighbor tables.

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

[0089] Furthermore, after determining the neighbor tables of each node, a routing table corresponding to each node is constructed based on the neighbor tables. It should be noted that the routing table contains data forwarding path information for the corresponding node, such as the packet destination node, next-hop information, and link information. This embodiment does not impose restrictions on the specific construction process of the node routing table; it depends on the specific implementation.

[0090] S12: Select the master node among all nodes and determine whether each node has a communication requirement; if yes, proceed to step S13; otherwise, end.

[0091] To ensure the stability of the communication system, this embodiment selects a master node from all nodes using a consensus protocol. This master node is responsible for maintaining the consistency of the routing table and time slot allocation for the entire system. This embodiment does not restrict the specific consensus protocol used; for example, it could be the Raft protocol. It should be noted that this embodiment does not restrict the specific process for selecting the master node; it can be selected based on node resource utilization or node signal strength, depending on the specific implementation.

[0092] Subsequently, each node determines whether it has a communication requirement, for example, by detecting whether it has received operation control group messages or service data messages. If it is confirmed that there is no communication requirement, the current process ends. If the node confirms that it has a communication requirement, it proceeds to the next step.

[0093] S13: Select the target route corresponding to the node based on the corresponding neighbor table and routing table, determine the time slot resources corresponding to the node based on the target route, and send the preliminary time slot resource occupancy information to the master node.

[0094] S14: Broadcast radio control messages to other nodes through the master node.

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

[0096] After a node confirms a communication need, it needs to be allocated corresponding time slot resources. Specifically, the target route for the node is selected based on the corresponding neighbor table and routing table. It is understood that each node may have multiple routes, but not every route can guarantee normal communication quality or stability. Therefore, the optimal route needs to be selected from the multiple routes corresponding to the node for communication. It should be noted that this embodiment does not restrict the specific method for selecting the target route.

[0097] Subsequently, after determining the target route for each node, the corresponding time slot resources for that node are determined based on the target route. Each node then sends preliminary time slot resource occupancy information to the master node, which in turn broadcasts radio control messages to the remaining nodes. It should be noted that the radio control message contains at least the final time slot resource occupancy information for all nodes, as well as time slot allocation backoff information. This achieves the allocation of time-series resources to each node, integrating route discovery and time slot allocation, and is more adaptable to flexible grouping requirements.

[0098] It should be noted that this embodiment does not restrict the specific process of determining the time slot resources corresponding to the node based on the target route, but depends on the specific implementation situation. Similarly, the backoff process is not restricted, but depends on the specific implementation situation.

[0099] In this embodiment, by setting the location code of each node in the vehicle-to-ground wireless communication system, a neighbor table and routing table corresponding to each node are constructed, clarifying the neighbor relationship between each node and other nodes and the corresponding data forwarding path information, thereby obtaining the real-time network topology. When a node confirms that it has a communication need, it selects the target route corresponding to the node according to the corresponding neighbor table and routing table, and determines the time slot resource corresponding to the node according to the target route. This achieves the coordination of optimal route discovery and dynamic time slot allocation, which can better adapt to network topology changes, meet the flexible grouping requirements, and improve the utilization rate of time slot resources and the communication service carrying capacity.

[0100] Based on the above embodiments, in some embodiments, a location code for each node is set, and a neighbor table corresponding to each node is constructed according to the location code, including:

[0101] S101: Obtain the track segment number and group number of each track section, and determine the position code of each node based on the track segment number and group number.

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

[0103] S103: Generate a neighbor table for each node based on the location code of each node and the signal strength, bit error rate, CPU load and direction information of the corresponding adjacent nodes.

[0104] To construct the neighbor table for each node, this embodiment first needs to obtain the track segment number and group number, and then assign a unique location code to each node based on these information. The location code format is track segment number - group number, for example, 003-02, which represents the 3rd segment, 2nd group.

[0105] It should be noted that the track segment numbering divides the entire track into multiple segments, each assigned a unique number (e.g., "003" represents the 3rd segment). This embodiment does not restrict the specific method of track division. For example, for straight sections or areas with gentle channel fading, a fixed division can be made according to the coverage diameter of the terrestrial radio unit. For curved sections or areas with complex electromagnetic environments, a more refined division can be made based on the specific channel variation characteristics.

[0106] Furthermore, each node collects the Received Signal Strength Indicator (RSSI), bit error rate, CPU load, and direction information of its corresponding neighboring nodes. Finally, based on the location encoding of each node and the signal strength, bit error rate, CPU load, and direction information of its corresponding neighboring nodes, a neighbor table is generated for each node. An example of a neighbor table is given below:

[0107] Table 1 Neighbor Table

[0108] ;

[0109] As shown in the table above, the neighbor table for each node is composed of the signal strength, bit error rate, CPU load, and direction information of the corresponding adjacent nodes. It should also be noted that the direction information is actually used to characterize which group node's directional antenna transmitted the message from which direction. The current group node determines the relative position (in which direction within the group) of the sending node and itself based on the antenna receiving the message.

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

[0111] Based on the above embodiments, in some embodiments, a routing table corresponding to each node is constructed according to each neighbor table, including:

[0112] S110: Determine the link lifecycle corresponding to the node based on the train's current speed, braking coefficient, and the curve curvature radius of the track section where the node is located.

[0113] S111: Determine the destination node for the corresponding communication service based on the node's communication requirements.

[0114] S112: Determine the next-hop address, next-hop load, and hop count of the destination node based on the corresponding neighbor table, in order to determine the routing link, and determine the real-time signal strength and real-time bit error rate corresponding to the routing link.

[0115] S113: Determine the link stability value corresponding to the routing link based on the real-time signal strength and real-time bit error rate.

[0116] S114: Generate the routing table corresponding to the node based on the destination node, next-hop address, next-hop load, hop count, link lifetime, and link stability value.

[0117] To construct the routing table for a node, this embodiment first needs to determine the link lifetime corresponding to the node based on the train's current speed, braking coefficient, and the radius of curvature of the curve in the track section where the node is located. It should be noted that the link lifetime refers to the time from establishment to expiration of the wireless link, and its specific formula is as follows:

[0118] ;

[0119] in, For the link's lifespan, Train speed, in m / s; The radius of curvature of the curve is in meters (m). This is the braking coefficient, with a default value of 1.2. It should be noted that in practice, only this setting may be retained. Valid routes. For business duration.

[0120] Further, based on the communication requirements of the nodes, the destination node for the corresponding communication service is determined. The next-hop address, next-hop load, and hop count of the destination node are determined according to the corresponding neighbor table to establish the routing link. The real-time signal strength and real-time bit error rate corresponding to the routing link are also determined. It should be noted that the destination node is the final target device or address to which the data will arrive. The next-hop address is the address of the next intermediate node to which the data will be sent during the routing process. The hop count is the number of intermediate nodes the data passes through from the source node to the destination node. The next-hop load refers to the current CPU utilization of the next-hop node itself, indicating its busy / idle status.

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

[0122] ;

[0123] in, This is the link stability value. For real-time signal strength, Improved cornering scenarios Weights. This refers to the real-time bit error rate. Below is an example of a routing representation:

[0124] Table 2 Routing Table

[0125] ;

[0126] In this way, by constructing a routing table, the routing relationship between the corresponding node and other nodes can be determined, so as to select the best route for the node and allocate time slots based on the routing table.

[0127] Based on the above embodiments, in some embodiments, a master node is selected from each node, including:

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

[0129] S122: Based on each neighbor table and routing table, determine the node that meets the preset requirements for the update time of the corresponding routing table, has a CPU load less than the load threshold, and a signal strength greater than the signal strength threshold as the master node.

[0130] The update time is the average update time of valid route entries in the routing table.

[0131] In practical implementation, the lightweight Raft protocol is used to select the master node and maintain consistency between the routing table and the timeslot table. Specifically, when selecting the master node, the neighbor table and routing table corresponding to each node are obtained. Based on each neighbor table and routing table, the node whose corresponding routing table update time meets the preset requirements, 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. Here, the update time is the average update time of the valid routing entries in the routing table.

[0132] It is important to note that this embodiment does not impose restrictions on preset requirements, load thresholds, or signal strength thresholds. For example, the node in each track segment with the most recent routing table update, CPU load less than 40%, and signal strength greater than -70dBm can be designated as the master node, responsible for coordinating time slot allocation, with adjacent segments participating in the voting process. This achieves the selection of the master node.

[0133] Based on the above embodiments, in some embodiments, the target route corresponding to the node is selected according to the corresponding neighbor table and routing table, including:

[0134] S131: Determine the node's bend flag, CPU load, and link stability value based on the corresponding neighbor table and routing table.

[0135] S132: Input the curve marker, CPU load, and link stability values ​​into the state space of the dynamic weighted routing model to determine the overall routing score weight corresponding to the node.

[0136] Among them, the dynamic weighted routing selection model is a Q-value function model that is pre-trained based on historical data and used to predict the weights of the overall routing score.

[0137] S133: Determine the overall routing score for each route corresponding to the node based on the overall routing score weight and the overall routing score calculation formula.

[0138] S134: Determine the route with the highest overall score as the target route for the node.

[0139] To determine the target route for a node, this embodiment specifically implements a dynamic weighted routing selection model driven by Q-learning. Specifically, firstly, based on the corresponding neighbor table and routing table, the node's curve flag, CPU load, and link stability value are determined. It should be noted that the curve flag s1∈{0,1} (0=straight path, 1=curved path), 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=(RSSIdBm+100) / 10 (discretely divided into 6 levels from -100dBm to -40dBm).

[0140] Furthermore, the curve marker, CPU load, and link stability values ​​are input into the state space of the dynamic weighted routing model to determine the overall routing score weight corresponding to each node. It should be noted that the dynamic weighted routing model is a Q-value function model pre-trained based on historical data to predict the overall routing score weight. The Q-value function is defined as:

[0141] ;

[0142] ;

[0143] Where Q(s,a) is the Q-value of the current state-action pair. For learning rate, The default value is 0.8, which is used to control the speed at which new and old knowledge are updated; As a discount factor, The default value is 0.9, used to balance immediate rewards and long-term benefits; r is the current reward value, specifically the reward function. The output; This refers to the new state after action a is performed. This is the optimal Q-value for the next state. Simultaneously, the reward function... Used to optimize Q-learning strategies For latency reduction rate, For business completion rate, For spectrum utilization, By training the model with historical data, the weights of the overall routing score and the reward function are adjusted in real time to ensure that the route selection is adapted to high-speed scenarios and dynamic grouping requirements.

[0144] Furthermore, the route comprehensive score weights are dynamically adjusted, and the route comprehensive score for each route corresponding to a node is determined based on the route comprehensive score weights and the route comprehensive score calculation formula. The specific route comprehensive score calculation formula is as follows:

[0145] ;

[0146] Where C represents the overall routing score. The route stability score is calculated, where L represents the node load level and N represents the hop count. As a routing stability weight, For load balancing weights, This refers to the hop count weight. It should also be noted that the route stability score and node load level refer to the average link stability value and average CPU load of all links / nodes on a route, respectively.

[0147] Finally, the overall route scores of each route are compared, and the route with the highest overall score is determined as the node's target route. This completes the determination of the node's target route.

[0148] Based on the above embodiments, in some embodiments, determining the time slot resources corresponding to the node according to the target route includes:

[0149] S135: Determine the protection time slot interval based on the current speed of the train.

[0150] S136: Globally allocate the 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 in order to generate the time slot resources corresponding to the nodes.

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

[0152] S137: Insert the protection time slot interval into the time slot resource corresponding to the node.

[0153] After determining the target route for each node, time slots are allocated to the nodes. First, the flexible protection time slots are dynamically adjusted, specifically based on the train's current speed. The formula is as follows:

[0154] ;

[0155] in, To protect the time slot interval, Let c be the train's current speed and c be the speed of light.

[0156] Furthermore, based on the target route and the Hungarian algorithm, the three-dimensional resource matrix Resource[t][f][s] is globally allocated. It should be noted that the three-dimensional resource matrix Resource[t][f][s] is also known as the time-frequency cube, whose dimensions include time slot t, frequency band f, and track segment number s. Simultaneously, it controls whether adjacent nodes have different frequencies or time slots, or when adjacent nodes use the same frequency, the difference in their track segment numbers must satisfy a certain condition. (That is, at least 2 complete blocks apart), and the time slot interval in the same frequency band is ≥3 time slot units (Δt≥3). When a new service triggers time slot allocation, nodes with a load of <60% are selected as relays to avoid co-channel interference and ultimately generate the time slot resources corresponding to the nodes.

[0157] Finally, the determined protection time slot intervals are dynamically inserted into the time slot resources corresponding to the nodes to compensate for the high-speed Doppler effect. For example, a 27.83ms protection time slot interval is generated when the train is running at 600km / h to ensure no interference between time slots. An example time slot allocation table is given below:

[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, while service 002 is allocated to time slot t2, frequency band f1, and orbital position s5. This time slot allocation method ensures spatial isolation and efficient spectrum reuse.

[0161] Based on the above embodiments, in some embodiments, before inserting the guard time slot interval into the time slot resource corresponding to the node, and after generating the time slot resource corresponding to the node, the method further includes:

[0162] S138: When the master node receives the preliminary time slot resource occupancy information unicast by each node, the master node determines whether there is a resource conflict based on the time slot resource occupancy information of each node; wherein, the time slot resource occupancy information includes the routing comprehensive score of the target route of the corresponding node; if yes, proceed to step S139; if no, proceed to step S137.

[0163] S139: Control the nodes among which there are resource conflicts, and the nodes whose distance from the front of the train meets the preset distance occupy the corresponding time slot resources.

[0164] S140: Control the remaining nodes to execute the binary exponential backoff strategy, delay for a preset time, and then return to step S136; wherein, the specific process of the nodes executing the binary exponential backoff strategy includes: determining the current count value of the collision counter; uniformly and randomly selecting an integer from the preset integer set as the target integer based on the count value; all integers in the preset integer set are positive integers; determining the preset time corresponding to each node based on 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.

[0165] To avoid multiple nodes competing for the same resource, after generating the time slot resources corresponding to a node, the master node receives the preliminary time slot resource occupancy information unicast by each node. The master node then needs to determine whether there are resource conflicts based on this information, specifically checking for time slot and frequency band conflicts and ensuring that the track segment spacing between adjacent nodes is no greater than 2. It should be noted that the time slot resource occupancy information includes the overall routing score of the corresponding node's target route.

[0166] If it is confirmed that there is no resource conflict in the current allocation, the allocation of the current time slot resource will proceed. If it is confirmed that there is a resource conflict in the current allocation, the nodes among the nodes with resource conflicts that are at a preset distance from the front of the train will occupy the corresponding time slot resource. For example, nodes closer to the front of the train (such as 001-01) will be given priority to occupy the time slot resource, and the remaining nodes will use a binary exponential backoff strategy to retry the time slot allocation after a preset delay to avoid continuous conflicts.

[0167] To achieve binary exponential backoff, a collision counter k needs to be set in the specific implementation. The initial value of the counter is 0, and its count value k increases by 1 for each collision, with an upper limit of 10. When performing binary exponential backoff, it is first necessary to determine the current count value of the collision counter, and then randomly select an integer r from a preset integer set based on the count value. For example, the preset integer set can be [0, 1, ..., (2... k - 1)], when the count value k is 2, the preset integer set is [0, 1, 3]. It can be understood that all integers in the preset integer set are positive integers. Further, based on the slot unit value Slot Time, the target integer r, and the route comprehensive score C of each node's target route... i The average of the route comprehensive scores C for the target routes of each node. avg The preset time corresponding to each node, i.e. the actual retreat time, is determined separately, and the specific formula is as follows:

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

[0169] Where T is the actual retreat time.

[0170] Based on the above embodiments, in some embodiments, the master node broadcasts radio control messages to other nodes, including:

[0171] S141: The master node broadcasts radio control messages to the other nodes at a preset period.

[0172] The radio control message includes a conformance protocol header, a route update flag, a timeslot update flag, direction information, link status, CPU load, routing data, and timeslot occupancy data.

[0173] In practice, the master node broadcasts radio control messages to other nodes at a preset period. This embodiment does not limit the preset period; for example, it can be 100ms. The radio control message consists of a consistency protocol header (including the current Raft term number, committed log index number, and log type mask), a route update flag, a slot update flag, direction information, link status (RSSI, packet loss rate), CPU load, routing data, and slot occupancy data. A route update flag set to 1 indicates a route data update; a slot update flag set to 1 indicates a slot occupancy data update; if both are set to 0, it is a neighbor probe message.

[0174] In this embodiment, the master node synchronizes the routing and time slot table through a preset periodic broadcast, thus avoiding communication interruptions caused by network topology changes.

[0175] Based on the above embodiments, in some embodiments, before selecting the target route corresponding to the node according to the corresponding neighbor table and routing table, after confirming that the node has communication needs, the method further includes:

[0176] S15: Determine whether there is a valid route for the node according to the corresponding routing table; if yes, proceed to step S13; if no, proceed to step S16.

[0177] S16: Output a message indicating that the node does not have a valid route, and return to the step of determining whether the node has a valid route based on the corresponding routing table.

[0178] In practice, to ensure successful target route selection, after confirming the node's communication needs, it's necessary to determine if a valid route exists for the node based on the corresponding routing table. Specifically, this involves checking if a target node entry exists in the routing table and verifying that the hop count and link lifetime meet the requirements. If a valid route exists, the process proceeds to selecting the target route for the node based on the corresponding neighbor table and routing table. If no valid route exists, a message indicating that no valid route exists for the node is output to prompt the user to maintain the node's route. After maintenance, the process returns to the step of determining if a valid route exists for the node based on the corresponding routing table.

[0179] Figure 3 This is a schematic diagram illustrating a scenario where a curve causes a vehicle-to-vehicle straight-through traffic transition to vehicle-to-ground / vehicle communication, as provided in an embodiment of this application. Figure 4 This is a schematic diagram illustrating a vehicle-to-ground / vehicle communication scenario with a large safety interval, as provided in an embodiment of this application. Figure 3 and Figure 4 As shown, the topology of the train-to-ground wireless communication system may change during train operation, necessitating route updates to ensure node communication connectivity. Therefore, based on the above embodiments, 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 has been described in detail. This application also provides embodiments corresponding to the time slot resource allocation device.

[0189] Figure 6 This is a schematic diagram of a time slot resource allocation device provided in an embodiment of this application. The device is applied to a vehicle-to-ground wireless communication system; the vehicle-to-ground wireless communication system includes multiple nodes, and the nodes are communicatively connected; wherein, each node includes at least a ground wireless unit and a vehicle-mounted wireless terminal; as shown... Figure 6 As shown, the device includes:

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

[0191] The second construction module 11 is used to construct a routing table corresponding to each node based on each neighbor table; wherein, the routing table contains the data forwarding path information of the corresponding node;

[0192] The judgment module 12 is used to select the master node among the nodes and determine whether each node has a communication requirement; if so, the selection confirmation module 13 is triggered.

[0193] The selection and determination module 13 is used to select the 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 time slot resource occupancy information to the master node.

[0194] The broadcast module 14 is used to broadcast radio control messages to other nodes through the master node; wherein the radio control message contains at least the final time slot resource occupancy information and backoff information.

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

[0196] The first acquisition module is used to acquire the track segment number and group number of each track section, and determine the position code of each node based on the track segment number and group number.

[0197] The acquisition submodule is used to control each node to acquire the signal strength, bit error rate, CPU load and direction information of the corresponding adjacent nodes;

[0198] The first generation submodule is used to generate a neighbor table for each node based on the location encoding of each node, as well as the signal strength, bit error rate, CPU load and direction information of the corresponding adjacent nodes.

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

[0200] The first determination submodule is used to determine the link lifecycle corresponding to the node based on the train's current speed, braking coefficient, and the radius of curvature of the track section where the node is located; and to determine the destination node of the corresponding communication service based on the node's communication requirements.

[0201] The second determination submodule is used to determine the next-hop address, next-hop load and hop count of the destination node based on the corresponding neighbor table, so as to determine the routing link and the real-time signal strength and real-time bit error rate corresponding to the routing link;

[0202] The third determination submodule is used to determine the link stability value corresponding to the routing link based on the real-time signal strength and real-time bit error rate.

[0203] The second generation submodule is used to generate the routing table corresponding to the node based on the destination node, next-hop address, next-hop load, hop count, link lifetime, and link stability value.

[0204] In some embodiments, the determining module 12 includes:

[0205] The second acquisition submodule is used to acquire the neighbor table and routing table corresponding to each node;

[0206] The fourth determination submodule is used to determine the main node based on each neighbor table and routing table, and the nodes whose corresponding routing table update time meets the preset requirements, whose CPU load is less than the load threshold, and whose signal strength is greater than the signal strength threshold.

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

[0208] In some embodiments, the selection of the determining module 13 includes:

[0209] The fifth determination submodule is used to determine the bend flag, CPU load, and link stability value of a node based on the corresponding neighbor table and routing table.

[0210] The sixth determination submodule is used to input the curve marker, CPU load and link stability values ​​into the state space of the dynamic weighted routing model to determine the routing comprehensive score weight corresponding to the node; wherein, the dynamic weighted routing model is a Q-value function model pre-trained based on historical data to predict the routing comprehensive score weight;

[0211] The seventh determination submodule is used to determine the overall routing score of each route corresponding to a node based on the overall routing score weight and the overall routing score calculation formula.

[0212] The eighth determination submodule is used to determine the route with the highest comprehensive score as the target route for the node.

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

[0214] The protection interval determination module is used to determine the protection time slot interval based on the current speed of the train.

[0215] The third generation submodule is used to globally allocate the 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 in order to generate the 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] The protection interval insertion submodule is used to insert the protection time slot interval into the time slot resource corresponding to the node.

[0217] In some embodiments, it also includes:

[0218] The conflict determination module is used to determine whether there is a resource conflict when the master node receives the preliminary time slot resource occupancy information of each node via unicast. The time slot resource occupancy information includes the routing comprehensive score of the target route of the corresponding node. If so, the time slot occupancy module is triggered; otherwise, the protection interval insertion submodule is triggered.

[0219] The time slot occupancy module is used to control which nodes among those with resource conflicts occupy the corresponding time slot resources if the distance from the front of the train meets the preset distance.

[0220] The backoff strategy execution module controls the remaining nodes to execute the binary exponential backoff strategy, triggering the third generation submodule after a preset delay. The specific process of a node executing the binary exponential backoff strategy includes: determining the current count value of the collision counter; uniformly and randomly selecting an integer from a preset integer set as the target integer based on the count value; ensuring that all integers in the preset integer set are positive integers; and determining the preset time for each node based on the time slot unit value, the target integer, the route comprehensive score of each node's target route, and the average of the route comprehensive scores of each node's target route.

[0221] In some embodiments, the broadcast module 14 includes:

[0222] The message broadcast submodule is used by the master node to broadcast wireless control messages to other nodes at a preset period.

[0223] The radio control message includes a conformance protocol header, a route update flag, a timeslot update flag, direction information, link status, CPU load, routing data, and timeslot occupancy data.

[0224] In some embodiments, it also includes:

[0225] The valid route determination module is used to determine whether a node has a valid route based on the corresponding routing table; if yes, the selection confirmation module 13 is triggered; if no, the prompt module is triggered.

[0226] The prompt module is used to output a prompt message indicating that no valid route exists for the node, and to trigger the valid route judgment module.

[0227] In some embodiments, it also includes:

[0228] The route failure detection module is used to determine whether there is a route failure for any node; if so, the route update module is triggered.

[0229] The route update module is used to trigger route updates for failed nodes, release the time slot resources occupied by the failed nodes, and update the corresponding time slot table.

[0230] The table entry update module is used to update the neighbor table and routing table corresponding to the route failure node, and broadcast the updated part of the routing table and time slot table of the route failure node through the master node;

[0231] The time slot reallocation module is used to reallocate the corresponding time slot resources to the failed routing node based on the updated neighbor table and routing table of the failed routing node.

[0232] In some embodiments, it also includes:

[0233] The utilization rate judgment module is used to determine whether the utilization rate of the three-dimensional resource matrix is ​​greater than the utilization rate threshold; if so, the hop count weight of the dynamic weighted routing selection model is increased through the master node.

[0234] In some embodiments, it also includes:

[0235] The table entry synchronization module is used to synchronize the corresponding routing table and time slot table to other nodes through the master node.

[0236] Since the embodiments of the apparatus and the embodiments of the method correspond to each other, please refer to the description of the embodiments of the method for the embodiments of the apparatus, which will not be repeated here.

[0237] Figure 7 This is a structural diagram of a time slot resource allocation device provided in an embodiment of this application. Figure 7 As shown, the time slot resource allocation device includes:

[0238] Memory 20 is used to store computer programs;

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

[0240] The processor 21 may include one or more processing cores, such as a quad-core processor or an octa-core processor. The processor 21 may be implemented using at least one of the following hardware forms: Digital Signal Processor (DSP), Field-Programmable Gate Array (FPGA), or Programmable Logic Array (PLA). The processor 21 may also include a main processor and a coprocessor. The main processor, also known as the Central Processing Unit (CPU), is used to process data in the wake-up state; the coprocessor is a low-power processor used to process data in the standby state. In some embodiments, the processor 21 may integrate a Graphics Processing Unit (GPU), which is responsible for rendering and drawing the content to be displayed on the screen. In some embodiments, the processor 21 may also include an Artificial Intelligence (AI) processor, which handles computational operations related to machine learning.

[0241] The memory 20 may include one or more computer-readable storage media, which may be non-transitory. The memory 20 may also include high-speed random access memory and non-volatile memory, such as one or more disk storage devices or flash memory devices. In this embodiment, the memory 20 is used to store at least the following computer program 201, which, after being loaded and executed by the processor 21, is capable of implementing the relevant steps of the time slot resource allocation method disclosed in any of the foregoing embodiments. In addition, the resources stored in the memory 20 may also include an operating system 202 and data 203, and the storage method may be temporary storage or permanent storage. The operating system 202 may include Windows, Unix, Linux, etc. The data 203 may include, but is not limited to, the data involved in the time slot resource allocation method.

[0242] In some embodiments, the time slot resource allocation device may 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 will understand that Figure 7 The structure shown does not constitute a limitation on the time slot resource allocation device and may include more or fewer components than illustrated.

[0244] Finally, this application also provides an embodiment corresponding to a computer-readable storage medium. The computer-readable storage medium stores a computer program, which, when executed by a processor, implements the steps described in the above method embodiments.

[0245] It is understood that if the methods in the above embodiments are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This 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 this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0246] The above provides a detailed description of a time slot resource allocation method, apparatus, device, and medium provided in this application. The various embodiments in the specification are described in a progressive manner, with each embodiment focusing on its differences from other embodiments. Similar or identical parts between embodiments can be referred to interchangeably. For the apparatus disclosed in the embodiments, since it corresponds to the method disclosed in the embodiments, the description is relatively simple; relevant parts can be referred to in the method section. It should be noted that those skilled in the art can make several improvements and modifications to this application without departing from the principles of this application, and these improvements and modifications also fall within the protection scope of this application.

[0247] It should also be noted that, in this specification, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

Claims

1. A time slot resource allocation method, characterized in that, The method is applied to a vehicle-to-ground wireless communication system; the vehicle-to-ground wireless communication system includes multiple nodes, and the nodes are communicatively connected to each other; wherein, each node includes at least a ground wireless unit and a vehicle-mounted wireless terminal; the method includes: Set the location code for each node, and construct a neighbor table corresponding to each node based on the location code; wherein the neighbor table contains the neighbor relationships between the corresponding node and other nodes; A routing table corresponding to each node is constructed based on each of the neighbor tables; wherein, the routing table contains data forwarding path information for the corresponding node; Select a master node from among the nodes and determine whether each node has a communication requirement; If so, then select the target route corresponding to the node according to the 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 occupancy information to the master node; The master node broadcasts radio control messages to the other nodes; wherein the radio control messages contain at least the final occupancy information and backoff information of the time slot resources.

2. The time slot resource allocation method according to claim 1, characterized in that, Setting the location code for each node, and constructing a neighbor table corresponding to each node based on the location code, including: Obtain the track segment number and group number, and determine the position code of each node based on the track segment number and group number; Control each node to collect signal strength, bit error rate, CPU load and direction information of its corresponding adjacent nodes; Based on the location code of each node, and the signal strength, bit error rate, CPU load and direction information of the corresponding neighboring nodes, a neighbor table is generated for each node.

3. The time slot resource allocation method according to claim 2, characterized in that, Construct a routing table for each node based on each of the neighbor tables, including: The link lifecycle corresponding to the node is determined based on the train's current speed, braking coefficient, and the curve curvature radius of the track section where the node is located. The destination node for the corresponding communication service is determined based on the communication requirements of the node. The next-hop address, next-hop load, and hop count of the destination node are determined based on the corresponding neighbor table to determine the routing link, and the real-time signal strength and real-time bit error rate corresponding to the routing link are determined. Based on the real-time signal strength and the real-time bit error rate, determine the link stability value corresponding to the routing link; The routing table corresponding to the node is generated based on the destination node, the next-hop address, the next-hop load, the hop count, the link lifetime, and the link stability value.

4. The time slot resource allocation method according to claim 3, characterized in that, Selecting a master node from among the aforementioned nodes includes: Obtain the neighbor table and the routing table corresponding to each node; Based on the neighbor tables and the routing tables, the node whose update time for the corresponding routing table meets the preset requirements, 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; The update time is the average update time of the valid route entries in the routing table.

5. The time slot resource allocation method according to claim 3, characterized in that, Selecting the target route corresponding to the node based on the neighbor table and the routing table includes: Based on the corresponding neighbor table and routing table, determine the bend flag, CPU load, and link stability value of the node; The curve marker, CPU load, and link stability value are input into the state space of the dynamic weighted routing model to determine the routing comprehensive score weight corresponding to the node; wherein, the dynamic weighted routing model is a Q-value function model pre-trained based on historical data to predict the routing comprehensive score weight. Based on the route comprehensive score weight and the route comprehensive score calculation formula, determine the route comprehensive score of each route corresponding to the node; The route with the highest overall score is determined as the target route for the node.

6. The time slot resource allocation method according to claim 1, characterized in that, Determining the time slot resources corresponding to the node based on the target route includes: The protection time slot interval is determined based on the train's current speed; The three-dimensional resource matrix is ​​globally allocated based on 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 resources corresponding to the nodes; wherein, the dimensions of the three-dimensional resource matrix include time slots, frequency bands and track segment numbers; The protection time slot interval is inserted into the time slot resource corresponding to the node.

7. The time slot resource allocation method according to claim 6, characterized in that, Before inserting the protection time slot interval into the time slot resource corresponding to the node, after generating the time slot resource corresponding to the node, the method further includes: When the master node receives the preliminary time slot resource occupancy information unicast by each of the nodes, the master node determines whether there is a resource conflict based on the time slot resource occupancy information corresponding to each node; wherein, the time slot resource occupancy information includes the comprehensive routing score of the target route corresponding to the node; If so, then among the nodes with resource conflicts, the node whose distance from the front of the vehicle meets the preset distance occupies the corresponding time slot resource; The remaining nodes are controlled to execute a binary exponential backoff strategy, and after a preset delay, return to the step of globally allocating the three-dimensional resource matrix according to the target route and the Hungarian algorithm. The specific process of the nodes executing the binary exponential backoff strategy includes: determining the current count value of the conflict counter; uniformly and randomly selecting an integer from a preset integer set as the target integer based on the count value; all integers in the preset integer set are positive integers; and determining the preset time corresponding to each node based on the time slot unit value, the target integer, the route comprehensive score of the target route for each node, and the average of the route comprehensive scores of the target routes for each node. If not, proceed to the step of inserting the protection time slot interval into the time slot resource corresponding to the node.

8. The time slot resource allocation method according to claim 1, characterized in that, The master node broadcasts radio control messages to the other nodes, including: The master node broadcasts the wireless control message to the other nodes at a preset period; The radio control message includes a consistency protocol header, a route update flag, a timeslot update flag, direction information, link status, CPU load, routing data, and timeslot occupancy data.

9. The time slot resource allocation method according to claim 1, characterized in that, Before selecting the target route corresponding to the node based on the neighbor table and the routing table, after confirming that the node has a communication requirement, the process further includes: Determine whether the node has a valid route based on the corresponding routing table; If so, proceed to the step of selecting the target route corresponding to the node based on the neighbor table and the routing table; If not, output a message indicating that the node does not have a valid route, and return to the step of determining whether the node has a valid route based on the corresponding routing table.

10. The time slot resource allocation method according to claim 1, characterized in that, Also includes: Determine if any of the nodes have experienced routing failures; If so, then trigger the route update of the route failure node, release the time slot resources occupied by the route failure node, and update the corresponding time slot table; Update the neighbor table and the routing table corresponding to the route failure node, and broadcast the updated portion of the routing table and time slot table of the route failure node through the master node; Based on the updated neighbor table and routing table of the route-failed node, the corresponding time slot resources are reassigned to the route-failed node.

11. The time slot resource allocation method according to claim 6, characterized in that, Also includes: Determine whether the utilization rate of the three-dimensional resource matrix is ​​greater than a utilization rate threshold; If so, the hop count weight of the dynamic weighted routing model is increased through the master node.

12. The time slot resource allocation method according to any one of claims 1 to 11, characterized in that, After broadcasting the radio control message to the other nodes through the master node, the method further includes: The master node synchronizes the corresponding routing table and time slot table with the other nodes.

13. A time slot resource allocation device, characterized in that, An application in a vehicle-to-ground wireless communication system; the vehicle-to-ground wireless communication system includes multiple nodes, and the nodes are communicatively connected to each other; wherein, each node includes at least a ground wireless unit and a vehicle-mounted wireless terminal; the device includes: The first construction module is used to set the location code of each node and construct a neighbor table corresponding to each node according to the location code; wherein, the neighbor table contains the neighbor relationship between the corresponding node and other nodes; The second construction module is used to construct a routing table corresponding to each node based on each of the neighbor tables; wherein, the routing table contains data forwarding path information of the corresponding node; The judgment module is used to select a master node among the nodes and determine whether each node has a communication requirement; if so, the selection confirmation module is triggered. The selection and determination module is used to select the target route corresponding to the node according to the 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 occupancy information to the master node. The broadcast module is used to broadcast radio control messages to the other nodes through the master node; wherein the radio control messages contain at least the final occupancy information and backoff information of the time slot resources.

14. A time-slot resource allocation device, characterized in that, include: Memory, used to store computer programs; A processor, configured to implement the steps of the time slot resource allocation method as described in any one of claims 1 to 12 when executing the computer program.

15. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the steps of the time slot resource allocation method as described in any one of claims 1 to 12.

Images