CN118102480A - Resource scheduling method, device and network node - Google Patents

Abstract

The application provides a resource scheduling method, a device and a network node, wherein the method comprises the following steps: in the exclusive signaling time slot of the ith superframe, according to P business priorities corresponding to the first cache data, P reserved time advance amounts are determined, i is an integer from 1 to N, and the nth superframe is the last superframe of reserved time slot resources; according to the P reservation time advance, P superframes after the ith superframe are determined; reserving time slot resources of the first cache data in P superframes according to P service priorities, wherein each service priority is matched with one superframe, and the higher the service priority is, the later the superframe position is; and sending a first resource negotiation signaling to the adjacent second network node, wherein the first resource negotiation signaling carries first indication information for indicating the time slot resources reserved by the first network node in P superframes. The application can effectively reduce the conflict probability of resource application, avoid complex resource preemption process and reasonably utilize network resources through the division of service priority.

Description

Resource scheduling method, device and network node

Technical Field

The present application relates to the field of mobile communications technologies, and in particular, to a method and an apparatus for scheduling resources, and a network node.

Background

The time slot resources in the self-organizing network are distributed and allocated in a combined manner of static state and dynamic state. The control plane data generally uses a static allocation mode to ensure that each network node sends networking signaling and negotiates service resources equally. The service plane has more data types, and the QoS (Quality of Service ) requirements of each service are also greatly different, so a dynamic resource allocation mode is generally adopted to ensure the total service throughput and the system transmission performance of the network.

The dynamic resource scheduling modes in the ad hoc network mainly comprise a CSMA (CARRIER SENSE Multiple Access) scheduling mode based on random contention and a dynamic TDMA (Time Division Multiple Access ) scheduling mode based on-demand negotiation. The CSMA scheduling mode based on random competition inevitably generates resource collision, and when the network density is higher, the collision times can be greatly increased, thereby causing the disconnection of a communication link and obviously reducing the network performance. Dynamic TDMA scheduling based on-demand negotiation is the main scheduling mode of the ad hoc network service plane resources, wherein the most classical protocol is USAP (Unifying Slot Assignment Protocol, unified time slot allocation protocol).

The USAP protocol is a distributed multi-hop protocol. The service time slot in the ad hoc network can be shared by all network nodes, each node can select one or more time slots from unassigned time slots, and the scheduling use of resources is completed through the statement and confirmation of the time slot assignment among the neighboring nodes. However, USAP protocol also has shortcomings, mainly expressed by:

1. all kinds of data services generated at the network nodes schedule resources in the same resource pool, so that resource application among different nodes in the multi-hop network is easy to generate conflict, the success rate of resource allocation is reduced, and the scheduling delay is increased.

2. The detection and arbitration process after the resource allocation conflict needs to consider various factors such as service priority, and the like, so that the resource preemption algorithm is complex, and the occupied signaling overhead is large.

As shown in fig. 1, the USAP protocol uses a superframe as a scheduling period, and all network nodes only need to have packet data to be transmitted, and no matter the service priority, resources are applied as required in JS time slot blocks of the same superframe. Once non-adjacent node A and node B apply for the same time slot resource, resource conflict can occur, 1-hop neighbor nodes (such as node C) common to node A and node B are required to effectively identify the conflict, and resource preemption scheduling is carried out according to service priority, so that attribution of the resource is judged. The USAP protocol may further increase resource allocation collision when the number of nodes applying for resources is large and the network is under a heavy load.

Disclosure of Invention

In view of the foregoing, embodiments of the present application provide a resource scheduling method, apparatus and network node that overcome or at least partially solve the foregoing problems.

In a first aspect, an embodiment of the present application provides a resource scheduling method, applied to a first network node, including:

in the exclusive signaling time slot of the ith superframe, according to P service priorities corresponding to the first cache data, P reserved time advance amounts are determined, i is an integer from 1 to N, the nth superframe is the last superframe of reserved time slot resources, P is greater than or equal to 1 and less than or equal to Q, and Q is the total service priority number corresponding to the transmission data in the ad hoc network;

according to the P reservation time advance, P superframes after the ith superframe are determined;

Reserving time slot resources of the first cache data in the P superframes according to the P service priorities, wherein each service priority is matched with one superframe, and the higher the service priority is, the later the superframe position is;

And sending a first resource negotiation signaling to the adjacent second network node, wherein the first resource negotiation signaling carries first indication information for indicating time slot resources reserved by the first network node in P superframes.

In a second aspect, an embodiment of the present application provides a resource scheduling method, applied to a second network node, including:

Receiving a first resource negotiation signaling which is sent by an adjacent first network node and carries first indication information, wherein the first indication information indicates time slot resources reserved by the first network node for first cache data in P superframes, P is greater than or equal to 1 and less than or equal to Q, the P superframes are determined based on P reservation time advance, and the P reservation time advance is determined based on P business priorities corresponding to the first cache data;

in the exclusive signaling time slot of the ith superframe, determining M reserved time advance amounts according to M service priorities corresponding to the second cache data, wherein i is an integer from 1 to N, the nth superframe is the last superframe of reserved time slot resources, M is greater than or equal to 1 and less than or equal to Q, and Q is the total service priority number corresponding to the transmission data in the ad hoc network;

according to the M reservation time advance, M superframes after the ith superframe are determined;

determining time slot resources different from the time slot resources reserved by the first cache data in the M superframes and generating a time slot resource set;

Reserving time slot resources of the second cache data in the time slot resource set according to the M service priorities;

And sending a second resource negotiation signaling to an adjacent third network node, wherein the second resource negotiation signaling carries the first indication information and the second indication information, and the second indication information indicates the time slot resources reserved by the second network node in M superframes.

In a third aspect, an embodiment of the present application provides a network node, where the network node is a first network node, and the first network node includes a memory, a transceiver, and a processor;

the memory is used for storing a computer program; the transceiver is used for receiving and transmitting data under the control of the processor; the processor is configured to read the computer program in the memory and perform the following operations:

in the exclusive signaling time slot of the ith superframe, according to P service priorities corresponding to the first cache data, P reserved time advance amounts are determined, i is an integer from 1 to N, the nth superframe is the last superframe of reserved time slot resources, P is greater than or equal to 1 and less than or equal to Q, and Q is the total service priority number corresponding to the transmission data in the ad hoc network;

according to the P reservation time advance, P superframes after the ith superframe are determined;

Reserving time slot resources of the first cache data in the P superframes according to the P service priorities, wherein each service priority is matched with one superframe, and the higher the service priority is, the later the superframe position is;

And controlling the transceiver to send a first resource negotiation signaling to the adjacent second network node, wherein the first resource negotiation signaling carries first indication information for indicating time slot resources reserved by the first network node in P superframes.

In a fourth aspect, an embodiment of the present application provides a network node, where the network node is a second network node, and the second network node includes a memory, a transceiver, and a processor;

the memory is used for storing a computer program; the transceiver is used for receiving and transmitting data under the control of the processor; the processor is configured to read the computer program in the memory and perform the following operations:

controlling the transceiver to receive a first resource negotiation signaling carrying first indication information sent by an adjacent first network node, wherein the first indication information indicates time slot resources reserved by the first network node for first cache data in P superframes, P is greater than or equal to 1 and less than or equal to Q, the P superframes are determined based on P reservation time advance, and the P reservation time advance is determined based on P service priorities corresponding to the first cache data;

in the exclusive signaling time slot of the ith superframe, determining M reserved time advance amounts according to M service priorities corresponding to the second cache data, wherein i is an integer from 1 to N, the nth superframe is the last superframe of reserved time slot resources, M is greater than or equal to 1 and less than or equal to Q, and Q is the total service priority number corresponding to the transmission data in the ad hoc network;

according to the M reservation time advance, M superframes after the ith superframe are determined;

determining time slot resources different from the time slot resources reserved by the first cache data in the M superframes and generating a time slot resource set;

Reserving time slot resources of the second cache data in the time slot resource set according to the M service priorities;

And controlling the transceiver to send a second resource negotiation signaling to an adjacent third network node, wherein the second resource negotiation signaling carries the first indication information and the second indication information, and the second indication information indicates the time slot resources reserved by the second network node in M superframes.

In a fifth aspect, an embodiment of the present application provides a resource scheduling device, applied to a first network node, including:

The first determining module is used for determining P reserved time advance amounts in the exclusive signaling time slot of the ith superframe according to P service priorities corresponding to the first cache data, wherein i is an integer from 1 to N, the nth superframe is the last superframe of reserved time slot resources, P is greater than or equal to 1 and less than or equal to Q, and Q is the total service priority number corresponding to the transmission data in the ad hoc network;

the second determining module is used for determining P superframes after the ith superframe according to the P reservation time advance;

The first reservation module is used for reserving time slot resources of the first cache data in the P superframes according to the P service priorities, wherein each service priority is matched with one superframe, and the higher the service priority is, the later the superframe position is;

and the first sending module is used for sending a first resource negotiation signaling to the adjacent second network node, wherein the first resource negotiation signaling carries first indication information for indicating the time slot resources reserved by the first network node in P superframes.

In a sixth aspect, an embodiment of the present application provides a resource scheduling device, applied to a second network node, including:

The receiving module is used for receiving a first resource negotiation signaling which is sent by an adjacent first network node and carries first indication information, wherein the first indication information indicates time slot resources reserved by the first network node for first cache data in P superframes, P is greater than or equal to 1 and less than or equal to Q, the P superframes are determined based on P reservation time advance, and the P reservation time advance is determined based on P service priorities corresponding to the first cache data;

The third determining module is configured to determine, in an exclusive signaling time slot of an ith superframe, M reserved time advance amounts according to M service priorities corresponding to the second buffered data, i is an integer from 1 to N, the nth superframe is a last superframe of reserved time slot resources, M is greater than or equal to 1 and less than or equal to Q, and Q is a total number of service priorities corresponding to transmission data in the ad hoc network;

a fourth determining module, configured to determine M superframes after the ith superframe according to the M reserved time advances;

The determining and generating module is used for determining time slot resources different from the time slot resources reserved by the first cache data in the M superframes and generating a time slot resource set;

the second reservation module is used for reserving time slot resources of the second cache data in the time slot resource set according to the M service priorities;

and the second sending module is used for sending a second resource negotiation signaling to the adjacent third network node, wherein the second resource negotiation signaling carries the first indication information and the second indication information, and the second indication information indicates the time slot resources reserved by the second network node in M superframes.

In a seventh aspect, an embodiment of the present application provides a processor-readable storage medium, where a computer program is stored, where the computer program is configured to cause the processor to execute the resource scheduling method according to the first aspect or the second aspect.

In the embodiment of the application, when the exclusive signaling time slot of the superframe arrives, P business priorities corresponding to the first cached data of the current cache are acquired, P reservation time advance numbers are determined based on the P business priorities, P superframes after the current superframe are determined based on the P reservation time advance numbers, in the P superframes, according to the principle that each business priority matches one superframe, the reservation time advance numbers of the data corresponding to the high business priority are large and the time slot resources are occupied preferentially, the time slot resources of the first cached data are reserved, the conflict probability of resource application can be effectively reduced through the division of the business priorities, the complex resource preemption process is avoided, the resource priority state is not required to be marked in the signaling negotiation process, the signaling cost is reduced, and the data with different business priorities can occupy all the time slot resources in an iterated manner along with the continuous advancing of the scheduling period, so that the network resources can be fully used, and the resource utilization rate is high.

Drawings

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

Fig. 1 is a schematic diagram of a prior art USAP protocol-based on-demand application of time slot resources in a superframe;

Fig. 2 is a schematic diagram of a resource scheduling method applied to a first network node according to an embodiment of the present application;

FIG. 3 is a schematic diagram showing a process for implementing dynamic resource scheduling based on time iteration according to an embodiment of the present application;

Fig. 4 is a schematic diagram of a resource scheduling method applied to a second network node according to an embodiment of the present application;

Fig. 5 shows a schematic diagram of a resource scheduling apparatus applied to a first network node according to an embodiment of the present application;

fig. 6 is a schematic diagram of a resource scheduling device applied to a second network node according to an embodiment of the present application;

Fig. 7 shows a block diagram of a network node according to an embodiment of the application.

Detailed Description

In the embodiment of the application, the term "and/or" describes the association relation of the association objects, which means that three relations can exist, for example, a and/or B can be expressed as follows: a exists alone, A and B exist together, and B exists alone. The character "/" generally indicates that the context-dependent object is an "or" relationship.

The term "plurality" in embodiments of the present application means two or more, and other adjectives are similar.

The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments, but not all embodiments of the present application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.

According to the resource scheduling method provided by the embodiment of the application, the data in the ad hoc network are subjected to service priority division according to different service types, and the time-iteration-based dynamic resource scheduling mode enables the data with high service priority to apply for time slot resources in one step earlier than the data with low service priority, so that the time advance of time slot resource reservation is changed to control the sequence of resource scheduling, thereby better ensuring the QoS (quality of service) requirement of the data with high service priority, effectively reducing resource conflict generated when a plurality of nodes apply for the same resource block at the same time, and reducing or avoiding complex resource preemption and resource renegotiation process after the conflict occurs.

The method and the device are based on the same application, and because the principles of solving the problems by the method and the device are similar, the implementation of the device and the method can be referred to each other, and the repetition is not repeated.

The following describes a resource scheduling method applied to a first network node according to an embodiment of the present application, as shown in fig. 2, where the method includes:

In step 201, in the dedicated signaling time slot of the ith superframe, according to P service priorities corresponding to the first buffered data, P reserved time advances are determined, i is an integer from 1 to N, the nth superframe is the last superframe of reserved time slot resources, P is greater than or equal to 1 and less than or equal to Q, and Q is the total number of service priorities corresponding to the transmission data in the ad hoc network.

The buffer of the first network node is buffered with data to be transmitted, when the exclusive signaling time slot of each superframe arrives, the first network node applies for time slot resources, and the buffered data is transmitted after applying for the time slot resources. And when applying for the time slot resources, the service priority corresponding to the cached data needs to be determined, the reservation time advance is determined based on the service priority, and then the matched super frame is determined, so that the time slot resources are applied for in the matched super frame.

The network node in the embodiment of the application is equipment for loading the ad hoc network waveform, is connected with a network with independent address and data transmission or reception function, and can be a workstation, a client, a network user or a personal computer, or can be equipment connected with a server, a printer and other networks.

In the exclusive signaling time slot of the i-th superframe, the first network node determines P service priorities corresponding to the first buffer data aiming at the first buffer data buffered in the buffer, wherein P is an integer greater than or equal to 1, and the value of P is smaller than or equal to Q. Q is the total number of service priorities corresponding to transmission data in the ad hoc network, and the service priorities are predetermined by an application layer, so that the total number of service priorities is a predetermined number. When the exclusive signaling time slot of the application time slot resource arrives, the first network node judges one or more service priorities corresponding to the first cached data currently cached, determines one or more reserved time advance according to the determined service priorities, and determines a matched superframe based on the one or more reserved time advance so as to apply for the resource.

Wherein, each business priority matches a reservation time advance, each reservation time advance matches a super frame position. i has a value of 1 to N, and in each dedicated signaling time slot from the 1 st superframe to the N th superframe, the first network node applies for resources for the buffered first buffered data.

And 202, determining P superframes after the ith superframe according to the P reservation time advance.

After determining P reserved time advances according to P service priorities corresponding to the first cache data, the first network node determines P superframes after the ith superframe based on the P reserved time advances to determine P superframe positions corresponding to the P reserved time advances. For example, if the value of i is 1, the first buffered data corresponds to 2 service priorities, such as service priority 1 and service priority 3, and service priority 1 is lower than service priority 3, after determining 2 reserved time advances (such as reserved time advance 1 and reserved time advance 3), a superframe matching with reserved time advance 1 may be determined, and a superframe matching with reserved time advance 3 may be determined, so as to determine 2 superframes corresponding to 2 reserved time advances.

Step 203, reserving time slot resources of the first buffer data in the P superframes according to the P service priorities, wherein each service priority matches with a superframe, and the higher the service priority, the later the superframe position is.

After P superframes after the ith superframe are determined based on the P reservation time advance, reserving time slot resources of the first cache data in the P superframes according to P service priorities corresponding to the first cache data, and applying for the time slot resources for the first cache data in the determined P superframes.

And when reserving time slot resources according to the P service priorities, determining corresponding superframes in the P superframes according to each service priority. The higher the service priority, the larger the corresponding reservation time advance, the more backward the superframe position (the farther the time distance from the current ith superframe), i.e., the higher the service priority, the more backward the superframe position, the farther the distance from the current ith superframe, the lower the service priority, the more forward the superframe position, and the closer the distance from the current ith superframe; the relationship between traffic priority and superframe location can be understood as a negative correlation of both (the higher the priority the later).

For example, according to the 2 reserved time advance, the (i+1) th superframe and the (i+2) th superframe after the (i) th superframe are determined, the service priority 1 is lower than the service priority 2, the service priority 1 is matched with the (i+1) th superframe, the service priority 2 is matched with the (i+2) th superframe, the time slot resource in the (i+1) th superframe is reserved according to the service priority 1, the time slot resource in the (i+1) th superframe is associated with the buffer data corresponding to the service priority 1, the time slot resource in the (i+2) th superframe is reserved according to the service priority 2, and the time slot resource in the (i+2) th superframe is associated with the buffer data corresponding to the service priority 2.

Step 204, a first resource negotiation signaling is sent to an adjacent second network node, where the first resource negotiation signaling carries first indication information indicating timeslot resources reserved by the first network node in P superframes.

And in the P superframes, after reserving the time slot resources of the first cache data according to the P service priorities, generating first indication information for indicating the time slot resources reserved by the first network node in the P superframes, and sending a first resource negotiation signaling carrying the first indication information to a second network node adjacent to the first network node, so that the second network node knows the time slot resource reservation condition of the first network node in the P superframes based on the first indication information carried by the first resource negotiation signaling.

The number of the second network nodes adjacent to the first network node is one or more, and the first network node sends first resource negotiation signaling carrying first indication information to each adjacent second network node. The number of second network nodes is determined based on the form of the connection between the network nodes. By way of example, the network nodes are connected linearly, and the number of second network nodes adjacent to the first network node is one or two; the network node 1 is connected to a plurality of network nodes at the same time and is located at the center of an area formed by the plurality of network nodes, and the number of network nodes adjacent to the network node 1 is a plurality.

The first network node sends the first resource negotiation signaling to the adjacent second network node, so that the second network node can know the time slot resource reservation condition of the first network node, and the situation that the same time slot resource is applied to cause resource application conflict of the adjacent network node is avoided.

And because the embodiment of the application determines the matched reservation time advance based on the service priority, when the resource negotiation signaling is sent, the service priority state carried on each time slot resource block in the superframe does not need to be marked in the resource negotiation signaling, thereby reducing signaling overhead.

According to the embodiment of the application, when the exclusive signaling time slot of the super frame arrives, P business priorities corresponding to the first cached data of the current cache are obtained, P reservation time advance numbers are determined based on the P business priorities, P super frames after the current super frame are determined based on the P reservation time advance numbers, in the P super frames, according to the principle that each business priority is matched with one super frame, the reservation time advance numbers of the data corresponding to the high business priority are large and the time slot resources are occupied preferentially, the time slot resources of the first cached data are reserved, the conflict probability of resource application can be effectively reduced through the division of the business priorities, the complex resource preemption process is avoided, the resource priority state is not required to be marked in the signaling negotiation process, the signaling cost is reduced, and the data with different business priorities can occupy all the time slot resources in an iterated mode along with the continuous advancing of the scheduling period, so that the network resources can be fully used, and the resource utilization rate is high.

The following describes a process of determining P reserved time advances corresponding to the first buffered data by the first network node. The determining P reserved time advance according to the P service priorities corresponding to the first cache data includes:

obtaining K service types corresponding to the first cache data, determining P service priorities corresponding to the K service types, wherein K is greater than or equal to 1, and the value of P is less than or equal to K;

Based on the association relation between the service priorities and the reserved time advances, determining P reserved time advances corresponding to the P service priorities;

Wherein each service priority is associated with a reserved time advance, and the service priority is positively correlated with the reserved time advance.

In a dedicated signaling time slot of an i-th superframe, a first network node acquires K service types corresponding to first buffer data aiming at the first buffer data buffered in the buffer, determines P service priorities corresponding to the first buffer data based on the K service types corresponding to the first buffer data, and then determines reservation time advance corresponding to the P service priorities based on an association relation between the service priorities and the reservation time advance. The service priority is positively correlated with the reservation time advance, each service priority is correlated with a reservation time advance, the higher the service priority is, the larger the corresponding reservation time advance is, and correspondingly, the later the superframe is.

In the embodiment of the application, the number P of service priorities determined based on K service types corresponding to the first cache data is smaller than or equal to K, when the value of K is equal to P, each service type corresponds to a service priority, and when the value of K is greater than P, at least two service types correspond to the same service priority. For example, the first buffer data corresponds to 3 service types, each service type corresponding to a service priority; or the first cache data corresponds to 3 service types, namely a service type 1, a service type 2 and a service type 3, wherein the service type 1 and the service type 2 correspond to the service priority 1, and the service type 3 corresponds to the service priority 2.

Optionally, the service types corresponding to the transmission data in the ad hoc network are divided into Q service priorities based on different QoS requirements, and each service priority corresponds to at least one service type; when determining the P service priorities corresponding to the K service types, the method comprises the following steps:

And determining P service priorities corresponding to the K service types of the first cache data according to the corresponding relation between the service priorities and the service types.

In the embodiment of the application, the service priority is predetermined by the application layer, and the application layer can divide the service types corresponding to the transmission data in the ad hoc network into Q service priorities based on different QoS requirements, wherein each service priority corresponds to one or more service types.

By way of example, the transmission data includes voice data, formatted messages, short message data, file data, picture data, and video data, and the transmission data corresponds to a voice service type, formatted message service type, short message service type, file service type, picture service type, video service type. The data of voice service type and formatted message service type are sensitive to time delay, and the data packet is smaller, which corresponds to high service priority; the data of the short message service type and the video service type are sensitive to time delay, and the transmission rate is required to be high, which corresponds to the medium service priority; the data of the file service type and the picture service type are insensitive to time delay and transmission rate, and correspond to low service priority.

By establishing the corresponding relation between the service priority and the service type, the service priority to which the service type belongs can be determined based on the corresponding relation under the condition that the service type is known, so as to determine the matched reservation time advance based on the determined service priority.

After obtaining K service types corresponding to the first cache data, the first network node determines P service priorities corresponding to the K service types according to the corresponding relation between the service priorities and the service types, so as to obtain the P service priorities corresponding to the first cache data. Since a service priority corresponds to one or more service types, the value of K is greater than or equal to P.

After determining the P service priorities corresponding to the first cache data, determining a corresponding reservation time advance for each service priority, where the reservation time advance corresponding to the high service priority is large (the scheduling time advance is large), that is, the higher the service priority is, the time slot resource can be selected and occupied first; the reservation time advance corresponding to the low service priority is small (the scheduling time advance is small), only the time slot resource can be selected finally, and only the residual resource can be used.

According to the embodiment of the application, when the exclusive signaling time slot of the super frame arrives, K service types corresponding to the first cached data of the current cache are acquired, P service priorities corresponding to the first cached data are determined based on the corresponding relation between the service priorities and the service types, P reservation time advance is determined based on the incidence relation between the service priorities and the reservation time advance, and then the super frame position for reserving time slot resources is determined, so that the super frame position corresponding to the cached data is determined based on different service types, time slot resources are applied at the matched super frame position, the situation that the data with different service priorities apply for the time slot resources at the same super frame is avoided, and the conflict probability of resource application is reduced.

The following describes a process of determining superframes based on the reserved time advances, where determining P superframes after the ith superframe according to the P reserved time advances includes:

taking the ith superframe as a reference superframe, and determining P superframes matched with the P reservation time advances according to the reference superframe and the P reservation time advances;

Wherein, each reservation time advance is associated with a super frame position, and the super frame position is more backward as the reservation time advance is larger.

After determining the P reserved time advances corresponding to the first buffered data, for the i-th superframe, P superframes matching the P reserved time advances may be determined based on the reference superframe and the P reserved time advances by taking the i-th superframe as the reference superframe.

Each reservation time advance is associated with a superframe position, and when the superframe position corresponding to the reservation time advance is determined for each reservation time advance in the P reservation time advances, the matched time is shifted backwards on the basis of a reference superframe to determine the superframe position associated with the current reservation time advance. The greater the reservation time advance, the farther the superframe position is, and the farther the determined superframe position is from the current superframe, the relationship between the reservation time advance and the superframe position can be understood as a positive correlation of the two (the greater the reservation time advance, the farther the position is).

As an example, the first buffer data corresponds to 4 service priorities, namely, service priority 1, service priority 2, service priority 3, and service priority 4, and the priorities of service priority 1, service priority 2, service priority 3, and service priority 4 are sequentially increased. Determining 4 reserved time advance amounts based on the 4 service priorities, taking the ith superframe as a reference superframe, and determining 4 superframes according to the reference superframe and the 4 reserved time advance amounts: the i+1th superframe, the i+2th superframe, the i+3th superframe, and the i+4th superframe, wherein the traffic priority 1 corresponds to the i+1th superframe, the traffic priority 2 corresponds to the i+2th superframe, the traffic priority 3 corresponds to the i+3th superframe, and the traffic priority 4 corresponds to the i+4th superframe.

The buffer data corresponding to the service priority 4 applies for time slot resources in the ith+4 superframe, the buffer data corresponding to the service priority 3 applies for time slot resources in the ith+3 superframe, the buffer data corresponding to the service priority 2 applies for time slot resources in the ith+2 superframe, and the buffer data corresponding to the service priority 1 applies for time slot resources in the ith+1 superframe; the remaining slot resources of the i+4 superframe, the remaining slot resources of the i+3 superframe, and the remaining slot resources of the i+2 superframe may be continuously occupied by the buffered data corresponding to the low traffic priority.

As another example, the transmission data in the ad hoc network corresponds to 4 service priorities, which are respectively a service priority 1, a service priority 2, a service priority 3, and a service priority 4, and the priorities of the service priority 1, the service priority 2, the service priority 3, and the service priority 4 are sequentially increased. The first buffer data corresponds to 2 service priorities, namely service priority 1 and service priority 3. 2 reservation time advance amounts are determined based on the 2 service priorities, an i-th superframe is taken as a reference superframe, and 2 superframes are determined according to the reference superframe and the 2 reservation time advance amounts: the i+1st superframe and the i+3st superframe, the traffic priority 1 corresponds to the i+1st superframe and the traffic priority 3 corresponds to the i+3st superframe. The buffer data corresponding to the service priority 3 applies for time slot resources in the i+3 super frame, and the buffer data corresponding to the service priority 1 applies for time slot resources in the i+1 super frame.

According to the implementation process, after the P reservation time advance corresponding to the first cache data is determined, the current superframe is used as a reference superframe, and the superframe matched with the reservation time advance is shifted backwards to determine the associated superframe based on the reservation time advance.

As an optional embodiment, reserving the timeslot resources of the first buffered data in the P superframes according to the P service priorities includes:

Determining a superframe matched with the service priority according to each service priority;

Reserving time slot resources for the cache data corresponding to the service priority in the first cache data in the matched superframe;

and reserving the time slot resources in the same super frame in sequence according to the order of the service priority from high to low.

After P superframes after the i-th superframe are determined, when the time slot resources of the first cache data are reserved according to the P service priorities in the P superframes, a superframe matched with the service priorities can be determined for each service priority, the time slot resources are reserved for the cache data corresponding to the service priorities in the determined matched superframes, the superframes matched with the cache data are determined, and the time slot resources are applied for the cache data in the matched superframes. The first network node can reserve time slot resources for the cache data with different service priorities at the same time, or reserve time slot resources for the cache data with different service priorities in sequence according to the priority order.

In the same superframe (superframe for providing time slot resources and reserving time slot resources for cache data), the time slot resources are preferentially selected by the cache data with highest service priority, after the time slot resources are selected by the cache data with highest service priority, the time slot resources are selected in the rest time slot resources by the cache data with second service priority, and so on, according to the sequence from high service priority to low service priority, the cache data with different service priorities reserve unoccupied time slot resources in the same superframe in sequence, after the time slot resources are reserved by the cache data with high service priority, the time slot resources are reserved in the rest resources by the cache data with low service priority, so that the full scheduling of resources in a network is ensured, and the condition of resource waste is avoided or reduced.

For example, the first buffer data corresponds to 5 service priorities, namely, service priority 1, service priority 2, service priority 3, service priority 4 and service priority 5, and the priority orders corresponding to the service priority 1, service priority 2, service priority 3, service priority 4 and service priority 5 are sequentially increased.

When the ith superframe is scheduled, the buffered data corresponding to service priority 5 (highest service priority) corresponds to the ith+5 superframe, the buffered data corresponding to service priority 4 corresponds to the ith+4 superframe, the buffered data corresponding to service priority 3 corresponds to the ith+3 superframe, the buffered data corresponding to service priority 2 corresponds to the ith+2 superframe, and the buffered data corresponding to service priority 1 corresponds to the ith+1 superframe.

When the i+1th superframe is scheduled, the buffer data corresponding to the service priority 5 corresponds to the i+6th superframe, the buffer data corresponding to the service priority 4 corresponds to the i+5th superframe, the buffer data corresponding to the service priority 3 corresponds to the i+4th superframe, the buffer data corresponding to the service priority 2 corresponds to the i+3rd superframe, and the buffer data corresponding to the service priority 1 corresponds to the i+2th superframe. All time slot resources in the i+6th super frame are not allocated, so that the buffer data corresponding to the service priority 5 can be allocated partially or completely as required. The time slot resources in the i+5 superframe are already occupied by the buffer data corresponding to the service priority 5 when the i superframe is scheduled, so the buffer data corresponding to the service priority 4 can only apply for the remaining resources in the i+5 superframe. The time slot resources in the i+4th superframe are already occupied by the buffer data corresponding to the service priority 4 when the i superframe is scheduled, so the buffer data corresponding to the service priority 3 can only apply for the remaining resources in the i+4th superframe. The time slot resources in the i+3 superframe are already occupied by the buffer data corresponding to the service priority 3 when the i superframe is scheduled, so that the buffer data corresponding to the service priority 2 can only apply for the remaining resources in the i+3 superframe. The time slot resources in the i+2 superframe are already occupied by the buffer data corresponding to the service priority 2 when the i superframe is scheduled, so that the buffer data corresponding to the service priority 1 can only apply for the remaining resources in the i+2 superframe.

When the i+2 superframe is scheduled, the buffer data corresponding to the service priority 5 corresponds to the i+7 superframe, the buffer data corresponding to the service priority 4 corresponds to the i+6 superframe, the buffer data corresponding to the service priority 3 corresponds to the i+5 superframe, the buffer data corresponding to the service priority 2 corresponds to the i+4 superframe, and the buffer data corresponding to the service priority 1 corresponds to the i+3 superframe. All time slot resources in the i+7th super frame are not allocated, so that the buffer data corresponding to the service priority 5 can be allocated partially or completely as required. The time slot resources in the i+6th superframe are already occupied by the buffer data corresponding to the service priority 5 when the i+1th superframe is scheduled, so the buffer data corresponding to the service priority 4 can only apply for the residual resources in the i+6th superframe. The time slot resources in the i+5 superframe are occupied by the buffer data corresponding to the service priority 5 when the i superframe is scheduled and occupied by the buffer data corresponding to the service priority 4 when the i+1 superframe is scheduled, so that the buffer data corresponding to the service priority 3 can only apply for the residual resources in the i+5 superframe. The time slot resources in the i+4 superframe are occupied by the buffer data corresponding to the service priority 4 when the i superframe is scheduled and occupied by the buffer data corresponding to the service priority 3 when the i+1 superframe is scheduled, so that the buffer data corresponding to the service priority 2 can only apply for the residual resources in the i+4 superframe. The time slot resources in the i+3 superframe are occupied by the buffer data corresponding to the service priority 3 when the i superframe is scheduled and occupied by the buffer data corresponding to the service priority 2 when the i+1 superframe is scheduled, so that the buffer data corresponding to the service priority 1 can only apply for the residual resources in the i+3 superframe.

And by analogy, repeatedly executing the resource allocation process on the basis of time iteration until the operation is finished, and repeatedly iterating the whole dynamic scheduling process according to the scheduling time. For time slot resources in the same superframe, the first round of application is always guaranteed to be finished by the cached data with the highest service priority; if the rest idle resources exist, completing the next round of application by the cached data of the service priority level; and if the residual idle resources still exist, carrying out third round of application by the cached data with lower service priority. With the time transition of the dispatching cycle position, the buffer data of different service priorities have opportunities to dispatch the time slot resources in the same super frame, thereby ensuring the full dispatching of all resources in the network and avoiding or reducing the condition of resource waste.

As an optional embodiment, if the value of Q is 3, when the first buffered data in the dedicated signaling time slot of the G superframe corresponds to three service priorities, the first network node determines the g+1st superframe, the g+2nd superframe and the g+3rd superframe after the G superframe, and reserves the time slot resource of the first buffered data in 3 consecutive superframes;

The G super frame is one super frame of N super frames, the time slot resource is reserved for the buffer data corresponding to the third service priority in the G+3 super frame, the time slot resource is reserved for the buffer data corresponding to the second service priority in the G+2 super frame, and the time slot resource is reserved for the buffer data corresponding to the first service priority in the G+1 super frame; the priority orders corresponding to the first service priority, the second service priority and the third service priority are sequentially increased.

Under the condition that the transmission data in the ad hoc network corresponds to 3 service priorities and the first buffer data in the dedicated signaling time slot of the G-th superframe of the N superframes corresponds to three service priorities, the first buffer data in the dedicated signaling time slot of the G-th superframe corresponds to all the predetermined service priorities, the three service priorities corresponding to the first buffer data are continuous service priorities, including a first service priority, a second service priority and a third service priority, and the priority orders corresponding to the first service priority, the second service priority and the third service priority are sequentially increased.

After determining that the first buffer data in the dedicated signaling time slot of the G superframe corresponds to three service priorities, the first network node determines 3 reserved time advances, and determines 3 superframes after the G superframe based on the 3 reserved time advances: the g+3 superframe, the g+2 superframe, and the g+1 superframe. Because the third service priority is the highest service priority in the 3 service priorities, the first network node reserves time slot resources for the cache data corresponding to the third service priority in the G+3rd super frame; because the second service priority is the medium service priority in the 3 service priorities, the first network node reserves time slot resources for the cache data corresponding to the second service priority in the G+2 super frame; because the first service priority is the lowest service priority in the 3 service priorities, the first network node reserves time slot resources for the buffer data corresponding to the first service priority in the G+1th superframe.

Optionally, in the case that the first buffered data in the dedicated signaling time slot of the g+1st superframe corresponds to three service priorities, the first network node determines a g+2st superframe, a g+3rd superframe and a g+4th superframe after the g+1st superframe, and reserves a time slot resource of the first buffered data in 3 consecutive superframes;

the first network node reserves time slot resources for the buffer data corresponding to the third service priority in a G+4 superframe, reserves unoccupied time slot resources for the buffer data corresponding to the second service priority in a G+3 superframe, and reserves unoccupied time slot resources for the buffer data corresponding to the first service priority in a G+2 superframe.

The G+1th superframe is any superframe of N superframes, and the value of G is smaller than or equal to N-1. After determining that the first buffer data in the dedicated signaling time slot of the g+1th superframe corresponds to three service priorities, the first network node determines 3 reserved time advances, and determines 3 superframes after the g+1th superframe based on the 3 reserved time advances: the g+4 superframe, the g+3 superframe, and the g+2 superframe. All time slot resources in the G+4 superframe are not allocated, and the first network node reserves time slot resources for the buffer data corresponding to the third service priority (highest service priority) in the G+4 superframe; the time slot resources in the G+3 superframe are occupied by the buffer data corresponding to the third service priority when the G superframe is scheduled, so that the first network node reserves unoccupied time slot resources for the buffer data corresponding to the second service priority (medium service priority) in the G+3 superframe; the time slot resources in the g+2 superframe are occupied by the buffer data corresponding to the second service priority when the G superframe is scheduled, so that the first network node reserves unoccupied time slot resources for the buffer data corresponding to the first service priority (lowest service priority) in the g+2 superframe.

Optionally, in the case that the first buffered data in the dedicated signaling time slot of the g+2 superframe corresponds to three service priorities, the first network node determines a g+3 superframe, a g+4 superframe and a g+5 superframe after the g+2 superframe, and reserves a time slot resource of the first buffered data in3 consecutive superframes;

The first network node reserves time slot resources for the buffer data corresponding to the third service priority in a G+5 superframe, reserves unoccupied time slot resources for the buffer data corresponding to the second service priority in a G+4 superframe, and reserves unoccupied time slot resources for the buffer data corresponding to the first service priority in a G+3 superframe.

After determining that the first buffer data in the dedicated signaling time slot of the g+2th superframe corresponds to three service priorities, the first network node determines 3 reserved time advances, and determines 3 superframes after the g+2th superframe based on the 3 reserved time advances: the g+5 superframe, the g+4 superframe, and the g+3 superframe. All time slot resources in the G+5 superframe are not allocated, and the first network node reserves time slot resources for the buffer data corresponding to the third service priority (highest service priority) in the G+5 superframe; the time slot resources in the G+4 superframe are already occupied by the buffer data corresponding to the third service priority when the G+1 superframe is scheduled, so that the first network node reserves unoccupied time slot resources for the buffer data corresponding to the second service priority (medium service priority) in the G+4 superframe; the time slot resources in the g+3 superframe are already occupied by the buffer data corresponding to the third service priority when the G superframe is scheduled and occupied by the buffer data corresponding to the second service priority when the g+1 superframe is scheduled, so that the first network node reserves unoccupied time slot resources for the buffer data corresponding to the first service priority (lowest service priority) in the g+3 superframe.

The following describes a dynamic resource scheduling process based on time iteration, taking 3 service priorities corresponding to transmission data in an ad hoc network as an example, as shown in fig. 3:

In the 1 st super frame, all network nodes are first time slot resources, the reservation time advance corresponding to the cache data corresponding to the high service priority in the network nodes is 3 super frames, the reservation time advance corresponding to the cache data corresponding to the medium service priority in the network nodes is 2 super frames, the reservation time advance corresponding to the cache data corresponding to the low service priority in the network nodes is 1 super frame, the cache data corresponding to the high service priority in the network nodes reserves resources in the super frame 4, the cache data corresponding to the medium service priority in the network nodes reserves resources in the super frame 3, and the cache data corresponding to the low service priority in the network nodes reserves resources in the super frame 2.

In the 2 nd super frame, each network node continues to reserve time slot resources according to the service priority of the local cache data, the cache data with high service priority reserves resources in the super frame 5, the cache data with medium service priority reserves residual resources after the cache data with high service priority is distributed in the super frame 4, and the cache data with low service priority reserves residual resources after the cache data with medium service priority is distributed in the super frame 3. In fig. 3, there are also spare resources left after the low traffic priority buffered data is allocated, indicating that the network traffic is small at this time.

In the 3 rd super frame, each network node continues to reserve time slot resources according to the service priority of the local cache data, and the cache data with high service priority reserves resources in the super frame 6, in fig. 3, the time slot resources in the super frame 6 are occupied by the cache data with high service priority, which indicates that no available resources exist in the cache data with medium service priority in the following 4 th super frame scheduling period. In fig. 3, since the resources in the superframe 5 are occupied by the buffered data with the middle service priority, no available resources of the buffered data with the low service priority exist in two subsequent superframe scheduling periods, indicating that the current instantaneous traffic has exceeded the throughput capability of the network. The buffer data with low service priority reserves the residual resources after the buffer data with high service priority and medium service priority are distributed in the super frame 4. In fig. 3, after the allocation of the low-service-priority buffer data is completed, the network has no remaining idle resources, which indicates that the resource utilization rate reaches 100%.

The dynamic resource is iteratively scheduled according to the process until the dynamic resource is finished.

In the above example, the transmission data in the ad hoc network is divided into three service priorities, namely, high, medium and low, and the dynamic resource scheduling mode based on time iteration is adopted, so that the cache data with high service priority applies for resources in one step earlier in time than the cache data with medium service priority, and the cache data with medium service priority applies for resources in one step earlier in time than the cache data with low service priority. Namely, the scheduling sequence of the resources is controlled by changing the time advance of the resource reservation, so that the QoS requirement of the cache data with high service priority is better ensured, the resource conflict generated when a plurality of nodes apply for the same resource block at the same time is effectively reduced, and the complex resource preemption and resource renegotiation process after the conflict occurs is reduced or avoided.

The above introduces the resource scheduling process of the first network node, when the dedicated signaling time slot of the superframe arrives, P service priorities corresponding to the first cached data of the current cache are obtained, P reserved time advance numbers are determined based on the P service priorities, P superframes after the current superframe are determined based on the P reserved time advance numbers, in the P superframes, according to the principle that each service priority matches a superframe, the reserved time advance numbers of the data corresponding to the high service priority are large and the time slot resources are occupied preferentially, the time slot resources of the first cached data are reserved, the conflict probability of the resource application can be effectively reduced through the division of the service priorities, the complex resource preemption process is avoided, the signaling negotiation process does not need to mark the priority state of the resources, the signaling overhead is reduced, and the data of different service priorities can occupy all the time slot resources iteratively along with the continuous progress of the scheduling period, so that the network resources can be fully used, and the resource utilization rate is high.

The resource scheduling procedure of the second network node is described below, and as shown in fig. 4, includes:

Step 401, receiving a first resource negotiation signaling carrying first indication information sent by an adjacent first network node, where the first indication information indicates a timeslot resource reserved by the first network node for first cache data in P superframes, P is greater than or equal to 1 and less than or equal to Q, the P superframes are determined based on P reserved time advance, and the P reserved time advance is determined based on P service priorities corresponding to the first cache data.

The second network node is used as an adjacent network node of the first network node, receives a first resource negotiation signaling carrying first indication information sent by the first network node, and can know the time slot resource reservation condition of the first network node in P superframes based on the first indication information because the first indication information indicates the time slot resource reserved by the first network node for the cached data in the P superframes. The second network node is used as an adjacent node of the first network node, and after the time slot resource reservation condition of the first network node is acquired, the time slot resource reservation is carried out based on the time slot resource reservation condition of the first network node so as to avoid resource application conflict of the adjacent network node due to the application of the same time slot resource.

Because the embodiment of the application determines the matched reservation time advance based on the service priority and determines the corresponding superframe position based on the reservation time advance, the first network node does not need to mark the service priority state carried on each time slot resource block in the superframe in the first resource negotiation signaling when sending the first resource negotiation signaling, thereby reducing signaling overhead.

For the first network node, the first cached data corresponds to P service priorities, P reservation time advance amounts are determined based on the P service priorities, and P superframes are determined according to the P reservation time advance amounts, so that time slot resources are reserved for the cached data with different service priorities in the determined P superframes.

Step 402, in the dedicated signaling time slot of the ith superframe, determining M reserved time advance amounts according to M service priorities corresponding to the second buffered data, where i is an integer from 1 to N, the nth superframe is the last superframe of reserved time slot resources, M is greater than or equal to 1 and less than or equal to Q, and Q is the total number of service priorities corresponding to the transmission data in the ad hoc network.

The buffer of the second network node is buffered with data to be transmitted, when the exclusive signaling time slot of each superframe arrives, the second network node applies for time slot resources, and the buffered data is transmitted after applying for the time slot resources. And when applying for the time slot resources, determining the service priority corresponding to the cached second cached data, determining the reservation time advance based on the service priority, and further determining the matched superframe to apply for the time slot resources in the matched superframe.

In the exclusive signaling time slot of the i-th superframe, the second network node determines M service priorities corresponding to the second buffer data according to the second buffer data buffered in the buffer, M is an integer greater than or equal to 1, and the value of M is smaller than or equal to Q. Q is the total number of service priorities corresponding to transmission data in the ad hoc network, and the service priorities are predetermined by an application layer, so that the total number of service priorities is a predetermined number. When the exclusive signaling time slot of the application time slot resource arrives, the second network node judges one or more service priorities corresponding to the second cached data currently cached, determines one or more reservation time advance according to the determined service priorities, and determines a matched superframe based on the one or more reservation time advance to apply for the resource.

Wherein, each business priority matches a reservation time advance, each reservation time advance matches a super frame position. i has a value of 1 to N, and in each dedicated signaling time slot from the 1 st superframe to the N th superframe, the second network node applies for resources for the buffered second buffered data.

And step 403, determining M superframes after the ith superframe according to the M reservation time advance.

And the second network node determines M superframes after the ith superframe based on the M reserved time advances after determining the M reserved time advances according to the M service priorities corresponding to the second cache data so as to determine M superframe positions corresponding to the M reserved time advances.

Step 404, determining a time slot resource different from the time slot resource reserved by the first buffer data in the M superframes, and generating a time slot resource set.

The second network node determines, after determining M superframes after the ith superframe based on the M reservation time advances, a slot resource different from a slot resource reserved by the first buffered data within the M superframes, and generates a slot resource set based on the determined slot resource. Because the second network node is a neighboring network node of the first network node, the second network node does not apply for the time slot resources reserved by the first network node, so after determining M superframes, the second network node needs to filter the time slot resources reserved by the first network node based on the time slot resource reservation condition of the first network node in the M superframes, and determine the time slot resource set corresponding to the second network node.

The first buffer data is buffer data corresponding to the first network node, specifically, buffer data corresponding to the first network node in a dedicated signaling time slot of the i-th superframe. The second network node obtains the time slot resource reservation condition of the first network node in each super frame, so that the resource application conflict of the adjacent network nodes caused by applying the same time slot resource to the cached data with the same service priority can be avoided.

And 405, reserving time slot resources of the second cache data in the time slot resource set according to the M service priorities.

After determining the corresponding time slot resource set, the second network node reserves time slot resources of the second cache data according to M service priorities, and applies for the time slot resources for the second cache data based on the remaining time slot resources in the determined M superframes.

When reserving time slot resources according to M service priorities, a corresponding superframe is determined within M superframes for each service priority. The higher the service priority, the larger the corresponding reservation time advance, the more backward the superframe is located (the farther the time distance from the current ith superframe is), i.e., the higher the service priority, the more backward the superframe is located, the farther the distance from the current ith superframe is located, the lower the service priority, the more forward the superframe is located, and the closer the current ith superframe is located.

After determining a corresponding superframe in M superframes for a service priority, reserving time slot resources for cached data corresponding to the service priority in the remaining time slot resources (the time slot resources remaining after the time slot resources reserved by the current superframe are filtered by the first network node) of the current superframe, so as to reserve the time slot resources in the time slot resource set.

Step 406, sending a second resource negotiation signaling to a third network node, where the second resource negotiation signaling carries the first indication information and the second indication information, and the second indication information indicates a timeslot resource reserved by the second network node in M superframes.

And in M superframes, after reserving time slot resources of the second cache data according to the M service priorities, generating second indication information for indicating the time slot resources reserved by the second network node in the M superframes, and sending a second resource negotiation signaling carrying the first indication information and the second indication information to a third network node adjacent to the second network node, so that the third network node knows the time slot resource reservation condition of the first network node in P superframes based on the first indication information carried by the second resource negotiation signaling, and knows the time slot resource reservation condition of the second network node in M superframes based on the second indication information carried by the second resource negotiation signaling.

The third network node is used as a neighboring network node of the second network node, so that the time slot resources reserved by the second network node cannot be applied, and resource application conflicts of the neighboring network nodes are avoided; the third network node and the first network node are non-adjacent network nodes, and may apply for the time slot resources reserved by the first network node, that is, the resource application conflict may not occur between adjacent network nodes.

It should be noted that, the process of determining M service priorities by the second network node, determining M reserved time advances based on the M service priorities, and determining M superframes based on the M reserved time advances is similar to the execution process of the first network node, which is not further described herein. Accordingly, the second network node follows the same principle when reserving the time slot resources of the second cache data based on the service priority, in the same superframe (the superframe for providing the time slot resources and reserving the time slot resources for the cache data), the time slot resources are preferentially selected by the cache data with the highest service priority, after the time slot resources are selected by the cache data with the highest service priority, the time slot resources are selected by the cache data with the highest service priority in the rest time slot resources, and so on, according to the sequence from high service priority to low service priority, the cache data with different service priorities reserve unoccupied time slot resources in sequence in the same superframe, and after the time slot resources are reserved by the cache data with the high service priority, the time slot resources are reserved in the rest resources by the cache data with the low service priority, so that the sufficient scheduling of resources in the network is ensured, and the condition of resource waste is avoided or reduced.

The above is a resource scheduling process of the second network node provided in the embodiment of the present application, where the second network node receives a first resource negotiation signaling sent by an adjacent first network node, and knows a time slot resource reservation condition of the first network node in P superframes according to first indication information carried by the first resource negotiation signaling; when the exclusive signaling time slot of the super frame arrives, the second network node acquires M service priorities corresponding to the second cached data of the current cache, determines M reserved time advance based on the M service priorities, determines M super frames after the current super frame based on the M reserved time advance, and in the M super frames, according to the principle that the reserved time advance of data corresponding to each service priority matched with one super frame and high service priority is large and the time slot resource is occupied preferentially, reserving the time slot resource of the second cached data in the occupiable time slot resource, avoiding the resource application conflict of adjacent network nodes, effectively reducing the conflict probability of resource application, avoiding the complex resource preemption process by dividing the service priority, avoiding marking the state of the resource priority in the signaling negotiation process, reducing signaling overhead, and along with the continuous promotion of the scheduling period, the data of different service priorities can occupy all time slot resources iteratively, so that the network resource can be fully used, and the resource utilization rate is high.

Having described the resource scheduling method provided by the embodiment of the present application, the resource scheduling device provided by the embodiment of the present application will be described below with reference to the accompanying drawings.

Referring to fig. 5, an embodiment of the present application provides a resource scheduling device, which is applied to a first network node, including:

A first determining module 501, configured to determine P reserved time advance amounts according to P service priorities corresponding to the first buffered data in a dedicated signaling time slot of an ith superframe, where i is an integer from 1 to N, the nth superframe is a last superframe of reserved time slot resources, P is greater than or equal to 1 and less than or equal to Q, and Q is a total number of service priorities corresponding to transmission data in the ad hoc network;

A second determining module 502, configured to determine P superframes after the ith superframe according to the P reserved time advances;

A first reservation module 503, configured to reserve, within the P superframes, time slot resources of the first buffered data according to the P service priorities, where each service priority matches a superframe, and the higher the service priority, the later the superframe position is;

A first sending module 504, configured to send a first resource negotiation signaling to an adjacent second network node, where the first resource negotiation signaling carries first indication information indicating timeslot resources reserved by the first network node in P superframes.

Optionally, the first determining module includes:

The acquisition determining submodule is used for acquiring K service types corresponding to the first cache data, determining P service priorities corresponding to the K service types, wherein K is greater than or equal to 1, and the value of P is smaller than or equal to K;

The first determining submodule is used for determining P reserved time advance corresponding to the P service priorities based on the association relation between the service priorities and the reserved time advance;

Wherein each service priority is associated with a reserved time advance, and the service priority is positively correlated with the reserved time advance.

Optionally, the service types corresponding to the transmission data in the ad hoc network are divided into Q service priorities based on different QoS requirements, and each service priority corresponds to at least one service type;

the acquisition determination submodule is further to:

And determining P service priorities corresponding to the K service types of the first cache data according to the corresponding relation between the service priorities and the service types.

Optionally, the second determining module is further configured to:

taking the ith superframe as a reference superframe, and determining P superframes matched with the P reservation time advances according to the reference superframe and the P reservation time advances;

Wherein, each reservation time advance is associated with a super frame position, and the super frame position is more backward as the reservation time advance is larger.

Optionally, the first reservation module includes:

a second determining submodule, configured to determine, for each service priority, a superframe in which the service priorities match;

the reservation sub-module is used for reserving time slot resources for the cache data corresponding to the service priority in the first cache data in the matched super frame;

and reserving the time slot resources in the same super frame in sequence according to the order of the service priority from high to low.

Optionally, if the value of Q is 3, when the first buffered data in the dedicated signaling slot of the G-th superframe corresponds to three service priorities, the apparatus further includes:

the first reservation determining module is used for determining a G+1st superframe, a G+2nd superframe and a G+3rd superframe after the G superframe and reserving time slot resources of the first cache data in 3 continuous superframes;

The G super frame is one super frame of N super frames, the time slot resource is reserved for the buffer data corresponding to the third service priority in the G+3 super frame, the time slot resource is reserved for the buffer data corresponding to the second service priority in the G+2 super frame, and the time slot resource is reserved for the buffer data corresponding to the first service priority in the G+1 super frame; the priority orders corresponding to the first service priority, the second service priority and the third service priority are sequentially increased.

Optionally, in a case that the first buffered data in the dedicated signaling slot of the g+1th superframe corresponds to three traffic priorities, the apparatus further includes:

The second reservation determining module is used for determining a G+2 superframe, a G+3 superframe and a G+4 superframe after the G+1 superframe and reserving time slot resources of the first cache data in 3 continuous superframes;

And reserving time slot resources for the buffer data corresponding to the third service priority in a G+4 superframe, reserving unoccupied time slot resources for the buffer data corresponding to the second service priority in a G+3 superframe, and reserving unoccupied time slot resources for the buffer data corresponding to the first service priority in a G+2 superframe.

As shown in fig. 6, an embodiment of the present application provides a resource scheduling device, which is applied to a second network node, and includes:

A receiving module 601, configured to receive a first resource negotiation signaling sent by an adjacent first network node and carrying first indication information, where the first indication information indicates a timeslot resource reserved by the first network node for first cache data in P superframes, where P is greater than or equal to 1 and less than or equal to Q, the P superframes are determined based on P reserved time advance, and the P reserved time advance is determined based on P service priorities corresponding to the first cache data;

A third determining module 602, configured to determine, in an exclusive signaling time slot of an ith superframe, M reserved time advance amounts according to M service priorities corresponding to the second buffered data, where i is an integer from 1 to N, the nth superframe is a last superframe of reserved time slot resources, M is greater than or equal to 1 and less than or equal to Q, and Q is a total number of service priorities corresponding to transmission data in the ad hoc network;

A fourth determining module 603, configured to determine M superframes after the ith superframe according to the M reserved time advances;

A determining and generating module 604, configured to determine, within the M superframes, a time slot resource different from a time slot resource reserved by the first buffered data and generate a time slot resource set;

a second reservation module 605, configured to reserve, in the set of time slot resources, time slot resources of the second buffered data according to the M service priorities;

A second sending module 606, configured to send a second resource negotiation signaling to an adjacent third network node, where the second resource negotiation signaling carries the first indication information and second indication information, and the second indication information indicates a timeslot resource reserved by the second network node in M superframes.

It should be noted that, in the embodiment of the present application, the division of the units is schematic, which is merely a logic function division, and other division manners may be implemented in actual practice. In addition, each functional unit in the embodiments of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.

The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a processor-readable storage medium. Based on such understanding, the technical solution of the present application may be embodied in essence or a part contributing to the prior art or all or part of the technical solution in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.

It should be noted that, the above device provided in the embodiment of the present application can implement all the method steps implemented in the method embodiment and achieve the same technical effects, and detailed descriptions of the same parts and beneficial effects as those in the method embodiment in this embodiment are omitted.

The embodiment of the application also provides a network node, as shown in fig. 7, which comprises a memory 701, a transceiver 702 and a processor 703; a memory 701 for storing a computer program; a transceiver 702 for receiving and transmitting data under the control of the processor 703; when the network node is a first network node, a processor 703 is configured to read the computer program in the memory 701 and perform the following operations:

in the exclusive signaling time slot of the ith superframe, according to P service priorities corresponding to the first cache data, P reserved time advance amounts are determined, i is an integer from 1 to N, the nth superframe is the last superframe of reserved time slot resources, P is greater than or equal to 1 and less than or equal to Q, and Q is the total service priority number corresponding to the transmission data in the ad hoc network;

according to the P reservation time advance, P superframes after the ith superframe are determined;

Reserving time slot resources of the first cache data in the P superframes according to the P service priorities, wherein each service priority is matched with one superframe, and the higher the service priority is, the later the superframe position is;

The transceiver 702 is controlled to send a first resource negotiation signaling to an adjacent second network node, where the first resource negotiation signaling carries first indication information indicating timeslot resources reserved by the first network node in P superframes.

Optionally, the processor 703 is further configured to perform the following operations:

obtaining K service types corresponding to the first cache data, determining P service priorities corresponding to the K service types, wherein K is greater than or equal to 1, and the value of P is less than or equal to K;

Based on the association relation between the service priorities and the reserved time advances, determining P reserved time advances corresponding to the P service priorities;

Wherein each service priority is associated with a reserved time advance, and the service priority is positively correlated with the reserved time advance.

Optionally, the service types corresponding to the transmission data in the ad hoc network are divided into Q service priorities based on different QoS requirements, and each service priority corresponds to at least one service type; the processor 703 is further configured to perform the following operations:

And determining P service priorities corresponding to the K service types of the first cache data according to the corresponding relation between the service priorities and the service types.

Optionally, the processor 703 is further configured to perform the following operations:

taking the ith superframe as a reference superframe, and determining P superframes matched with the P reservation time advances according to the reference superframe and the P reservation time advances;

Wherein, each reservation time advance is associated with a super frame position, and the super frame position is more backward as the reservation time advance is larger.

Optionally, the processor 703 is further configured to perform the following operations:

Determining a superframe matched with the service priority according to each service priority;

Reserving time slot resources for the cache data corresponding to the service priority in the first cache data in the matched superframe;

and reserving the time slot resources in the same super frame in sequence according to the order of the service priority from high to low.

Optionally, if the value of Q is 3, when the first buffered data in the dedicated signaling slot of the G-th superframe corresponds to three service priorities, the processor 703 is further configured to: determining the G+1st superframe, the G+2nd superframe and the G+3rd superframe after the G superframe, and reserving time slot resources of the first cache data in 3 continuous superframes;

The G super frame is one super frame of N super frames, the time slot resource is reserved for the buffer data corresponding to the third service priority in the G+3 super frame, the time slot resource is reserved for the buffer data corresponding to the second service priority in the G+2 super frame, and the time slot resource is reserved for the buffer data corresponding to the first service priority in the G+1 super frame; the priority orders corresponding to the first service priority, the second service priority and the third service priority are sequentially increased.

Optionally, in the case that the first buffered data in the dedicated signaling slot of the g+1th superframe corresponds to three traffic priorities, the processor 703 is further configured to: determining a G+2 superframe, a G+3 superframe and a G+4 superframe after the G+1 superframe, and reserving time slot resources of the first cache data in 3 continuous superframes;

And reserving time slot resources for the buffer data corresponding to the third service priority in a G+4 superframe, reserving unoccupied time slot resources for the buffer data corresponding to the second service priority in a G+3 superframe, and reserving unoccupied time slot resources for the buffer data corresponding to the first service priority in a G+2 superframe.

When the network node is a second network node, a processor 703 is configured to read the computer program in the memory 701 and perform the following operations: the transceiver 702 is controlled to receive a first resource negotiation signaling carrying first indication information sent by an adjacent first network node, where the first indication information indicates timeslot resources reserved by the first network node for first cache data in P superframes, P is greater than or equal to 1 and less than or equal to Q, the P superframes are determined based on P reserved time advance, and the P reserved time advance is determined based on P service priorities corresponding to the first cache data;

in the exclusive signaling time slot of the ith superframe, determining M reserved time advance amounts according to M service priorities corresponding to the second cache data, wherein i is an integer from 1 to N, the nth superframe is the last superframe of reserved time slot resources, M is greater than or equal to 1 and less than or equal to Q, and Q is the total service priority number corresponding to the transmission data in the ad hoc network;

according to the M reservation time advance, M superframes after the ith superframe are determined;

determining time slot resources different from the time slot resources reserved by the first cache data in the M superframes and generating a time slot resource set;

Reserving time slot resources of the second cache data in the time slot resource set according to the M service priorities;

The transceiver 702 is controlled to send a second resource negotiation signaling to a third network node, where the second resource negotiation signaling carries the first indication information and second indication information, and the second indication information indicates a timeslot resource reserved by the second network node in M superframes.

Wherein in fig. 7, a bus architecture may comprise any number of interconnected buses and bridges, and in particular one or more processors represented by processor 703 and various circuits of the memory, represented by memory 701, linked together. The bus architecture may also link together various other circuits such as peripheral devices, voltage regulators, power management circuits, etc., which are well known in the art and, therefore, will not be described further herein. The bus interface provides an interface. The transceiver 702 may be a number of elements, including a transmitter and a receiver, providing a means for communicating with various other apparatus over transmission media, including wireless channels, wired channels, optical cables, and the like.

The processor 703 is responsible for managing the bus architecture and general processing, and the memory 701 may store data used by the processor 703 in performing operations.

The processor 703 may be a Central Processing Unit (CPU), application SPECIFIC INTEGRATED Circuit (ASIC), field-Programmable gate array (Field-Programmable GATE ARRAY, FPGA), or complex Programmable logic device (Complex Programmable Logic Device, CPLD), or may employ a multi-core architecture.

The processor is configured to execute the method provided by the embodiment of the present application according to the obtained executable instructions by calling a computer program stored in the memory. The processor and the memory may also be physically separate.

It should be noted that, the above device provided in the embodiment of the present application can implement all the method steps implemented in the method embodiment and achieve the same technical effects, and detailed descriptions of the same parts and beneficial effects as those of the method embodiment in the embodiment are omitted herein.

Embodiments of the present application also provide a processor-readable storage medium storing a computer program for causing the processor to execute a resource scheduling method.

The processor-readable storage medium may be any available medium or data storage device that can be accessed by a processor, including, but not limited to, magnetic storage (e.g., floppy disks, hard disks, magnetic tape, magneto-optical disks (MOs), etc.), optical storage (e.g., CD, DVD, BD, HVD, etc.), and semiconductor storage (e.g., ROM, EPROM, EEPROM, non-volatile storage (NAND FLASH), solid State Disk (SSD)), etc.

It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, magnetic disk storage, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-executable instructions. These computer-executable instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These processor-executable instructions may also be stored in a processor-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the processor-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These processor-executable instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various modifications and variations can be made to the present application without departing from the spirit or scope of the application. Thus, it is intended that the present application also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.

Claims (10)

1. A method for scheduling resources, applied to a first network node, comprising:

in the exclusive signaling time slot of the ith superframe, according to P service priorities corresponding to the first cache data, P reserved time advance amounts are determined, i is an integer from 1 to N, the nth superframe is the last superframe of reserved time slot resources, P is greater than or equal to 1 and less than or equal to Q, and Q is the total service priority number corresponding to the transmission data in the ad hoc network;

according to the P reservation time advance, P superframes after the ith superframe are determined;

Reserving time slot resources of the first cache data in the P superframes according to the P service priorities, wherein each service priority is matched with one superframe, and the higher the service priority is, the later the superframe position is;

And sending a first resource negotiation signaling to the adjacent second network node, wherein the first resource negotiation signaling carries first indication information for indicating time slot resources reserved by the first network node in P superframes.

2. The method of claim 1, wherein determining P reserved time advances according to P service priorities corresponding to the first buffered data comprises:

obtaining K service types corresponding to the first cache data, determining P service priorities corresponding to the K service types, wherein K is greater than or equal to 1, and the value of P is less than or equal to K;

Based on the association relation between the service priorities and the reserved time advances, determining P reserved time advances corresponding to the P service priorities;

Wherein each service priority is associated with a reserved time advance, and the service priority is positively correlated with the reserved time advance.

3. The method of claim 2, wherein the traffic types corresponding to the transmission data in the ad hoc network are classified into Q traffic priorities based on different quality of service QoS requirements, each traffic priority corresponding to at least one traffic type;

The determining P service priorities corresponding to the K service types includes:

And determining P service priorities corresponding to the K service types of the first cache data according to the corresponding relation between the service priorities and the service types.

4. The method according to claim 1 or 2, wherein determining P superframes after the i-th superframe according to the P reservation time advances comprises:

taking the ith superframe as a reference superframe, and determining P superframes matched with the P reservation time advances according to the reference superframe and the P reservation time advances;

Wherein, each reservation time advance is associated with a super frame position, and the super frame position is more backward as the reservation time advance is larger.

5. The method of claim 1, wherein reserving the time slot resources of the first buffered data within the P superframes according to the P traffic priorities comprises:

Determining a superframe matched with the service priority according to each service priority;

Reserving time slot resources for the cache data corresponding to the service priority in the first cache data in the matched superframe;

and reserving the time slot resources in the same super frame in sequence according to the order of the service priority from high to low.

6. The method according to claim 1 or 5, wherein if the value of Q is 3, when the first buffered data in the dedicated signaling time slot of the G-th superframe corresponds to three service priorities, the first network node determines the g+1st superframe, the g+2nd superframe and the g+3rd superframe after the G-th superframe, and reserves the time slot resource of the first buffered data in 3 consecutive superframes;

The G super frame is one super frame of N super frames, the time slot resource is reserved for the buffer data corresponding to the third service priority in the G+3 super frame, the time slot resource is reserved for the buffer data corresponding to the second service priority in the G+2 super frame, and the time slot resource is reserved for the buffer data corresponding to the first service priority in the G+1 super frame; the priority orders corresponding to the first service priority, the second service priority and the third service priority are sequentially increased.

7. The method according to claim 6, wherein in case the first buffered data in the dedicated signaling time slot of the g+1 superframe corresponds to three traffic priorities, the first network node determines the g+2 superframe, the g+3 superframe and the g+4 superframe after the g+1 superframe, reserving the time slot resources of the first buffered data in 3 consecutive superframes;

And reserving time slot resources for the buffer data corresponding to the third service priority in a G+4 superframe, reserving unoccupied time slot resources for the buffer data corresponding to the second service priority in a G+3 superframe, and reserving unoccupied time slot resources for the buffer data corresponding to the first service priority in a G+2 superframe.

8. A resource scheduling method applied to a second network node, comprising:

Receiving a first resource negotiation signaling which is sent by an adjacent first network node and carries first indication information, wherein the first indication information indicates time slot resources reserved by the first network node for first cache data in P superframes, P is greater than or equal to 1 and less than or equal to Q, the P superframes are determined based on P reservation time advance, and the P reservation time advance is determined based on P business priorities corresponding to the first cache data;

in the exclusive signaling time slot of the ith superframe, determining M reserved time advance amounts according to M service priorities corresponding to the second cache data, wherein i is an integer from 1 to N, the nth superframe is the last superframe of reserved time slot resources, M is greater than or equal to 1 and less than or equal to Q, and Q is the total service priority number corresponding to the transmission data in the ad hoc network;

according to the M reservation time advance, M superframes after the ith superframe are determined;

determining time slot resources different from the time slot resources reserved by the first cache data in the M superframes and generating a time slot resource set;

Reserving time slot resources of the second cache data in the time slot resource set according to the M service priorities;

And sending a second resource negotiation signaling to an adjacent third network node, wherein the second resource negotiation signaling carries the first indication information and the second indication information, and the second indication information indicates the time slot resources reserved by the second network node in M superframes.

9. A network node, wherein the network node is a first network node, and comprises a memory, a transceiver, and a processor;

the memory is used for storing a computer program; the transceiver is used for receiving and transmitting data under the control of the processor; the processor is configured to read the computer program in the memory and perform the following operations:

in the exclusive signaling time slot of the ith superframe, according to P service priorities corresponding to the first cache data, P reserved time advance amounts are determined, i is an integer from 1 to N, the nth superframe is the last superframe of reserved time slot resources, P is greater than or equal to 1 and less than or equal to Q, and Q is the total service priority number corresponding to the transmission data in the ad hoc network;

according to the P reservation time advance, P superframes after the ith superframe are determined;

Reserving time slot resources of the first cache data in the P superframes according to the P service priorities, wherein each service priority is matched with one superframe, and the higher the service priority is, the later the superframe position is;

And controlling the transceiver to send a first resource negotiation signaling to the adjacent second network node, wherein the first resource negotiation signaling carries first indication information for indicating time slot resources reserved by the first network node in P superframes.

10. A network node, wherein the network node is a second network node, and comprises a memory, a transceiver, and a processor;

the memory is used for storing a computer program; the transceiver is used for receiving and transmitting data under the control of the processor; the processor is configured to read the computer program in the memory and perform the following operations:

controlling the transceiver to receive a first resource negotiation signaling carrying first indication information sent by an adjacent first network node, wherein the first indication information indicates time slot resources reserved by the first network node for first cache data in P superframes, P is greater than or equal to 1 and less than or equal to Q, the P superframes are determined based on P reservation time advance, and the P reservation time advance is determined based on P service priorities corresponding to the first cache data;

in the exclusive signaling time slot of the ith superframe, determining M reserved time advance amounts according to M service priorities corresponding to the second cache data, wherein i is an integer from 1 to N, the nth superframe is the last superframe of reserved time slot resources, M is greater than or equal to 1 and less than or equal to Q, and Q is the total service priority number corresponding to the transmission data in the ad hoc network;

according to the M reservation time advance, M superframes after the ith superframe are determined;

determining time slot resources different from the time slot resources reserved by the first cache data in the M superframes and generating a time slot resource set;

Reserving time slot resources of the second cache data in the time slot resource set according to the M service priorities;

And controlling the transceiver to send a second resource negotiation signaling to an adjacent third network node, wherein the second resource negotiation signaling carries the first indication information and the second indication information, and the second indication information indicates the time slot resources reserved by the second network node in M superframes.