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

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

Info

Publication number
CN113873473A
CN113873473A CN202111124457.XA CN202111124457A CN113873473A CN 113873473 A CN113873473 A CN 113873473A CN 202111124457 A CN202111124457 A CN 202111124457A CN 113873473 A CN113873473 A CN 113873473A
Authority
CN
China
Prior art keywords
node
time slot
resource scheduling
service data
hop
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202111124457.XA
Other languages
Chinese (zh)
Other versions
CN113873473B (en
Inventor
王晓红
栾瑾
刘先恺
田毅
赵志林
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
CRRC Qingdao Sifang Co Ltd
Original Assignee
CRRC Qingdao Sifang Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by CRRC Qingdao Sifang Co Ltd filed Critical CRRC Qingdao Sifang Co Ltd
Priority to CN202111124457.XA priority Critical patent/CN113873473B/en
Publication of CN113873473A publication Critical patent/CN113873473A/en
Application granted granted Critical
Publication of CN113873473B publication Critical patent/CN113873473B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/30—Services specially adapted for particular environments, situations or purposes
    • H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
    • H04W4/42—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for mass transport vehicles, e.g. buses, trains or aircraft
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The embodiment of the application discloses a method, a system, equipment and a train for realizing low-delay resource scheduling, wherein an authorized time slot for transmitting first service data of a node can be determined according to a first resource scheduling request message sent by a previous-hop node and a public node time slot table of the node, the authorized time slot can be determined by sending the resource scheduling request message once between two-hop nodes, the interaction process between the 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 communication delay 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, a device, 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 the running control of the train and ensure the normal running of the train.
At present, communication between trains relies primarily on ground equipment. The ground equipment forwards the message generated by the train to other trains. When a communication system is constructed, the construction of a large number of ground devices leads to a high construction cost of a train communication network. And if the mode of communication between the trains is adopted, although the cost for constructing ground equipment can be reduced, the communication process is easily influenced by the operation of the trains, and the communication time delay is higher. Therefore, how to reduce the time delay when the communication is performed between trains is a problem to be solved.
Disclosure of Invention
In view of this, embodiments of the present application provide a method, a system, a device, and a train for implementing low-latency resource scheduling, which can reduce latency of communication between trains.
In order to solve the above problem, the technical solution provided by the embodiment 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 for transmitting first service data, and 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 public 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 is used for transmitting the first service data;
when the number of the neighbor nodes of the node is smaller than the number threshold, 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;
when the time slot corresponding to the request time slot is an available time slot in the common 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 a next hop node, wherein the second resource scheduling request message comprises a common 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 in the public node time slot table of the node is the occupied time slot, 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 service data occupying a 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 an authorized time slot for the node to transmit the first service data;
and when the service selection result is that the time slot for transmitting the first service data is redetermined, sending a reapplication request to a source node for transmitting the first service data.
In a possible implementation manner, the obtaining a service selection result when the request timeslot is an occupied timeslot in the common node timeslot table of the node includes:
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;
sending the first hop count to a target node so that the target node can generate a service selection result according to the first hop count; the target node is a neighbor node of the first node for transmitting the first service data, and the request time slot in a node time slot table of the target node is an occupied time slot;
and acquiring a service selection result sent by the target node.
In a possible implementation manner, the obtaining a service selection result when the request timeslot is an occupied timeslot in the common node timeslot table of the node includes:
when the request time slot is an occupied time slot in the common 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:
adjusting a node time slot table of the node according to the authorized time slot for transmitting the first service data determined by the node;
and sending the adjusted node time slot table of the node to other nodes.
In a possible implementation manner, when the number of the neighbor nodes of the local node is greater than or equal to a number threshold, the method further includes:
acquiring the number of the time slots of the request time slots;
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 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 authorization message sent by the next hop node, wherein the resource scheduling authorization message comprises an available time slot for transmitting the first service data, which is determined by the next hop node;
and determining the authorized time slot for the node to transmit the first service data according to the available time slot of the first service data determined by the next hop node and the 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 for transmitting first service data, and 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 public 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 is used for transmitting the first service data;
acquiring a public node time slot table of a local node, wherein the public node time slot table of the local node is generated according to the node time slot table of the local node and the node time slot table of a neighbor node of the local node;
and when the time slot corresponding to the request time slot in the common 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.
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, and the method includes:
acquiring data information of first service data;
when the number of the neighbor nodes of the node is smaller than the number threshold, 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;
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 common node time slot table of the node.
In a possible implementation manner, when the number of the neighbor nodes of the local node is greater than or equal to a number threshold, the method further includes:
determining the time slot number of the authorized time slot according to the data information of the first service data;
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 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;
acquiring a resource scheduling authorization message sent by the next hop node, wherein the resource scheduling authorization message comprises an available time slot for transmitting the first service data, which is determined by the next hop node;
and determining the authorized time slot for the node to transmit the first service data according to the available time slot for transmitting the first service data determined by the next hop node and the 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, 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 in any embodiment of the third aspect;
the forwarding node is configured to execute the method for implementing low-latency resource scheduling according to any embodiment of the first aspect;
the destination node is configured to execute the method for implementing low-latency resource scheduling 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, where the source node transmits first service data, and the source node is connected to the destination node;
the source node is configured to execute the method for implementing low-latency resource scheduling in any embodiment of the third aspect;
the destination node is configured to execute the method for implementing low-latency resource scheduling in the second aspect.
In a sixth aspect, the present application provides an apparatus for implementing low-latency resource scheduling, where the apparatus includes: a processor, a memory, a 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 above first aspects, or to perform the method of the above second aspect, or to perform the method of the above third aspect.
In a seventh aspect, the present application provides a train, including the device for implementing low-latency resource scheduling in the sixth aspect.
Therefore, 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 acquires data information of first service data, acquires a public node time slot table of the source node when the number of neighbor nodes of the source node is smaller than a number threshold value, 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 method comprises the steps that a forwarding node acquires a first resource scheduling request message, when the number of neighbor nodes of the forwarding node is smaller than a number threshold value, a public node time slot table of the node is acquired, when a time slot corresponding to a request time slot in the public node time slot table of the node is an available time slot, the time slot corresponding to the request time slot is determined as an authorized time slot for the node to transmit first service data, and a second resource scheduling request message is sent to a next hop node. And if the time slot corresponding to the request time slot in the common 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.
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 of the node for transmitting the first service data can be determined, the authorized time slot can be determined by sending the resource scheduling request message once between 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 the 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 needed to be used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive exercise.
Fig. 1 is a schematic view 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 timeslot table of a node 0 according to an embodiment of the present application;
fig. 6 is a schematic diagram of a common node timeslot table of the node 3 according to an embodiment of the present application;
fig. 7 is a schematic flowchart of a method for implementing low-latency resource scheduling according to an embodiment of the present application;
fig. 8 is a schematic flowchart of another method for implementing low-latency resource scheduling according to an embodiment of the present application;
fig. 9 is a flowchart illustrating a further method for implementing low-latency resource scheduling according to an embodiment of the present application.
Detailed Description
In order to facilitate understanding and explaining the technical solutions provided by the embodiments of the present application, the following description will first describe the background art of the present application.
After studying the conventional method for communication between trains, it is found that at present, communication between trains is generally performed through ground equipment arranged beside a track. In the construction process of a train track system, the train communication network structure is complex due to excessive ground equipment, and the construction difficulty is high. In addition, the ground device is used for forwarding the message, so that excessive time delay is generated, and the timeliness of message processing is affected. When the train is directly communicated with the train, the communication time delay is high, and the communication process is influenced.
Based on this, an embodiment of the present application provides a method for implementing low-latency resource scheduling, where a source node acquires data information of first service data, and when the number of neighbor nodes of the source node is less than a number threshold, acquires a common node time slot table of the source node, and the source node determines, according to the data information of the first service data and the common node time slot table of the source node, an authorized time slot for transmitting the first service data, and sends a first resource scheduling request message to a next-hop node. The method comprises the steps that a forwarding node acquires a first resource scheduling request message, when the number of neighbor nodes of the forwarding node is smaller than a number threshold value, a public node time slot table of the node is acquired, when a time slot corresponding to a request time slot in the public node time slot table of the node is an available time slot, the time slot corresponding to the request time slot is determined as an authorized time slot for the node to transmit first service data, and a second resource scheduling request message is sent to a next hop node. And if the time slot corresponding to the request time slot in the common 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.
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 of the node for transmitting the first service data can be determined, the authorized time slot can be determined by sending the resource scheduling request message once between 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 the trains is reduced.
In order to facilitate understanding of the method for implementing low-latency resource scheduling provided in the embodiment of the present application, the following description is made with reference to a scenario example shown in fig. 1. Referring to fig. 1, this figure 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 common 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 public time slot table of the node when the number of the neighbor nodes of the forwarding node is less than the number threshold. When the time slot corresponding to the request time slot in the public node time slot table of the node is the available time slot, the time slot corresponding to the request time slot is determined as the 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. If the next hop node is the forwarding node, the above operations are repeatedly executed. 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 determines whether the time slot corresponding to the request time slot is an available time slot according to the common node time slot table of the node. And if the time slot corresponding to the request time slot is the available time slot, determining the time slot corresponding to the request time slot in the public node time slot table of the node as the authorized time slot. And determining the authorized time slot of each node for transmitting the first service data in such a way, thereby realizing the scheduling of resources. In the process of resource scheduling, the interactive flow among the nodes is reduced, and the time delay is reduced.
In order to facilitate understanding of the technical solution provided by the embodiment of the present application, a method for implementing low-latency resource scheduling provided by the embodiment of the present application is described below with reference to the accompanying drawings.
First, 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 communication nodes corresponding to a train. Each node may be a communication node corresponding to a train, specifically, a communication node corresponding to the whole train, or a communication node corresponding to one train group. The communication needs of the train can be set specifically, and the embodiment of the application is not limited to this.
For convenience of explaining the process of determining the authorized time slot by each node transmitting the first service data, a system for implementing low-latency resource scheduling is introduced first.
Referring to fig. 2, this figure 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 to transmit 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, regardless 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 for 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 comprises a destination node, a source node and a forwarding node, and transmits data information such as the priority of the first service data and the service type of the first service data. After the source node 201 receives the issued primitive, the mac layer performs error check on the primitive. If no exception exists, a scheduling information unit can be generated, wherein the scheduling information unit comprises a destination node, a source node and a forwarding node, and transmits data information such as the priority of the first service data and the service type of the first service data.
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 slots required to transmit the first traffic data based on the first traffic data.
A2: and determining the size relation between the number of the neighbor nodes of the node and the number threshold.
Neighbor nodes of source node 201 are nodes directly connected to source node 201 and nodes indirectly connected to source node 201. Specifically, in the embodiment of the present application, the neighbor node of the source node 201 may be a node within a two-hop range of the source node 201.
When the number of the neighbor nodes of the source node 201 is small, the number of different service data that the node needs to transmit may be small, the probability of scheduling conflict occurring when the node schedules resources for transmitting different service data is small, and after the node determines the authorized time slot, the next hop node determines the authorized time slot. When the number of the neighbor nodes of the source node 201 is large, the number of different service data that the node needs to transmit may be large, and the probability of scheduling conflict when the node schedules resources for transmitting different service data is large. Therefore, the authorized time slot of the node can be determined after negotiation with the next hop node, and scheduling conflict is avoided.
The number of the neighbor nodes of the local node, that is, the source node 201, is compared with the number threshold, so as to determine the size relationship between the number of the neighbor nodes of the source node 201 and the number threshold. When the number of neighbor nodes of the source node 201 is less than the number threshold, the number of neighbor nodes of the source node 201 may be considered to be less.
The number threshold may be determined according to the network size of the communication network and the network environment. For example, a simulation test method may be employed to determine the number threshold. The number threshold may be 15, for example.
A3: and when the number of the neighbor nodes of the node is smaller than the number threshold, 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.
When the number of neighbor nodes of the node is smaller than the number threshold, the source node 201 may directly determine the authorized time slot.
The source node 201 obtains the common node slot table of the 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 time slot table of the source node 201 and a neighbor node time slot table of the source node 201, and obtain a common node time slot table of the source node 201 by phase or by summing the node time slot tables of the neighbor nodes and the node time 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 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 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.
The source node 201 transmits a resource scheduling request message to the next hop node after determining the granted time slot. The resource Scheduling request message may specifically be a Distributed Scheduling-request (DSCH-request) message in a DSCH (Distributed Scheduling) message.
The resource scheduling request message includes the public node time slot table of the node. Wherein, the node time slot table of the node comprises authorized time slots. In one possible implementation, the slots in the common node slot table may be set to determine the grant 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 service data needs to be forwarded through the forwarding node 202. The forwarding node may be a source node, and may be one or more forwarding nodes, which are determined according to the data information of the first service data and the connection relationship between the nodes.
Forwarding node 202 performs the following four steps:
a6: and acquiring the resource scheduling request message sent by the previous hop node.
The forwarding node 202 obtains the resource scheduling request message sent by the previous-hop node. The previous hop node may be a source node or a forwarding node. And the resource scheduling request message sent by the previous hop node comprises a common 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, and the request time slot is an authorized time slot determined by the previous hop node for transmitting the first service data.
A7: and when the number of the neighbor nodes of the node is smaller than the number threshold, acquiring a public node time slot table of the node.
The forwarding node 202 also compares the number of neighbor nodes of the node with the number threshold. When the number of the neighbor nodes of the node is smaller than the number threshold, the probability of time slot collision is low, and the authorized time slot of the node can be determined first.
And acquiring a common node time slot table of the node. 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 node of the node.
A8: and when the time slot corresponding to the request time slot in the common 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.
If the time slot corresponding to the request time slot is an available time slot in the common node time slot table of the node, it indicates that the time slot corresponding to the request time slot is not occupied, and the time slot 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 the node to transmit the first service data, namely, the time slot for the node to receive the first service data sent by the previous hop of node.
A9: and sending a second resource scheduling request message to a next hop node, wherein the second resource scheduling request message comprises a common node time slot table of the node.
Forwarding node 202 continues to send resource scheduling request messages to the next hop node. The resource scheduling request message includes a common node time slot table of the node. The public node time slot table of the node comprises the authorized time slot determined by the node for transmitting the first service data.
In a possible implementation manner, the second resource scheduling request message may further include a mode flag for determining the time slot. For the case that the number of neighbor nodes of the forwarding node is small, the mode flag may be set to the non-negotiated scheduling mode.
The next hop node of forwarding node 202 may be either 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 by information of the next hop node carried in a resource scheduling request message sent by the previous hop node.
And when the next hop node of the forwarding node is the forwarding node, the next hop node executes the operation to realize the scheduling of the resource.
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 the resource scheduling request message sent by the previous hop node.
The destination node 203 acquires the resource scheduling request message transmitted by the previous hop node, i.e. the forwarding node 202. And the resource scheduling request message sent by the previous hop node comprises a common node time slot table of the previous hop node. And the public 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 common node slot table of the previous hop node includes the request slot. The request time slot is an authorized time slot determined by the previous hop node for transmitting the first service data.
A11: and acquiring a common node time slot table of the node.
The 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 in the common 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.
In the common node time slot table of the destination node 203, if the time slot corresponding to the request time slot is an available time slot, the time slot corresponding to the request time slot may be determined as an authorized time slot for the node to transmit the first service data. After the destination node 203 determines the authorized time slot, the resource scheduling is completed.
In another possible implementation manner, refer to fig. 3, which is a schematic structural diagram of another system for implementing low-latency resource scheduling provided in the embodiment of the present application.
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 to transmit 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 consistent with the method for implementing low-latency resource scheduling by the source node 201 in the foregoing embodiment. The method for the destination node 302 to implement low-latency resource scheduling is consistent with the method for the destination node 203 to implement low-latency resource scheduling in the above embodiments. For a specific implementation manner of the source node 301 and the destination node 302 for implementing low-latency resource scheduling, please refer to the above, which is not described herein again.
In one possible implementation, the traffic data transmitted by the forwarding nodes may collide. For example, in the forwarding node, resource scheduling request messages for transmitting different service data may be received at the same time. Or, the time slot corresponding to the request time slot may have been determined to transmit other service data, and the forwarding node does not send the updated node time slot table to other nodes, which causes the common node time slot table of other nodes to be inaccurate, and further causes time slot collision easily. For example, refer to fig. 4, which is a schematic structural diagram of a system for implementing low-latency resource scheduling according to an embodiment of the present application. Node 0 is a source node for transmitting first service data, node 3 is a source node for transmitting second service data, and nodes 1 and 2 are forwarding nodes for transmitting the first service data and the second service data. When node 0 determines the authorized time slot for transmitting the first service data, it sends a resource scheduling request for the first service data to node 1. Referring to fig. 5, this figure 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 time slot for transmitting the second service data, and sends a resource scheduling request for the second service data to the node 2. Referring to fig. 6, this is a schematic diagram of a common node slot table of the node 3 according to the embodiment of the present application. In the common node time slot table of the node 0 and the node 3, the condition of time slot occupation does not occur, so that the authorized time slots determined by the node 0 and the node 3 conflict.
Based on this, the embodiment of the present application provides a method for implementing low-latency resource scheduling, which is applied to a forwarding node transmitting first service data.
In addition to the above steps, the method further comprises the following three steps:
b1: and when the time slot corresponding to the request time slot in the public node time slot table of the node is the occupied time slot, 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. And when the time slot corresponding to the request time slot in the common node time slot table of the node is the occupied time slot, indicating that the time slot conflict occurs.
Taking the above-mentioned nodes 0 to 3 as examples, when the node 1 and the node 2 perform resource scheduling, it can be found 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 common node time slot table.
When time slot conflict occurs, the forwarding node can judge which service in the conflicted services needs to apply for resource scheduling again, and which service can continue to apply for resource scheduling.
Specifically, the forwarding node may obtain the service selection result to determine the 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 service data occupying a 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 forwarding node, the hop count is increased by 1 for every forwarding node. The second hop count is the hop count from the source node to the node where the time slot collision occurs in the node path transmitting the second service data. That is, from the source node to the node where the time slot collision occurs, the number of hops is increased by 1 every time one forwarding node passes. And comparing the first hop count with the second hop count to obtain a service selection result.
It should be noted that, the embodiment of the present application does not limit the node that generates the service selection result. In a possible implementation manner, the node may obtain the first hop count and the second hop count to generate a 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 the time slot collision is found or more than two time slot collision nodes are found, one node can 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, the node with the smaller node identifier is determined as the node generating the service selection result.
Correspondingly, the embodiments of the present application provide two specific implementation manners for obtaining a service selection result when the request timeslot is an occupied timeslot in the common node timeslot table of the node, please refer to the following.
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 an authorized time slot for the node to transmit the first service data.
If the service selection result is that the time slot of the first service data is determined, it indicates that the authorized time slot for transmitting the first service data needs to be determined continuously. 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 resource of the second service data can be reapplied. And the conflicted time slot is distributed to be used for transmitting the first service data, so that the scheduling of resources is realized.
B3: and when the service selection result is that the time slot for transmitting the first service data is redetermined, sending a reapplication request to a source node for transmitting the first service data.
And if the service selection result is that the time slot for transmitting the first service data is re-determined, determining the time slot for indicating the conflict as the time slot for transmitting other service data. The forwarding node sends a reapplication 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 the resource for the transmission of the first service data.
Based on the above, by obtaining the service selection result when the time slot conflict occurs, the service allocated to the time slot can be determined according to the hop count of the node related to the service where the conflict occurs, so that the problem of time slot conflict is solved, and the automatic scheduling of resources is realized.
The embodiment of the present application further provides an implementation manner for obtaining a service selection result when the request timeslot is an occupied timeslot in the common node timeslot table of the node, and the implementation manner specifically includes the following three steps:
c1: and 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.
The first hop count associated with transmitting the first service data may be a hop count from a source node transmitting the first service data to the 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 present application does not limit a specific implementation manner of obtaining the first hop count. In a possible implementation manner, the forwarding node may be determined according to the node information of the source node, or the forwarding node may obtain the first hop count from other nodes.
C2: sending the first hop count to a target node so that the target node can generate 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.
And after acquiring the first hop count, the node sends the first hop count to the target node. The target node is a node which transmits the first service data in the neighbor nodes of the first node, and is a node which requests the time slot corresponding to the time slot to be the occupied time slot in the public node time slot table of the first node.
And the target node generates a service selection result according to the acquired first hop count. In a possible implementation manner, 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 a possible implementation manner, when the first hop count is smaller than the second hop count, a service selection result for re-determining a time slot for transmitting the first service data may be obtained; when the first hop count is greater than the second hop count, a service selection result for determining the time slot of the first service data may be obtained.
C3: and acquiring a service selection result sent by the target node.
And the forwarding node acquires the service selection result sent by the target node, and then performs resource scheduling according to the service selection result.
In another possible implementation, the traffic selection result may be generated by the forwarding node. The embodiment of the present application provides another specific implementation manner for obtaining a service selection result when the request timeslot is an occupied timeslot in the common node timeslot table of the node, including:
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 first service data and a second hop count for transmitting second service data;
and obtaining a service selection result according to the first hop count and the second hop count.
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 a possible implementation manner, when the first hop count is smaller than the second hop count, a service selection result for re-determining a time slot for transmitting the first service data may be obtained; when the first hop count is greater than the second hop count, a service selection result for determining the time slot of the first service data may be obtained.
Further, if the forwarding node generates a service selection result, the method further includes the following steps:
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.
And after the forwarding node generates a 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 the 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 a possible implementation manner, in order to enable other nodes to obtain a more accurate node time slot table of the forwarding node, after the authorized time slot of the node is determined, the node also sends the node time 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 in addition to the foregoing steps, the method further includes:
adjusting a node time slot table of the node according to the authorized time slot for transmitting the first service data determined by the node;
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. And the node adjusts the node time slot table of the node according to the authorized time slot of the first service data. And sending the adjusted node time slot table to other nodes. After receiving the node time slot table, the other nodes can correspondingly update the common node time 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 the number threshold. If the source node determines the authorized time slot first, then 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 present application provides a method for implementing low-latency resource scheduling, where a source node may execute the following four steps to implement resource scheduling.
D1: and determining the time slot number of the authorized time slot according to the data information of the first service data.
The source node firstly determines the time slot number of the authorized time slot 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 the common node time slot table of the next hop node and the time slot number.
And the source node generates a second resource scheduling request message based on the time slot number of the authorized time slot and sends the second resource scheduling request message to the next hop node.
In a possible implementation manner, the second resource scheduling request message may further include a mode flag for determining the time slot. For the case that the number of neighbor nodes of the forwarding node is large, the mode flag may be set as 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.
And after the next hop node acquires the second resource scheduling request message, determining the available time slot for transmitting the first service data according to the time slot number in the second resource scheduling request message and the common node time slot table of the next hop node. The available time slot is a free time slot that the next hop node can use to transmit the first traffic data.
D3: and acquiring a resource scheduling authorization message sent by the next hop node, wherein the resource scheduling authorization message comprises the available time slot of the first service data determined by the next hop node.
After the next hop node determines the grant time slot, the resource scheduling grant message is sent to the local node, namely the source node. The resource scheduling grant message includes an available time slot for transmitting the first service data determined by the next hop node. The resource Scheduling grant message may specifically be a DSCH-grant (Distributed Scheduling-grant) message.
D4: and determining the authorized time slot for the node to transmit the first service data according to the available time slot for transmitting the first service data determined by the next hop node and the common node time slot table of the node.
And the source node determines the authorized time slot of the node for transmitting the first service data 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 slot determined by the next hop node, the node determines the authorized time slot, so that the probability of the conflict of the time slots of the first service data transmitted by the node and the next hop node can be reduced, and the efficiency of determining the authorized time slot 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, time slot collision may be caused by determining the authorized time slot of the node in advance.
Based on this, the embodiments of the present application provide a method for implementing low-latency resource scheduling, where 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 determines the request time slot, that is, 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 the request time slots is the same as the number of the authorized time slots 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 the 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 a number of time slots. And the forwarding node sends a third resource scheduling request message to the next hop node.
The next hop node may determine the number of time 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 common node time slot table of the node. In a possible implementation manner, the next hop node may determine the number of idle timeslots from the timeslot table of the common node of the node in advance, and when the number of idle timeslots is greater than the number of timeslots, the next hop node may perform transmission of the first service data. And the next hop node generates a resource scheduling authorization message and sends the resource scheduling authorization message to the forwarding node.
E3: and acquiring a resource scheduling authorization message sent by the next hop node, wherein the resource scheduling authorization message comprises an available time slot for transmitting the first service data determined by the next hop node.
And the resource scheduling authorization message sent by the next hop node comprises the 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 authorization message sent by the next hop node.
E4: and determining the authorized time slot for the node to transmit the first service data according to the available time slot of the first service data determined by the next hop node and the common node time slot table of the node.
The node acquires a public node time slot table of the node. The node determines the authorized time slot for the node to transmit the first service data according to the available time slot determined by the next hop node and the public node time slot table of the node.
In the embodiment of the application, the available time slot is inquired through 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 common node time slot table of the node. The authorized time slot determined by the node can avoid the conflict with the time slot occupied by the next hop node for transmitting other service data, and the success probability of 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 embodiment of the method, the embodiment of the application also provides a method for realizing low-delay resource scheduling, which is applied to a forwarding node for transmitting first service data.
The method for implementing low-latency resource scheduling will be described with reference to the accompanying drawings. Referring to fig. 7, the figure is a schematic flowchart of a method for implementing low-latency resource scheduling according to an embodiment of the present application, and includes S701 to 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 public 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; and 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 determined by the previous hop node for transmitting the first service data.
S702: and when the number of the neighbor nodes of the node is smaller than the number threshold, 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 common 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 a next hop node, wherein the second resource scheduling request message comprises a common 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 in the public node time slot table of the node is the occupied time slot, 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 service data occupying a 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 an authorized time slot for the node to transmit the first service data;
and when the service selection result is that the time slot for transmitting the first service data is redetermined, sending a reapplication request to a source node for transmitting the first service data.
In a possible implementation manner, the obtaining a service selection result when the request timeslot is an occupied timeslot in the common node timeslot table of the node includes:
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;
sending the first hop count to a target node so that the target node can generate a service selection result according to the first hop count; the target node is a neighbor node of the first node for transmitting the first service data, and the request time slot in a node time slot table of the target node is an occupied time slot;
and acquiring a service selection result sent by the target node.
In a possible implementation manner, the obtaining a service selection result when the request timeslot is an occupied timeslot in the common node timeslot table of the node includes:
when the request time slot is an occupied time slot in the common 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:
adjusting a node time slot table of the node according to the authorized time slot for transmitting the first service data determined by the node;
and sending the adjusted node time slot table of the node to other nodes.
In a possible implementation manner, when the number of the neighbor nodes of the local node is greater than or equal to a number threshold, the method further includes:
acquiring the number of the time slots of the request time slots;
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 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 authorization message sent by the next hop node, wherein the resource scheduling authorization message comprises an available time slot for transmitting the first service data, which is determined by the next hop node;
and determining the authorized time slot for the node to transmit the first service data according to the available time slot of the first service data determined by the next hop node and the common node time slot table of the node.
Based on the system for realizing low-delay resource scheduling provided by the method embodiment, the embodiment of the application also provides a method for realizing low-delay resource scheduling, which is applied to a target node for transmitting first service data.
The method for implementing low-latency resource scheduling will be described with reference to the accompanying drawings. Referring to fig. 8, this figure is a schematic flowchart of another method for implementing low-latency resource scheduling provided in the embodiment of the present application, and includes S801 to 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 public 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; and 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 determined by the previous hop node for transmitting the first service data.
S802: and 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 node of the node.
S803: and when the time slot corresponding to the request time slot in the common 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.
Based on the system for realizing low-delay resource scheduling provided by the method embodiment, the embodiment of the application also provides a method for realizing low-delay resource scheduling, which is applied to a source node for transmitting first service data.
The method for implementing low-latency resource scheduling will be described with reference to the accompanying drawings. Referring to fig. 9, the figure is a schematic flowchart of another method for implementing low-latency resource scheduling provided in the embodiment of the present application, and includes S901 to 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 the number threshold, 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 common node time slot table of the node.
In a possible implementation manner, when the number of the neighbor nodes of the local node is greater than or equal to a number threshold, the method further includes:
determining the time slot number of the authorized time slot according to the data information of the first service data;
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 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;
acquiring a resource scheduling authorization message sent by the next hop node, wherein the resource scheduling authorization message comprises an available time slot for transmitting the first service data, which is determined by the next hop node;
and determining the authorized time slot for the node to transmit the first service data according to the available time slot for transmitting the first service data determined by the next hop node and the common node time slot table of the node.
Based on the system for implementing low-latency resource scheduling provided by the embodiment of the method, the embodiment of the application also provides a device for implementing low-latency resource scheduling, and the device comprises: a processor, a memory, a 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 including 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 the 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 equipment for realizing the low-delay resource scheduling.
It should be noted that, in the present specification, the embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments may be referred to each other. For the system or the device disclosed by the embodiment, the description is simple because the system or the device corresponds to the method disclosed by the embodiment, and the relevant points can be referred to the method part for description.
It should be understood that in the present application, "at least one" means one or more, "a plurality" means two or more. "and/or" for describing an association relationship of associated objects, indicating that there may be three relationships, e.g., "a and/or B" may indicate: only A, only B and both A and B are present, wherein A and B may be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of single item(s) or plural items. 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, herein, relational terms such as first and second, and the like may be 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. Also, 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 an … …" does not exclude the presence of other identical 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. A software module may reside 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 (14)

1.一种实现低时延资源调度的方法，其特征在于，所述方法应用于传输第一业务数据的转发节点，所述方法包括：1. A method for implementing low-latency resource scheduling, wherein the method is applied to a forwarding node that transmits first service data, and the method comprises: 获取由上一跳节点发送的第一资源调度请求消息；所述第一资源调度请求消息中包括所述上一跳节点的公共节点时隙表；所述上一跳节点的公共节点时隙表根据所述上一跳节点的节点时隙表以及所述上一跳节点的邻居节点的节点时隙表生成；所述上一跳节点的公共节点时隙表中包括请求时隙，所述请求时隙为所述上一跳节点确定的传输所述第一业务数据的授权时隙；Obtain the first resource scheduling request message sent by the previous hop node; the first resource scheduling request message includes the public node time slot table of the previous hop node; the public node time slot table of the previous hop node Generated according to the node time slot table of the previous hop node and the node time slot table of the neighbor nodes of the previous hop node; the public node time slot table of the previous hop node includes a request time slot, and the request time slot is The time slot is an authorized time slot for transmitting the first service data determined by the previous hop node; 当所述本节点的邻居节点的个数小于个数阈值时，获取本节点的公共节点时隙表，所述本节点的公共节点时隙表根据本节点的节点时隙表以及本节点的邻居节点的节点时隙表生成；When the number of neighbor nodes of this node is less than the number threshold, obtain the public node time slot table of this node, and the public node time slot table of this node is based on the node time slot table of this node and the neighbor nodes of this node. Node slot table generation for nodes; 当所述本节点的公共节点时隙表中，与所述请求时隙对应的时隙为可用时隙时，将与所述请求时隙对应的时隙确定为本节点传输所述第一业务数据的授权时隙；向下一跳节点发送第二资源调度请求消息，所述第二资源调度请求消息包括所述本节点的公共节点时隙表。When the time slot corresponding to the request time slot is an available time slot in the public node time slot table of the local node, the time slot corresponding to the request time slot is determined to transmit the first service to the local node Grant time slot for data; send a second resource scheduling request message to the next hop node, where the second resource scheduling request message includes the public node time slot table of the current node. 2.根据权利要求1所述的方法，其特征在于，所述方法还包括：2. The method according to claim 1, wherein the method further comprises: 当所述本节点的公共节点时隙表中，与所述请求时隙对应的时隙为已占用时隙时，获取业务选择结果；所述业务选择结果是根据传输所述第一业务数据的节点的第一跳数以及传输第二业务数据的节点的第二跳数确定的；所述第二业务数据为占用与所述请求时隙对应的时隙的业务数据；When the time slot corresponding to the request time slot in the public node time slot table of the local node is an occupied time slot, the service selection result is obtained; the service selection result is based on the transmission of the first service data. The first hop number of the node and the second hop number of the node transmitting the second service data are determined; the second service data is the service data occupying the time slot corresponding to the request time slot; 当所述业务选择结果为确定第一业务数据的时隙时，将与所述请求时隙对应的时隙确定为本节点传输所述第一业务数据的授权时隙；When the service selection result is to determine the time slot of the first service data, the time slot corresponding to the request time slot is determined to be an authorized time slot for the node to transmit the first service data; 当所述业务选择结果为重新确定传输所述第一业务数据的时隙时，向传输所述第一业务数据的源节点发送重新申请请求。When the service selection result is that the time slot for transmitting the first service data is re-determined, a re-application request is sent to the source node that transmits the first service data. 3.根据权利要求2所述的方法，其特征在于，所述当所述本节点的公共节点时隙表中，所述请求时隙为已占用时隙时，获取业务选择结果，包括：3. The method according to claim 2, wherein when the requested time slot is an occupied time slot in the public node time slot table of the local node, obtaining a service selection result comprises: 当所述本节点的公共节点时隙表中，所述请求时隙为已占用时隙时，获取传输所述第一业务数据的第一跳数；When the requested time slot is an occupied time slot in the public node time slot table of the local node, acquiring the first hop number for transmitting the first service data; 向目标节点发送所述第一跳数，以便所述目标节点根据所述第一跳数生成业务选择结果；所述目标节点为传输所述第一业务数据的所述第一节点的邻居节点，所述目标节点的节点时隙表中所述请求时隙为已占用时隙；sending the first hop count to the 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 that transmits the first service data, The requested timeslot in the node timeslot table of the target node is an occupied timeslot; 获取由所述目标节点发送的业务选择结果。Obtain the service selection result sent by the target node. 4.根据权利要求2所述的方法，其特征在于，所述当所述本节点的公共节点时隙表中，所述请求时隙为已占用时隙时，获取业务选择结果，包括：4. The method according to claim 2, wherein, when the requested time slot is an occupied time slot in the public node time slot table of the local node, obtaining a service selection result comprises: 当所述本节点的公共节点时隙表中，所述请求时隙为已占用时隙时，获取传输所述第一业务数据的第一跳数，以及所述第二资源调度请求相关的第二跳数；When the request time slot is an occupied time slot in the public node time slot table of the local node, obtain the first hop number for transmitting the first service data, and the first hop number related to the second resource scheduling request two-hop count; 根据所述第一跳数和所述第二跳数，得到业务选择结果。A service selection result is obtained according to the first hop count and the second hop count. 5.根据权利要求4所述的方法，其特征在于，所述方法还包括：5. The method according to claim 4, wherein the method further comprises: 向目标节点发送所述业务选择结果；所述目标节点为所述第一节点的邻居节点，所述目标节点的节点时隙表中所述请求时隙为已占用时隙。The service selection result is sent to a target node; the target node is a neighbor node of the first node, and the requested time slot in the node time slot table of the target node is an occupied time slot. 6.根据权利要求1-5任一项所述的方法，其特征在于，所述方法还包括：6. The method according to any one of claims 1-5, wherein the method further comprises: 根据本节点确定的传输所述第一业务数据的授权时隙，调整本节点的节点时隙表；Adjust the node time slot table of this node according to the authorized time slot for transmitting the first service data determined by this node; 向其他节点发送调整后的所述本节点的节点时隙表。Send the adjusted node time slot table of the current node to other nodes. 7.根据权利要求1所述的方法，其特征在于，当所述本节点的邻居节点的个数大于或者等于个数阈值时，所述方法还包括：7. The method according to claim 1, wherein when the number of neighbor nodes of the current node is greater than or equal to a number threshold, the method further comprises: 获取所述请求时隙的时隙数量；obtaining the time slot number of the requested time slot; 向下一跳节点发送第三资源调度请求消息，所述第三资源调度请求消息包括所述时隙数量，以便所述下一跳节点根据所述下一跳节点的公共节点时隙表和所述时隙数量确定传输所述第一业务数据的可用时隙；Send a third resource scheduling request message to the next hop node, where the third resource scheduling request message includes the number of time slots, so that the next hop node can The number of time slots determines an available time slot for transmitting the first service data; 获取所述下一跳节点发送的资源调度授权消息，所述资源调度授权消息包括所述下一跳节点确定的传输所述第一业务数据的可用时隙；acquiring a resource scheduling authorization message sent by the next hop node, where the resource scheduling authorization message includes an available time slot for transmitting the first service data determined by the next hop node; 根据所述下一跳节点确定的所述第一业务数据的可用时隙和本节点的公共节点时隙表，确定本节点传输所述第一业务数据的授权时隙。According to the available time slot of the first service data determined by the next hop node and the public node time slot table of the current node, the authorized time slot for the current node to transmit the first service data is determined. 8.一种实现低时延资源调度的方法，其特征在于，所述方法应用于传输第一业务数据的目的节点，所述方法包括：8. A method for implementing low-latency resource scheduling, wherein the method is applied to a destination node for transmitting first service data, and the method comprises: 获取由上一跳节点发送的资源调度请求消息；所述资源调度请求消息中包括所述上一跳节点的公共节点时隙表；所述上一跳节点的公共节点时隙表根据所述上一跳节点的节点时隙表以及所述上一跳节点的邻居节点的节点时隙表生成；所述上一跳节点的公共节点时隙表中包括请求时隙，所述请求时隙为所述上一跳节点确定的传输所述第一业务数据的授权时隙；Obtain the resource scheduling request message sent by the previous hop node; the resource scheduling request message includes the public node time slot table of the previous hop node; the public node time slot table of the previous hop node is based on the above The node time slot table of the one-hop node and the node time slot table of the neighbor nodes of the previous hop node are generated; the public node time slot table of the previous hop node includes the request time slot, and the request time slot is the an authorized time slot for transmitting the first service data determined by the previous hop node; 获取本节点的公共节点时隙表，所述本节点的公共节点时隙表根据本节点的节点时隙表以及本节点的邻居节点的节点时隙表生成；Obtain the public node time slot table of the current node, where the public node time slot table of the current node is generated according to the node time slot table of the current node and the node time slot table of the neighbor nodes of the current 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 local node, the time slot corresponding to the request time slot is determined to transmit the first service to the local node Grant time slot for data. 9.一种实现低时延资源调度的方法，其特征在于，所述方法应用于传输第一业务数据的源节点，所述方法包括：9. A method for implementing low-latency resource scheduling, wherein the method is applied to a source node transmitting first service data, and the method comprises: 获取第一业务数据的数据信息；Obtain data information of the first service data; 当所述本节点的邻居节点的个数小于个数阈值时，获取本节点的公共节点时隙表，所述本节点的公共节点时隙表根据本节点的节点时隙表以及本节点的邻居节点的节点时隙表生成；When the number of neighbor nodes of this node is less than the number threshold, obtain the public node time slot table of this node, and the public node time slot table of this node is based on the node time slot table of this node and the neighbor nodes of this node. Node slot table generation for nodes; 根据所述第一业务数据的数据信息和所述本节点的公共节点时隙表确定传输所述第一业务数据的授权时隙；Determine the 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 local node; 向下一跳节点发送第一资源调度请求消息，所述第一资源调度请求消息包括所述本节点的公共节点时隙表。Send a first resource scheduling request message to the next hop node, where the first resource scheduling request message includes the public node time slot table of the current node. 10.根据权利要求9所述的方法，其特征在于，当所述本节点的邻居节点的个数大于或者等于个数阈值时，所述方法还包括：10. The method according to claim 9, wherein when the number of the neighbor nodes of the current node is greater than or equal to the number threshold, the method further comprises: 根据所述第一业务数据的数据信息确定授权时隙的时隙数量；Determine the number of time slots of the authorized time slot according to the data information of the first service data; 向下一跳节点发送第二资源调度请求消息，所述第二资源调度请求消息包括所述时隙数量，以便所述下一跳节点根据所述下一跳节点的公共节点时隙表和所述时隙数量确定传输所述第一业务数据的可用时隙；Send a second resource scheduling request message to the next hop node, where the second resource scheduling request message includes the number of time slots, so that the next hop node can The number of time slots determines an available time slot for transmitting the first service data; 获取所述下一跳节点发送的资源调度授权消息，所述资源调度授权消息包括所述下一跳节点确定的传输所述第一业务数据的可用时隙；acquiring a resource scheduling authorization message sent by the next hop node, where the resource scheduling authorization message includes an available time slot for transmitting the first service data determined by the next hop node; 根据所述下一跳节点确定的传输所述第一业务数据的可用时隙和本节点的公共节点时隙表，确定本节点传输所述第一业务数据的授权时隙。According to the available timeslots for transmitting the first service data determined by the next-hop node and the public node timeslot table of the current node, the authorized timeslots for the current node to transmit the first service data are determined. 11.一种实现低时延资源调度的系统，其特征在于，所述系统包括传输第一业务数据的源节点、转发节点和目的节点，所述源节点与所述转发节点连接，所述转发节点与所述目的节点连接；11. A system for implementing low-latency resource scheduling, wherein the system comprises a source node for transmitting first service data, a forwarding node and a destination node, the source node is connected to the forwarding node, and the forwarding node is connected to the forwarding node. the node is connected to the destination node; 所述源节点，用于执行权利要求9或10所述的实现低时延资源调度的方法；the source node, configured to execute the method for implementing low-latency resource scheduling according to claim 9 or 10; 所述转发节点，用于执行权利要求1-7任一项所述的实现低时延资源调度的方法；the forwarding node, configured to execute the method for implementing low-latency resource scheduling according to any one of claims 1-7; 所述目的节点，用于执行权利要求8所述的实现低时延资源调度的方法。The destination node is configured to execute the method for implementing low-latency resource scheduling according to claim 8 . 12.一种实现低时延资源调度的系统，其特征在于，所述系统包括传输第一业务数据的源节点和目的节点，所述源节点与所述目的节点连接；12. A system for implementing low-latency resource scheduling, wherein the system comprises a source node and a destination node for transmitting first service data, and the source node is connected to the destination node; 所述源节点，用于执行权利要求9或10所述的实现低时延资源调度的方法；the source node, configured to execute the method for implementing low-latency resource scheduling according to claim 9 or 10; 所述目的节点，用于执行权利要求8所述的实现低时延资源调度的方法。The destination node is configured to execute the method for implementing low-latency resource scheduling according to claim 8 . 13.一种实现低时延资源调度的设备，其特征在于，所述设备包括：处理器、存储器、系统总线；13. A device for implementing low-latency resource scheduling, wherein the device comprises: a processor, a memory, and a system bus; 所述处理器以及所述存储器通过所述系统总线相连；The processor and the memory are connected through the system bus; 所述存储器用于存储一个或多个程序，所述一个或多个程序包括指令，所述指令当被所述处理器执行时使所述处理器执行权利要求1-7任一项所述的方法，或者执行权利要求8所述的方法，或者执行权利要求9或10所述的方法。The memory is used to store one or more programs, the one or more programs comprising instructions that, when executed by the processor, cause the processor to perform the process of any one of claims 1-7 method, or perform the method of claim 8, or perform the method of claim 9 or 10. 14.一种列车，其特征在于，包括权利要求13所述的实现低时延资源调度的设备。14. A train, comprising the device for implementing low-latency resource scheduling according to claim 13.
CN202111124457.XA 2021-09-24 2021-09-24 A method, system, equipment and train for realizing low-latency resource scheduling Active CN113873473B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111124457.XA CN113873473B (en) 2021-09-24 2021-09-24 A method, system, equipment and train for realizing low-latency resource scheduling

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111124457.XA CN113873473B (en) 2021-09-24 2021-09-24 A method, system, equipment and train for realizing low-latency resource scheduling

Publications (2)

Publication Number Publication Date
CN113873473A true CN113873473A (en) 2021-12-31
CN113873473B CN113873473B (en) 2024-01-09

Family

ID=78993984

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111124457.XA Active CN113873473B (en) 2021-09-24 2021-09-24 A method, system, equipment and train for realizing low-latency resource scheduling

Country Status (1)

Country Link
CN (1) CN113873473B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115942469A (en) * 2022-11-08 2023-04-07 鹤壁天海电子信息系统有限公司 A communication method, device and storage medium
CN116962318A (en) * 2023-02-07 2023-10-27 哈尔滨商业大学 An image data transmission method and system

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050047428A1 (en) * 2003-09-03 2005-03-03 Samsung Electronics Co., Ltd. System and method for selecting beacon transmission starting point in communication system
WO2008002547A2 (en) * 2006-06-27 2008-01-03 University Of Delaware Method for scheduling transmissions in an ad hoc network
CN101808371A (en) * 2010-03-30 2010-08-18 重庆邮电大学 IEEE802.16 Mesh network resource pre-reservation method for supporting multi-hop resource pre-reservation
WO2014124251A2 (en) * 2013-02-07 2014-08-14 Interdigital Patent Holdings, Inc. Apparatus and methods for mesh networks
CN106488561A (en) * 2015-08-28 2017-03-08 北京信威通信技术股份有限公司 A kind of resource allocation methods in multihop network
KR102211845B1 (en) * 2019-09-04 2021-02-03 국방과학연구소 Apparatus and method for performing scheduling in ad hoc networks
CN113347600A (en) * 2021-06-02 2021-09-03 中车青岛四方机车车辆股份有限公司 Method, system, equipment and train for realizing resource scheduling

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050047428A1 (en) * 2003-09-03 2005-03-03 Samsung Electronics Co., Ltd. System and method for selecting beacon transmission starting point in communication system
WO2008002547A2 (en) * 2006-06-27 2008-01-03 University Of Delaware Method for scheduling transmissions in an ad hoc network
CN101808371A (en) * 2010-03-30 2010-08-18 重庆邮电大学 IEEE802.16 Mesh network resource pre-reservation method for supporting multi-hop resource pre-reservation
WO2014124251A2 (en) * 2013-02-07 2014-08-14 Interdigital Patent Holdings, Inc. Apparatus and methods for mesh networks
CN106488561A (en) * 2015-08-28 2017-03-08 北京信威通信技术股份有限公司 A kind of resource allocation methods in multihop network
KR102211845B1 (en) * 2019-09-04 2021-02-03 국방과학연구소 Apparatus and method for performing scheduling in ad hoc networks
CN113347600A (en) * 2021-06-02 2021-09-03 中车青岛四方机车车辆股份有限公司 Method, system, equipment and train for realizing resource scheduling

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115942469A (en) * 2022-11-08 2023-04-07 鹤壁天海电子信息系统有限公司 A communication method, device and storage medium
CN116962318A (en) * 2023-02-07 2023-10-27 哈尔滨商业大学 An image data transmission method and system
CN116962317A (en) * 2023-02-07 2023-10-27 哈尔滨商业大学 An image transmission method, device and system

Also Published As

Publication number Publication date
CN113873473B (en) 2024-01-09

Similar Documents

Publication Publication Date Title
Cao et al. A novel adaptive TDMA-based MAC protocol for VANETs
US7046639B2 (en) System and method for ad hoc network access employing the distributed election of a shared transmission schedule
US20110013572A1 (en) Systems and methods for resource allocation serving communication requirements and fairness
CN113347600B (en) Method, system, equipment and train for realizing resource scheduling
CN109640393B (en) Competitive time division multiple access method for data and voice simultaneous transmission of wireless ad hoc network
Soldo et al. Video streaming distribution in VANETs
CN113873473A (en) Method, system, equipment and train for realizing low-delay resource scheduling
Xu et al. Adaptive multichannel MAC protocol based on SD‐TDMA mechanism for the vehicular ad hoc network
CN113099545B (en) A multi-access scheduling method for cross-domain networks
WO2014036964A1 (en) Method and apparatus for processing multi-timeslot or multi-subframe resources
CN101808371B (en) IEEE802.16Mesh network resource reservation method supporting multi-hop resource reservation
US20120099541A1 (en) Apparatus and method for operating multi-channel based on wireless access in vehicular environments
CN110418389B (en) Meter reading method of energy metering network
CN104954996B (en) By the data distributing method of RSU auxiliary transmissions
CN101018173A (en) Multi-address access method with the confliction decomposition
Fantacci et al. Performance evaluation of a modified PRMA protocol for joint voice and data packet wireless networks
US20160014670A1 (en) Method for generating network route using tv white space
CN115767736B (en) Continuous time frame reservation method and system based on hybrid TDMA wireless ad hoc network
Kwon et al. Adaptive multi-channel allocation for vehicular infrastructure mesh systems
KR102298650B1 (en) Service channel allocation method for transmitting WAVE service message
KR100514737B1 (en) Apparatus and method for making a QOS supporting polling list
Cao et al. OGCMAC: A novel OFDM based group contention MAC for VANET control channel
Eshet et al. Randomly ranked mini slots for fair and efficient medium access control in ad hoc networks
CN113709884A (en) Communication resource allocation method and device
Lin et al. EHM: a novel efficient protocol based handshaking mechanism for underwater acoustic sensor networks

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant