Method and system for implementing resource reservation based on dynamic tdma resource allocation ad hoc network

Abstract

The application discloses a kind of based on dynamic TDMA resource allocation self-organizing network's resource reservation implementation method and system, method includes the following steps: S1, based on Dijkstra algorithm calculation source node reaches the best path of destination node;S2, according to the best path, source node sends the time slot reservation command of this node and next hop neighbor node to link each node, each node receives time slot reservation command, and the time slot reservation between this node and its next hop neighbor node is completed using self-organizing network link layer dynamic resource scheduling algorithm, and the time slot that reservation succeeds no longer participates in the dynamic resource scheduling of link layer dynamic resource scheduling algorithm dynamic resource scheduling;S3, the service between reservation source node and destination node is transmitted on the best path after completing time slot resource reservation.The application can guarantee data bandwidth between key nodes in self-organizing network, ensure the normal transmission of critical service.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of self-organizing network communication technology, in particular to a resource reservation implementation method and system based on dynamic TDMA resource allocation self-organizing network. BACKGROUND

[0002] The TDMA self-organizing network resource allocation algorithm is the core component of the TDMA self-organizing network, and is the key to whether the TDMA self-organizing network can efficiently utilize channel resources. In the existing self-organizing network link based on the dynamic TDMA model, the nodes within the two-hop range share the time domain resources, and the time domain resources are allocated according to the node load. If the node data load is large, more time domain resources are allocated, and the two-hop range neighbors of the node are allocated less time domain resources. The nodes compete for resources dynamically according to the data volume. In this state, it is difficult to guarantee the QoS (Quality of Service) of the key business, and it is difficult to meet the needs of various business transmissions in actual applications. For example, in the self-organizing network, multiple nodes with large loads compete for transmission resources, and the data bandwidth between key nodes cannot be guaranteed.

[0003] Therefore, how to provide a resource reservation implementation method and system based on dynamic TDMA resource allocation self-organizing network capable of guaranteeing the data bandwidth between key nodes in the self-organizing network is a technical problem that those skilled in the art need to solve. SUMMARY

[0004] Therefore, the present application provides a resource reservation implementation method and system based on dynamic TDMA resource allocation self-organizing network, which can guarantee the data bandwidth between key nodes in the self-organizing network and ensure the normal transmission of key businesses.

[0005] In order to achieve the above purpose, the present application adopts the following technical scheme:

[0006] A resource reservation implementation method based on dynamic TDMA resource allocation self-organizing network, comprising the following steps:

[0007] S1, calculating the best path from the source node to the destination node based on the Dijkstra algorithm;

[0008] S2, according to the best path, the source node sends a time slot reservation command of the node and the next hop neighbor node to each node of the link hop by hop, and after each node receives the time slot reservation command, the self-organizing network link layer dynamic resource scheduling algorithm is used to complete the time slot reservation between the node and the next hop neighbor node, and the successfully reserved time slot does not participate in the dynamic resource scheduling of the link layer dynamic resource scheduling algorithm;

[0009] S3, reserving the transmission of the service between the source node and the destination node on the best path after the time slot resource reservation is completed.

[0010] Further, in the resource reservation implementation method for the self-organizing network based on dynamic TDMA resource allocation, S1 comprises: calculating the shortest path from the source node to the destination node based on the Dijkstra algorithm, and if there are multiple shortest paths, screening the best path according to the channel quality.

[0011] Further, in the resource reservation implementation method for the self-organizing network based on dynamic TDMA resource allocation, the screening principle of the best path in S1 is: according to the communication rate level corresponding to the signal-to-noise ratio of each hop in each shortest path, combining the time domain resource multiplexing principle within two hops, taking the shortest path with the largest link communication capacity as the best path.

[0012] Further, in the resource reservation implementation method for the self-organizing network based on dynamic TDMA resource allocation, in S2, when the time slots of all nodes on the best path are successfully reserved, the state of each node and the change of the best path are monitored in a timely manner, and if the best path changes, S2 is repeatedly executed.

[0013] Further, in the resource reservation implementation method for the self-organizing network based on dynamic TDMA resource allocation, in S2, the frame structure in the self-organizing network link layer is divided into time slots, subframes and complex frames; a complex frame contains 16 subframes; a subframe contains sensing, multi-frequency broadcast, fixed time slots, fusion time slots and dynamic time slots; wherein, the dynamic time slots are dynamically scheduled according to the business congestion degree, the reserved resources are only allocated in the dynamic time slots, and twice collision detection is required between neighbor nodes in the allocation process.

[0014] Further, in the resource reservation implementation method for the self-organizing network based on dynamic TDMA resource allocation, in S2, the time slot reservation process between the node and the next hop neighbor node is:

[0015] After the sending end receives the application for resource reservation, the resource reservation operation is performed, and the information obtained by the resource reservation is put into the REQ message, and then the REQ message is sent to the one-hop neighbor node of the sending end, i.e. the receiving end;

[0016] After the receiving end receives the REQ message, the information of the resource reservation is detected for collision, if no collision is found, the resource reservation information sent by the sending end is stored, and the information of the successful reservation is put into the RSP message, and then the RSP message is sent to the one-hop neighbor node of the receiving end, including the sending end.

[0017] After the sending end receives the RSP message, it checks whether there is a time slot conflict in the returned message, if not, it stores all the messages related to the reserved resources in the RSP message, and transmits the successfully reserved message to the MAC layer in the self-organizing network link layer.

[0018] Further, in the above-mentioned resource reservation implementation method based on dynamic TDMA resource allocation ad hoc network, in S3, a data source node and a destination node flag is added in the service data transmitted on the link reserving time slot resources from the source node to the destination node, and the service data is only transmitted hop by hop on each node of the link reserving time slot resources, each node identifies the flag and forwards the service data using the reserved time slot resources.

[0019] The application further provides a resource reservation implementation system based on dynamic TDMA resource allocation ad hoc network, comprising:

[0020] a routing module, configured to calculate a best path from a source node to a destination node based on a Dijkstra algorithm and control transmission of service from the source node to the destination node on the best path;

[0021] a resource reservation control module, configured to make the source node send a time slot reservation command of a next hop neighbor node of the source node to each node of the link hop by hop according to the best path;

[0022] a time slot allocation module, configured to complete time slot reservation between the node and the next hop neighbor node of the node using a dynamic resource scheduling algorithm of an ad hoc network link layer after the node receives the time slot reservation command, and the reserved time slot is not involved in dynamic resource scheduling of the dynamic resource scheduling algorithm of the ad hoc network link layer.

[0023] Further, in the above-mentioned resource reservation implementation system based on dynamic TDMA resource allocation ad hoc network, the resource reservation control module is further configured to monitor states of each node and changes of the best path in a timely manner after time slots of all nodes on the best path are successfully reserved.

[0024] Further, in the above-mentioned resource reservation implementation system based on dynamic TDMA resource allocation ad hoc network, further comprising a remote control module, configured to remotely send a time slot allocation requirement to the time slot allocation module and transmit a node state monitoring message.

[0025] According to the above technical solution, compared with the prior art, the application provides a resource reservation implementation method and system based on dynamic TDMA resource allocation ad hoc network, which reserves a transmission time slot at a physical layer hop by hop according to a best path, and the reserved time slot is not involved in dynamic resource scheduling of a dynamic resource scheduling algorithm of a link layer, thereby avoiding time slot conflict, efficiently using channel resources, guaranteeing transmission of critical service data according to a specified reserved link, and ensuring data bandwidth between critical nodes. BRIEF DESCRIPTION OF DRAWINGS

[0026] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the following will briefly introduce the drawings needed to be used in the embodiments or prior art description. Obviously, the drawings in the following description only only the embodiments of the present application, and for those skilled in the art, other drawings can be obtained without creative labor on the basis of the provided drawings.

[0027] Figure 1 The flow chart of the resource reservation implementation method of the self-organizing network based on dynamic TDMA resource allocation provided by the present application;

[0028] Figure 2 The self-organizing network link layer structure diagram provided by the present application;

[0029] Figure 3 The time slot reservation flow chart provided by the present application;

[0030] Figure 4 The structure block diagram and data flow direction schematic diagram of the resource reservation implementation system of the self-organizing network based on dynamic TDMA resource allocation provided by the present application. DETAILED DESCRIPTION

[0031] The technical solutions in the embodiments of the present application will be described clearly and completely below with the drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, not all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative labor are within the protection scope of the present application.

[0032] As shown in Figure 1 The present application discloses a resource reservation implementation method of a self-organizing network based on dynamic TDMA resource allocation, comprising the following steps:

[0033] S1, calculating the best path from the source node to the destination node based on Dijkstra algorithm;

[0034] S2, according to the best path, the source node sends the time slot reservation command of the node and the next hop neighbor node to each node in the link hop by hop, after each node receives the time slot reservation command, the self-organizing network link layer dynamic resource scheduling algorithm is used to complete the time slot reservation between the node and the next hop neighbor node, and the reserved time slot does not participate in the dynamic resource scheduling of the link layer dynamic resource scheduling algorithm;

[0035] S3, reserving the service between the source node and the destination node to be transmitted on the best path after the time slot resource reservation is completed.

[0036] In a self-organizing network link based on a dynamic TDMA model, nodes within a two-hop range share time domain resources, the time domain resources are allocated according to the node load, and the more the data load of a node, the more time domain resources are allocated to the node, and the less time domain resources are allocated to the neighbors within the two-hop range of the node. The nodes compete for resources dynamically according to the data volume. In this state, it is difficult to guarantee the QoS (quality of service) of the key service.

[0037] In a specific example, as shown in Figure 2 When the load of link 1 is large, the time domain resources obtained by link 2 after dynamic resource negotiation and allocation are small. If there is a key service on link 2, the quality of service will be affected by the service on link 1, and it is difficult to guarantee the continuous and stable link quality. The above-mentioned method of the application realizes the method of reserving fixed data bandwidth resources between any two nodes in a self-organizing network. When the 1->3 direction resource reservation of link 2 is configured, no matter how large the load of link 1 is, the 1->3 direction of link 2 can guarantee a fixed data bandwidth, and the data bandwidth between key nodes can guarantee the quality of service of the key service.

[0038] Next, each step is further described.

[0039] S1, based on the Dijkstra algorithm, the best path from the source node to the destination node is calculated, specifically including:

[0040] Based on the Dijkstra algorithm, the shortest path from the source node to the destination node is calculated. If there are multiple shortest paths at the same time, according to the communication rate level corresponding to the signal-to-noise ratio of each hop in each shortest path and the principle of time domain resource multiplexing within a two-hop range, the one with the maximum link communication capacity is recommended as the best path. This step can reduce the system load, improve the reliability of the reserved link, and reduce the transmission delay.

[0041] S2 mainly performs flow reservation control, path node state monitoring and best path change monitoring. The specific steps are:

[0042] 1) receiving and processing user reservation requests;

[0043] 2) according to the user request, querying the destination node path, and selecting the best path recommended by the route;

[0044] 3) according to the best path, the source node sends time slot reservation commands of the node and the next node to each node of the link hop by hop, and each node receives the time slot reservation command, and uses the self-organizing network link layer dynamic resource scheduling algorithm to complete the time slot reservation between the node and the next hop neighbor node;

[0045] 4) after the time slot reservation of all nodes on the best path is successful, the state of each node and the change of the best path are monitored regularly. If the best path changes, step 3) is executed, otherwise step 4) is repeated.

[0046] Specifically, the frame structure in the ad hoc network link layer is divided into time slots, subframes and complex frames; the complex frame contains 16 subframes; the subframe contains perception, multi-frequency broadcast, fixed time slot, fusion time slot and dynamic time slot; wherein, the dynamic time slot is dynamically scheduled according to the congestion degree of the service, the reserved resources are only allocated in the dynamic time slot, and two collision detections are required between the neighbor nodes in the allocation process. The dynamic time slot allocation avoids time domain collision within two-hop range of nodes through two handshakes (i.e. two collision detections) between neighbor nodes, and realizes time domain multiplexing outside two-hop range, which has the beneficial effects of reserving transmission time slots at the physical layer hop by hop according to the best path, avoiding time slot collision problem, and efficiently utilizing channel resources.

[0047] Next, the time slot reservation process between two neighbor nodes is further described, as shown in Figure 3 The signaling for reserving time slot resources is divided into a sending end and a receiving end, and message transmission is performed through REQ and RSP.

[0048] The sending end receives the application for resource reservation and performs resource reservation operation, and puts the information obtained by resource reservation into the REQ message, and then sends the REQ message to the one-hop neighbor node of the sending end, i.e. the receiving end.

[0049] The receiving end receives the REQ message, detects the collision of the information for resource reservation, if no collision is found, stores the resource reservation information sent by the sending end, and puts the information of successful reservation into the RSP message, and then sends the RSP message to the one-hop neighbor node of the receiving end, which includes the sending end.

[0050] The sending end receives the RSP message, checks whether there is a time slot collision in the returned message, if not, stores all the messages related to the reserved resources in the RSP message, and transmits the successfully reserved message to the MAC layer in the networking link layer.

[0051] There are two collision avoidance operations in the whole signaling process of time slot resource reservation, one is when the sending end starts the resource reservation operation by constructing the REQ message, and the other is when the receiving end processes the REQ message, so the process of two handshakes (i.e. the process of REQ and RSP) can guarantee that there is no time slot collision problem in the reserved resources, and in order to avoid the error that the receiving end does not receive the RSP message and mistakenly thinks that the reservation is successful, the time slot for resource reservation will not be used when the RSP message is not received, and the validity of the stored resource reservation time slot is only kept for one subframe.

[0052] In S3, a data source node and a destination node flag is added in the service data transmitted on the link reserving time slot resources between the source node and the destination node, and the service data is only hop-by-hop transmitted on each node of the link reserving time slot resources, each node identifies the flag and forwards the service data using the reserved time slot resources, and other data is forwarded according to time slot competition. This step can ensure that the data of the key user is transmitted according to the specified reserved link, and the key data is guaranteed in the reserved data bandwidth.

[0053] In other embodiments, the steps of transmitting a time slot allocation requirement command remotely, and remotely monitoring node status and message transmission are further included.

[0054] As shown in Figure 4 , the embodiment of the present application further provides a resource reservation implementation system based on dynamic TDMA resource allocation ad hoc network, comprising:

[0055] a routing module for calculating the best path from the source node to the destination node based on Dijkstra algorithm, and controlling the transmission of the service between the source node and the destination node on the best path;

[0056] a resource reservation control module for sending the time slot reservation command of the next hop neighbor node of the current node to each node hop-by-hop along the best path according to the best path;

[0057] a time slot allocation module for reserving the time slot between the current node and the next hop neighbor node of the current node using the dynamic resource scheduling algorithm of the ad hoc network link layer after each node receives the time slot reservation command, and the reserved time slot is not involved in the dynamic resource scheduling of the dynamic resource scheduling algorithm of the link layer.

[0058] The MAC in the time slot allocation module Figure 4 has two functions in general, one is time slot management, i.e. allocating the reserved time slot for each node, and the other is data transmission, i.e. receiving the time slot reservation command and feeding back the time slot allocation result to the resource reservation control module.

[0059] In one embodiment, the routing module provides not only the calculation of the best path, but also the multi-path transmission control function and the whole network topology query function. In terms of multi-path transmission control, the multi-path transmission function can be closed, and the data of the key user can be transmitted in parallel on multiple paths before the time slot resource reservation for the path is configured, and after the time slot resource reservation, the key user data adds the flag and the path, and the node can only transmit according to the path carried by the data frame.

[0060] In terms of whole network topology query, the topology information contains parameters such as the IP address of the network entry node.

[0061] In another embodiment, the resource reservation control module is configured to monitor the status of each node and the change of the optimal path in time after the time slots of all nodes on the optimal path are successfully reserved.

[0062] In one embodiment, the method further comprises:

[0063] The remote control module is configured to send the time slot allocation requirement to the time slot allocation module and transmit the node status monitoring message.

[0064] The source node of the time slot resource reservation can initiate control and query commands to each node on the link by means of the remote control module, which provides a point-to-point remote control data transmission channel. The source node directly sends the time slot allocation requirement to the MAC of the local node, and sends the control command to the remote control module of the remote node through the remote control module, which sends the time slot allocation requirement to the MAC of the remote node. In addition to the time slot allocation requirement command, the remote control module also provides transmission of the node status monitoring message. The remote control channel is implemented based on UDP, and the source node queries the IP address of the remote node by means of the topology information provided by the routing.

[0065] The embodiments in the specification are described in a progressive manner, and each embodiment focuses on the difference from other embodiments. The same or similar parts between the embodiments can be referred to each other. For the device disclosed in the embodiments, since it corresponds to the method disclosed in the embodiments, the description is relatively simple, and the relevant parts can be referred to the method part.

[0066] The above description of the disclosed embodiments enables a person skilled in the art to implement or use the present application. Various modifications to the embodiments will be apparent to those skilled in the art, and the general principles defined herein can be implemented in other embodiments without departing from the spirit or scope of the present application. Therefore, the present application will not be limited to the embodiments shown herein, but will conform to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A method for resource reservation implementation in ad hoc networks based on dynamic TDMA resource allocation, characterized in that, The method comprises the following steps: S1, calculating the optimal path from the source node to the destination node based on the Dijkstra algorithm; S2, according to the optimal path, the source node sends the time slot reservation command of the node and the next hop neighbor node to each node of the link hop by hop, after each node receives the time slot reservation command, the time slot reservation between the node and the next hop neighbor node is completed by using the dynamic resource scheduling algorithm of the ad hoc network link layer, and the successfully reserved time slot is not involved in the dynamic resource scheduling of the dynamic resource scheduling algorithm; the time slot reservation process between the node and the next hop neighbor node is as follows: After the sending end receives the application of resource reservation, the sending end performs the resource reservation operation, and puts the information obtained by the resource reservation into the REQ message, and then sends the REQ message to the one-hop neighbor node of the sending end, i.e. the receiving end; After the receiving end receives the REQ message, the information of the resource reservation is detected for conflict, if no conflict is found, the resource reservation information sent by the sending end is stored, and the successfully reserved information is put into the RSP message, and then the RSP message is sent to the one-hop neighbor node of the receiving end, including the sending end; After the sending end receives the RSP message, it is checked whether there is a time slot conflict in the returned message, if not, all the messages related to the reserved resources in the RSP message are stored, and the successfully reserved message is transmitted to the MAC layer in the networking link layer; S3, the service between the source node and the destination node is transmitted on the optimal path after the time slot resource reservation is completed.

2. The method of claim 1, wherein the method further comprises: S1 comprises: Based on the Dijkstra algorithm, the shortest path from the source node to the destination node is calculated, if there are multiple shortest paths at the same time, the best path is selected according to the channel quality.

3. The method of claim 2, wherein the method further comprises: The selection principle of the best path in S1 is that according to the communication rate level corresponding to the signal-to-noise ratio of each hop in each shortest path, combined with the time domain resource multiplexing principle within two hops, the shortest path with the largest link communication capacity is selected as the best path.

4. The method of claim 1, wherein the method further comprises: In S2, after the time slots of all nodes on the best path are successfully reserved, the state of each node and the change of the best path are monitored at regular intervals, if the best path changes, S2 is repeated.

5. The method of claim 1, wherein the method further comprises: In S2, the frame structure in the ad hoc network link layer is divided into time slots, subframes and complex frames; the complex frame contains 16 subframes; the subframe contains sensing, multi-frequency broadcast, fixed time slot, fusion time slot and dynamic time slot; wherein, the dynamic time slot is dynamically scheduled according to the business congestion degree, the reserved resource is only allocated in the dynamic time slot, and twice collision detection is required between neighbor nodes in the allocation process.

6. The method of claim 1, wherein the method further comprises: In S3, in the business data transmitted on the link reserving time slot resources between the source node and the destination node, the data source node and the destination node are marked, and the business data is transmitted hop by hop only on the nodes of the link reserving time slot resources, each node identifies the mark and forwards the business data using the reserved time slot resources.

7. A system for implementing resource reservation in an ad hoc network based on dynamic TDMA resource allocation, characterized in that, The method comprises the following steps: A routing module is configured to calculate the optimal path from the source node to the destination node based on the Dijkstra algorithm, and control the service between the source node and the destination node to be transmitted on the optimal path. a resource reservation control module, configured to make the source node send a time slot reservation command of a next-hop neighbor node to each node on the optimal path hop by hop; a time slot allocation module, configured to complete time slot reservation between the node and the next-hop neighbor node by using a dynamic resource scheduling algorithm of a link layer of the ad hoc network after the node receives the time slot reservation command, and the successfully reserved time slot is no longer involved in the dynamic resource scheduling of the dynamic resource scheduling algorithm of the link layer.

8. The system for resource reservation in ad hoc networks based on dynamic TDMA resource allocation according to claim 7, characterized in that, The resource reservation control module is further configured to monitor the state of each node and the change of the optimal path at a regular time after the time slots of all nodes on the optimal path are successfully reserved.

9. The system for resource reservation in ad hoc networks based on dynamic TDMA resource allocation according to claim 7, wherein, The method further comprises: a remote control module, configured to remotely send a time slot allocation requirement to the time slot allocation module and transmit a node state monitoring message.

Images