CN113347600A - Method, system, equipment and train for realizing resource scheduling - Google Patents
Method, system, equipment and train for realizing resource scheduling Download PDFInfo
- Publication number
- CN113347600A CN113347600A CN202110614591.1A CN202110614591A CN113347600A CN 113347600 A CN113347600 A CN 113347600A CN 202110614591 A CN202110614591 A CN 202110614591A CN 113347600 A CN113347600 A CN 113347600A
- Authority
- CN
- China
- Prior art keywords
- node
- resource scheduling
- authorization
- time slot
- table corresponding
- 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
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
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/12—Messaging; Mailboxes; Announcements
-
- 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/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W76/00—Connection management
- H04W76/10—Connection setup
- H04W76/14—Direct-mode setup
Abstract
The embodiment of the application discloses a method, a system, equipment and a train for realizing resource scheduling, which simultaneously send resource scheduling request messages of a target quantity to authorized nodes through request nodes and realize message multi-transmission to the authorized nodes. The authorization node can determine an authorized time slot according to the received resource scheduling request message, and determine an authorization result according to the target time slot number. And the authorization node simultaneously transmits the resource scheduling authorization messages of the target quantity to the request node. And if the request node does not receive the resource scheduling authorization message sent by the authorization node within the preset time, adjusting the target quantity, and continuing to send the resource scheduling request message until the times of receiving the resource scheduling authorization message or sending the resource scheduling request message reach a time threshold. By adjusting the target number, the normal transmission of messages between the requesting node and the authorizing node is ensured, the success probability of direct communication between trains is improved, and the normal operation of resource scheduling is ensured.
Description
Technical Field
The present application relates to the field of communications, and in particular, to a method, a system, a device, and a train for implementing resource scheduling.
Background
In the running process of the train, information interaction with other trains is needed to ensure the normal running of the train.
At present, communication between trains is mainly forwarded by ground equipment. When a communication network of a train is established, the arrangement of ground equipment beside a track needs to be considered, so that the construction cost and difficulty of the communication network of the train are increased. However, if the method of directly communicating between the trains is adopted, although the cost for constructing ground equipment can be reduced, the communication process is easily affected by the operation of the trains, and the quality of the communication link cannot be ensured. Therefore, how to ensure that the relevant messages can be successfully received when the communication is directly performed between the trains is an urgent 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 resource scheduling, which can improve the probability of successful reception of messages between trains by using a multi-pass mechanism, ensure that relevant messages for resource scheduling can be received between trains, and complete a resource scheduling process.
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 resource scheduling, where the method is applied to a requesting node, and the method includes:
simultaneously sending resource scheduling request messages of a target quantity to authorized nodes; wherein the initial value of the target number is determined according to network communication conditions; the resource scheduling request message comprises the number of target time slots, a common node time slot table corresponding to the request node and a flag bit; the common node time slot table corresponding to the request node comprises a node time slot table corresponding to the request node and a node time slot table corresponding to a neighbor node of the request node; the flag bit is used for representing the target number;
if the resource scheduling authorization message sent by the authorization node is not received within the preset time, adjusting the target number, and returning to execute the resource scheduling request message for simultaneously sending the target number to the authorization node and the subsequent steps until the resource scheduling authorization message sent by the authorization node is received within the preset time or the frequency of sending the resource scheduling request message reaches a frequency threshold;
and if the resource scheduling authorization message sent by the authorization node is received within the preset time and the authorization result in the resource scheduling authorization message is successful, the resource scheduling is successful.
In one possible implementation manner, after the number of times of sending the resource scheduling request message reaches the number threshold, the method further includes:
and sending a resource scheduling failure message to the network layer.
In a possible implementation manner, the resource scheduling grant message further includes time slot information, and if the resource scheduling is successful, the method further includes:
and adjusting a node time slot table corresponding to the request node according to the time slot information in the resource scheduling authorization message, and sending the adjusted node time slot table corresponding to the request node to other nodes.
In one possible implementation, adjusting the target number includes:
and increasing the numerical value of the target quantity to obtain the adjusted target quantity.
In a second aspect, the present application provides a method for implementing resource scheduling, where the method is applied to an authorized node, and the method includes:
receiving a resource scheduling request message sent by a request node;
determining an authorized time slot according to the public node time slot table corresponding to the authorized node and the public node time slot table corresponding to the request node in the resource scheduling request message; the public node time slot table corresponding to the authorization node comprises a node time slot table corresponding to the authorization node and a node time slot table corresponding to a neighbor node of the authorization node;
determining an authorization result according to the time slot number of the authorized time slot and the target time slot number in the resource scheduling request message;
determining the target number according to the flag bit in the resource scheduling request message;
and simultaneously sending the resource scheduling authorization messages of the target quantity to the request node, wherein the resource scheduling authorization messages comprise the authorization result.
In a possible implementation manner, the determining an authorizeable time slot according to the common node time slot table corresponding to the authorization node and the common node time slot table corresponding to the request node in the resource scheduling request message includes:
acquiring a common node time slot table corresponding to the authorization node;
and inquiring common idle time slots from the public node time slot table corresponding to the authorization node and the public node time slot table corresponding to the request node, and determining the idle time slots as authorized time slots.
In a possible implementation manner, the determining an authorization result according to the number of time slots of the authorizeable time slot and the number of target time slots in the resource scheduling request message includes:
if the time slot number of the authorized time slots is larger than or equal to the target time slot number, selecting the authorized time slots with the target time slot number from the authorized time slots as authorized time slots, and determining an authorization result as successful authorization;
and if the time slot number of the authorized time slot is less than the target time slot number, determining the authorization result as authorization failure.
In a third aspect, the present application provides a system for implementing resource scheduling, where the system includes a requesting node and an authorizing node;
the request node is used for simultaneously sending resource scheduling request messages of a target quantity to the authorization node; wherein the initial value of the target number is determined according to network communication conditions; the resource scheduling request message comprises the number of target time slots, a common node time slot table corresponding to the request node and a flag bit; the common node time slot table corresponding to the request node comprises a node time slot table corresponding to the request node and a node time slot table corresponding to a neighbor node of the request node; the flag bit is used for representing the target number;
the authorization node is used for receiving a resource scheduling request message sent by the request node;
determining an authorized time slot according to the public node time slot table corresponding to the authorized node and the public node time slot table corresponding to the request node in the resource scheduling request message; the public node time slot table corresponding to the authorization node comprises a node time slot table corresponding to the authorization node and a node time slot table corresponding to a neighbor node of the authorization node; determining an authorization result according to the time slot number of the authorized time slot and the target time slot number in the resource scheduling request message; determining the target number according to the flag bit in the resource scheduling request message; simultaneously sending the resource scheduling authorization messages of the target quantity to the request node, wherein the resource scheduling authorization messages comprise the authorization result;
the requesting node is further configured to adjust the target number if the resource scheduling grant message sent by the grant node is not received within a preset time, and return to execute the resource scheduling request message and subsequent steps of sending the target number to the grant node at the same time until the resource scheduling grant message sent by the grant node is received within the preset time or the number of times of sending the resource scheduling request message reaches a number threshold; and if the resource scheduling authorization message sent by the authorization node is received within the preset time and the authorization result in the resource scheduling authorization message is successful, the resource scheduling is successful.
In a possible implementation manner, the requesting node is further configured to send a resource scheduling failure message to the network layer.
In a possible implementation manner, the requesting node is further configured to adjust a node timeslot table corresponding to the requesting node according to the timeslot information in the resource scheduling authorization message, and send the adjusted node timeslot table corresponding to the requesting node to other nodes.
In a possible implementation manner, the requesting node is specifically configured to increase the value of the target number to obtain the adjusted target number.
In a possible implementation manner, the authorization node is specifically configured to obtain a common node timeslot table corresponding to the authorization node; and inquiring common idle time slots from the public node time slot table corresponding to the authorization node and the public node time slot table corresponding to the request node, and determining the idle time slots as authorized time slots.
In a possible implementation manner, the authorization node is specifically configured to select an authorized timeslot with a target timeslot number from the authorized timeslots as an authorization timeslot if the timeslot number of the authorized timeslot is greater than or equal to the target timeslot number, and determine an authorization result as successful authorization;
and if the time slot number of the authorized time slot is less than the target time slot number, determining the authorization result as authorization failure.
In a fourth aspect, the present application provides a first device for implementing resource scheduling, including: 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 the first aspect described above.
In a fifth aspect, the present application provides a second device for implementing resource scheduling, including: 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 the second aspect described above.
In a sixth aspect, the present application provides a train, which is characterized by comprising the first device for implementing resource scheduling in the fourth aspect, and/or the second device for implementing resource scheduling in the fifth 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 resource scheduling, the request nodes send the resource scheduling request messages of the target quantity to the authorization nodes at the same time, and message multi-transmission to the authorization nodes is realized. The initial value of the target number is set according to the network communication condition, and the number of the resource scheduling request messages which are simultaneously transmitted can be flexibly adjusted according to the network communication condition. Therefore, when the network communication quality is poor, the probability that the resource scheduling request message is successfully received by the authorization node is improved by simultaneously sending a plurality of resource scheduling request messages. The resource scheduling request message comprises the number of target time slots and a common node time slot table corresponding to the request node. The authorization node can determine an authorized time slot according to the common node time slot table corresponding to the request node and the common node time slot table corresponding to the authorization node in the received resource scheduling request message, and determine an authorization result according to the target time slot number. Similarly, in order to ensure that the requesting node can receive the resource scheduling authorization message, the authorization node determines the target quantity according to the flag bit in the resource scheduling request message, and simultaneously sends the resource scheduling authorization message of the target quantity to the requesting node. The resource scheduling authorization message includes an authorization result. If the request node does not receive the resource scheduling authorization message sent by the authorization node within the preset time, the request node indicates that the authorization node does not successfully receive the resource scheduling request message or fails to send the resource scheduling authorization message, adjusts the target number, and continues to send the resource scheduling request message until the number of times of receiving the resource scheduling authorization message or sending the resource scheduling request message reaches the threshold number. By adjusting the target quantity, the resource scheduling request message is continuously sent, the authorization node is further ensured to receive the resource scheduling request message, the corresponding resource scheduling authorization message is successfully fed back, and the normal transmission of the message between the request node and the authorization node is ensured, so that the related message of resource scheduling can be received between trains, the success probability of direct communication between the trains is improved, and the normal operation of resource scheduling is ensured.
Drawings
Fig. 1 is a schematic view of a scenario of a method for implementing resource scheduling according to an embodiment of the present application;
fig. 2 is a flowchart of a method for implementing resource scheduling according to an embodiment of the present application;
fig. 3 is a schematic diagram of communication between a requesting node and an authorizing node according to an embodiment of the present application;
fig. 4 is a schematic diagram of another communication between a requesting node and an authorizing node according to an embodiment of the present application;
fig. 5 is a flowchart of a method for implementing resource scheduling according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a system for implementing 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 a conventional method for communication between trains, the inventor finds that at present, communication between trains is generally performed through ground equipment arranged beside a track. The reason is that the communication between the train and the ground equipment is reliable, so that the normal transmission of the message can be realized, and the communication nodes can normally receive the message. However, a network structure of a train communication network established based on a train and ground equipment is complex, the construction difficulty is high, time delay is easily generated in the message transmission process, and the timeliness of message processing is affected. Less equipment cost is required for direct train-to-train communication than for communication between a train and ground equipment. However, the communication process is easily affected by the train operation, which results in the loss of the message in the transmission process or the failure of message parsing. Especially for communication between trains moving at high speed, such as magnetic levitation trains, it is difficult to ensure the quality of the communication channel between the trains.
Based on this, the embodiment of the application provides a method, a system, equipment and a train for realizing resource scheduling. And simultaneously sending the resource scheduling request messages of the target quantity to the authorization nodes through the request nodes, thereby realizing message multi-transmission to the authorization nodes. The initial value of the target number is set according to the network communication condition, and the number of the resource scheduling request messages which are simultaneously transmitted can be flexibly adjusted according to the network communication condition. Therefore, when the network communication quality is poor, the probability that the resource scheduling request message is successfully received by the authorization node is improved by simultaneously sending a plurality of resource scheduling request messages. The resource scheduling request message comprises the number of target time slots and a common node time slot table corresponding to the request node. The authorization node can determine the authorized time slot according to the public node time slot table corresponding to the request node and the public node time slot table corresponding to the authorization node in the received resource scheduling request message, and determine the authorization result according to the time slot number of the authorized time slot and the target time slot number. Similarly, in order to ensure that the requesting node can receive the resource scheduling authorization message, the authorization node determines the target quantity according to the flag bit in the resource scheduling request message, and simultaneously sends the resource scheduling authorization message of the target quantity to the requesting node. The resource scheduling authorization message includes an authorization result. If the request node does not receive the resource scheduling authorization message sent by the authorization node within the preset time, the request node indicates that the authorization node does not successfully receive the resource scheduling request message or fails to send the resource scheduling authorization message, adjusts the target number, and continues to send the resource scheduling request message until the number of times of receiving the resource scheduling authorization message or sending the resource scheduling request message reaches the threshold number. By adjusting the target quantity and continuously sending the resource scheduling request message, the authorization node can be further ensured to receive the resource scheduling request message, the corresponding resource scheduling authorization message is fed back, and the normal receiving of the message between the request node and the authorization node is ensured, so that the related message of resource scheduling can be received between trains, the success probability of direct communication between the trains is improved, and the normal operation of resource scheduling is ensured.
In order to facilitate understanding of a method for implementing resource scheduling provided in an 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 resource scheduling according to an embodiment of the present application.
In practical application, the requesting node and the authorizing node may correspond to communication devices in a train that needs to communicate, respectively.
The request node can receive the requirement information of resource scheduling issued by the network layer and correspondingly start the resource scheduling. The requesting node can determine the initial value of the target quantity according to the current network communication condition and simultaneously send the resource scheduling request message of the target quantity to the authorized node. Assuming that the initial value of the target number is 2, the requesting node simultaneously sends 2 resource scheduling request messages to the authorizing node. After receiving the resource scheduling request message, the authorization node may determine, by using information included in the resource scheduling request message, a target number of resource scheduling request messages sent by the request node this time, and determine an authorization result. And correspondingly generating a resource scheduling authorization message by the authorization node, and sending the resource scheduling authorization message with the target quantity to the request node. If the requesting node does not receive the resource scheduling grant message within the preset time, the target number may be adjusted, for example, to 3. And simultaneously sending the resource scheduling request messages of the target quantity to the authorized nodes. And after receiving the resource scheduling request message, the authorized node generates and sends scheduling authorization messages of 3 resources. And if the request node receives the resource scheduling authorization message within the preset time, judging whether the resource scheduling is successful or not by using the received resource scheduling authorization message. And if the authorization result in the resource scheduling authorization message is successful, determining that the resource scheduling is successful. And sending the service data to the authorized node according to the determined time slot resource.
In order to facilitate understanding of the technical solutions provided in the embodiments of the present application, a method for implementing resource scheduling provided in the embodiments of the present application is described below with reference to the accompanying drawings.
First, it should be noted that the method for implementing 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.
Referring to fig. 2, the figure is a flowchart of a method for implementing resource scheduling provided in an embodiment of the present application, where the method is applied to a requesting node, and includes steps S201 to S203.
S201: simultaneously sending resource scheduling request messages of a target quantity to authorized nodes; wherein the initial value of the target number is determined according to network communication conditions; the resource scheduling request message comprises the number of target time slots, a common node time slot table corresponding to the request node and a flag bit; the common node time slot table corresponding to the request node comprises a node time slot table corresponding to the request node and a node time slot table corresponding to a neighbor node of the request node; the flag bit is used for representing the target number.
The requesting node is a node for performing hop-by-hop resource scheduling in a link for transmitting service data. The requesting node sends a resource scheduling request message to a next-hop neighbor node to the destination node, i.e., an authorized node. And after receiving the resource scheduling request information of the request node, the authorization node determines whether the corresponding resource is available to realize the transmission of the service data, and further sends a resource scheduling authorization message to the request node, so that the request node determines whether the resource of the hop of service data transmission is successfully scheduled based on the resource scheduling authorization message.
Requesting node the requesting node may be a source node in the entire communication link or may be a forwarding node in the communication link. For example, if a source node needs to request resource scheduling from a destination node through a forwarding node, when the source node sends a resource scheduling request message to the forwarding node, the source node is a request node, and the forwarding node is an authorization node; after the resource scheduling of the node is completed, in the process that the forwarding node sends a resource scheduling request message to the destination node, the forwarding node is a request node, and the destination node is an authorization node.
It should be noted that, in the embodiment of the present application, the trigger condition for triggering the requesting node to send the resource scheduling request message to the authorizing node is not limited. In a possible implementation manner, the requesting node may start the resource scheduling request after receiving the service primitive issued by the previous layer, that is, the network layer. In addition, in order to ensure the efficiency of resource scheduling, the network layer may perform error check on the generated service primitive first, and issue the service primitive to the requesting node after determining that there is no error. The service primitive may include information related to resource scheduling, such as destination node, source node, grant node, priority, and service type. The requesting node may determine an authorized node according to the received service primitive and generate a corresponding resource scheduling request message.
The requesting node may determine an initial value of a target number according to the current network communication condition, the target number being used for determining the number of resource scheduling request messages transmitted simultaneously. The initial value of the target number is determined by the current network communication condition, and the network communication condition can be determined according to the acquired related information of the network communication. For example, when the network communication condition is poor, the initial value of the target number may be set to a larger value; when the network communication condition is good, the initial value of the target number may be set to a smaller value.
And the requesting node simultaneously transmits the resource scheduling request messages of the target quantity to the authorized nodes based on the determined target quantity. The resource scheduling request message comprises the number of target time slots, a common node time slot table corresponding to the request node and a flag bit. Specifically, the resource Scheduling request message may be a Distributed Scheduling-request (DSCH-request) message in a DSCH (Distributed Scheduling) message. And the allocation of the time slots corresponding to the nodes and the connection of the links between the nodes can be realized through the resource scheduling request message.
Wherein, the target time slot number can be determined according to the requirement of resource scheduling. Specifically, the requesting node may determine the target number of timeslots according to the service type in the received service primitive.
In order to facilitate the authorized nodes to determine the authorized time slots, the resource scheduling request message includes a common node time slot table corresponding to the requesting node. The common node time slot table corresponding to the request node comprises a node time slot table corresponding to the request node and a node time slot table corresponding to a neighbor node of the request node. The neighbor node of the requesting node may be determined according to the range maintained by each node set in the ad hoc network, for example, if the requesting node maintains the neighbor node within the two-hop range, the node timeslot table corresponding to the neighbor node is the node timeslot table corresponding to the neighbor node within the two-hop range. The node slot table of the neighbor node may be obtained by the requesting node in advance. In a possible implementation manner, if the node timeslot table of a node changes, the node may broadcast the adjusted node timeslot table to other neighboring nodes. After obtaining the adjusted node time slot table, the other nodes may update the stored node time slot table of the node.
Because the problem of message loss may occur between the requesting node and the authorized node, the authorized node cannot necessarily receive the resource scheduling request message sent by the requesting node. The resource scheduling request message includes a flag bit. The flag bit is used for indicating the target number of the resource scheduling request messages simultaneously sent by the request node, so that the authorization node sends the target number of the resource scheduling authorization messages to the request node after acquiring the flag bit. And correspondingly adjusting the zone bits along with the target number simultaneously transmitted by the resource scheduling request message.
S202: and if the resource scheduling authorization message sent by the authorization node is not received within the preset time, adjusting the target number, and returning to execute the resource scheduling request message for simultaneously sending the target number to the authorization node and the subsequent steps until the resource scheduling authorization message sent by the authorization node is received within the preset time or the frequency of sending the resource scheduling request message reaches a frequency threshold.
After the grant node can normally receive the resource scheduling request message sent by the request node, the resource scheduling grant message is fed back. The resource Scheduling grant message may be a DSCH-grant (Distributed grant) message among DSCH (Distributed Scheduling, Distributed) messages.
It can be understood that, during the message transmission between the requesting node and the authorized node, the following situations may occur:
the first condition is as follows: the authorization node can receive part or all of the resource scheduling request message and correspondingly feed back the resource scheduling authorization message. The requesting node can receive part or all of the resource scheduling authorization message within a certain time. Referring to fig. 3, this figure is a schematic diagram of communication between a requesting node and an authorizing node according to an embodiment of the present application. Fig. 4 is a schematic diagram of another communication between a requesting node and an authorizing node according to an embodiment of the present application.
Case two: the authorization node can receive part or all of the resource scheduling request message and correspondingly feed back the resource scheduling authorization message. The requesting node does not successfully receive the resource scheduling authorization message within a certain time.
Case three: the grant node may receive part or all of the resource scheduling request message, but cannot normally feed back the resource scheduling grant message.
Case four: the authorized node does not receive part or all of the resource scheduling request message and does not feed back the resource scheduling authorization message.
For the above four cases, it can be considered that the case is that normal transmission between the requesting node and the authorizing node is realized, and the requesting node cannot normally receive the resource scheduling authorizing message in the other three cases, and may need to resend the resource scheduling requesting message.
Correspondingly, if the requesting node does not receive the resource scheduling grant message sent by the grant node within the preset time, it indicates that the resource scheduling request message or the resource scheduling grant message of the target number may be sent, normal message transmission cannot be achieved, and the target number may be further adjusted. The preset time may be preset time for the requesting node to perform one-time message interaction with the authorizing node under a normal condition, and the preset time may be set according to a specific network communication condition. In one possible implementation manner, the timing of the preset time may be performed by starting a message retransmission timer after the resource scheduling request message is transmitted.
Specifically, the value of the target number can be increased, so that the requesting node and the authorized node can simultaneously send more messages, and the probability of normal transmission of the messages is improved.
In a possible implementation manner, adjusting the target number may specifically include: and increasing the numerical value of the target quantity to obtain the adjusted target quantity. Specifically, a fixed number may be increased, for example, by 1 at a time; the increased value may also be determined based on network communication conditions.
And after the target quantity is adjusted, returning to execute the steps of simultaneously sending the resource scheduling request messages of the target quantity to the authorized node and the subsequent steps until the resource scheduling authorized messages sent by the authorized node are received within the preset time or the frequency of sending the resource scheduling request messages reaches a frequency threshold value.
If the resource scheduling authorization message sent by the authorization node is received within the preset time, the message can be determined to be successfully transmitted, retransmission is stopped, and whether subsequent resource scheduling is successful is judged.
In addition, if the resource scheduling grant message sent by the grant node cannot be received within the preset time after the resource scheduling request message is sent for multiple times, it can be considered that a communication fault may exist between the request node and the grant node. In order to avoid the waste of network resources and timely process the fault, the retransmission of the resource scheduling grant message can be stopped. Specifically, a time threshold may be preset, and if the number of times of sending the resource scheduling request message reaches the time threshold, the retransmission is stopped. The number threshold may be set according to the network communication condition, and may be set to 5 times, for example.
S203: and if the resource scheduling authorization message sent by the authorization node is received within the preset time and the authorization result in the time slot information in the resource scheduling authorization message is successful in authorization, the resource scheduling is successful.
If the requesting node receives the resource scheduling authorization message sent by the authorizing node within the preset time after the requesting node simultaneously sends the resource scheduling request messages of the target quantity to the authorizing node, the received resource scheduling authorization message can be utilized to judge whether the resource scheduling is successful.
The resource scheduling authorization message has an authorization result determined by the authorization node. If the authorization result is successful, it indicates that the requesting node can use the authorized time slots of the target time slot number to transmit the service data, and the resource scheduling is successful. If the authorization result is authorization failure, the authorization node does not find the authorized time slot which meets the target time slot number, and the resource scheduling fails.
It should be noted that, if the requesting node receives the resource scheduling grant messages sent by the multiple grant nodes, it may determine whether the processing is successful, and if the processing is successful, the requesting node may not perform other processing.
Based on the related contents of the above S201-S203, it can be known that simultaneous multi-transmission of the resource scheduling request messages can be realized by simultaneously sending the resource scheduling request messages of the target number to the authorized nodes. And the target number can be further adjusted according to the network communication condition and the frequency of sending the resource scheduling request message, so that the number of the resource scheduling request messages sent at the same time is matched with the network communication condition, and the probability of successfully receiving the resource scheduling request message by the authorization node is improved.
In a possible implementation manner, if the number of times of sending the resource scheduling request message reaches the threshold number of times, it indicates that the resource scheduling fails. After the number of times of sending the resource scheduling request message reaches the number threshold, the method further includes:
and sending a resource scheduling failure message to the network layer.
The resource scheduling failure message is a message for notifying the network layer of the resource scheduling failure. The resource scheduling failure message may include specific reason information of the resource scheduling failure, for example, a communication failure with the authorized node, so that the network layer may perform next resource scheduling adjustment according to the reason information of the resource scheduling failure.
In the embodiment of the application, the resource scheduling failure message is sent to the network layer by the request node, so that the network layer can conveniently acquire the relevant information of resource scheduling in time, adjust the information in time and improve the processing efficiency after the resource scheduling failure.
In a possible implementation manner, the resource scheduling grant message further includes time slot information, and after the resource scheduling is successful, the requesting node may send the relevant service data according to the granted time slot. Correspondingly, the requesting node needs to adjust its corresponding node time slot table to mark the occupied time slot.
Specifically, if the resource scheduling is successful, the method for implementing resource scheduling further includes:
and adjusting a node time slot table corresponding to the request node according to the time slot information in the resource scheduling authorization message, and sending the adjusted node time slot table corresponding to the request node to other nodes.
After the resource scheduling is determined to be successful, the requesting node needs to mark the time slot occupied in the node time slot table corresponding to the requesting node. And the requesting node correspondingly adjusts the node time slot table of the requesting node according to the time slot information in the resource scheduling authorization message. After the node time slot table is adjusted, the requesting node needs to send the adjusted node time slot table to other nodes, so that the other nodes can store and query the adjusted node time slot table. Specifically, the node slot table may be sent to other nodes in a broadcast manner.
In the embodiment of the application, the adjusted node time slot table is sent to other nodes through the request node, so that the other nodes can conveniently inquire the idle time slot based on the node time slot table corresponding to the request node, and the data transmission conflict between the nodes is reduced.
An embodiment of the present application provides a flowchart of a method for implementing resource scheduling, which is shown in fig. 5 and is applied to an authorization node, and the method includes steps S501 to S505.
S501: and receiving a resource scheduling request message sent by a requesting node.
Based on the related content of the above embodiments, when normal communication is possible between the requesting node and the authorizing node, the authorizing node may receive the resource scheduling request message sent by the requesting node. After the resource scheduling request message, the grant node may generate a corresponding resource scheduling grant message based on the resource scheduling request message. The requesting node may determine whether the resource scheduling is successful based on the received resource scheduling grant message.
It should be noted that, after receiving the first resource scheduling request message sent by the requesting node, the grant node may perform the subsequent steps of determining the grant time slot and generating and sending the resource scheduling grant message. If the authorization node receives the resource scheduling request messages sent by the plurality of request nodes, whether the processing is performed or whether the processing is successful or not can be judged, and if the processing is successful, other processing can not be performed.
S502: determining an authorized time slot according to the public node time slot table corresponding to the authorized node and the public node time slot table corresponding to the request node in the resource scheduling request message; and the public node time slot table corresponding to the authorized node comprises the node time slot table of the authorized node and the node time slot table of the neighbor node of the authorized node.
A slot may be granted as an unoccupied free slot. When the authorized node and the requesting node have a common free time slot, the common free time slot can be used for transmitting the service data. Correspondingly, the free time slots that can be used are the authorized time slots that can be authorized to be occupied.
And the authorization node acquires the public node time slot table corresponding to the request node from the resource scheduling request message and acquires the public node time slot table corresponding to the authorization node. The public node time slot table corresponding to the authorized node comprises a node time slot table of the authorized node and a node time slot table of a neighbor node of the authorized node. The authorization node can query idle time slots shared by the authorization node, neighbor nodes of the authorization node, the request node and neighbor nodes of the request node based on the common node time slot table corresponding to the authorization node and the common node time slot table corresponding to the request node, so as to determine the authorized time slots.
In a possible implementation manner, an embodiment of the present application provides a specific implementation manner for determining an authorized time slot according to a common node time slot table corresponding to the authorized node and a common node time slot table corresponding to a requesting node in the resource scheduling request message, please refer to the following.
S503: and determining an authorization result according to the time slot number request node of the authorized time slot and the target time slot number in the resource scheduling request message.
After determining the authorized time slot, the authorization result needs to be determined according to the number of time slots of the authorized time slot and the number of target time slots. The grant result may be used to determine whether the resource scheduling is successful. In a possible implementation manner, an embodiment of the present application provides a specific implementation manner for determining an authorization result according to the number of time slots of the grantable time slot and the number of target time slots in the resource scheduling request message, please refer to the following.
S504: and determining the target number according to the flag bit in the resource scheduling request message.
Similarly, in order to ensure that the requesting node can receive the resource scheduling request message, the granting node also needs to perform multiple transmissions of the resource scheduling request message. And the authorization node determines the target number according to the flag bit in the resource scheduling request message.
S505: and simultaneously sending the resource scheduling authorization messages of the target quantity to the request node, wherein the resource scheduling authorization messages comprise the authorization result.
And the authorization node simultaneously transmits the resource scheduling authorization messages of the target quantity to the request node based on the determined target quantity. The resource scheduling authorization message includes an authorization result. The requesting node may determine whether the resource scheduling was successful based on the grant result.
Based on the related contents of S501-S505, the grant node may determine the grant time slots and the target number by processing the received resource scheduling request message, and further send the resource scheduling grant messages of the target number to the request node at the same time, so that the request node determines whether the resource scheduling is successful after successfully receiving the grant message. The authorization node conducts multi-transmission of the resource scheduling authorization message, so that the probability that the request node receives the resource scheduling authorization message can be improved, and the reliable receiving of the message can be ensured.
Further, an embodiment of the present application provides a specific implementation manner for determining an authorized time slot according to a common node time slot table corresponding to the authorized node and a common node time slot table corresponding to the requesting node in the resource scheduling request message, including:
and acquiring a public node time slot table corresponding to the authorization node, inquiring a common idle time slot from the public node time slot table corresponding to the authorization node and the public node time slot table corresponding to the request node, and determining the idle time slot as an authorized time slot.
And the authorized node acquires the corresponding public node time slot table. The common node slot table corresponding to the authorized node may be pre-stored in the authorized node. Specifically, in a possible implementation manner, after the grant node receives the resource scheduling request message, the grant node may trigger to acquire the common node timeslot table corresponding to the grant node.
The public node time slot table corresponding to the authorization node is provided with the node time slot table corresponding to the authorization node and the neighbor node of the authorization node, and the node time slot table is provided with occupied time slots and idle time slots corresponding to all the nodes. Similarly, the common node time slot table corresponding to the request node has node time slot tables of the request node and neighbor nodes of the request node, and the node time slot table has occupied time slots and idle time slots corresponding to each node. In order to ensure that the service data can be normally transmitted, a common idle time slot can be inquired from the common node time slot table corresponding to the authorization node and the common node time slot table corresponding to the request node, and the inquired idle time slot is determined as an authorized time slot.
It should be noted that the authorized time slot is a common free time slot that can be used and determined by the authorized node after the query, and whether the authorized time slot is used for transmitting the service data, that is, is authorized to be the authorized time slot, also needs to be determined according to the time slot number of the authorized time slot and the target time slot number.
In the embodiment of the application, a common idle time slot is determined as an authorized time slot through common node time slot tables corresponding to an authorized node and a requesting node respectively, the authorized time slot which can be used for service data transmission is determined first, and then an authorization result is determined based on the authorized time slot.
In a possible implementation manner, an embodiment of the present application provides a specific implementation manner for determining an authorization result according to the number of time slots of the grantable time slot and the number of target time slots in the resource scheduling request message, including:
if the time slot number of the authorized time slots is larger than or equal to the target time slot number, selecting the authorized time slots with the target time slot number from the authorized time slots as authorized time slots, and determining an authorization result as successful authorization;
and if the time slot number of the authorized time slot is less than the target time slot number, determining the authorization result as authorization failure.
The number of slots of the allowable slots determined by the grant node may be greater than or equal to the target number of slots, or may be less than the target number of slots. If the time slot number of the authorized time slot is larger than or equal to the target time slot number, the requesting node can successfully transmit the service data. Correspondingly, the authorized time slots with the target time slot number are selected from the authorized time slots to be used as the authorized time slots for transmitting the service data, and the authorization result is determined as successful authorization. On the contrary, if the time slot number of the authorized time slot is less than the target time slot number, the requesting node cannot successfully transmit the service data, and the authorized node sets the authorization result as authorization failure.
In one possible implementation, the grant result of successful grant has grant time slot and grant flag bit. The number of grant slots included in the grant result of the grant failure is 0.
Based on the method for implementing resource scheduling provided by the foregoing method embodiment, the embodiment of the present application also provides a system for implementing resource scheduling, and the system for implementing resource scheduling will be described below with reference to the accompanying drawings.
Referring to fig. 6, this figure is a schematic structural diagram of a system for implementing resource scheduling according to an embodiment of the present application. As shown in fig. 6, the system for implementing resource scheduling includes a requesting node 601 and a granting node 602;
the requesting node 601 is configured to send a resource scheduling request message of a target number to the authorizing node 602 at the same time; wherein the initial value of the target number is determined according to network communication conditions; the resource scheduling request message includes the number of target time slots, a common node time slot table and a flag bit corresponding to the request node 601; the common node time slot table corresponding to the requesting node 601 comprises a node time slot table corresponding to the requesting node 601 and a node time slot table corresponding to a neighbor node of the requesting node 601; the flag bit is used for representing the target number;
the grant node 602 is configured to receive a resource scheduling request message sent by the requesting node 601;
determining an authorized time slot according to the public node time slot table corresponding to the authorized node 602 and the public node time slot table corresponding to the requesting node 601 in the resource scheduling request message; the common node timeslot table corresponding to the authorized node 602 includes a node timeslot table corresponding to the authorized node 602 and a node timeslot table corresponding to a neighbor node of the authorized node 602; determining an authorization result according to the time slot number of the authorized time slot and the target time slot number in the resource scheduling request message; determining the target number according to the flag bit in the resource scheduling request message; simultaneously sending the resource scheduling authorization messages of the target quantity to the requesting node 601, wherein the resource scheduling authorization messages comprise the authorization result;
the requesting node 601 is further configured to adjust the target number if the resource scheduling grant message sent by the authorizing node 602 is not received within a preset time, and return to execute the resource scheduling request message sent to the authorizing node 602 at the same time and subsequent steps until the resource scheduling grant message sent by the authorizing node 602 is received within the preset time or the number of times of sending the resource scheduling request message reaches a threshold number; if the resource scheduling authorization message sent by the authorization node 602 is received within the preset time, and the authorization result in the resource scheduling authorization message is successful in authorization, the resource scheduling is successful.
In a possible implementation manner, the requesting node 601 is further configured to send a resource scheduling failure message to a network layer.
In a possible implementation manner, the requesting node 601 is further configured to adjust a node time slot table corresponding to the requesting node 601 according to the time slot information in the resource scheduling authorization message, and send the adjusted node time slot table corresponding to the requesting node 601 to other nodes.
In a possible implementation manner, the requesting node 601 is specifically configured to increase the value of the target number to obtain the adjusted target number.
In a possible implementation manner, the grant node 602 is specifically configured to obtain a common node timeslot table corresponding to the grant node 602; and inquiring a common idle time slot from the public node time slot table corresponding to the authorized node 602 and the public node time slot table corresponding to the requesting node 601, and determining the idle time slot as an authorized time slot.
In a possible implementation manner, the grant node 602 is specifically configured to select an grantable timeslot with a target timeslot number from the grantable timeslots as a grant timeslot if the timeslot number of the grantable timeslot is greater than or equal to the target timeslot number, and determine a grant result as a grant success;
and if the time slot number of the authorized time slot is less than the target time slot number, determining the authorization result as authorization failure.
Based on the method for implementing resource scheduling provided by the embodiment of the method, the application provides a device for implementing resource scheduling, which 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 comprising instructions, which when executed by the processor, cause the processor to perform the method of any of the above embodiments.
Based on the device for realizing resource scheduling provided by the embodiment of the method, the application provides a train, which comprises the device for realizing resource scheduling provided by the embodiment.
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 (11)
1. A method for realizing resource scheduling, which is applied to a requesting node, and comprises the following steps:
simultaneously sending resource scheduling request messages of a target quantity to authorized nodes; wherein the initial value of the target number is determined according to network communication conditions; the resource scheduling request message comprises the number of target time slots, a common node time slot table corresponding to the request node and a flag bit; the common node time slot table corresponding to the request node comprises a node time slot table corresponding to the request node and a node time slot table corresponding to a neighbor node of the request node; the flag bit is used for representing the target number;
if the resource scheduling authorization message sent by the authorization node is not received within the preset time, adjusting the target number, and returning to execute the resource scheduling request message for simultaneously sending the target number to the authorization node and the subsequent steps until the resource scheduling authorization message sent by the authorization node is received within the preset time or the frequency of sending the resource scheduling request message reaches a frequency threshold;
and if the resource scheduling authorization message sent by the authorization node is received within the preset time and the authorization result in the resource scheduling authorization message is successful, the resource scheduling is successful.
2. The method of claim 1, wherein after the number of times the resource scheduling request message is transmitted reaches a number threshold, the method further comprises:
and sending a resource scheduling failure message to the network layer.
3. The method of claim 1, wherein the resource scheduling grant message further includes time slot information, and if the resource scheduling is successful, the method further includes:
and adjusting a node time slot table corresponding to the request node according to the time slot information in the resource scheduling authorization message, and sending the adjusted node time slot table corresponding to the request node to other nodes.
4. The method of claim 1, wherein adjusting the target number comprises:
and increasing the numerical value of the target quantity to obtain the adjusted target quantity.
5. A method for realizing resource scheduling, which is applied to an authorized node, and comprises the following steps:
receiving a resource scheduling request message sent by a request node;
determining an authorized time slot according to the public node time slot table corresponding to the authorized node and the public node time slot table corresponding to the request node in the resource scheduling request message; the public node time slot table corresponding to the authorization node comprises a node time slot table corresponding to the authorization node and a node time slot table corresponding to a neighbor node of the authorization node;
determining an authorization result according to the time slot number of the authorized time slot and the target time slot number in the resource scheduling request message;
determining the target number according to the flag bit in the resource scheduling request message;
and simultaneously sending the resource scheduling authorization messages of the target quantity to the request node, wherein the resource scheduling authorization messages comprise the authorization result.
6. The method according to claim 5, wherein the determining an allowable slot according to the common node slot table corresponding to the grant node and the common node slot table corresponding to the request node in the resource scheduling request message comprises:
acquiring a common node time slot table corresponding to the authorization node;
and inquiring common idle time slots from the public node time slot table corresponding to the authorization node and the public node time slot table corresponding to the request node, and determining the idle time slots as authorized time slots.
7. The method of claim 5, wherein the determining the grant result according to the number of slots of the grantable slot and the number of target slots in the resource scheduling request message comprises:
if the time slot number of the authorized time slots is larger than or equal to the target time slot number, selecting the authorized time slots with the target time slot number from the authorized time slots as authorized time slots, and determining an authorization result as successful authorization;
and if the time slot number of the authorized time slot is less than the target time slot number, determining the authorization result as authorization failure.
8. A system for realizing resource scheduling comprises a request node and an authorization node;
the request node is used for simultaneously sending resource scheduling request messages of a target quantity to the authorization node; wherein the initial value of the target number is determined according to network communication conditions; the resource scheduling request message comprises the number of target time slots, a common node time slot table corresponding to the request node and a flag bit; the common node time slot table corresponding to the request node comprises a node time slot table corresponding to the request node and a node time slot table corresponding to a neighbor node of the request node; the flag bit is used for representing the target number;
the authorization node is used for receiving a resource scheduling request message sent by the request node; determining an authorized time slot according to the public node time slot table corresponding to the authorized node and the public node time slot table corresponding to the request node in the resource scheduling request message; the public node time slot table corresponding to the authorization node comprises a node time slot table corresponding to the authorization node and a node time slot table corresponding to a neighbor node of the authorization node; determining an authorization result according to the time slot number of the authorized time slot and the target time slot number in the resource scheduling request message; determining the target number according to the flag bit in the resource scheduling request message; simultaneously sending the resource scheduling authorization messages of the target quantity to the request node, wherein the resource scheduling authorization messages comprise the authorization result;
the requesting node is further configured to adjust the target number if the resource scheduling grant message sent by the grant node is not received within a preset time, and return to execute the resource scheduling request message and subsequent steps of sending the target number to the grant node at the same time until the resource scheduling grant message sent by the grant node is received within the preset time or the number of times of sending the resource scheduling request message reaches a number threshold; and if the resource scheduling authorization message sent by the authorization node is received within the preset time and the authorization result in the resource scheduling authorization message is successful, the resource scheduling is successful.
9. A first apparatus that implements resource scheduling, comprising: a processor, a memory, a system bus;
the processor and the memory are connected through the system bus;
the memory is to store one or more programs, the one or more programs comprising instructions, which when executed by the processor, cause the processor to perform the method of any of claims 1-4.
10. A second apparatus for implementing resource scheduling, comprising: a processor, a memory, a system bus;
the processor and the memory are connected through the system bus;
the memory is to store one or more programs, the one or more programs comprising instructions, which when executed by the processor, cause the processor to perform the method of any of claims 5-7.
11. A train comprising a first device implementing resource scheduling according to claim 9 and/or a second device implementing resource scheduling according to claim 10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110614591.1A CN113347600B (en) | 2021-06-02 | 2021-06-02 | Method, system, equipment and train for realizing resource scheduling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110614591.1A CN113347600B (en) | 2021-06-02 | 2021-06-02 | Method, system, equipment and train for realizing resource scheduling |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113347600A true CN113347600A (en) | 2021-09-03 |
| CN113347600B CN113347600B (en) | 2022-04-22 |
Family
ID=77473060
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110614591.1A Active CN113347600B (en) | 2021-06-02 | 2021-06-02 | Method, system, equipment and train for realizing resource scheduling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113347600B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113873473A (en) * | 2021-09-24 | 2021-12-31 | 中车青岛四方机车车辆股份有限公司 | Method, system, equipment and train for realizing low-delay resource scheduling |
| CN113891282A (en) * | 2021-10-29 | 2022-01-04 | 中国联合网络通信集团有限公司 | Resource scheduling method and control function entity |
| CN115454912A (en) * | 2022-11-09 | 2022-12-09 | 苏州浪潮智能科技有限公司 | Parallel arbitration method, system, equipment and storage medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100226268A1 (en) * | 2009-03-09 | 2010-09-09 | Industrial Technology Research Institute | Slot based persistent allocation scheme |
| CN102158966A (en) * | 2011-02-25 | 2011-08-17 | 北京交通大学 | Centralized time slot dispatching method and system |
| US8254394B1 (en) * | 1999-06-29 | 2012-08-28 | Cisco Technology, Inc. | Technique for providing constant bit rate (CBR) service over a time-slotted access channel |
| US20140286257A1 (en) * | 2013-03-25 | 2014-09-25 | Intellectual Discovery Co., Ltd. | Method and apparatus for performing control channel scheduling in orthogonal frequency division multiplexing access (ofdma)-based wireless mesh network |
| US20160198460A1 (en) * | 2013-09-06 | 2016-07-07 | Guoxia Zhang | Time slot selection in wireless communication |
| WO2017050126A1 (en) * | 2015-09-21 | 2017-03-30 | 中兴通讯股份有限公司 | Data transmission method, and method and device for sending indication information |
| CN107645775A (en) * | 2016-07-21 | 2018-01-30 | 北京信威通信技术股份有限公司 | A kind of method and device of scheduling of resource |
| US20200107301A1 (en) * | 2017-03-24 | 2020-04-02 | Zte Corporation | Data transmitting method and device, and storage medium |
| US20200322973A1 (en) * | 2017-10-10 | 2020-10-08 | Lenovo (Beijing) Limited | Determining a transmission scheme |
| WO2021008378A1 (en) * | 2019-07-12 | 2021-01-21 | 华为技术有限公司 | Communication method and device |
-
2021
- 2021-06-02 CN CN202110614591.1A patent/CN113347600B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8254394B1 (en) * | 1999-06-29 | 2012-08-28 | Cisco Technology, Inc. | Technique for providing constant bit rate (CBR) service over a time-slotted access channel |
| US20100226268A1 (en) * | 2009-03-09 | 2010-09-09 | Industrial Technology Research Institute | Slot based persistent allocation scheme |
| CN102158966A (en) * | 2011-02-25 | 2011-08-17 | 北京交通大学 | Centralized time slot dispatching method and system |
| US20140286257A1 (en) * | 2013-03-25 | 2014-09-25 | Intellectual Discovery Co., Ltd. | Method and apparatus for performing control channel scheduling in orthogonal frequency division multiplexing access (ofdma)-based wireless mesh network |
| US20160198460A1 (en) * | 2013-09-06 | 2016-07-07 | Guoxia Zhang | Time slot selection in wireless communication |
| WO2017050126A1 (en) * | 2015-09-21 | 2017-03-30 | 中兴通讯股份有限公司 | Data transmission method, and method and device for sending indication information |
| CN107645775A (en) * | 2016-07-21 | 2018-01-30 | 北京信威通信技术股份有限公司 | A kind of method and device of scheduling of resource |
| US20200107301A1 (en) * | 2017-03-24 | 2020-04-02 | Zte Corporation | Data transmitting method and device, and storage medium |
| US20200322973A1 (en) * | 2017-10-10 | 2020-10-08 | Lenovo (Beijing) Limited | Determining a transmission scheme |
| WO2021008378A1 (en) * | 2019-07-12 | 2021-01-21 | 华为技术有限公司 | Communication method and device |
Non-Patent Citations (1)
| Title |
|---|
| 丁叁叁等: "基于TDD系统的高速磁悬浮软切换技术研究", 《信息传输与接入技术》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113873473A (en) * | 2021-09-24 | 2021-12-31 | 中车青岛四方机车车辆股份有限公司 | Method, system, equipment and train for realizing low-delay resource scheduling |
| CN113873473B (en) * | 2021-09-24 | 2024-01-09 | 中车青岛四方机车车辆股份有限公司 | Method, system, equipment and train for realizing low-delay resource scheduling |
| CN113891282A (en) * | 2021-10-29 | 2022-01-04 | 中国联合网络通信集团有限公司 | Resource scheduling method and control function entity |
| CN113891282B (en) * | 2021-10-29 | 2023-04-28 | 中国联合网络通信集团有限公司 | Resource scheduling method and control functional entity |
| CN115454912A (en) * | 2022-11-09 | 2022-12-09 | 苏州浪潮智能科技有限公司 | Parallel arbitration method, system, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113347600B (en) | 2022-04-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113347600B (en) | Method, system, equipment and train for realizing resource scheduling | |
| US10827524B2 (en) | Method of decentralized medium access control in a communications network | |
| CN1951068B (en) | A method of distributive reservation of a medium in a radio communications network | |
| Bilstrup et al. | Scalability issues of the MAC methods STDMA and CSMA of IEEE 802.11 p when used in VANETs | |
| Lott et al. | Medium access and radio resource management for ad hoc networks based on UTRA TDD | |
| US8130731B2 (en) | Method, network nodes and system for broadcast transmission of data | |
| US7142527B2 (en) | System and method for transmission scheduling using network membership information and neighborhood information | |
| US20160073288A1 (en) | Reducing contention in a peer-to-peer data link network | |
| US20060083197A1 (en) | Channel assigning method for ad-hoc network | |
| US20100195585A1 (en) | Methods and systems for scheduling among nodes for a data slot in wireless communication networks | |
| KR101916328B1 (en) | System and Method for Beacon Scheduling using RPL in TSCH based IoT Environment | |
| CN110062465A (en) | A kind of resource allocation methods of terminal direct connection communication | |
| US20090028090A1 (en) | Method and system of wireless communication between devices | |
| US20090086752A1 (en) | Communication scheduling of network nodes using fair access and weighting techniques | |
| CN109996189B (en) | System for cooperative repetition of broadcast messages | |
| CN101582910A (en) | Method and device for controlling medium access | |
| US20190363865A1 (en) | Full duplex transmission method and apparatus | |
| Zhang et al. | A black-burst based time slot acquisition scheme for the hybrid TDMA/CSMA multichannel MAC in VANETs | |
| US20110206033A1 (en) | Communication method between wireless nodes | |
| EP1371183A1 (en) | System and method for transmission scheduling using network membership information and neighborhood information | |
| Gomez et al. | Cooperation on demand protocols for wireless networks | |
| EP1183825B1 (en) | A distributed wireless medium access control protocol with support for isochronous services | |
| US8837383B2 (en) | Method of generating report messages in a network | |
| CN113873473A (en) | Method, system, equipment and train for realizing low-delay resource scheduling | |
| Gotzhein et al. | Deterministic Arbitration |
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 |