Method, medium and apparatus for contention-free resource allocation for tdma data link

Abstract

The application provides a resource allocation method, medium and device for TDMA data chain contention-free, which comprises the following steps: in a terminal access process, network resource application procedure, network resource notification procedure and resource recycling procedure are respectively used for resource allocation, resource synchronization and resource recycling. Compared with the traditional multiple resource contention negotiation procedure, the resource negotiation-free allocation method of the application reduces the conflict negotiation of air interface resources, saves the delay of conflict negotiation and improves the terminal access delay.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and more specifically, to a method, medium, and apparatus for contention-free resource allocation in TDMA data links. Background Technology

[0002] In traditional TDMA data links, the air interface link is divided into a narrowband discovery link and a wideband data link. The terminal completes access and multi-node distributed self-organizing network formation in the narrowband link. There are generally three methods for MAC layer resource allocation:

[0003] 1. Fixed Allocation Multiple Access: The system allocates a fixed amount of channel resources to each node. This method is suitable for scenarios where the number of nodes is fixed and the service is uniform and stable. However, when the number of nodes is small, there is a problem of low resource utilization.

[0004] 2. Random Access Multiple Access: This method allows nodes to randomly occupy channel resources to send data. If the channel resources occupied by different nodes collide, the data will be retransmitted according to certain rules until successful. This method is suitable for a large number of nodes and services with intermittent and bursty characteristics, but it has the problem of high delay due to collisions.

[0005] 3. Dynamic allocation of multiple access on demand: Nodes reserve channel resources in a timely manner according to their own bandwidth requirements. Dedicated channels are needed to manage resource allocation / negotiation / conflicts. Inevitably, there will be resource collisions and negotiations between multiple terminal nodes. Consequently, the air interface requires multiple sub-time slots to interact and resolve conflicts. The numerous and complex interaction processes lead to high air interface latency, which has a significant impact on terminal access latency, especially for TDMA data links in long-distance communication. Summary of the Invention

[0006] The present invention aims to provide a method, medium and apparatus for contention-free resource allocation in TDMA data links, so as to solve the problems existing in the above-mentioned traditional resource allocation methods in TDMA data links.

[0007] This invention provides a contention-free resource allocation method for TDMA data links, comprising:

[0008] During the terminal access process, resource allocation, resource synchronization, and resource recycling are carried out through network access resource application process, network-wide resource announcement process, and resource recycling process, respectively.

[0009] Furthermore, in the network access resource application process, a fair and uniform allocation strategy is adopted to allocate all network resources to nodes waiting to access the network without negotiation.

[0010] Furthermore, the network access resource application process includes:

[0011] A node seeking to join the network initiates a network access resource request to an existing agent node.

[0012] The agent node queries the current network resource usage of all nodes and selects the node with the most resources as the resource allocation node to initiate a resource request;

[0013] Resource allocation nodes allocate resources in their own resource pools according to a binary interval. The application for network access resources is successful when the network proxy node replies with a resource response to the node to be added to the network.

[0014] Furthermore, in the network-wide resource notification process, the network nodes actively notify the network-wide nodes of their resource occupancy status, thereby achieving consistency and synchronization of network-wide resource occupancy status among all network nodes.

[0015] Furthermore, the network-wide resource notification process includes:

[0016] When a node successfully applies for network access resources, the in-network agent node receives the resource response and needs to generate a resource announcement signaling message; when an in-network node leaves the network, the resource recycling node generates the resource announcement signaling message.

[0017] The network-wide resource notification process broadcasts the network-wide resource occupancy status of resource allocation nodes and newly joined nodes, as well as the network-wide resource occupancy status of resource allocation nodes and resource recycling nodes, to the entire network. This information is used by each node in the network to record the network-wide resource occupancy status of all nodes and the overall network resource occupancy status.

[0018] Furthermore, in the resource recycling process, when a node leaves the network, the remaining nodes recycle the resources occupied by the node that left the network.

[0019] Furthermore, the resource recycling process includes:

[0020] When a node leaves the network, the node with the smallest node ID among its 1-hop neighbors is selected as the resource recycling node. The leaving node initiates a resource recycling request to the resource recycling node, which then recycles the resources and allocates them to the resource recycling node. At the same time, the network-wide resource announcement process is triggered.

[0021] When a node goes offline abnormally, the node with the smallest node ID among its 1-hop neighbors is selected as the resource recycling node. The abnormally offline node initiates a network exit resource recycling request to the resource recycling node, which then recycles the resources and allocates the abnormally offline node's resources to the resource recycling node. At the same time, the network-wide resource announcement process is triggered.

[0022] When other nodes in the network receive the network-wide resource notification process triggered by the resource recycling node, they compare it with the locally stored network nodes to identify nodes that have left the network and / or abnormally offline nodes, and clear the network-wide resource usage of nodes that have left the network and / or abnormally offline nodes.

[0023] Furthermore, the resource allocation node needs to periodically check the resource occupancy status of all nodes in the network and reclaim idle resources according to the resource reclamation process.

[0024] The present invention also provides a computer terminal storage medium storing computer terminal executable instructions, which are used to execute the above-described resource allocation method for TDMA data link contention-free operation.

[0025] The present invention also provides a computing device, comprising:

[0026] At least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to perform the above-described resource allocation method for TDMA data link contention-free operation.

[0027] In summary, due to the adoption of the above technical solution, the beneficial effects of the present invention are:

[0028] In the terminal access process, the resource allocation method of the present invention without negotiation reduces the conflict interaction negotiation of air interface resources compared with the traditional multiple resource competition negotiation process, saves the time delay of conflict negotiation, and improves the terminal access latency. Attached Figure Description

[0029] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings in the embodiments will be briefly described below. It should be understood that the following drawings only show some embodiments of the present invention and should not be regarded as a limitation on the scope. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0030] Figure 1 This is a flowchart of a resource allocation method for TDMA data links that avoids contention, as described in an embodiment of the present invention.

[0031] Figure 2 This is a flowchart of the network access resource application process in an embodiment of the invention.

[0032] Figure 3 This is a schematic diagram of the two-part interval in an embodiment of the invention. Detailed Implementation

[0033] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. The components of the embodiments of the present invention described and shown in the accompanying drawings can generally be arranged and designed in various different configurations.

[0034] Therefore, the following detailed description of the embodiments of the invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely to illustrate selected embodiments of the invention. All other embodiments obtained by those skilled in the art based on the embodiments of the invention without inventive effort are within the scope of protection of the invention.

[0035] Example

[0036] like Figure 1 As shown, this embodiment proposes a contention-free resource allocation method for TDMA data links, including:

[0037] During terminal access, resource allocation, synchronization, and recycling are performed using a network access resource application process, a network-wide resource announcement process, and a resource recycling process, respectively. The entire resource allocation process follows the principles of fast application, no negotiation required, and delayed recycling. Therefore, the network access resource application process, network-wide resource announcement process, and resource recycling process are defined as follows:

[0038] (1) Application process for network access resources

[0039] The network access resource application process employs a fair and even allocation strategy, distributing all network resources to nodes seeking network access without negotiation. Specifically, the network access resource application process includes:

[0040] A node seeking to join the network initiates a network access resource request to an existing agent node.

[0041] The agent node queries the current network resource usage of all nodes and selects the node with the most resources as the resource allocation node to initiate a resource request;

[0042] Resource allocation nodes allocate resources in their own resource pools according to a binary interval. The application for network access resources is successful when the network proxy node replies with a resource response to the node to be added to the network.

[0043] Define node roles: Node A to be added to the network, Proxy Node B in the network, Resource Allocation Node C;

[0044] Define a resource management tool: a bitmap showing the overall network resource usage.

[0045] Following the network access resource application process, node A, which is about to join the network, initiates a network access resource application request to the network agent node B. The network agent node B then initiates a resource application to the resource allocation node C, which has the most resources. The resource allocation node C allocates half of its resources from its own resource pool and replies to the network agent node B. The network agent node B then replies to the network agent node A. The allocated resources come from the resource allocation node C's own resource pool, thus avoiding resource conflict negotiation with other network nodes.

[0046] Furthermore, such as Figure 2 , Figure 3 As shown, the method by which resource allocation nodes allocate resources in their own resource pools according to a binary interval includes:

[0047] (a) After receiving a network access resource application, the network agent node sorts the node IDs from high to low according to the bitmap of the total network resource usage stored by itself. If the resource usage is the same, it sorts them in order of the number of hops away from the local network agent node.

[0048] (b) Select the node with the most resources on the network as the resource allocation node to initiate a resource request and allocate resources;

[0049] (c) After receiving a resource request, the resource allocation node divides its own bitmap of total network resource usage into two intervals and indexes it.

[0050] (d) This resource allocation node uses the resource at index 0 and uses the resource at index 1 to form a bitmap of the total network resource occupancy as the resource allocation result for the node to be added to the network;

[0051] (e) Update the bitmap of the total network resource occupancy of this resource allocation node. The data of this resource allocation node will be sent on resource index 0 in the future.

[0052] (f) The allocated index 1 resource is used to form a network-wide resource occupancy bitmap timeslot information response, which is then sent to the node to be added to the network. Example of the network-wide resource occupancy bitmap timeslot information: The smallest granularity of resource allocation is a pair of data frames occupying two consecutive frames; the network-wide resource occupancy bitmap occupies a total of 16 bits. The network-wide resource occupancy bitmap is used to indicate the allocation status of frame resource pairs at corresponding positions; 1 indicates that the resource is occupied, and 0 indicates that it is not occupied.

[0053] (2) Network-wide resource notification process

[0054] In the network-wide resource notification process, on-network nodes proactively notify all network nodes of their resource occupancy status, achieving synchronization of network-wide resource occupancy across all nodes. Specifically, the network-wide resource notification process includes:

[0055] When a node successfully applies for network access resources, the in-network agent node receives the resource response and needs to generate a resource announcement signaling message; when an in-network node leaves the network, the resource recycling node generates the resource announcement signaling message.

[0056] The network-wide resource announcement process broadcasts the network-wide resource occupancy status of resource allocation nodes and newly joined nodes, as well as the network-wide resource occupancy status of resource allocation nodes and resource recycling nodes, to the entire network. This information is used by each node in the network to record the network-wide resource occupancy status of all nodes and to maintain the network-wide resource occupancy status, i.e., the bitmap table.

[0057] (3) Resource recycling process

[0058] In the resource recycling process, when a node leaves the network, the remaining nodes reclaim the resources occupied by the leaving node. Specifically, the resource recycling process includes:

[0059] When a node leaves the network, the node with the smallest node ID among its 1-hop neighbors is selected as the resource recycling node. The leaving node initiates a resource recycling request to the resource recycling node, which then recycles the resources and allocates them to the resource recycling node. At the same time, the network-wide resource announcement process is triggered.

[0060] When a node goes offline abnormally, the node with the smallest node ID among its 1-hop neighbors is selected as the resource recycling node. The abnormally offline node initiates a network exit resource recycling request to the resource recycling node, which then recycles the resources and allocates the abnormally offline node's resources to the resource recycling node. At the same time, the network-wide resource announcement process is triggered.

[0061] When other nodes in the network receive the network-wide resource notification process triggered by the resource recycling node, they compare it with the locally stored network nodes to identify nodes that have left the network and / or abnormally offline nodes, and clear the network-wide resource usage of nodes that have left the network and / or abnormally offline nodes.

[0062] Furthermore, the resource allocation node needs to periodically check the resource occupancy status of all nodes in the network and reclaim idle resources according to the resource reclamation process.

[0063] Furthermore, in some embodiments, a computer terminal storage medium is proposed, storing computer terminal executable instructions for executing the resource allocation method for TDMA data link contention-free operation as described in the preceding embodiments. Examples of computer storage media include magnetic storage media (e.g., floppy disks, hard disks, etc.), optical recording media (e.g., CD-ROMs, DVDs, etc.), or memory such as memory cards, ROMs, or RAMs. The computer storage medium can also be distributed across a network-connected computer system, for example, as an application store.

[0064] Furthermore, in some embodiments, a computing device is proposed, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to perform a contention-free resource allocation method for TDMA data links as described in the preceding embodiments. Examples of computing devices include PCs, tablet computers, smartphones, or PDAs.

[0065] The above description is merely a preferred embodiment of the present invention and is not intended to limit the invention. Various modifications and variations can be made to the present invention by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.

Claims

1. A method for resource allocation for contention-free TDMA data link, characterized in that, Comprise: In the terminal access process, network resource application process, network resource notification process and resource recycling process are used for resource allocation, resource synchronization and resource recycling, respectively; In the network resource application process, a public average allocation strategy is used to allocate all network resources to the node to be accessed without negotiation; The network resource application process comprises: The node to be accessed initiates network resource application to the in-network agent node; The in-network agent node queries the network resource occupation of the current network node, selects the in-network node with the most resources as the resource allocation node to initiate resource application; The resource allocation node allocates resources in its own resource pool according to the binary interval, and replies to the node to be accessed through the in-network agent node to reply to the resource response, that is, the network resource application is successful.

2. The method for resource allocation for TDMA data link contention-free according to claim 1, characterized in that, In the network resource notification process, the in-network node actively notifies the network resource occupation to the network node, so that the network resource occupation of the network node is consistent and synchronized.

3. The method for TDMA data link contention-free resource allocation according to claim 2, characterized in that, The network resource notification process comprises: When the network resource application of the node to be accessed is successful, the in-network agent node successfully receives the resource response and needs to generate resource notification signaling; when the in-network node is offline, the resource recycling node generates resource notification signaling; The network resource notification process broadcasts the network resource occupation of the resource allocation node and the newly accessed node to the network, and the network resource occupation of the resource allocation node and the resource recycling node, which is used for each in-network node to record the network resource occupation of the network node and the network resource occupation.

4. The method for TDMA data link contention-free resource allocation of claim 1, wherein, In the resource recycling process, the node is offline, and the in-network node recycles the resources occupied by the offline node.

5. The method for TDMA data link contention-free resource allocation according to claim 4, characterized in that, The resource recycling process comprises: When the node is offline, find the node with the smallest node ID in its 1-hop neighbor as the resource recycling node, and the offline node initiates the offline resource recycling request to the resource recycling node, and the resource recycling node recycles the resources and allocates the resources of the offline node to the resource recycling node, and triggers the network resource notification process; When the node is offline, find the node with the smallest node ID in its 1-hop neighbor as the resource recycling node, and the offline node initiates the offline resource recycling request to the resource recycling node, and the resource recycling node recycles the resources and allocates the resources of the offline node to the resource recycling node, and triggers the network resource notification process; Other in-network nodes compare the in-network nodes saved locally when receiving the network resource notification process triggered by the resource recycling node, identify the offline node and / or the offline node, and clear the network resource occupation of the offline node and / or the offline node.

6. The method for TDMA data link contention-free resource allocation according to claim 5, wherein, The resource allocation node needs to periodically check the network resource occupation of the network node, and recycle the idle resources according to the resource recycling process.

7. A computer terminal storage medium storing computer terminal executable instructions, characterized in that, The computer terminal executable instructions are used to execute the resource allocation method for TDMA data link contention-free as claimed in any one of claims 1-6.

8. A computing device, comprising: Comprise: At least one processor; and a memory connected in communication with the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method for TDMA data link contention-free resource allocation according to any one of claims 1-6.

Images