CN113873473B

CN113873473B - Method, system, equipment and train for realizing low-delay resource scheduling

Info

Publication number: CN113873473B
Application number: CN202111124457.XA
Authority: CN
Inventors: 王晓红; 栾瑾; 刘先恺; 田毅; 赵志林
Original assignee: CRRC Qingdao Sifang Co Ltd
Current assignee: CRRC Qingdao Sifang Co Ltd
Priority date: 2021-09-24
Filing date: 2021-09-24
Publication date: 2024-01-09
Anticipated expiration: 2041-09-24
Also published as: CN113873473A

Abstract

The embodiment of the application discloses a method, a system, equipment and a train for realizing low-delay resource scheduling, which can determine an authorized time slot for transmitting first service data of a node according to a first resource scheduling request message sent by a previous-hop node and a public node time slot table of the node, and can determine the authorized time slot by sending the resource scheduling request message once between two-hop nodes, so that the interaction process between nodes required for determining the authorized time slot is reduced, the time consumed by communication between the trains serving as the nodes is reduced, and the time delay of communication between the trains is reduced.

Description

Method, system, equipment and train for realizing low-delay resource scheduling

Technical Field

The present application relates to the field of communications technologies, and in particular, to a method, a system, an apparatus, and a train for implementing low latency resource scheduling.

Background

In the running process of the train, the train needs to communicate with other trains and a control center through ground equipment so as to realize running control of the train and ensure normal running of the train.

Currently, communication between trains relies primarily on ground equipment. The ground equipment forwards the train generated message to other trains. When a communication system is built, building a large number of ground equipment results in high building cost of a train communication network. If the communication mode between trains is adopted, the cost of building ground equipment can be reduced, but the communication process is easily affected by the operation of the trains, and the communication time delay is higher. Therefore, how to reduce the time delay in communication between trains is a problem to be solved.

Disclosure of Invention

In view of this, the embodiments of the present application provide a method, a system, an apparatus, and a train for implementing low-latency resource scheduling, which can reduce the latency of communication between trains.

In order to solve the above problems, the technical solution provided in the embodiments of the present application is as follows:

in a first aspect, the present application provides a method for implementing low latency resource scheduling, where the method is applied to a forwarding node transmitting first service data, the method includes:

acquiring a first resource scheduling request message sent by a previous hop node; the first resource scheduling request message comprises a public node time slot table of the previous hop node; the common node time slot table of the previous hop node is generated according to the node time slot table of the previous hop node and the node time slot table of the neighbor node of the previous hop node; the public node time slot table of the previous hop node comprises a request time slot, wherein the request time slot is an authorized time slot which is determined by the previous hop node and used for transmitting the first service data;

when the number of neighbor nodes of the node is smaller than a number threshold value, a public node time slot table of the node is obtained, and the public node time slot table of the node is generated according to the node time slot table of the node and the node time slot table of the neighbor nodes of the node;

When the time slot corresponding to the request time slot is an available time slot in the public node time slot table of the node, determining the time slot corresponding to the request time slot as an authorized time slot for the node to transmit the first service data; and sending a second resource scheduling request message to the next hop node, wherein the second resource scheduling request message comprises a public node time slot table of the node.

In one possible implementation, the method further includes:

when the time slot corresponding to the request time slot is the occupied time slot in the public node time slot table of the node, acquiring a service selection result; the service selection result is determined according to a first hop count of a node transmitting the first service data and a second hop count of a node transmitting the second service data; the second service data is the service data occupying the time slot corresponding to the request time slot;

when the service selection result is that the time slot of the first service data is determined, determining the time slot corresponding to the request time slot as the authorized time slot for transmitting the first service data by the node;

and when the service selection result is that the time slot for transmitting the first service data is redetermined, transmitting a re-application request to a source node for transmitting the first service data.

In one possible implementation manner, when the request time slot is an occupied time slot in the public node time slot table of the node, acquiring a service selection result includes:

when the request time slot is an occupied time slot in a public node time slot table of the node, acquiring a first hop count for transmitting the first service data;

transmitting the first hop count to a target node so that the target node generates a service selection result according to the first hop count; the target node is a neighbor node of the first node transmitting the first service data, and the request time slot in the node time slot table of the target node is an occupied time slot;

and acquiring a service selection result sent by the target node.

when the request time slot is an occupied time slot in the public node time slot table of the node, acquiring a first hop count for transmitting the first service data and a second hop count related to the second resource scheduling request;

And obtaining a service selection result according to the first hop count and the second hop count.

In one possible implementation, the method further includes:

sending the service selection result to a target node; the target node is a neighbor node of the first node, and the request time slot in the node time slot table of the target node is an occupied time slot.

In one possible implementation, the method further includes:

according to the authorized time slot for transmitting the first service data determined by the node, adjusting a node time slot table of the node;

and sending the adjusted node time slot table of the node to other nodes.

In one possible implementation manner, when the number of neighbor nodes of the node is greater than or equal to a number threshold, the method further includes:

acquiring the time slot number of the request time slot;

transmitting a third resource scheduling request message to a next-hop node, wherein the third resource scheduling request message comprises the time slot number, so that the next-hop node determines available time slots for transmitting the first service data according to a common node time slot table of the next-hop node and the time slot number

Acquiring a resource scheduling grant message sent by the next-hop node, wherein the resource scheduling grant message comprises an available time slot for transmitting the first service data, which is determined by the next-hop node;

And determining an authorized time slot for transmitting the first service data by the node according to the available time slot of the first service data determined by the next hop node and a common node time slot table of the node.

In a second aspect, the present application provides a method for implementing low latency resource scheduling, where the method is applied to a destination node transmitting first service data, the method includes:

acquiring a resource scheduling request message sent by a previous hop node; the resource scheduling request message comprises a public node time slot table of the previous hop node; the common node time slot table of the previous hop node is generated according to the node time slot table of the previous hop node and the node time slot table of the neighbor node of the previous hop node; the public node time slot table of the previous hop node comprises a request time slot, wherein the request time slot is an authorized time slot which is determined by the previous hop node and used for transmitting the first service data;

the method comprises the steps of obtaining a public node time slot table of a node, wherein the public node time slot table of the node is generated according to the node time slot table of the node and the node time slot tables of neighbor nodes of the node;

and when the time slot corresponding to the request time slot is an available time slot in the public node time slot table of the node, determining the time slot corresponding to the request time slot as an authorized time slot for the node to transmit the first service data.

In a third aspect, the present application provides a method for implementing low latency resource scheduling, where the method is applied to a source node transmitting first service data, the method includes:

acquiring data information of first service data;

determining an authorized time slot for transmitting the first service data according to the data information of the first service data and the public node time slot table of the node;

and sending a first resource scheduling request message to a next hop node, wherein the first resource scheduling request message comprises a public node time slot table of the node.

determining the time slot number of the authorized time slots according to the data information of the first service data;

transmitting a second resource scheduling request message to a next-hop node, wherein the second resource scheduling request message comprises the time slot number, so that the next-hop node determines an available time slot for transmitting the first service data according to a common node time slot table of the next-hop node and the time slot number;

and determining an authorized time slot for transmitting the first service data by the node according to the available time slot for transmitting the first service data determined by the next hop node and a common node time slot table of the node.

In a fourth aspect, the present application provides a system for implementing low-latency resource scheduling, where the system includes a source node for transmitting first service data, a forwarding node, and a destination node, where the source node is connected to the forwarding node, and the forwarding node is connected to the destination node;

the source node is configured to execute the method for implementing low-latency resource scheduling according to any one of the embodiments of the third aspect;

the forwarding node is configured to perform the method for implementing low-latency resource scheduling according to any one of the embodiments of the first aspect;

the destination node is configured to perform the method for implementing low latency resource scheduling described in the second aspect.

In a fifth aspect, the present application provides a system for implementing low latency resource scheduling, where the system includes a source node and a destination node for transmitting first service data, where the source node is connected with the destination node;

In a sixth aspect, the present application provides an apparatus for implementing low latency resource scheduling, where the apparatus includes: a processor, memory, system bus;

the processor and the memory are connected through the system bus;

the memory is for storing one or more programs, the one or more programs comprising instructions, which when executed by the processor, cause the processor to perform the method of any of the first aspect, or the method of the second aspect, or the method of the third aspect.

In a seventh aspect, the present application provides a train, including the apparatus for implementing low latency resource scheduling described in the sixth aspect.

From this, the embodiment of the application has the following beneficial effects:

according to the method, the system, the equipment and the train for realizing low-delay resource scheduling, a source node obtains data information of first service data, when the number of neighbor nodes of the source node is smaller than a number threshold value, a public node time slot table of the source node is obtained, the source node determines an authorized time slot for transmitting the first service data according to the data information of the first service data and the public node time slot table of the source node, and a first resource scheduling request message is sent to a next hop node. The forwarding node acquires the first resource scheduling request message, when the number of neighbor nodes of the forwarding node is smaller than a number threshold value, acquires a public node time slot table of the forwarding node, when a time slot corresponding to a request time slot in the public node time slot table of the forwarding node is an available time slot, determines the time slot corresponding to the request time slot as an authorized time slot for transmitting the first service data of the forwarding node, and transmits a second resource scheduling request message to the next hop node. The destination node obtains a first resource scheduling request message sent by the previous hop node, and obtains a public node time slot table of the destination node, if a time slot corresponding to the request time slot is an available time slot in the public node time slot table of the destination node, the time slot corresponding to the request time slot is determined to be an authorized time slot for the destination node to transmit the first service data.

Therefore, according to the first resource scheduling request message sent by the previous hop node and the public node time slot table of the node, the authorized time slot for transmitting the first service data of the node can be determined, the authorized time slot can be determined by sending the resource scheduling request message once between the two hop nodes, the interaction process between the nodes required for determining the authorized time slot is reduced, the time consumed by communication between trains serving as the nodes is reduced, and the time delay of communication between trains is reduced.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive faculty for a person skilled in the art.

Fig. 1 is a schematic diagram of a scenario of a method for implementing low-latency resource scheduling according to an embodiment of the present application;

fig. 2 is a schematic structural diagram of a system for implementing low-latency resource scheduling according to an embodiment of the present application;

Fig. 3 is a schematic structural diagram of another system for implementing low-latency resource scheduling according to an embodiment of the present application;

fig. 4 is a schematic structural diagram of a system for implementing low-latency resource scheduling according to an embodiment of the present application;

fig. 5 is a schematic diagram of a common node slot table of node 0 according to an embodiment of the present application;

fig. 6 is a schematic diagram of a common node slot table of a node 3 according to an embodiment of the present application;

fig. 7 is a flowchart of a method for implementing low latency resource scheduling according to an embodiment of the present application;

fig. 8 is a flowchart of another method for implementing low latency resource scheduling according to an embodiment of the present application;

fig. 9 is a flowchart of another method for implementing low latency resource scheduling according to an embodiment of the present application.

Detailed Description

In order to facilitate understanding and explanation of the technical solutions provided by the embodiments of the present application, the background art of the present application will be described first.

After studying the conventional method of communication between trains, it has been found that, at present, communication between trains is usually carried out by means of ground equipment arranged beside the track. In the construction process of the train track system, excessive ground equipment can lead to a complex train communication network structure and high construction difficulty. And, the message is forwarded through the ground equipment, so that excessive time delay can be generated, and the timeliness of message processing is affected. When the train is directly communicated with the train, the communication time delay is higher, and the communication process is influenced.

Based on this, the embodiment of the application provides a method for realizing low-delay resource scheduling, a source node obtains data information of first service data, and when the number of neighbor nodes of the source node is smaller than a number threshold, a public node time slot table of the source node is obtained, and the source node determines an authorized time slot for transmitting the first service data according to the data information of the first service data and the public node time slot table of the source node and sends a first resource scheduling request message to a next hop node. The forwarding node acquires the first resource scheduling request message, when the number of neighbor nodes of the forwarding node is smaller than a number threshold value, acquires a public node time slot table of the forwarding node, when a time slot corresponding to a request time slot in the public node time slot table of the forwarding node is an available time slot, determines the time slot corresponding to the request time slot as an authorized time slot for transmitting the first service data of the forwarding node, and transmits a second resource scheduling request message to the next hop node. The destination node obtains a first resource scheduling request message sent by the previous hop node, and obtains a public node time slot table of the destination node, if a time slot corresponding to the request time slot is an available time slot in the public node time slot table of the destination node, the time slot corresponding to the request time slot is determined to be an authorized time slot for the destination node to transmit the first service data.

In order to facilitate understanding of a method for implementing low latency resource scheduling provided in the embodiments of the present application, the following description is provided with reference to the scenario example shown in fig. 1. Referring to fig. 1, the diagram is a schematic view of a scenario of a method for implementing low-latency resource scheduling according to an embodiment of the present application.

In practical application, the source node 101 determines an authorized time slot for transmitting the first service data according to the data information of the first service data and the public node time slot table, generates a resource scheduling request message according to the authorized time slot for transmitting the first service data determined by the source node, and sends the resource scheduling request message to the next hop node. When the next hop node is a forwarding node, the forwarding node 102 acquires the received resource scheduling request message of the previous hop node, and acquires the node public slot table when the number of neighbor nodes of the forwarding node is smaller than the number threshold value. When the time slot corresponding to the request time slot in the public node time slot table of the node is an available time slot, determining the time slot corresponding to the request time slot as an authorized time slot for the node to transmit the first service data. And generating a resource scheduling request message according to the public node time slot table of the node, and sending the resource scheduling request message to the next hop node. And if the next hop node is a forwarding node, repeating the operation. If the next hop node is the destination node 103, the destination node 103 obtains the resource scheduling request message of the previous hop node, and judges whether the time slot corresponding to the request time slot is an available time slot according to the public node time slot table of the node. If the time slot corresponding to the request time slot is an available time slot, determining the time slot corresponding to the request time slot in a common node time slot table of the node as an authorized time slot. The authorized time slot of each node transmitting the first service data is determined in this way, and the scheduling of resources is realized. In the process of resource scheduling, the interactive flow between nodes is reduced, and the time delay is reduced.

In order to facilitate understanding of the technical solution provided by the embodiments of the present application, a method for implementing low-latency resource scheduling provided by the embodiments of the present application is described below with reference to the accompanying drawings.

Firstly, it should be noted that the method for implementing low-latency resource scheduling provided in the embodiment of the present application may be applied to a communication system of a wireless ad hoc network constructed by a communication node corresponding to a train. Each node may be a communication node corresponding to a train, specifically may be a communication node corresponding to a whole train, or may be a communication node corresponding to a train set. The configuration may be specifically set according to the communication requirement of the train, which is not limited in the embodiment of the present application.

In order to facilitate the explanation of the process of determining the authorized time slots by each node transmitting the first service data, a system for implementing low-latency resource scheduling will be described.

Referring to fig. 2, the diagram is a schematic structural diagram of a system for implementing low-latency resource scheduling according to an embodiment of the present application.

The system comprises a source node 201, a forwarding node 202 and a destination node 203. The source node 201 is a node that starts a resource scheduling process, that is, a node that starts transmitting the first service data. The destination node 203 is a node that receives the first traffic data. The forwarding node 202 is a node that forwards the first traffic data to the destination node 203.

It should be noted that the source node 201 is determined with respect to the node that needs to transmit the first service data, and is independent of the distribution of the nodes in the entire communication network.

The source node 201 performs the following five steps:

a1: and acquiring data information of the first service data.

The first service data is service data to be transmitted by the source node 201. The data information of the first service data includes information related to the first service data, such as a source node, a forwarding node and a destination node to which the first service data is to be transmitted, a priority of transmitting the first service data, a service type to which the first service data belongs, and the like. In one possible implementation, the primitives may be issued by the network layer. The primitive includes data information such as a destination node, a source node, a forwarding node, a priority of transmitting the first service data, a service type to which the first service data belongs, and the like. After the source node 201 receives the issued primitive, the media access control layer performs error checking on the primitive. If the first service data is abnormal, a scheduling information unit can be generated, wherein the scheduling information unit comprises a destination node, a source node and a forwarding node, and the priority of the first service data is transmitted, and the data information such as the service type of the first service data is included.

The source node 201 may determine a node that needs to perform resource scheduling according to the data information of the first service data, thereby determining a next hop node. The source node 201 may determine the number of time slots required to transmit the first traffic data based on the first traffic data.

A2: and determining the size relation between the number of neighbor nodes of the node and a number threshold value.

The neighbor nodes of the source node 201 are nodes directly connected to the source node 201 and nodes indirectly connected to the source node 201. Specifically, in the embodiment of the present application, the neighboring node of the source node 201 may be a node within the two-hop range of the source node 201.

When the number of neighbor nodes of the source node 201 is smaller, the number of different service data that the node needs to transmit may be smaller, the probability of occurrence of scheduling conflict when the node schedules to transmit the resources of the different service data is smaller, and after the node determines the authorized time slot, the next hop node may determine the authorized time slot. When the number of neighbor nodes of the source node 201 is larger, the number of different service data that the node needs to transmit may be larger, and the probability of occurrence of scheduling conflict when the node schedules the resources for transmitting the different service data is larger. Therefore, the authorized time slot of the node can be determined after the node negotiates with the next hop, and scheduling conflict is avoided.

The number of the present node, that is, the neighboring nodes of the source node 201 is compared with the number threshold, so as to determine the magnitude relationship between the number of the neighboring nodes of the source node 201 and the number threshold. When the number of neighbor nodes of the source node 201 is smaller than the number threshold, the number of neighbor nodes of the source node 201 can be considered to be smaller.

The number threshold may be determined based on the network size of the communication network, as well as the network environment. For example, a number threshold may be determined using a simulation test method. The number threshold may be 15, for example.

A3: and when the number of the neighbor nodes of the node is smaller than a number threshold value, acquiring a public node time slot table of the node, wherein the public node time slot table of the node is generated according to the node time slot table of the node and the node time slot table of the neighbor nodes of the node.

The source node 201 may directly determine the grant time slot when the number of neighbor nodes of the own node is less than the number threshold.

The source node 201 acquires the common node slot table of the own node. The common node slot table is generated from the node slot table of the source node 201 and the node slot tables of the neighbor nodes of the source node 201. Specifically, the source node 201 may obtain a node slot table of the source node 201 and a neighbor node slot table of the source node 201, and phase-by-phase or union the node slot table of the neighbor node and the node slot table of the source node 201 to obtain a public node slot table of the source node 201. The common node slot table of the source node 201 includes corresponding occupied slots and available slots.

A4: and determining an authorized time slot for transmitting the first service data according to the data information of the first service data and the public node time slot table of the node.

The source node 201 may determine a common available time slot of the own node and the neighboring node according to the common node time slot table, and determine a time slot for transmitting the first service data, that is, an authorized time slot, from among the available time slots according to the data information of the first service data.

A5: and sending a resource scheduling request message to a next hop node, wherein the resource scheduling request message comprises a public node time slot table of the node.

After determining the grant time slot, the source node 201 transmits a resource scheduling request message to the next hop node. The resource scheduling request message may specifically be a DSCH-request (Distributed Scheduling-request, distributed scheduling request) message among DSCH (Distributed Scheduling ) messages.

The resource scheduling request message includes a public node time slot table of the node. The node time slot table of the node comprises authorized time slots. In one possible implementation, slots in the common node slot table may be set to determine authorized slots.

In addition, in order to implement resource scheduling, the resource scheduling request message may further include data information of the first service data, so that the next hop node implements resource scheduling.

The next hop node of source node 201 may be forwarding node 202. In some possible cases, the source node 201 and the destination node 203 are not directly connected, and the first traffic data needs to be forwarded by the forwarding node 202. The forwarding node may be determined by the source node according to the data information of the first service data and the connection relationship between the nodes, and the forwarding node may be one or more.

Forwarding node 202 performs the following four steps:

a6: and acquiring a resource scheduling request message sent by the last hop node.

The forwarding node 202 obtains the resource scheduling request message sent by the previous hop node. The last hop node may be a source node or a forwarding node. The resource scheduling request message sent by the previous-hop node comprises a public node time slot table of the previous-hop node. The public node time slot table of the previous hop node comprises a request time slot, wherein the request time slot is an authorized time slot which is determined by the previous hop node and used for transmitting the first service data.

A7: and when the number of the neighbor nodes of the node is smaller than a number threshold value, acquiring a public node time slot table of the node.

Forwarding node 202 also compares the number of neighbor nodes of the node to a number threshold. When the number of neighbor nodes of the node is smaller than the number threshold, the probability of time slot conflict is smaller, and the authorized time slot of the node can be determined first.

And obtaining a public node time slot table of the node. The public node time slot table of the node is generated according to the node time slot table of the node and the node time slot tables of the neighbor nodes of the node.

A8: and when the time slot corresponding to the request time slot is an available time slot in the public node time slot table of the node, determining the time slot corresponding to the request time slot as an authorized time slot for the node to transmit the first service data.

If the time slot corresponding to the request time slot is an available time slot in the public node time slot table of the node, the time slot corresponding to the request time slot is not occupied, and the method can be used for transmitting the first service data. And determining the time slot corresponding to the request time slot as an authorized time slot for transmitting the first service data by the node, namely the time slot for receiving the first service data sent by the last hop node by the node.

A9: and sending a second resource scheduling request message to the next hop node, wherein the second resource scheduling request message comprises a public node time slot table of the node.

Forwarding node 202 continues to send resource scheduling request messages to next hop nodes. The resource scheduling request message includes a common node slot table of the node. The public node time slot table of the node comprises an authorized time slot which is determined by the node and used for transmitting the first service data.

In one possible implementation, the second resource scheduling request message may further include a mode flag for determining a time slot. For the case where the number of neighbor nodes of the forwarding node is small, the mode flag may be set to a non-negotiated scheduling mode.

The next hop node of forwarding node 202 may be a forwarding node or a destination node. The forwarding node 202 may be a next-hop node determined according to the destination node, or may be a next-hop node determined according to information of a next-hop node carried by a resource scheduling request message sent by a previous-hop node.

When the next hop node of the forwarding node is the forwarding node, the next hop node executes the operation, so that the scheduling of the resources is realized.

When the next hop node of the forwarding node is the destination node 203, the destination node 203 performs the following three steps.

A10: and acquiring a resource scheduling request message sent by the last hop node.

The destination node 203 obtains the resource scheduling request message sent by the previous hop node, i.e. the forwarding node 202. The resource scheduling request message sent by the previous-hop node comprises a public node time slot table of the previous-hop node. The common node time slot table of the previous hop node is generated according to the node time slot table of the previous hop node and the node time slot tables of the neighbor nodes of the previous hop node. The common node time slot table of the previous hop node comprises a request time slot. The request time slot is an authorized time slot determined by the last hop node for transmitting the first service data.

A11: and obtaining a public node time slot table of the node.

A common node slot table of the destination node 203 is obtained. The common node slot table of the destination node 203 is generated from the node slot table of the destination node 203 and the node slot tables of the neighbor nodes of the destination node 203.

A12: and when the time slot corresponding to the request time slot is an available time slot in the public node time slot table of the node, determining the time slot corresponding to the request time slot as an authorized time slot for the node to transmit the first service data.

In the common node slot table of the destination node 203, if the slot corresponding to the request slot is an available slot, the slot corresponding to the request slot may be determined as an authorized slot for the node to transmit the first service data. After the destination node 203 determines the authorized time slot, the current resource scheduling is completed.

In another possible implementation manner, referring to fig. 3, a schematic structural diagram of another system for implementing low-latency resource scheduling according to an embodiment of the present application is shown.

The system comprises a source node 301 and a destination node 302. The source node 301 is a node that starts a resource scheduling process, that is, a node that starts transmitting the first service data. The destination node 302 is a node that receives the first traffic data.

The method for implementing low-latency resource scheduling by the source node 301 is identical to the method for implementing low-latency resource scheduling by the source node 201 in the above embodiment. The method for the destination node 302 to implement low-latency resource scheduling is identical to the method for the destination node 203 to implement low-latency resource scheduling in the above embodiment. The specific implementation manner of the source node 301 and the destination node 302 for implementing low-latency resource scheduling is referred to above, and will not be described herein.

In one possible implementation, traffic data transmitted by forwarding nodes may collide. For example, in the present forwarding node, a resource scheduling request message for transmitting different service data may be received at the same time. Or, the time slot corresponding to the request time slot may be determined to transmit other service data, and the forwarding node does not send the updated node time slot table to other nodes, so that the common node time slot table of other nodes is inaccurate, and further, time slot collision is easily caused. For example, referring to fig. 4, the diagram is a schematic structural diagram of a system for implementing low latency resource scheduling according to an embodiment of the present application. Wherein, node 0 is a source node for transmitting the first service data, node 3 is a source node for transmitting the second service data, and node 1 and node 2 are forwarding nodes for transmitting the first service data and the second service data. When node 0 determines an authorized slot for transmitting the first traffic data, and sends a resource scheduling request for the first traffic data to node 1. Referring to fig. 5, the diagram is a schematic diagram of a common node slot table of node 0 according to an embodiment of the present application. Wherein the gray grid is the authorized time slot determined by node 0. Meanwhile, the node 3 determines an authorized slot for transmitting the second service data and transmits a resource scheduling request for the second service data to the node 2. Referring to fig. 6, the diagram is a schematic diagram of a common node slot table of the node 3 according to an embodiment of the present application. In the common node time slot table of the node 0 and the node 3, no time slot occupation occurs, which results in the conflict of authorized time slots determined by the node 0 and the node 3.

Based on the foregoing, an embodiment of the present application provides a method for implementing low latency resource scheduling applied to a forwarding node transmitting first service data.

In addition to the above steps, the method comprises the following three steps:

b1: and when the time slot corresponding to the request time slot is the occupied time slot in the public node time slot table of the node, acquiring a service selection result.

The public node time slot table of the node is generated according to the node time slot table of the node and the node time slot table of the neighbor node of the node. When the time slot corresponding to the request time slot is the occupied time slot in the public node time slot table of the node, the time slot conflict is indicated.

Taking the above nodes 0 to 3 as an example, when performing resource scheduling, the node 1 and the node 2 can find that the request time slot for transmitting the first service data conflicts with the request time slot for transmitting the second service data in the obtained public node time slot table.

When the time slot conflict occurs, the forwarding node can judge which service needs to apply for the resource scheduling again in the conflicting services, and which service can continuously apply for the resource scheduling.

Specifically, the forwarding node may obtain a service selection result to determine a service that continues to apply for resource scheduling. Wherein the service selection result is determined according to a first hop count of the node transmitting the first service data and a second hop count of the node transmitting the second service data. The second service data is the service data occupying the time slot corresponding to the request time slot.

The first hop count is the hop count from the source node to the forwarding node in the node path for transmitting the first service data. That is, from the source node to the present forwarding node, the hop count increases by 1 every time a forwarding node is passed. The second hop count is a hop count from the source node to a node where a slot collision occurs in a node path for transmitting the second service data. That is, from the source node to the node where the slot collision occurs, the hop count increases by 1 every time a forwarding node is passed. And comparing the first hop count with the second hop count to obtain a service selection result.

Note that, the embodiment of the present application is not limited to the node that generates the service selection result. In one possible implementation, the first hop count and the second hop count may be acquired by the present node to generate the service selection result. In another possible implementation, the service selection result may be generated by a node transmitting other services.

In one possible case, when a time slot collision is found or there are more than two nodes where the time slot collision occurs, a node may be selected from a plurality of nodes to generate a service selection result. For example, the node that generated the service selection result may be determined by the node identification of the node. For example, a node identifying a smaller node is determined as the node that generated the service selection result.

Correspondingly, the embodiments of the present application provide two specific embodiments for obtaining the service selection result when the request slot is the occupied slot in the common node slot table of the present node, which are described below.

B2: and when the service selection result is that the time slot of the first service data is determined, determining the time slot corresponding to the request time slot as the authorized time slot for transmitting the first service data by the node.

If the service selection result is that the time slot of the first service data is determined, the instruction that the authorized time slot for transmitting the first service data needs to be continuously determined is provided. The forwarding node may determine a time slot corresponding to the request time slot as an authorized time slot for the node to transmit the first service data. Correspondingly, the resources of the second service data can be reapplied. And allocating the conflicting time slots for transmitting the first service data so as to realize the scheduling of the resources.

B3: and when the service selection result is that the time slot for transmitting the first service data is redetermined, transmitting a re-application request to a source node for transmitting the first service data.

If the service selection result is to re-determine the time slot for transmitting the first service data, the time slot indicating the conflict is determined to transmit other service data. The forwarding node sends a re-application request to a source node transmitting the first service data. The re-application request is a request for triggering the source node to re-apply for resources for the transmission of the first traffic data.

Based on the above, by acquiring the service selection result when the time slot conflict occurs, the service allocated by the time slot can be determined according to the hop count of the node involved in the service with the conflict, so as to solve the problem of the time slot conflict and realize automatic scheduling of resources.

The embodiment of the application also provides an implementation manner for obtaining the service selection result when the request time slot is the occupied time slot in the public node time slot table of the node, which specifically comprises the following three steps:

c1: and when the request time slot is the occupied time slot in the public node time slot table of the node, acquiring a first hop count for transmitting the first service data.

The first hop count associated with transmitting the first traffic data may be a hop count from a source node transmitting the first traffic data to the own forwarding node. The first hop count may reflect the number of nodes transmitting the first traffic data or the number of nodes completing the authorization. The embodiment of the application does not limit the specific implementation manner of acquiring the first hop count. In one possible implementation, the forwarding node may determine from node information of the source node, or the forwarding node may obtain the first hop count from other nodes.

C2: transmitting the first hop count to a target node so that the target node generates a service selection result according to the first hop count; the target node is a neighbor node of the first node, and the request time slot in the node time slot table of the target node is an occupied time slot.

After the node obtains the first hop count, the node sends the first hop count to the target node. The target node is a node transmitting the first service data in the neighbor nodes of the first node, and is a node of the occupied time slot corresponding to the request time slot in the time slot table of the public node of the first node.

And the target node generates a service selection result according to the acquired first hop count. In one possible implementation, the target node obtains the second hop count, and compares the first hop count with the second hop count to obtain a service selection result.

Specifically, in one possible implementation manner, when the first hop count is smaller than the second hop count, a service selection result of re-determining a time slot for transmitting the first service data may be obtained; and when the first hop count is greater than the second hop count, obtaining a service selection result for determining the time slot of the first service data.

And C3: and acquiring a service selection result sent by the target node.

The forwarding node acquires a service selection result sent by the target node, and further performs resource scheduling according to the service selection result.

In another possible implementation, the service selection result may be generated by the forwarding node. The embodiment of the present application provides another specific implementation manner of obtaining a service selection result when the request time slot is an occupied time slot in the common node time slot table of the present node, where the method includes:

when the request time slot is an occupied time slot in a public node time slot table of the node, acquiring a first hop count for transmitting first service data and a second hop count for transmitting second service data;

The forwarding node obtains a first hop count and a second hop count. The first hop count and the second hop count may be obtained by other nodes.

And the forwarding node compares the first hop count with the second hop count to obtain a service selection result. Specifically, in one possible implementation manner, when the first hop count is smaller than the second hop count, a service selection result of re-determining a time slot for transmitting the first service data may be obtained; and when the first hop count is greater than the second hop count, obtaining a service selection result for determining the time slot of the first service data.

Further, if the service selection result is generated by the forwarding node, the method further comprises the following steps:

And after the forwarding node generates the service selection result, sending the service selection result to the target node. The target node is a neighbor node of the first node, and the request time slot in the node time slot table of the target node is an occupied time slot. And sending a service selection result to the target node so that the target node allocates the time slot corresponding to the request time slot according to the service selection result.

In one possible implementation manner, in order to enable other nodes to acquire the node slot table of the forwarding node more accurately, after determining the authorized slot of the node, the node also sends the node slot table of the node to other nodes.

Specifically, an embodiment of the present application provides a method for implementing low-latency resource scheduling applied to a forwarding node transmitting first service data, where the method includes the following steps in addition to the above steps:

And sending the adjusted node time slot table of the node to other nodes.

After the node determines the authorized time slot, the occupation condition of the time slot in the node time slot table of the node needs to be adjusted. The node time slot table of the node is adjusted according to the authorized time slot of the first service data. And transmitting the adjusted node slot table to other nodes. Other nodes can correspondingly update the common node slot table after receiving the node slot table.

The embodiment of the application does not limit the mode of sending the node time slot table, and the node time slot table of the node can be sent to other nodes in a broadcasting mode.

In one possible implementation, the number of neighbor nodes of the source node is greater than or equal to a number threshold. If the source node determines the authorized time slot, the next hop node determines the authorized time slot of the node according to the authorized time slot determined by the source node, the conflict is easy to generate.

Based on this, the embodiment of the application provides a method for implementing low-latency resource scheduling, and the source node may implement the following four steps to implement resource scheduling.

D1: and determining the time slot number of the authorized time slots according to the data information of the first service data.

The source node firstly determines the time slot number of the authorized time slots according to the data information of the first service data.

D2: and sending a second resource scheduling request message to a next-hop node, wherein the second resource scheduling request message comprises the time slot number, so that the next-hop node determines the available time slot of the first service data according to a common node time slot table of the next-hop node and the time slot number.

The source node generates a second resource scheduling request message based on the time slot number of the authorized time slots, and sends the second resource scheduling request message to the next hop node.

In one possible implementation, the second resource scheduling request message may further include a mode flag for determining a time slot. For the case where the number of neighbor nodes of the forwarding node is large, the mode flag may be set to the negotiation scheduling mode. And the next hop node adopts a corresponding resource scheduling mode according to the mode mark in the second resource scheduling request message.

After the next-hop node acquires the second resource scheduling request message, determining an available time slot for transmitting the first service data according to the time slot number in the second resource scheduling request message and a common node time slot table of the next-hop node. The available time slots are free time slots that the next hop node may use to transmit the first traffic data.

D3: and acquiring a resource scheduling grant message sent by the next-hop node, wherein the resource scheduling grant message comprises an available time slot of the first service data determined by the next-hop node.

After the next hop node determines the grant time slot, a resource scheduling grant message is sent to the node, i.e. the source node. The resource scheduling grant message includes an available time slot for transmitting the first service data, which is determined by the next hop node. The resource scheduling grant message may specifically be a DSCH-grant (Distributed Scheduling-grant, distributed scheduling grant) message.

D4: and determining an authorized time slot for transmitting the first service data by the node according to the available time slot for transmitting the first service data determined by the next hop node and a common node time slot table of the node.

And the source node determines an authorized time slot for transmitting the first service data of the node according to the available time slot for transmitting the first service data determined by the next hop node.

Therefore, on the basis of the available time slots determined by the next-hop node, the node determines the authorized time slots again, so that the probability of collision of the time slots of the node and the next-hop node for transmitting the first service data can be reduced, and the efficiency of determining the authorized time slots can be improved under the condition that the number of neighbor nodes of the node is large.

Similarly, when the number of neighbor nodes of the forwarding node is large, a mode of determining the authorized time slot of the forwarding node may cause a time slot conflict.

Based on this, the embodiment of the application provides a method for implementing low-delay resource scheduling, when the number of neighbor nodes of a forwarding node is greater than or equal to a number threshold, the forwarding node may execute the following four steps to implement resource scheduling.

E1: and acquiring the time slot number of the request time slot.

The forwarding node firstly determines a request time slot, namely the number of authorized time slots for transmitting the first service data, determined by the previous-hop node according to the first resource scheduling request message sent by the previous-hop node. The number of slots of the request slot is the same as the number of slots of the grant slot to be determined by the node.

E2: and sending a third resource scheduling request message to a next-hop node, wherein the third resource scheduling request message comprises the time slot number, so that the next-hop node determines the available time slot of the first service data according to a common node time slot table of the next-hop node and the time slot number.

The forwarding node generates a third resource scheduling request message. The third resource scheduling request message includes the number of slots. The forwarding node sends a third resource scheduling request message to the next hop node.

The next-hop node may determine the number of slots according to the received third resource scheduling request message. And the next hop node determines the available time slot for transmitting the first service data according to the time slot number and the public node time slot table of the node. In one possible implementation, the next-hop node may determine the number of idle slots from the slot table of the common node of the node, and when the number of idle slots is greater than the number of slots, the next-hop node may perform transmission of the first service data. The next hop node generates a resource scheduling grant message and sends the resource scheduling grant message to the forwarding node.

E3: and acquiring a resource scheduling grant message sent by the next-hop node, wherein the resource scheduling grant message comprises an available time slot for transmitting the first service data, which is determined by the next-hop node.

The resource scheduling grant message sent by the next-hop node includes an available time slot determined by the next-hop node for transmitting the first service data. The node can determine the available time slot determined by the next-hop node by acquiring the resource scheduling grant message sent by the next-hop node.

E4: and determining an authorized time slot for transmitting the first service data by the node according to the available time slot of the first service data determined by the next hop node and a common node time slot table of the node.

The node obtains a public node time slot table of the node. And the node determines an authorized time slot for transmitting the first service data according to the available time slot determined by the next hop node and a common node time slot table of the node.

In the embodiment of the application, the available time slot is queried by the next-hop node, and the available time slot of the next-hop node is fed back to the node, so that the node can determine the authorized time slot which can be used for transmitting the first service data to the next-hop node according to the available time slot of the next-hop node and the public node time slot table of the node. The authorized time slot determined by the node can avoid the time slot conflict occupied by the next hop node for transmitting other service data, and the probability of successfully determining the authorized time slot under the condition of multiple neighbor nodes is improved.

Based on the system for realizing low-delay resource scheduling provided by the above method embodiment, the embodiment of the application also provides a method for realizing low-delay resource scheduling, which is applied to a forwarding node for transmitting the first service data.

The method for realizing low-delay resource scheduling will be described with reference to the accompanying drawings. Referring to fig. 7, the flowchart of a method for implementing low latency resource scheduling according to an embodiment of the present application includes S701-S703.

S701: acquiring a first resource scheduling request message sent by a previous hop node; the first resource scheduling request message comprises a public node time slot table of the previous hop node; the common node time slot table of the previous hop node is generated according to the node time slot table of the previous hop node and the node time slot table of the neighbor node of the previous hop node; the public node time slot table of the previous hop node comprises a request time slot, wherein the request time slot is an authorized time slot which is determined by the previous hop node and used for transmitting the first service data.

S702: and when the number of the neighbor nodes of the node is smaller than a number threshold value, acquiring a public node time slot table of the node, wherein the public node time slot table of the node is generated according to the node time slot table of the node and the node time slot table of the neighbor nodes of the node.

S703: when the time slot corresponding to the request time slot is an available time slot in the public node time slot table of the node, determining the time slot corresponding to the request time slot as an authorized time slot for the node to transmit the first service data; and sending a second resource scheduling request message to the next hop node, wherein the second resource scheduling request message comprises a public node time slot table of the node.

In one possible implementation, the method further includes:

and acquiring a service selection result sent by the target node.

In one possible implementation, the method further includes:

and sending the adjusted node time slot table of the node to other nodes.

acquiring the time slot number of the request time slot;

Based on the system for realizing low-delay resource scheduling provided by the above method embodiment, the embodiment of the application also provides a method for realizing low-delay resource scheduling, which is applied to a destination node for transmitting the first service data.

The method for realizing low-delay resource scheduling will be described with reference to the accompanying drawings. Referring to fig. 8, a flowchart of another method for implementing low latency resource scheduling according to an embodiment of the present application is shown, including S801-S803.

S801: acquiring a resource scheduling request message sent by a previous hop node; the resource scheduling request message comprises a public node time slot table of the previous hop node; the common node time slot table of the previous hop node is generated according to the node time slot table of the previous hop node and the node time slot table of the neighbor node of the previous hop node; the public node time slot table of the previous hop node comprises a request time slot, wherein the request time slot is an authorized time slot which is determined by the previous hop node and used for transmitting the first service data.

S802: and obtaining a public node time slot table of the node, wherein the public node time slot table of the node is generated according to the node time slot table of the node and the node time slot tables of neighbor nodes of the node.

S803: and when the time slot corresponding to the request time slot is an available time slot in the public node time slot table of the node, determining the time slot corresponding to the request time slot as an authorized time slot for the node to transmit the first service data.

Based on the system for realizing low-delay resource scheduling provided by the above method embodiment, the embodiment of the present application also provides a method for realizing low-delay resource scheduling, which is applied to a source node transmitting first service data.

The method for realizing low-delay resource scheduling will be described with reference to the accompanying drawings. Referring to fig. 9, a flowchart of another method for implementing low latency resource scheduling according to an embodiment of the present application is shown, including S901-S904.

S901: and acquiring data information of the first service data.

S902: and when the number of the neighbor nodes of the node is smaller than a number threshold value, acquiring a public node time slot table of the node, wherein the public node time slot table of the node is generated according to the node time slot table of the node and the node time slot table of the neighbor nodes of the node.

S903: and determining an authorized time slot for transmitting the first service data according to the data information of the first service data and the public node time slot table of the node.

S904: and sending a first resource scheduling request message to a next hop node, wherein the first resource scheduling request message comprises a public node time slot table of the node.

Based on the system for realizing low-latency resource scheduling provided by the above method embodiment, the embodiment of the present application further provides a device for realizing low-latency resource scheduling, where the device includes: a processor, memory, system bus;

The processor and the memory are connected through the system bus;

the memory is configured to store one or more programs, the one or more programs comprising instructions, which when executed by the processor, cause the processor to perform the above-described resource scheduling method applied to a source node, or to perform the above-described resource scheduling method applied to a forwarding node, or to perform the above-described resource scheduling method applied to a destination node.

Based on the system for realizing low-delay resource scheduling provided by the embodiment of the method, the embodiment of the application also provides a train, and the train comprises the device for realizing low-delay resource scheduling.

It should be noted that, in the present description, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different manner from other embodiments, and identical and similar parts between the embodiments are all enough to refer to each other. For the system or device disclosed in the embodiments, since it corresponds to the method disclosed in the embodiments, the description is relatively simple, and the relevant points refer to the description of the method section.

It should be understood that in this application, "at least one" means one or more, and "a plurality" means two or more. "and/or" for describing the association relationship of the association object, the representation may have three relationships, for example, "a and/or B" may represent: only a, only B and both a and B are present, wherein a, B may be singular or plural. The character "/" generally indicates that the context-dependent object is an "or" relationship. "at least one of" or the like means any combination of these items, including any combination of single item(s) or plural items(s). For example, at least one (one) of a, b or c may represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", wherein a, b, c may be single or plural.

It is further noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. The software modules may be disposed in Random Access Memory (RAM), memory, read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.

The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A method for implementing low latency resource scheduling, the method being applied to a forwarding node transmitting first traffic data, the method comprising:

2. The method according to claim 1, wherein the method further comprises:

3. The method according to claim 2, wherein the obtaining a service selection result when the requested time slot is an occupied time slot in the common node time slot table of the own node includes:

transmitting the first hop count to a target node so that the target node generates a service selection result according to the first hop count; the target node is a neighbor node of a first node transmitting the first service data, and the request time slot in the node time slot table of the target node is an occupied time slot;

and acquiring a service selection result sent by the target node.

4. The method according to claim 2, wherein the obtaining a service selection result when the requested time slot is an occupied time slot in the common node time slot table of the own node includes:

5. The method according to claim 4, wherein the method further comprises:

6. The method according to any one of claims 1-5, further comprising:

and sending the adjusted node time slot table of the node to other nodes.

7. The method of claim 1, wherein when the number of neighbor nodes of the own node is greater than or equal to a number threshold, the method further comprises:

acquiring the time slot number of the request time slot;

transmitting a third resource scheduling request message to a next-hop node, wherein the third resource scheduling request message comprises the time slot number, so that the next-hop node determines an available time slot for transmitting the first service data according to a common node time slot table of the next-hop node and the time slot number;

8. A method for implementing low latency resource scheduling, the method being applied to a destination node transmitting first traffic data, the method comprising:

9. A method for implementing low latency resource scheduling, the method being applied to a source node transmitting first traffic data, the method comprising:

acquiring data information of first service data;

10. The method of claim 9, wherein when the number of neighbor nodes of the own node is greater than or equal to a number threshold, the method further comprises:

11. A system for realizing low-delay resource scheduling, which is characterized by comprising a source node, a forwarding node and a destination node for transmitting first service data, wherein the source node is connected with the forwarding node, and the forwarding node is connected with the destination node;

the source node being configured to perform the method for implementing low latency resource scheduling of claim 9 or 10;

The forwarding node configured to perform the method for implementing low latency resource scheduling of any of claims 1-7;

the destination node is configured to perform the method for implementing low latency resource scheduling according to claim 8.

12. A system for implementing low-latency resource scheduling, the system comprising a source node and a destination node for transmitting first service data, the source node being connected with the destination node;

13. An apparatus for implementing low latency resource scheduling, the apparatus comprising: a processor, memory, system bus;

the processor and the memory are connected through the system bus;

the memory is for storing one or more programs, the one or more programs comprising instructions, which when executed by the processor, cause the processor to perform the method of any of claims 1-7, or to perform the method of claim 8, or to perform the method of claim 9 or 10.

14. A train comprising the apparatus for implementing low latency resource scheduling of claim 13.