A dynamic TDMA time slot allocation method based on node priority

By dividing time frames into control periods and service periods, and dynamically adjusting service slot occupation according to node priority and service needs, the problem of difficulty in adjusting node access channel capabilities in the prior art is solved, and the channel resource utilization rate and Access satisfaction of high priority nodes.

CN113939030BActive Publication Date: 2024-11-05THE 54TH RESEARCH INSTITUTE OF CHINA ELECTRONICS TECHNOLOGY GROUP CORPORATION
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202111272391.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-10-29
Publication Date
2024-11-05
Estimated Expiration
2041-10-29

AI Technical Summary

Technical Problem

The existing dynamic TDMA protocol cannot adjust the node's access channel capability according to node characteristics, resulting in low channel utilization among different nodes.

Method used

Using a dynamic TDMA slot allocation method based on node priority, time frames are divided into control periods and service periods. The node dynamically adjusts the occupation of service slots according to priority and service requirements, and performs time slot requests and allocations through control packets to ensure that The access requirements of high-priority nodes are met first.

Benefits of technology

It realizes that nodes dynamically adjust the number of service slots according to traffic volume and priority, improve channel resource utilization, and ensure that the access requirements of high-priority nodes are met first.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113939030B_ABST
    Figure CN113939030B_ABST
Patent Text Reader

Abstract

The invention discloses a dynamic TDMA time slot allocation method based on node priority, and relates to the field of wireless communication. In the method, a time frame is divided into two parts: a control period and a service period; the control time slot in the control period is fixedly occupied, and the service time slot in the service period is dynamically acquired, and the node sends and receives control packets in the control period, and sends and receives service data in the service period; at the same time, the nodes in the network are divided into two categories of high priority and low priority, and when a time slot application conflict occurs, the high priority node can obtain the service time slot first, and when the high priority node has no time slot available, the low priority node can be required to release part of the service time slot, so the high priority node has a higher service time slot acquisition capability.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to the field of wireless communications, and in particular to a dynamic TDMA time slot allocation method based on node priority. Background Art

[0002] According to the different ways of allocating time slots to users, TDMA can be divided into dynamic time slot allocation and fixed time slot allocation. Fixed time slot allocation has poor flexibility and low channel utilization in many application scenarios. Therefore, dynamic time slot allocation strategy is one of the key research directions of TDMA protocol.

[0003] For TDMA protocols that use dynamic time slot allocation strategies, a time frame is divided into two or more parts. Nodes complete the occupation of time slots by interactively controlling packets in specific time periods and transmit service data in the time slots they have occupied. The dynamic TDMA protocol can dynamically adjust the number of time slots occupied according to the service needs of the nodes, so it has higher flexibility and channel utilization.

[0004] In many application scenarios, different nodes have different channel access requirements, and the existing time slot allocation method for dynamic TDMA cannot adjust the ability of nodes to access channels according to node characteristics. Summary of the invention

[0005] The object of the present invention is to provide a dynamic TDMA time slot allocation method based on node priority, which can adjust the node access channel capability according to different node priorities.

[0006] In order to achieve the above object, the technical solution adopted by the present invention is:

[0007] A dynamic TDMA time slot allocation method based on node priority comprises the following steps:

[0008] (1) A time frame is divided into two parts: control period and service period;

[0009] (2) The control period consists of N control time slots, where N is the maximum number of nodes in the entire network at the same time; the service period consists of M service time slots, where M ≥ N;

[0010] (3) After a node joins the network, it occupies a fixed control time slot in the control period, and this time slot remains unchanged during the operation of the network;

[0011] (4) After a time frame period starts, a node listens to the time slot request control packets, request reply control packets, and time slot occupancy control packets sent by its neighbor nodes in the control time slots not occupied by it, and updates the local time slot occupancy information according to the time slot occupancy control packets;

[0012] (5) When the current time slot is the control time slot occupied by the node, the node calculates the service time slot occupancy of the current time frame according to the received request reply control packet, and sends a time slot occupancy control packet in combination with the time slot occupancy information of the local neighboring node; if the node receives a time slot release request from a high-priority node and the node is a low-priority node, it randomly selects an occupied service time slot with probability p for release and no longer initiates a service time slot request; otherwise, the node selects an idle service time slot to initiate an application according to the current time slot occupancy and service volume, and sends a time slot request control packet according to the time slot application situation; the node completes the allocation of the corresponding time slot according to the time slot request control packet intercepted, and sends a request reply control packet according to the time slot allocation situation;

[0013] (6) After the control period ends, the node sends service information in the service time slots that it successfully occupies, and listens to the service information sent by neighboring nodes in the service time slots that it does not occupy.

[0014] Furthermore, the structures of the time slot request control packet, the time slot occupancy control packet and the request reply control packet in step (3) are:

[0015] The time slot request control packet consists of four parts: source node number, priority flag, time slot release information, and application time slot number. The source node number is the number of the node and corresponds to the control packet it occupies. The priority flag is represented by 0 and 1, where 0 represents a low priority node and 1 represents a high priority node. The time slot release information is used to indicate the time slot release requirements of the node and neighboring nodes. The application time slot number indicates which service time slots the node has initiated an application for.

[0016] The time slot occupancy control packet consists of three parts: the source node number, the time slot occupancy information of the local node, and the time slot occupancy information of the neighboring node; among them, the time slot occupancy information of the local node is used to indicate the service time slot occupancy of the node, and the time slot occupancy information of the neighboring node is used to indicate the time slot occupancy of the neighboring node;

[0017] The request reply control packet consists of two parts: the source node number and the time slot application reply. The time slot application reply is the node's reply to the neighbor's service time slot application.

[0018] Furthermore, in step (5), the node calculates the service time slot occupancy of the current time frame according to the received request reply control packet, specifically in the following manner:

[0019] The node receives the request reply control packets sent by all neighboring nodes. For the service time slot initiated by the node in the previous time frame period, if all neighboring nodes assign the node to the node, the node successfully occupies the service time slot, otherwise the node gives up occupying the service time slot.

[0020] Furthermore, in step (5), the node selects an idle service time slot to initiate an application based on the current time slot occupancy and service volume, specifically in the following manner:

[0021] When the service time slots occupied by a node cannot meet the transmission requirements, an application is initiated for an idle service time slot. The principles for selecting an idle time slot are:

[0022] Business time slots that have been occupied within a two-hop range cannot be applied for; low-priority nodes cannot apply for business time slots that have been applied for by low-priority and high-priority neighbor nodes; high-priority nodes can initiate applications for business time slots that have been applied for by low-priority neighbor nodes; if the allocated business time slots are allocated to low-priority nodes, and the low-priority node and the high-priority node that will initiate the time slot application are one-hop neighbors, the high-priority node can still initiate applications for the allocated time slots, and in other cases, applications cannot be initiated for business time slots that have been allocated by neighbor nodes; if the number of idle time slots available for the node to apply for cannot meet the business needs, applications are initiated for all available idle time slots, otherwise some business time slots are randomly selected for application; if the node is a high-priority node, when there are no idle time slots available for application, a time slot release request is written into the time slot release information.

[0023] Furthermore, in step (5), the node completes the allocation of the corresponding time slot according to the time slot request control packet intercepted, specifically in the following manner:

[0024] When only one node applies for a service time slot, the service time slot is allocated to the applying node; when multiple nodes apply for the same service time slot, if the nodes have different priorities, the time slot is allocated to the high-priority node; if the nodes have the same priority, the time slot is allocated to the node that first applied for the time slot.

[0025] Furthermore, the probability p in step (5) is calculated as follows:

[0026]

[0027] Among them, N1 is a high-priority node with a time slot release requirement within two hops, and N all A node that has a business time slot application requirement within a two-hop range.

[0028] The beneficial effects of adopting the above technical solution are:

[0029] 1. The method of the present invention can enable a node to dynamically adjust the number of occupied service time slots according to its service volume and priority, and give priority to meeting the access needs of high-priority nodes while allocating them on demand.

[0030] 2. The method of the present invention can realize spatial multiplexing of service time slots and has a high channel resource utilization rate. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] Figure 1 It is a time frame structure diagram of the present invention.

[0032] Figure 2 It is a diagram of the structure of the time slot request control packet of the present invention.

[0033] Figure 3 It is a diagram of the structure of the request reply control packet of the present invention.

[0034] Figure 4 It is a diagram of the time slot occupancy control group structure of the present invention.

[0035] Figure 5 It is a time slot allocation flow chart of the present invention. DETAILED DESCRIPTION

[0036] The present invention will be further described in detail below in conjunction with the accompanying drawings.

[0037] A dynamic TDMA time slot allocation method based on node priority, the specific steps are as follows:

[0038] (1) A time frame is divided into two parts: control period and service period. Figure 1 As shown;

[0039] (2) The control period consists of N control time slots, where N is the maximum number of nodes in the entire network at the same time. The service period consists of M service time slots, where the value of M is greater than or equal to N;

[0040] (3) After a node joins the network, it occupies a fixed control time slot in the control period, and this time slot remains unchanged during the operation of the network.

[0041] (4) After a time frame period begins, a node listens to the time slot request control packets sent by its neighbor nodes in the control time slots not occupied by it (see Figure 2 ), request reply control packet (see Figure 3 ) and time slot occupancy control packets (see Figure 4 ) and update the local time slot occupancy information according to the time slot occupancy control group.

[0042] (5) When the current time slot is the control time slot occupied by this node, the node calculates the service time slot occupancy of the current time frame based on the received request reply control packet, and sends the time slot occupancy control packet in combination with the time slot occupancy information of the local neighboring node; if the node receives a time slot release request from a high-priority node and the node is a low-priority node, it randomly selects an occupied service time slot with probability p to release it and no longer initiates a service time slot request. On the contrary, the node will select a certain idle service time slot to initiate an application based on the current time slot occupancy and business volume, and send a time slot request control packet based on the time slot application situation; the node completes the allocation of the corresponding time slot based on the time slot request control packet it has heard, and sends a request reply control packet based on the time slot allocation situation.

[0043] (6) After the control period ends, the node sends service information in the service time slots that it successfully occupies, and listens to the service information sent by neighboring nodes in the service time slots that it does not occupy.

[0044] The structures of the time slot request control packet, the time slot occupancy control packet and the request reply control packet in step (4) are specifically as follows:

[0045] The time slot request control packet consists of four parts: source node number, priority flag, time slot release information, and application time slot number. The source node number is the number of the node corresponding to the control packet it occupies. The priority flag is represented by 0 and 1, where 0 represents a low priority node and 1 represents a high priority node. The time slot release information indicates the time slot release requirements of this node and neighboring nodes. The application time slot number part indicates which service time slots the node has initiated an application for.

[0046] The time slot occupancy control packet consists of three parts: the source node number, the time slot occupancy information of the local node, and the time slot occupancy information of the neighboring node. The local node time slot occupancy information indicates the service time slot occupancy of the node, and the neighboring node time slot occupancy information indicates the time slot occupancy of the neighboring node.

[0047] The request reply control packet consists of two parts: the source node number and the time slot application reply. The time slot application reply is the node's reply to the neighbor's service time slot application.

[0048] like Figure 5 As shown, the specific method of step (5) is as follows:

[0049] Compute node service time slot occupancy:

[0050] The node receives the request reply control packets sent by all neighboring nodes. For the service time slot initiated by the node in the previous time frame period, if all neighboring nodes assign the node to the node, the node successfully occupies the service time slot, otherwise the node gives up occupying the service time slot.

[0051] Idle service time slot selection: When the service time slots occupied by a node cannot meet the transmission requirements, an application for idle service time slots will be initiated. The principles for selecting idle time slots are:

[0052] The service time slots that have been occupied within the two-hop range cannot be applied for; low-priority nodes cannot apply for service time slots that have been applied for by low-priority and high-priority neighbor nodes; high-priority nodes can initiate applications for service time slots that have been applied for by low-priority neighbor nodes; if the allocated service time slots are allocated to low-priority nodes, and the low-priority node and the high-priority node that will initiate the time slot application are one-hop neighbors, the high-priority node can still initiate applications for the allocated time slots. In other cases, applications cannot be initiated for service time slots that have been allocated by neighbor nodes. If the number of idle time slots available for the node to apply for cannot meet the service demand, an application is initiated for all available idle time slots, otherwise some service time slots are randomly selected for application. At the same time, if the node is a high-priority node, when there are no idle time slots available for application, a time slot release request is written into the time slot release information.

[0053] Business time slot allocation:

[0054] When only one node applies for a service time slot, the service time slot is allocated to the applying node; when multiple nodes apply for the same service time slot, if the nodes have different priorities, the time slot is allocated to the high-priority node; if the nodes have the same priority, the time slot is allocated to the node that first applied for the time slot.

[0055] The probability p in step (5) is calculated as follows:

[0056]

[0057] Where N1 is a high-priority node with a time slot release requirement within two hops, and N all A node that has a business time slot application requirement within a two-hop range.

[0058] In summary, the present invention divides a time frame into two parts: a control period and a business period; the control time slots in the control period are fixedly occupied, and the business time slots in the business period are dynamically acquired. The nodes send and receive control packets in the control period, and send and receive business data in the business period; at the same time, the nodes in the network are divided into two categories, high priority and low priority. When a time slot application conflict occurs, the high priority node can obtain the business time slot first. At the same time, when the high priority node has no time slot available, the low priority node can be required to release some business time slots. Therefore, the high priority node has a higher business time slot acquisition capability.

Claims

1. A dynamic TDMA time slot allocation method based on node priority, characterized in that: The following steps are involved: (1) A time frame is divided into two parts: control period and service period; (2) The control period consists of N control time slots, where N is the maximum number of nodes in the entire network at the same time; The service period consists of M service time slots, M ≥ N; (3) After a node enters the network, it occupies a fixed control time slot in the control period, and this will remain unchanged during the operation of the network. The structures of the time slot request control packet, the time slot occupation control packet, and the request reply control packet are as follows: The time slot request control packet consists of four parts: source node number, priority flag, time slot release information, and application time slot number. The source node number is the number of the node and corresponds to the control packet it occupies. The priority flag is represented by 0 and 1, where 0 represents a low priority node and 1 represents a high priority node. The time slot release information is used to indicate the time slot release requirements of the node and neighboring nodes. The application time slot number indicates which service time slots the node has initiated an application for. The time slot occupancy control packet consists of three parts: the source node number, the time slot occupancy information of the local node, and the time slot occupancy information of the neighboring node; among them, the time slot occupancy information of the local node is used to indicate the service time slot occupancy of the node, and the time slot occupancy information of the neighboring node is used to indicate the time slot occupancy of the neighboring node; The request reply control packet consists of two parts: the source node number and the time slot application reply. The time slot application reply is the node's reply to the neighbor's service time slot application; (4) After a time frame period starts, a node listens to the time slot request control packets, request reply control packets, and time slot occupancy control packets sent by its neighbor nodes in the control time slots not occupied by it, and updates the local time slot occupancy information according to the time slot occupancy control packets; (5) When the current time slot is the control time slot occupied by this node, the node calculates the service time slot occupancy of the current time frame according to the received request reply control packet, and sends a time slot occupancy control packet in combination with the time slot occupancy information of the local neighbor node; if the node receives a time slot release request from a high-priority node and the node is a low-priority node, it randomly selects an occupied service time slot with probability p for release and no longer initiates a service time slot request; otherwise, the node selects an idle service time slot to initiate an application according to the current time slot occupancy and service volume, and sends a time slot request control packet according to the time slot application situation; the node completes the allocation of the corresponding time slot according to the detected time slot request control packet, and sends a request reply control packet according to the time slot allocation situation; wherein, the node selects an idle service time slot to initiate an application according to the current time slot occupancy and service volume, and the specific method is as follows: When the service time slots occupied by a node cannot meet the transmission requirements, an application is initiated for an idle service time slot. The principles for selecting an idle time slot are: The service time slots that have been occupied within the two-hop range cannot be applied for; low-priority nodes cannot apply for service time slots that have been applied for by low-priority and high-priority neighbor nodes; high-priority nodes can initiate applications for service time slots that have been applied for by low-priority neighbor nodes; if the allocated service time slots are allocated to low-priority nodes, and the low-priority node and the high-priority node that will initiate the time slot application are one-hop neighbors, the high-priority node can still initiate applications for the allocated time slots, and in other cases, applications cannot be initiated for service time slots that have been allocated by neighbor nodes; if the number of idle time slots available for the node to apply for cannot meet the service demand, an application is initiated for all available idle time slots, otherwise some service time slots are randomly selected for application; if the node is a high-priority node, when there are no idle time slots available for application, a time slot release request is written into the time slot release information; The node completes the allocation of the corresponding time slot according to the time slot request control packet it hears, specifically in the following way: When only one node applies for a service time slot, the service time slot is allocated to the node that applied for it. When multiple nodes apply for the same service time slot, if the nodes have different priorities, the time slot is allocated to the node with the higher priority. If the nodes have the same priority, the time slot is allocated to the node that applied for the time slot first. The probability p is calculated as: Where N1 is the number of high-priority nodes with time slot release requirements within two hops, N all The number of nodes that have business time slot application requirements within two hops; (6) After the control period ends, the node sends service information in the service time slots that it successfully occupies, and listens to the service information sent by neighboring nodes in the service time slots that it does not occupy.

2. A method for dynamic TDMA time slot allocation based on node priority according to claim 1, characterized in that: In step (5), the node calculates the service time slot occupancy of the current time frame according to the received request reply control packet, specifically in the following manner: The node receives the request reply control packets sent by all neighboring nodes. For the service time slot initiated by the node in the previous time frame period, if all neighboring nodes assign the node to the node, the node successfully occupies the service time slot, otherwise the node gives up occupying the service time slot.

Citation Information

Patent Citations

  • Link time slot allocation method based on collision buffer in ad hoc TDMA networks

    CN108990157A

  • Time slot scheduling method based on mobile ad hoc network

    CN112672358A

  • Data transmission method and device and electronic equipment

    CN113099538A

  • User priority based preemption techniques in a time division multiple access multi-hop ad hoc network

    US20090022136A1