QoS time slot distribution method and system in TDMA ad hoc network

Abstract

The embodiment of the invention provides a QoS time slot allocation method and system in a TDMA ad hoc network, and relates to the technical field of communication resource allocation. The method comprises the following steps: taking a time slot as the minimum unit of wireless resources of the TDMA ad hoc network, and forming a time frame by a plurality of time slots; the method comprises the following steps: collecting time slot resource requirements of various types of services of all nodes in a preset period through a decision center node, and allocating and arranging time slot resources of various types of services in each node in a time frame in a next preset period according to the time slot resource requirements of various types of services and a preset priority; and sending the arrangement result to each node through a time slot allocation message, receiving the time slot allocation message by each node to obtain the arrangement result, and sending data in the next preset period according to the arrangement result when the preset effective time is reached. According to the method provided by the invention, the utilization rate of the time slot resources in the node communication process can be improved, the fair distribution of the time slot resources is ensured, and the QoS requirements of different types of services are met.

Description

Technical Field

[0001] The present application relates to the technical field of wireless communication resource allocation, and in particular, to a QoS time slot allocation method and system in a TDMA ad hoc network. Background Art

[0002] Wireless TDMA (Time Division Multiple Access) ad hoc networks reuse wireless channel resources (time slots) for different nodes through time division, thereby realizing autonomous establishment and maintenance of the network and achieving efficient and flexible communication. This type of network does not require fixed infrastructure, has strong adaptability, and is self-organizing, distributed, and highly resistant to destruction, and is widely used.

[0003] Based on the increasingly rich business scenarios, there will be certain differences in the services transmitted by different nodes in the wireless TDMA ad hoc network at different times. For example, when the node performs control signaling interaction transmission, it may only need a Kbps-level transmission rate to meet the requirements, while when transmitting high-definition video and images, it will need to reach a Mbps-level transmission rate. Therefore, the actual demand of each node in the network for air interface time slot resources is dynamically changing. In a wireless TDMA ad hoc network, time slot resources are usually limited, and nodes in the network need to share these time slot resources. Therefore, in the design of the MAC layer (Media Access Control) protocol, implementing a time slot allocation method that can ensure high system throughput and high bandwidth resource utilization is one of the important issues in wireless ad hoc network communication.

[0004] The commonly used time slot resource allocation technologies in current wireless TDMA ad hoc networks mainly include static time slot allocation and dynamic time slot allocation. In the static time slot allocation mode, each node will be pre-allocated with a fixed number of time slot resources when accessing the network to perform data transmission and reception. This allocation mechanism can ensure the stability of the delay during the communication process, but it cannot dynamically respond to changes in resource demand caused by node entry and exit, changes in business traffic, etc. When the business volume fluctuates or the number of nodes in the network changes, insufficient resources or over-allocation may cause low utilization. In the dynamic time slot allocation mode, during the operation of the node after accessing the network, each node is allowed to regularly reallocate time slot resources according to its own business needs. This allocation mechanism can effectively cope with fluctuations in communication business volume and can still maintain efficient time slot utilization in a network with a large node scale, but it still does not consider the QoS (Quality of Service) of the service. When the time slot demand is too large and the time slot resources are insufficient, some nodes will not be able to obtain the expected fair allocation results. Summary of the invention

[0005] In order to solve one of the above technical defects, an embodiment of the present application provides a QoS time slot allocation method and system in a TDMA ad hoc network.

[0006] According to a first aspect of an embodiment of the present application, a method for allocating QoS time slots in a TDMA ad hoc network is provided, the method comprising:

[0007] The time slot is the smallest unit of wireless resources in TDMA ad hoc network, and multiple time slots are grouped into time frames;

[0008] The decision-making center node in the TDMA ad hoc network collects the time slot resource requirements of various types of services of all nodes in a preset period, and allocates and arranges the time slot resources of various types of services in each node within a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services;

[0009] The allocation and scheduling result of the time slot resources is sent to each node through the time slot allocation message. Each node receives the time slot allocation message to obtain the allocation and scheduling result, and sends data according to the allocation and scheduling result in the next preset cycle when the preset effective time is reached.

[0010] In an optional embodiment of the present application, the step of collecting the time slot resource requirements of various types of services of all nodes in a preset period through a decision center node in the TDMA ad hoc network, and allocating and arranging the time slot resources of various types of services in each node in a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services also includes:

[0011] In the next preset period, the time slot resources of each type of service in each node within a time frame are allocated and arranged in an equal interval arrangement manner.

[0012] In an optional embodiment of the present application, the step of collecting the time slot resource requirements of various types of services of all nodes in a preset period through a decision center node in the TDMA ad hoc network, and allocating and arranging the time slot resources of various types of services in each node in a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services also includes:

[0013] The priorities of various types of services are, from high to low, delay-sensitive services, real-time streaming services, non-real-time streaming services, and low-priority services.

[0014] In an optional embodiment of the present application, the step of collecting the time slot resource requirements of various types of services of all nodes in a preset period through a decision center node in the TDMA ad hoc network, and allocating and arranging the time slot resources of various types of services in each node in a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services also includes:

[0015] When calculating the time slot resource requirements for delay-sensitive services, the minimum resource guarantee strategy is adopted and the minimum number of time slots required is configured.

[0016] In an optional embodiment of the present application, the step of collecting the time slot resource requirements of various types of services of all nodes in a preset period through a decision center node in the TDMA ad hoc network, and allocating and arranging the time slot resources of various types of services in each node in a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services also includes:

[0017] When calculating the time slot resource requirements of real-time streaming services, a conditional smoothing strategy is adopted.

[0018] In an optional embodiment of the present application, the step of collecting the time slot resource requirements of various types of services of all nodes in a preset period through a decision center node in the TDMA ad hoc network, and allocating and arranging the time slot resources of various types of services in each node in a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services also includes:

[0019] When calculating the time slot resource requirements of non-real-time streaming services, a mean smoothing strategy is adopted.

[0020] In an optional embodiment of the present application, the step of collecting the time slot resource requirements of various types of services of all nodes in a preset period through a decision center node in the TDMA ad hoc network, and allocating and arranging the time slot resources of various types of services in each node in a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services also includes:

[0021] When calculating the time slot resource requirements of non-real-time streaming services and low-priority services, a mean smoothing strategy is adopted.

[0022] According to a second aspect of the embodiment of the present application, a QoS time slot allocation system in a TDMA ad hoc network is provided, the system comprising a resource partitioning module, an allocation scheduling module and an allocation validation module; wherein:

[0023] A resource division module is used to divide the wireless resources of the TDMA ad hoc network with time slots as the smallest unit, and to group multiple time slots into time frames;

[0024] The allocation and scheduling module is used to collect the time slot resource requirements of various types of services of all nodes in a preset period through the decision center node in the TDMA self-organizing network, and allocate and schedule the time slot resources of various types of services in each node within a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services;

[0025] The allocation and effectiveness module is used to send the allocation and scheduling results of time slot resources to each node through the time slot allocation message. Each node receives the time slot allocation message to obtain the allocation and scheduling results, and sends data according to the allocation and scheduling results in the next preset cycle when the preset effectiveness time is reached.

[0026] According to the third aspect of the embodiments of the present application, a computer device is provided, comprising: a memory; a processor; and a computer program; wherein the computer program is stored in the memory and is configured to be executed by the processor to implement a QoS time slot allocation method in a TDMA self-organizing network as described in any one of the first aspects of the embodiments of the present application.

[0027] According to the fourth aspect of the embodiments of the present application, a computer-readable storage medium is provided, on which a computer program is stored; the computer program is executed by a processor to implement a QoS time slot allocation method in a TDMA self-organizing network as described in any one of the first aspects of the embodiments of the present application.

[0028] The QoS time slot allocation method in a TDMA ad hoc network provided in an embodiment of the present application has the following beneficial effects:

[0029] The present application divides the channel into time slot resources of small time periods, and N time slots form a time frame, so that each node in the network can allocate and occupy different time slot resources in the time frame for sending data; in addition, the present application classifies the services according to the service type in the wireless TDMA self-organizing network node, sets the priority for the characteristics of different types of services, so as to calculate and allocate the time slot resource requirements, and can meet the QoS requirements of different services. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0031] Figure 1 A flowchart of a time slot allocation method provided in an embodiment of the present application;

[0032] Figure 2 is a flow chart of a time slot allocation method provided by another embodiment of the present application;

[0033] Figure 3 A schematic diagram of a 5-node networking scenario provided in an embodiment of the present application;

[0034] Figure 4 A schematic diagram of a TDMA time slot structure provided in an embodiment of the present application;

[0035] Figure 5 A flow chart for calculating time slot resource requirements provided in an embodiment of the present application;

[0036] Figure 6 A schematic diagram of the timeslot request message format provided in an embodiment of the present application;

[0037] Figure 7 A schematic diagram of the process of arranging the time slots at equal intervals provided in the embodiment of the present application;

[0038] Figure 8 A schematic diagram of the timeslot allocation message format provided in an embodiment of the present application;

[0039] Fig. 9 A structural diagram of a time slot allocation system provided in an embodiment of the present application;

[0040] Fig.10 A schematic diagram of the computer device structure provided for one embodiment of the present application. DETAILED DESCRIPTION

[0041] In order to make the technical solutions and advantages in the embodiments of the present application more clearly understood, the exemplary embodiments of the present application are further described in detail below in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present application, rather than an exhaustive list of all the embodiments. It should be noted that the embodiments in the present application and the features in the embodiments can be combined with each other without conflict.

[0042] The present application provides a QoS time slot allocation method suitable for the MAC layer in a wireless TDMA ad hoc network, which improves the time slot resource utilization rate during node communication while ensuring fair allocation of time slot resources and meets the QoS requirements of different types of services. Figure 1 For a flowchart of the QoS time slot allocation method in a TDMA ad hoc network provided in an embodiment of the present application, please refer to Figure 1 :

[0043] S1: The time slot is the smallest unit of wireless resources in the TDMA ad hoc network, and multiple time slots are grouped into a time frame.

[0044] In a specific implementation, in a wireless TDMA ad hoc network, the channel is divided into time slot resources of small time periods, N time slots form a time frame, and M time frames form a superframe. Each node in the network occupies different time slot resources in the time frame to send data. Specifically, the maximum data transmission length of each time slot is MTU (Maximum Transmission Unit) bytes.

[0045] S2: The decision-making center node in the TDMA self-organizing network collects the time slot resource requirements of various types of services of all nodes in a preset period, and allocates and arranges the time slot resources of various types of services in each node within a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services.

[0046] In a specific implementation, the MAC layer of each node in the wireless TDMA ad hoc network maintains transmission information of multiple service types. Specifically, the service types include delay-sensitive services TsS, real-time streaming services RtS, non-real-time services non-RtS, and low-priority services low-PriS. In this embodiment, the priorities of the above services are reduced in sequence. In this embodiment, low-priority services include but are not limited to background file transfer services, TCP-based services (FTP / file sharing), and test data.

[0047] The current time slot allocation scheme in the TDMA self-organizing network mainly allocates time slot resources based on the data volume of the overall service flow of the node transmitter. Under the condition of limited wireless resources, when the service traffic in the network increases, it will affect the node data transmission of time-sensitive services or real-time services in the network, and cannot meet the QoS requirements of such services such as delay, throughput, and delay jitter. Based on this, the embodiment of the present application classifies the transmitter services in a more detailed dimension in the wireless TDMA self-organizing network node, sets priorities according to the characteristics of different types of services, and adopts different strategies to calculate and allocate time slot resource requirements to meet the QoS requirements of different services.

[0048] Specifically, the transmission information includes: the cumulative amount of data D sent downlink for each service within each statistical period T (i.e., the preset period) send , the current cache data volume of each business D buffer , where the statistical period T is an integer multiple of the time frame.

[0049] Furthermore, using triples <ToS,D send , D buffer >Record the above information.

[0050] In the specific implementation, when the period T arrives, the node uses the service transmission information statistics to calculate the number of time slots required for each type of service N. ToS , used to meet the business transmission of the next cycle.

[0051] In this embodiment, for delay-sensitive services:

[0052] The minimum resource guarantee strategy is used to calculate the time slot resource requirements, and the minimum number of time slots required N can be configured. min ;

[0053] Calculate the number of time slots required based on the amount of recorded data: NTsS =ceil((D send +D buffer ) / (MTU×T)), where ceil() is the result of the calculation rounded up;

[0054] Final number of time slots required: N TsS =max(N TsS , N min ).

[0055] In this embodiment, for the real-time streaming media service:

[0056] A conditional smoothing strategy is used to calculate time slot resource requirements;

[0057] If it is the first statistical period or the current period (D send +D buffer ) value is higher than the previous cycle (D send_pre +D buffer_pre ) value is high, then D=(D send +D buffer );

[0058] If the current cycle (D send +D buffer ) value is higher than the previous cycle (D send_pre +D buffer_pre ) value is low, smoothing is performed:

[0059] D=(D send_pre ×α1+D send ×β1)+(D buffer_pre ×α2+D buffer ×β2)

[0060] Where D is the data value after weighted smoothing, α1, β1, α2, β2 are weighting factors and are all positive numbers, α1+β1=1, α2+β2=1;

[0061] Final number of time slots required: N RtS =ceil(D / (MTU×T)).

[0062] In this embodiment, for non-real-time streaming media services and low-priority services:

[0063] The mean smoothing strategy is used to calculate the time slot resource requirements;

[0064] For each period T, the statistical D send and D buffer , combined with the statistical values ​​of the previous L-1 cycles for smoothing filtering:

[0065]

[0066] Where D send_cur and D buffer_cur is the data volume after filtering, D send-i and D buffer-i is the statistical data value of the i-th cycle before the current cycle. When smoothing and filtering the data of the first L-1 cycles, the edge expansion method of copying the current effective value is adopted;

[0067] Final number of time slots required: N non-RtS =N low-PriS =ceil((D send_cur +D buffer_cur ) / (MTU×T)).

[0068] Based on this, when calculating resource requirements, the embodiment of the present application adopts a minimum resource guarantee strategy for delay-sensitive services, which can ensure that such services obtain sufficient time slot resources to ensure that they can get sending opportunities within a reasonable time, and ultimately ensure transmission delay and delay jitter; a conditional smoothing strategy is adopted for real-time streaming media services to ensure that such services can quickly obtain sufficient time slot resources when traffic increases sharply, and slowly release time slot resources when traffic decreases, thereby ensuring throughput and stability in transmission; a mean smoothing strategy is adopted for non-real-time services and low-priority services to reduce random fluctuations in data transmission, obtain smooth time slot resources as much as possible, and ensure stability in transmission.

[0069] In the specific implementation, the node will allocate the time slot resource requirements of each type of service within itself. <ID,ToS,N ToS >, sent to the decision center node in the network through a time slot request message, where ID is the unique identification code of the node. As for the time slot resource requirements of the decision center node itself, they can be directly saved.

[0070] In the specific implementation, the decision center node collects the time slot resource requirements of various types of services of all nodes in the network in each cycle T. <ID,ToS,N ToS >Then the time slot resources are allocated, and the time slot resources are allocated in order from high to low priority to delay-sensitive services, real-time streaming services, non-real-time services, and low-priority services. For the same type of services reported by different ID nodes, the first reported priority is higher. The allocation process is as follows:

[0071] The time slot resource allocation for delay-sensitive services adopts the principle of priority satisfaction. When there are sufficient idle time slot resources, the time slot requirements of all nodes for this type of service can be met in turn. When the time slot resources for this type of service are allocated to a certain node, if the remaining idle time slot resources can no longer meet its resource requirements, the remaining idle time slot resources will be allocated to the current node at one time, and subsequent allocation will be stopped.

[0072] The time slot resource allocation for real-time streaming services adopts the principle of priority satisfaction. When there are sufficient idle time slot resources, the time slot requirements of all nodes for this type of service can be met in turn. When the time slot resources for this type of service are allocated to a certain node, if the remaining idle time slot resources can no longer meet its resource requirements, the remaining idle time slot resources will be allocated to the current node at one time, and subsequent allocation will be stopped.

[0073] The allocation of time slot resources for non-real-time services adopts the best-effort principle. When there are sufficient idle time slot resources, the number of time slots required for this type of service requested by all nodes can be met in turn. When there are insufficient idle time slot resources, all idle time slot resources are allocated to all nodes in proportion. The number of time slots allocated to the corresponding ID node = ceil((N ID / N all )×N idle )(where N ID The number of time slot requirements for this type of service reported by the ID node, N all The total number of time slot requirements for this type of service reported by all nodes, N idle = is the total number of idle time slot resources that can actually be allocated), considering the accuracy impact caused by rounding up, the number of time slot allocations of the last node is calculated by subtracting the number of time slots currently allocated to this type of service from the total number of idle time slot resources, and subsequent allocation is stopped at the same time;

[0074] The time slot resource allocation for low-priority services adopts the best-effort principle. When there are sufficient idle time slot resources, the number of time slots required for this type of service requested by all nodes can be met in turn. When there are insufficient idle time slot resources, all idle time slot resources are allocated to all nodes in proportion. The number of time slots allocated to the corresponding ID node = ceil((N ID / N all )×N idle )(where N ID The number of time slot requirements for this type of service reported by the ID node, N all The total number of time slot requirements for this type of service reported by all nodes, N idle is the total number of idle time slot resources that can actually be allocated), considering the accuracy impact caused by rounding up, the number of time slot allocations of the last node is calculated by subtracting the number of time slots currently allocated to this type of service from the total number of idle time slot resources, and subsequent allocation is stopped at the same time.

[0075] In some embodiments of the present application, in the next preset period, the time slot resources of each type of service in each node within a time frame are allocated and arranged in an equal interval arrangement manner.

[0076] In the specific implementation, the decision center node sums up the time slots allocated for the above different types of services according to the node ID; then selects time slots at equal intervals within the time frame and allocates them to the corresponding nodes. If the current time slot position has been allocated and occupied, it searches for idle time slots before and after the current position for allocation. After all node time slots are arranged, the time slot resource allocation results are sent to each node in the network through a time slot allocation message.

[0077] Please continue to see Figure 1 :

[0078] S3: Send the allocation and scheduling result of the time slot resources to each node through the time slot allocation message. Each node receives the time slot allocation message to obtain the allocation and scheduling result, and sends data according to the allocation and scheduling result in the next preset period when the preset effective time is reached.

[0079] In a specific implementation, after receiving the time slot allocation message, each node parses and obtains its own latest time slot allocation result, and then at the time specified by the entire network system, all nodes in the entire network simultaneously update the time slot allocation information.

[0080] Furthermore, the present application provides another embodiment, as a specific illustration, see Figure 2 :

[0081] S101: Time slot structure planning: divide the wireless resources into minimum unit time slots, several time slots form a time frame, several time frames form a superframe, and each node in the network periodically occupies different time slot resources in the time frame to send data.

[0082] Specifically, in a wireless TDMA ad hoc network, the channel is divided into time slot resources of small time periods, N time slots form a time frame, and M time frames form a superframe. Each node in the network can allocate different time slot resources in the time frame for sending data, where the maximum data transmission length of each time slot is MTU bytes. In this embodiment, the network is constructed by 5 nodes, and the node IDs are 1 to 5, where ID1 node is the decision center node. The network scenario is as follows: Figure 3 The planning of the time slot structure is as follows: a time slot length is 1ms, 50 time slots form a time frame, 10 time frames form a superframe with a length of 500ms, and the maximum data transmission length MTU of each time slot is 1000 bytes. The time slot structure is as follows: Figure 4 shown.

[0083] In some other embodiments of the present application, the specific planning of network scenarios and time slots and time frames is not necessarily limited to the above structure, and can be specifically divided according to actual implementation capabilities and service transmission requirements.

[0084] S201: Service information maintenance: The MAC layer of each node maintains transmission information of multiple service types, and counts the amount of downlink data sent by each service in each period T and the amount of current cached data for each service.

[0085] Specifically, during the operation of the node, the data or control information received or generated by the MAC layer is classified and maintained and the sending traffic is monitored according to the service type ToS. The service types include the following four categories: delay-sensitive service TsS, real-time streaming service RtS, non-real-time service non-RtS, and low-priority service low-PriS, with the service priority decreasing in turn.

[0086] In some other embodiments of the present application, the service types are not necessarily limited to the four categories, and can be specifically divided according to the service types existing in the system. The general principle of service type division is that control or session information that is sensitive to delay has the highest priority, followed by real-time high-traffic streaming media services, then non-real-time streaming media services, and finally low-priority services.

[0087] For each type of service, a corresponding buffer area is established to store the service data to be sent out, and the amount of data sent downlink by each service is accumulated in real time. After each cycle T arrives, the amount of data D sent downlink by each service in this cycle is counted send And the remaining data volume D of each service buffer area buffer , using triples <ToS,D send , D buffer >Record. In this embodiment, the statistical period T is set to 10 time frame periods, D send and D buffer The unit is Byte, which is the service transmission information of different nodes in the network in the last 4 cycles. send and D buffer The statistical results are shown in the following table:

[0088]

[0089] S202: Resource demand calculation: In period T i When it arrives, the node uses the statistical results of service transmission information to calculate the number of time slot resource requirements for each type of service.

[0090] Specifically, in period T i When it arrives, the node uses the business transmission information statistics results <ToS,D send , D buffer >Calculate the number of time slots required for each type of service N ToS , the process is as follows Figure 5 As shown, the specific calculation steps are as follows:

[0091] If it is a delay-sensitive service, the minimum resource guarantee strategy is used to calculate the required number of time slots and configure the minimum number of time slots required N. min . Calculate the required number of time slots N based on the amount of recorded data TsS =ceil((D send +D buffer ) / (MTU×T)), the final number of time slots required is N TsS =max(N TsS , N min ). Delay-sensitive services include messages with high transmission delay requirements such as conversational voice, telemetry and remote control, and signaling. min 5, which can ensure that the delay-sensitive service is allocated at least 5 time slot resources in a 50ms time frame, ensuring that it can get a transmission opportunity once every 10ms on average. In some other embodiments of the present application, N min It can be calculated and configured according to the transmission delay requirements of the corresponding business.

[0092] Combined with step D in Example S201 send and D buffer According to the statistical results, nodes ID1 and ID5 have delay-sensitive services. For the time slot requirement of ID1, N TsS =ceil((50000Byte+17000Byte) / (1000Byte×10))=7, the final required number of time slots N TsS =max(7,5)=7; For the time slot requirement of ID5, N TsS =ceil((10000Byte+29850Byte) / (1000Byte×10))=4, the final required number of time slots N TsS =max(4,5)=5.

[0093] If it is a real-time streaming service, a conditional smoothing strategy is used to calculate the number of time slot requirements. If it is the first statistical cycle or the current cycle (D send +D buffer ) value is higher than the previous cycle (D send_pre +D buffer_pre ) value is high, then D=(D send +D buffer ); if the current cycle (D send +D buffer ) value is higher than the previous cycle (D send_pre +D buffer_pre ) value is low, smoothing is performed: D = (D send_pre ×α1+D send ×β1)+(D buffer_pre ×α2+D buffer×β2), where D is the amount of data after weighted smoothing, α1, β1, α2, β2 are weighting factors and are all positive numbers, α1+β1=1, α2+β2=1. The final number of time slots required is N RtS =ceil(D / (MTU×T)). Real-time streaming services include conversational video, real-time images, etc. In this embodiment, α1, β1, α2, and β2 are 0.25, 0.75, 0.25, and 0.75, respectively.

[0094] Combined with step D in Example S201 send and D buffer According to the statistical results, the node with real-time streaming service is node ID2, because the period T i The 72321Byte is larger than the period T i-1 The (60000+39150)Byte is low, then D=(60000×0.25+72321×0.75)+39150×0.25=79028.25Byte, and the final required number of time slots is N RtS =ceil(79028.25Byte / (1000Byte×10))=8.

[0095] If it is a non-real-time service or a low-priority service, the mean smoothing strategy is used to calculate the number of time slot requirements. send and D buffer , combined with the statistical values ​​of the previous L-1 cycles for smoothing filtering:

[0096]

[0097]

[0098] Where D send_cur and D buffer_cur is the data volume after filtering, D send-i and D buffer-i is the statistical data value of the i-th cycle before the current cycle. When smoothing and filtering the data of the first L-1 cycles, the edge expansion method of copying the current valid value is used. The final number of time slots required is N non-RtS =N low-PriS =ceil((D send_cur +D buffer_cur ) / (MTU×T)). Non-real-time services include non-session video, high-definition images (buffered streaming media), etc. Low-priority services include services based on TCP (Transmission Control Protocol) (FTP (File Transfer Protocol) / file sharing), test data, etc. In this embodiment, the value of L is 4.

[0099] Combined with step D in Example S201 send and D buffer According to the statistical results, nodes ID2 and ID3 have non-real-time services. For the time slot requirement of ID2, D send_cur =(12320+19870+19980+62300) / 4=28617.5Byte, D buffer_cur =(9800+41250) / 4=12762.5Byte, the final number of time slots required is N non-RtS =ceil((28617.5+12762.5)Byte / (1000Byte×10))=5; For the time slot requirement of ID3, D send_cur =(9978+20010+40102+40102) / 4=27548Byte, D buffer_cur =(9500+17560+7652+7652) / 4=10591Byte, the final number of time slots required is N non-RtS =ceil((27548+10591)Byte / (1000Byte×10))=4.

[0100] Combined with step S201 in the embodiment, send and D buffer According to the statistical results, the node with low priority service is node ID4, D send_cur =(9785+7862+10023+29860) / 4=14382.5Byte, D buffer_cur =(32015+12354) / 4=11092.3Byte, the final number of time slots required is N non-RtS =ceil((14382.5+11092.3)Byte / (1000Byte×10))=3.

[0101] Finally, each node in the network scenario of this embodiment has a period T i The results of the time slot requirement are shown in the following table:

[0102]

[0103] S203: Resource demand reporting: The node sends its own ID, various types of services and corresponding time slot resource demand numbers to the decision-making center node in the network through a time slot request message.

[0104] Specifically, after calculating the number of time slots required for each service, the node constructs a time slot request message and sends the time slot resource requirement information to the decision center node in the network. The time slot resource requirements of the decision center node itself can be directly saved. The format of the time slot request message is as follows: Figure 6 As shown, it includes message type, message ID, source node ID, destination node ID, each service type ToS and the corresponding time slot resource requirement number N ToS .

[0105] The message type is used to distinguish messages marked as time slot requests; the message ID is an increasing sequence number maintained by the node itself, which is incremented by 1 each time it is sent; the source node ID is the unique identification code of the node itself, which can be used together with the message ID to identify the uniqueness of the message sent by the node at each moment; the destination node ID is the unique identification code of the decision-making center node in the network; each service type ToS and the corresponding time slot resource requirement N ToS It is the number of time slots required to send different services within this cycle.

[0106] S204: Time slot resource allocation: After collecting the time slot resource requirements of various types of services of all nodes in the network in each period T, the decision center node allocates time slot resources according to certain rules.

[0107] Specifically, after collecting the time slot resource requirements of all types of services of all nodes in the network in each cycle T, the decision center node allocates time slot resources, and allocates time slot resources to delay-sensitive services, real-time streaming services, non-real-time services, and low-priority services in order of priority from high to low. For the same type of services reported by different ID nodes, the priority reported first is higher. The specific allocation steps are as follows:

[0108] The time slot resource allocation for delay-sensitive services adopts the principle of priority satisfaction. When there are sufficient idle time slot resources, the time slot requirements of all nodes for this type of service can be met in turn. When the time slot resources of this type of service are allocated to a certain node, if the remaining idle time slot resources can no longer meet its resource requirements, the remaining idle time slot resources will be allocated to the current node at one time, and subsequent allocation will be stopped. In this embodiment, combined with the result of the time slot requirements in S202, nodes ID1 and ID5 have delay-sensitive services, and the time slot requirements are 7 and 5 respectively, and node ID1 has no more than 10 nodes in period T. i-1 This service exists, so 7 time slot resources are first allocated to node ID1 in a time frame (50 time slots constitute a time frame), and 43 idle time slot resources remain after the allocation; then 5 time slot resources are allocated to node ID5, and 38 idle time slot resources remain after the allocation.

[0109] The time slot resource allocation of the real-time streaming service adopts the principle of priority satisfaction. When the idle time slot resources are sufficient, the time slot requirements of this type of service requested by all nodes can be met in turn; when the time slot resources of this type of service are allocated to a certain node, if the remaining idle time slot resources can no longer meet its resource requirements, the remaining idle time slot resources will be allocated to the current node at one time, and subsequent allocation will be stopped. In this embodiment, combined with the result of the time slot requirement number in S202, the node with real-time streaming service is node ID2, the time slot requirement number is 8, and 30 idle time slot resources remain after the allocation.

[0110] The allocation of time slot resources for non-real-time services adopts the best-effort principle. When there are sufficient idle time slot resources, the number of time slots required for this type of service requested by all nodes can be met in turn. When there are insufficient idle time slot resources, all idle time slot resources are allocated to all nodes in proportion. The number of time slots allocated to the corresponding ID node = ceil((N ID / N all )×N idle )(where N ID The number of time slots required for this type of service reported by the ID node, N all The total number of time slot requirements for this type of service reported by all nodes, N idle = is the total number of idle time slot resources that can actually be allocated), considering the accuracy impact caused by rounding up, the number of time slot allocations of the last node is calculated by subtracting the number of time slots currently allocated to this type of service from the total number of idle time slot resources, and subsequent allocation is stopped. In this embodiment, combined with the result of the number of time slot requirements in S202, nodes ID2 and ID3 have non-real-time services, and the number of time slot requirements is 5 and 4 respectively. There are sufficient idle time slot resources and node ID2 is in period T i-3 This service exists, so 5 time slot resources are allocated to node ID2 first, and 25 idle time slot resources remain after the allocation; then 4 time slot resources are allocated to node ID3, and 21 idle time slot resources remain after the allocation.

[0111] The time slot resource allocation for low-priority services adopts the best-effort principle. When there are sufficient idle time slot resources, the number of time slots required for this type of service requested by all nodes can be met in turn. When there are insufficient idle time slot resources, all idle time slot resources are allocated to all nodes in proportion. The number of time slots allocated to the corresponding ID node = ceil((N ID / N all )×N idle )(where N ID The number of time slots required for this type of service reported by the ID node, N all The total number of time slot requirements for this type of service reported by all nodes, N idle= is the total number of idle time slot resources that can actually be allocated), considering the accuracy impact caused by rounding up, the number of time slot allocations of the last node is calculated by subtracting the number of time slots currently allocated to this type of service from the total number of idle time slot resources, and subsequent allocation is stopped. In this embodiment, combined with the result of the number of time slot requirements in S202, the node with low priority service is node ID4, the number of time slot requirements is 3, and 18 idle time slot resources remain after allocation.

[0112] S205: Time slot scheduling and distribution: The decision center node schedules the time slots allocated to each node at equal intervals. After all the node time slots are scheduled, the time slot resource allocation result is sent to each node via a time slot allocation message.

[0113] Specifically, the decision center node sums the allocated time slots according to the node ID; then selects time slots at equal intervals within the time frame and allocates them to the corresponding nodes. If the current time slot position has been allocated and occupied, it searches for free time slots before and after the current position for allocation. In this embodiment, the process of allocating time slots at equal intervals for each node is as follows: Figure 7 As shown, the specific steps are as follows:

[0114] A time frame consists of 50 time slots, so within a time frame:

[0115] For ID1, the number of time slots required is 7, that is, 7 time slots are allocated to ID1 in 1 time frame, and the intervals of each time slot obtained by ID1 are equal. Specifically, starting from the 1st time slot, 1 time slot is allocated to ID1 every 6 time slots until the 7th time slot allocation of ID1 is completed;

[0116] For ID2, the number of time slots required is 13, that is, 13 time slots are allocated to ID1 at equal intervals within one time frame. Since the first time slot position has been allocated and occupied, an idle time slot is searched before and after the current position for allocation, that is, starting from the second time slot position, one time slot is allocated to ID2 every three time slots until the 13th time slot of ID2 is allocated; similarly, if the time slot position to be allocated according to the equal interval has been allocated and occupied, an idle time slot is searched before and after the current position for allocation;

[0117] And so on, until the time slot position arrangement of ID5 is completed.

[0118] After all nodes have completed the time slot arrangement, the time slot resource allocation results are sent to each node in the network through the time slot allocation message. The format of the time slot allocation message is as follows: Figure 8As shown in the figure, it includes message type, message message ID, source node ID and time slot table result. The message type is used to distinguish messages marked as time slot allocation; the message message ID is an increasing sequence number maintained by the node itself, which is accumulated by 1 each time it is sent; the source node ID is the unique identification code of the node itself, which can be used together with the message message ID to identify the uniqueness of the message sent by the node at each moment; the time slot table is the result of the arranged time slot allocation.

[0119] S301: Resource results take effect: After receiving the time slot allocation message, each node obtains its own latest time slot allocation result, and then at the time specified by the entire network system, all nodes in the network simultaneously update the time slot allocation information.

[0120] Specifically, after receiving the time slot allocation message, each node obtains its latest time slot allocation result, and then at the time specified by the entire network system, all nodes in the network simultaneously update the time slot allocation information. In this embodiment, each node uniformly updates the time slot allocation information at the start time of the superframe cycle, and uses the latest time slot allocation result to send data in the next cycle. In some other embodiments of the present application, the specific effective time can be set according to the actual situation of the system.

[0121] To sum up, the method provided in the embodiment of the present application takes into account both service priority and the allocation principles of services of different priorities when allocating time slot resources, ensuring that when time slot resources are limited, the transmission stability and latency of high-priority services and the transmission opportunism of low-priority services can be guaranteed to meet the QoS requirements of different services.

[0122] It should be understood that, although the various steps in the flow chart are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear description in this article, the execution of these steps is not strictly limited in order, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the figure may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these sub-steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.

[0123] See also Fig. 9 An embodiment of the present application provides a QoS time slot allocation system in a TDMA ad hoc network, the system comprising a resource partitioning module 10, an allocation scheduling module 20 and an allocation validation module 30; wherein,

[0124] The resource division module 10 is used to divide the wireless resources of the TDMA ad hoc network with time slots as the minimum unit, and to group multiple time slots into time frames;

[0125] The allocation and scheduling module 20 is used to collect the time slot resource requirements of various types of services of all nodes in a preset period through the decision center node in the TDMA ad hoc network, and allocate and schedule the time slot resources of various types of services in each node in a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services;

[0126] The allocation and validation module 30 is used to send the allocation and scheduling result of the time slot resources to each node through the time slot allocation message. Each node receives the time slot allocation message to obtain the allocation and scheduling result, and sends data according to the allocation and scheduling result in the next preset period when the preset validity time is reached.

[0127] For the specific definition of the QoS time slot allocation system in the above-mentioned TDMA self-organizing network, please refer to the definition of the QoS time slot allocation method in the TDMA self-organizing network in the above-mentioned text, which will not be repeated here. Each module in the above-mentioned QoS time slot allocation system in the TDMA self-organizing network can be implemented in whole or in part by software, hardware and a combination thereof. The above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory in the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.

[0128] In one embodiment, a computer device is provided, the internal structure diagram of which can be as follows: Fig.10 As shown. The computer device includes a processor, a memory, a network interface and a database connected via a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store data. The network interface of the computer device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, the QoS time slot allocation method in the TDMA self-organizing network as described above is implemented. It includes: a memory and a processor, the memory stores a computer program, and when the processor executes the computer program, the QoS time slot allocation method in the TDMA self-organizing network as described above is implemented.

[0129] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the QoS time slot allocation method in a TDMA ad hoc network can be implemented as described above.

[0130] Those skilled in the art will appreciate that the embodiments of the present application can be provided as methods, systems, or computer program products. Therefore, the present application can adopt the form of complete hardware embodiments, complete software embodiments, or embodiments in combination with software and hardware. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code. The scheme in the embodiments of the present application can be implemented in various computer languages, for example, C language, VHDL language, Verilog language, object-oriented programming language Java and literal scripting language JavaScript, etc.

[0131] The present application is described with reference to the flowcharts and / or block diagrams of the systems and computer program products according to the embodiments of the present application. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of the processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0132] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0133] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0134] Although the preferred embodiments of the present application have been described, those skilled in the art may make other changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications falling within the scope of the present application.

[0135] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A QoS time slot allocation method in a TDMA ad hoc network, characterized in that: include: Taking a time slot as the minimum unit of wireless resources of a TDMA ad hoc network, a plurality of the time slots are grouped into a time frame; The decision center node in the TDMA ad hoc network collects the time slot resource requirements of various types of services of all nodes in a preset period, and allocates and arranges the time slot resources of various types of services in each node in a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services; The allocation and scheduling result of the time slot resources is sent to each of the nodes via a time slot allocation message. Each of the nodes receives the time slot allocation message to obtain the allocation and scheduling result, and sends data according to the allocation and scheduling result in the next preset period when the preset effective time is reached.

2. The QoS time slot allocation method in a TDMA ad hoc network according to claim 1, characterized in that: The step of collecting the time slot resource requirements of various types of services of all nodes in a preset period through the decision center node in the TDMA self-organizing network, and allocating and arranging the time slot resources of various types of services in each node in a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services also includes: In the next preset period, the time slot resources of each type of service in each node in one time frame are allocated and arranged in an equal interval arrangement manner.

3. The QoS time slot allocation method in a TDMA ad hoc network according to claim 2, characterized in that: The step of collecting the time slot resource requirements of various types of services of all nodes in a preset period through the decision center node in the TDMA self-organizing network, and allocating and arranging the time slot resources of various types of services in each node in a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services also includes: The priorities of the various types of services are, from high to low, delay-sensitive services, real-time streaming media services, non-real-time streaming media services, and low-priority services.

4. The QoS time slot allocation method in a TDMA ad hoc network according to claim 3, characterized in that: The step of collecting the time slot resource requirements of various types of services of all nodes in a preset period through the decision center node in the TDMA self-organizing network, and allocating and arranging the time slot resources of various types of services in each node in a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services also includes: When calculating the time slot resource requirement of the delay-sensitive service, a minimum resource guarantee strategy is adopted and a minimum time slot number requirement is configured.

5. The QoS time slot allocation method in TDMA ad hoc network according to claim 3, characterized in that: The step of collecting the time slot resource requirements of various types of services of all nodes in a preset period through the decision center node in the TDMA self-organizing network, and allocating and arranging the time slot resources of various types of services in each node in a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services also includes: When calculating the time slot resource requirement of the real-time streaming media service, a conditional smoothing strategy is adopted.

6. The QoS time slot allocation method in a TDMA ad hoc network according to claim 3, characterized in that: The step of collecting the time slot resource requirements of various types of services of all nodes in a preset period through the decision center node in the TDMA self-organizing network, and allocating and arranging the time slot resources of various types of services in each node in a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services also includes: When calculating the time slot resource requirement of the non-real-time streaming media service, a mean smoothing strategy is adopted.

7. The QoS time slot allocation method in a TDMA ad hoc network according to claim 3, characterized in that: The step of collecting the time slot resource requirements of various types of services of all nodes in a preset period through the decision center node in the TDMA self-organizing network, and allocating and arranging the time slot resources of various types of services in each node in a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services also includes: When calculating the time slot resource requirements of the non-real-time streaming media service and the low-priority service, a mean smoothing strategy is adopted.

8. A QoS time slot allocation system in a TDMA ad hoc network, characterized in that: include: Resource partitioning module, allocation scheduling module and allocation validation module; among which, A resource division module, used to divide the wireless resources of the TDMA ad hoc network with time slots as the smallest unit, and to group a plurality of the time slots into time frames; An allocation and scheduling module is used to collect the time slot resource requirements of various types of services of all nodes in a preset period through a decision center node in the TDMA ad hoc network, and allocate and schedule the time slot resources of various types of services in each node in a time frame in the next preset period according to the time slot resource requirements and preset priorities of various types of services; The allocation effectiveness module is used to send the allocation scheduling result of the time slot resources to each node through a time slot allocation message, and each node receives the time slot allocation message to obtain the allocation scheduling result, and sends data according to the allocation scheduling result in the next preset period when the preset effectiveness time is reached.

9. A computer device, characterized in that: include: Memory; processor; as well as Computer programs; The computer program is stored in the memory and is configured to be executed by the processor to implement the QoS time slot allocation method in a TDMA ad hoc network as claimed in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: A computer program is stored thereon; the computer program is executed by a processor to implement a QoS time slot allocation method in a TDMA ad hoc network as claimed in any one of claims 1-7.

Images