Time slot allocation method and device based on two-layer master-slave combined pulse routing protocol

Abstract

The application relates to a time slot allocation method and device based on a two-layer active-passive combined Pulse routing protocol, which comprises the following steps: initiating flooding by a pulse source, obtaining the hop number information from the pulse source by cooperative relaying, and obtaining the neighbor node information within two hops by neighbor interaction; based on the hop number information from the pulse source and the neighbor node information within two hops, establishing a time slot division rule with the pulse source as a center node, and generating a time slot spanning tree; initiating a periodic pulse by the pulse source, obtaining the route to the pulse source by each node, and forwarding according to the time slot spanning tree; determining the transmission nodes which need to transmit data in the network, and initiating route searching based on the transmission nodes to optimize the time slots according to the time slot spanning tree. The application reduces the time slot resource overhead required by the network routing through time slot multiplexing, and the larger the network scale, the less the required time slots, and the better the effect.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of mobile ad hoc network routing protocol, and in particular to a time slot allocation method and device based on two-layer active-passive combined Pulse routing protocol. BACKGROUND

[0002] In the mobile ad hoc network routing protocol, the Pulse routing protocol has gained wide attention for its outstanding advantages of adapting to the drastic changes in network topology and quickly repairing the route. Through periodic initiation of flooding by the pulse source, all nodes obtain the route to the pulse source, only the nodes that need to send or receive data send the reservation packet to respond to the pulse source, the nodes on the path obtain the reverse route, and other nodes are in a dormant state to save resources. At the same time, the Pulse routing protocol optimizes the route by using the listening method, is suitable for high-mobility networks, has high expansion capability and high fault tolerance.

[0003] However, the time slot allocation problem during the periodic pulse of the Pulse routing protocol is a great challenge. The existing 802.11 protocol adopts carrier sense multiple access CDMA / CA to perform data transmission through channel listening and preemption, which adapts to the changes in network topology. However, due to the high uncertainty of random competition, the protocol efficiency is low with the increase of network size. The TDMA protocol allocates resources in a fixed manner, which can achieve high link capacity when the topology is stable. However, its architecture is difficult to adapt to randomness changes. Moreover, due to the randomness of the selection of the pulse source node and the randomness of the location distribution of each node, the above time slot allocation mechanism cannot meet the demand of high mobility and high expansion capability of the Pulse routing protocol. SUMMARY

[0004] Therefore, it is necessary to provide a time slot allocation method and device based on two-layer active-passive combined Pulse routing protocol to solve the existing time slot allocation problem.

[0005] To achieve the above purpose, in a first aspect, the present application provides a time slot allocation method based on two-layer active-passive combined Pulse routing protocol, comprising:

[0006] initiating flooding by the pulse source, obtaining the hop count information from each node to the pulse source through cooperative relaying, and obtaining the neighbor node information within two hops of each node through neighbor interaction;

[0007] based on the hop count information of each node to the pulse source and the neighbor node information within two hops of each node, establishing a time slot division rule with the pulse source as the center node, and generating a time slot spanning tree, the pulse source initiates a periodic pulse, each node obtains the route to the pulse source and forwards according to the time slot spanning tree;

[0008] determining a transmission node in the network that needs data transmission, and initiating routing based on the transmission node to perform time slot optimization according to the time slot spanning tree.

[0009] Further, each node in the network obtains hop information from itself to the pulse source node, including:

[0010] The pulse source initiates flooding, and each node in the network determines hop information from itself to the pulse source node according to the time of receiving a broadcast packet, wherein each node forwards the broadcast packet in the next time slot of the first time slot of receiving the data packet.

[0011] Further, each node obtains neighbor node information within two hops through neighbor interaction, including:

[0012] Each node in the network sends a Hello data packet to a neighbor node in turn to perform neighbor interaction, wherein the Hello data packet includes one-hop neighbor information and hop information from each node to the pulse source;

[0013] After two rounds of neighbor interaction, each node in the network obtains neighbor node information within two hops.

[0014] Further, based on the hop information from each node to the pulse source and the neighbor node information within two hops of each node, a time slot division rule with the pulse source as the center node is established, and a time slot spanning tree is generated, the pulse source initiates a periodic pulse, each node obtains a route to the pulse source and forwards according to the time slot spanning tree, including:

[0015] Based on the neighbor information within two hops of the pulse source, time slots are divided for child nodes and grandchild nodes of the pulse source, a spanning tree based on time slot ordering is obtained, and the spanning tree based on time slot ordering is sent to neighbor nodes of the pulse source as a pulse data packet with the periodic pulse initiated by the pulse source;

[0016] Each node obtains a route to the pulse source, based on two-hop neighbor information of each neighbor node and hop information from the node to the pulse source, time slots are re-divided for grandchild nodes of the pulse source, and the pulse data packet is forwarded to the next neighbor node in the time slot of each neighbor node itself according to the spanning tree based on time slot ordering.

[0017] Further, the routing is initiated based on the transmission node to perform time slot optimization according to the time slot spanning tree, including:

[0018] Reserve time slots available to the transmission node are determined according to the time slot spanning tree;

[0019] If the transmission node is a node that needs data transmission or network access, a reservation data packet is sent to the pulse source in the reserve time slot available to the transmission node, and other nodes on the route path are required to forward the reservation data packet in their own reserve time slot.

[0020] Further, the method further comprises:

[0021] Each node in the network completes dynamic allocation of resource self-negotiation based on neighbor node information.

[0022] Further, each node in the network completes dynamic allocation of resource self-negotiation based on neighbor node information, specifically comprising:

[0023] According to the local time slot table, the time slot ownership applied by the neighbor node is arbitrated according to a preset time slot allocation rule, so as to apply an unoccupied time slot on demand, wherein the time slot is distributed.

[0024] When forwarding a pulse data packet to a neighbor node in a time slot where each node itself is located, each neighbor node updates the local time slot table according to the received pulse data packet, wherein the pulse data packet includes a data time slot application table of each node itself.

[0025] According to the interaction of the pulse data packet between each node and the neighbor node, a time slot of a competition failure is adjusted, and a new data time slot application table is sent to the neighbor node with a reserved data packet, so that the neighbor node arbitrates according to local information and sends a response data packet to the node.

[0026] If each node successfully occupies a time slot, data transmission is performed in a data frame, and if each node does not successfully occupy a time slot, the conflict time slot is released.

[0027] Further, the method further comprises:

[0028] Optimizing routing by listening and sending time slot competition conflict information to each node.

[0029] Further, the method further comprises:

[0030] Each node optimizes a routing path by listening and responding to a neighbor node;

[0031] If each node listens to the data time slot application table in the reserved data packet and the data time slot application table of the node itself exists time slot competition conflict, a response data is sent to the neighbor node, so that the neighbor node releases the conflict time slot.

[0032] In a second aspect, the application also provides a time slot allocation device based on a two-layer active-passive combination Pulse routing protocol, comprising:

[0033] An information acquisition module is configured to initiate flooding by a pulse source, acquire hop count information from the pulse source to each node in the network by cooperative relaying, and obtain neighbor node information within two hops by neighbor interaction of each node.

[0034] a rule establishing module, configured to establish a time slot division rule with a pulse source as a center node based on hop information of each node to the pulse source and neighbor node information within two hops of each node, and generate a time slot spanning tree, the pulse source initiates a periodic pulse, each node obtains a route to the pulse source and forwards according to the time slot spanning tree;

[0035] a time slot optimization module, configured to determine a transmission node in need of data transmission in networking, and initiate a route finding based on the transmission node to perform time slot optimization according to the time slot spanning tree.

[0036] The beneficial effects of the above embodiments are:

[0037] The application optimizes the pulse time slot and reserved time slot division method by obtaining the neighbor node information within two hops through cooperative relaying and neighbor interaction, multiplexes the time slots outside two hops, reduces the time slot overhead, and avoids pulse packet forwarding conflicts; the reserved packet can be sent in the pulse time slot or the reserved time slot, further improving the time slot utilization rate and reducing the network overhead; the time slot application adopts a two-round interaction mode to improve the time slot application success rate, and an interval time slot application method is used to reduce the possibility of time slot application conflicts; the time slots are distributed and dispersed in the entire time frame, data packets can be forwarded in time, the end-to-end delay is effectively reduced compared with the centralized distribution, the time slots outside two hops can be multiplexed, and the time slot utilization rate is improved. BRIEF DESCRIPTION OF DRAWINGS

[0038] Figure 1 A flowchart of an embodiment of a time slot allocation method based on a two-layer active-passive combined Pulse routing protocol provided by the application;

[0039] Figure 2 A frame structure diagram of a time slot allocation method based on a two-layer active-passive combined Pulse routing protocol provided by the application;

[0040] Figure 3 A topology structure diagram provided by an embodiment of the application;

[0041] Figure 4 A parameter setting diagram provided by an embodiment of the application;

[0042] Figure 5 An experimental result diagram provided by an embodiment of the application;

[0043] Figure 6 Another experimental result diagram provided by an embodiment of the application;

[0044] Figure 7 A pulse time slot ordering table diagram of a pulse source, a source node and a destination node in simulation provided by an embodiment of the application;

[0045] Figure 8The data time slot diagram occupied by each node provided by an embodiment of the application;

[0046] Figure 9 The flowchart of an embodiment of the time slot allocation method based on the two-layer active-passive combined Pulse routing protocol provided by the application. DETAILED DESCRIPTION

[0047] The preferred embodiments of the application are specifically described below with reference to the drawings, which form a part of this application. The drawings together with the application's embodiments illustrate the principles of the application, and are used for explaining the application's principles, but are not used to limit the scope of the application.

[0048] In the description of the application, the terms "first", "second" are only used for descriptive purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first", "second" can explicitly or implicitly include at least one of the features. In addition, the meaning of "multiple" is two or more, unless otherwise specifically limited. In this paper, the phrase "embodiment" means that the specific features, structures or properties described in conjunction with the embodiment can be included in at least one embodiment of the application. The appearance of this phrase in the specification does not necessarily mean the same embodiment, nor is it an independent or alternative embodiment that is not mutually exclusive with other embodiments. Those skilled in the art explicitly and implicitly understand that the embodiments described herein can be combined with other embodiments.

[0049] The application provides a time slot allocation method and device based on a two-layer active-passive combined Pulse routing protocol. By means of time slot multiplexing, the time slot resource overhead required for networking routing is reduced, the node time slot conflict problem in the pulse time under the TDMA architecture is solved, and the larger the network size, the less the required time slot proportion, the better the effect.

[0050] The specific embodiments are described in detail below:

[0051] Please refer to Figure 1 , Figure 1 The flowchart of an embodiment of the time slot allocation method based on the two-layer active-passive combined Pulse routing protocol provided by the application, a specific embodiment of the application, discloses a time slot allocation method based on a two-layer active-passive combined Pulse routing protocol, comprising:

[0052] Step S101: Initiate flooding by the pulse source, acquire the hop number information from the pulse source to each node in the network through cooperative relay, and acquire the neighbor node information within two hops through neighbor interaction of each node;

[0053] Step S102: based on the hop information of each node to the pulse source and the neighbor node information within two hops of each node, a time slot division rule is established with the pulse source as the center node, and a time slot generation tree is generated, the pulse source initiates a periodic pulse, each node obtains the route to the pulse source and forwards according to the time slot generation tree;

[0054] Step S103: determining a transmission node in the networking that needs to perform data transmission, and initiating a route search based on the transmission node to perform time slot optimization according to the time slot generation tree.

[0055] First of all, it needs to be pointed out that the frame structure diagram in the time slot allocation method based on the two-layer active-passive combined Pulse routing protocol is as shown in Figure 2 Figure 2 The frame structure diagram of the time slot allocation method based on the two-layer active-passive combined Pulse routing protocol provided by the application. It mainly includes: broadcast frame, neighbor interaction frame, pulse frame, reservation frame and data frame. The broadcast frame and the neighbor interaction frame are mainly used to obtain the hop number of the node to the pulse source and the neighbor information within two hops, which are used as the basis for subsequent pulse time slot and reservation time slot allocation; the pulse frame is mainly used for each node to obtain the route to the pulse source, the reservation frame is mainly used for the pulse source and the nodes on the path to obtain the reverse route of the source node, and the data frame is mainly used for data transmission between nodes.

[0056] The application optimizes the pulse time slot and reservation time slot division method by obtaining the neighbor node information within two hops through cooperative relay and neighbor interaction, multiplexes the time slots outside two hops, reduces the time slot overhead, avoids pulse packet forwarding conflict, the reservation packet can be sent in the pulse time slot or the reservation time slot, further improves the time slot utilization rate, and reduces the network overhead; the time slot application adopts a two-round interaction mode, improves the time slot application success rate, at the same time, adopts an interval time slot application method, reduces the possibility of time slot application conflict, the time slots are distributed and dispersed in the entire time frame, data packets can be forwarded in time, the end-to-end delay is effectively reduced compared with the centralized distribution, the time slots outside two hops can be multiplexed, and the time slot utilization rate is improved.

[0057] In an embodiment of the application, the hop information of each node in the networking to the pulse source node is obtained, including:

[0058] The pulse source initiates flooding, and each node in the networking determines the hop information to the pulse source node according to the time of receiving the broadcast packet, wherein each node forwards the broadcast packet in the next time slot of the first received data packet time slot.

[0059] ​It can be understood that in the broadcast frame, the flooding is initiated by the pulse source, each node in the network determines the hop number from the pulse source according to the time of receiving the broadcast packet, and forwards the broadcast packet in the next time slot, wherein each node forwards the broadcast packet only once, each node obtains the hop number from the pulse source through cooperative relay, and the broadcast frame is set to the maximum supported hop number of time slots.

[0060] In an embodiment of the present application, each node in the network obtains the neighbor node information within two hops, including:

[0061] Each node in the network sends a Hello packet to the neighbor node in turn for neighbor interaction, wherein the Hello packet includes one-hop neighbor information and hop number information of each node from the pulse source;

[0062] After two rounds of neighbor interaction, each node in the network obtains the neighbor node information within two hops.

[0063] It can be understood that in the neighbor interaction frame, each node in the network sends a Hello packet in turn for neighbor interaction according to the size of the MAC address, wherein the Hello packet carries one-hop neighbor information of each node and hop number information from the pulse source, through two rounds of neighbor interaction, each node in the network obtains the neighbor information within two hops and the hop number information from the pulse source, wherein the neighbor interaction frame is set to twice the maximum supported number of nodes of time slots.

[0064] In an embodiment of the present application, based on the hop number information of each node from the pulse source and the neighbor node information within two hops of each node, a time slot division rule is established with the pulse source as the center node, and a time slot spanning tree is generated, the pulse source initiates a periodic pulse, each node obtains a route to the pulse source and forwards according to the time slot spanning tree, including:

[0065] Based on the neighbor information within two hops of the pulse source, time slots are divided for the child nodes and grandchild nodes of the pulse source, a spanning tree based on time slot ordering is obtained, and the spanning tree based on time slot ordering is sent to the neighbor nodes of the pulse source with the pulse data packet of the periodic pulse initiated by the pulse source;

[0066] Each node obtains a route to the pulse source, based on the two-hop neighbor information of each neighbor node and the hop number information of the node from the pulse source, time slots are re-divided for the grandchild nodes of the pulse source, and the pulse data packet is forwarded to the next neighbor node in the time slot where each neighbor node is located according to the spanning tree based on time slot ordering.

[0067] It can be understood that the pulse source divides the pulse time slots for the child nodes and the grandchild nodes according to the two-hop neighbor information, other nodes divide the pulse time slots for the grandchild nodes according to the two-hop neighbor table and the hop number of the nodes from the pulse source, and the time slot order table is forwarded to each node with the pulse packet. The node only orders the grandchild nodes with the hop number greater than itself from the pulse source, if the hop number of the grandchild node from the pulse source is equal to the hop number of the node already ordered in the table, the node re-adjusts the order according to the MAC address, the node with the smaller MAC address obtains the pulse time slot preferentially, so that the conflict of the nodes within two hops can be avoided, and the loop of the ordering can also be avoided.

[0068] In one embodiment of the present application, the method further comprises:

[0069] determining the reserved time slots available for the transmission node according to the time slot spanning tree;

[0070] if the transmission node is a node requiring data transmission or network entry, sending a reserved data packet to the pulse source in the reserved time slot available for the transmission node, and enabling other nodes on the routing path to forward the reserved data packet in the reserved time slot of the node itself.

[0071] It can be understood that the node requiring data transmission can send a reserved data packet in the appropriate pulse time slot or the reserved time slot. The node orders the grandchild nodes based on the received time slot order table, and determines the position of the node according to the new time slot order table. For example, if there are M nodes after the node itself in the time slot order table, the node waits for 2M+1 time slots and then sends a reserved data packet to the pulse source, if the remaining pulse time slots are insufficient, the node sends the reserved packet after leaving corresponding time slots for the subsequent nodes in the table in the reserved time slot. When a new node enters the network, the node sends a reserved data packet to the pulse source in the M+1 time slot. When a non-pulse source node receives the reserved packet, the node determines the time slot interval between the node itself and the previous hop node according to the order table, and forwards the packet after waiting for the same time slot interval.

[0072] In one embodiment of the present application, the method further comprises:

[0073] Each node in the network completes the dynamic allocation of the resources through autonomous negotiation based on the neighbor node information.

[0074] Each node in the network completes the dynamic allocation of the resources through autonomous negotiation based on the neighbor node information, and specifically includes:

[0075] arbitrating the time slot ownership applied by the neighbor nodes according to a preset time slot allocation rule according to the local time slot table, so as to apply the unoccupied time slots on demand, wherein the time slots are distributed;

[0076] When forwarding the pulse data packet to the neighbor node in the time slot where the node itself is located, the neighbor node updates the local time slot table according to the received pulse data packet, wherein the pulse data packet comprises the data time slot application table of the node itself;

[0077] According to the interaction of the pulse data packet between the node and the neighbor node, the failed time slot is adjusted, and a new data time slot application table is sent to the neighbor node with the reservation data packet, so that the neighbor node arbitrates according to the local information and sends a response data packet to the node;

[0078] If the node successfully occupies the time slot, data transmission is performed in the data frame, and if the node fails to successfully occupy the time slot, the conflict time slot is released.

[0079] It can be understood that first, the node arbitrates the conflict time slot application of the neighbor node according to the existing local time slot table, i.e., the time slot application situation table of the node, one-hop and two-hop neighbor nodes, and according to certain time slot allocation rules. The time slot allocation rules guarantee the fairness of time slot allocation and prevent some neighbor nodes from always failing to apply for a time slot, resulting in a "starvation" phenomenon. At the same time, the node applies for an unoccupied time slot according to its own needs. In order to reduce the application conflict and reduce the end-to-end delay, the node applies for a time slot according to the MAC address and maintains a certain interval, and the time slot application interval is set to the maximum number of nodes. The data time slot application table is sent to all one-hop neighbor nodes with the pulse data packet, and the table comprises the time slot application situation of the node itself and the one-hop neighbor nodes.

[0080] After the node receives the pulse data packet, the local time slot table is updated according to the time slot application information, and the time slot application situation of the node itself and the one-hop neighbor nodes is obtained. If the node has an application failure time slot, other unoccupied time slots are re-applied. The new time slot application table is sent to the one-hop neighbor nodes with the reservation data packet.

[0081] The node receives the time slot application table of the reservation data packet, updates the local time slot table and the time slot application table, and if the node itself still has a time slot application failure, records the application failure time slot, skips the time slot in the next round of time slot application, avoids multiple applications of the same conflict-prone time slot, and sends a response data packet to the previous hop node. If the node detects that the time slot application in the reservation data packet conflicts with the time slot application table of the node, a response data packet is also sent to the previous hop neighbor node.

[0082] The node receives the response data packet, updates the time slot application situation, and performs data transmission in the successfully applied data time slot. Through the two-round time slot application interaction of each frame, the success rate of time slot application can be maximized, the probability of time slot application conflict can be reduced, the time slots of the nodes beyond two hops can be reused, and the utilization rate of the time slots can be improved.

[0083] In an embodiment of the present application, the above method further comprises:

[0084] Optimizing the routing by means of listening and sending time slot competition conflict information to each node.

[0085] The optimizing the routing by means of listening and sending time slot competition conflict information to each node specifically comprises:

[0086] Each node optimizes the routing path by means of listening and responding to the neighbor node;

[0087] If each node listens to the time slot competition conflict between the data time slot application table in the reserved data packet and the data time slot application table of the node itself, a response data is sent to the neighbor node so as to make the neighbor node release the conflict time slot.

[0088] It can be understood that the new node wants to join the network, first keeps listening, updates the neighbor information according to the listened pulse data packet, and obtains the time slot order table. After waiting for all the nodes in the order table to send the pulse packet, the new node sends a reserved packet to the pulse source, and the one-hop and two-hop neighbor nodes of the new node on the routing path add it to the neighbor table, and the grandpa node allocates a pulse time slot for the new node in the next round of pulse time slot. The division of the pulse and the reserved time slot mainly depends on the neighbor relationship and the hop number from the pulse source. In order to reduce the network overhead, the broadcast time frame and the neighbor interaction time frame only appear in the first time frame, and the maintenance and update of the subsequent neighbor relationship mainly depend on the interaction of the pulse data packet. The pulse data packet carries the one-hop neighbor information of the node and the hop number from the pulse source. If the pulse packet of the neighbor node is not received within the three time frames, it is considered that the neighbor node has exited the network.

[0089] In addition, in order to simulate and verify the method provided by the application, the node scale of the simulation is set to 32 nodes. Please refer to Figure 3 、 Figure 4 , Figure 3 A topology structure diagram provided by an embodiment of the application, Figure 4 A parameter setting diagram provided by an embodiment of the application. Wherein node 0 is the pulse source, node 29 is the source node, and node 23 is the destination node. The experimental results are shown in Figure 5 and Figure 6 : the source node 29 transmits the data packet to the destination node 23 through the routing 29->12->6->0->1->21->23, and the sending amount of the node 29 is basically consistent with the receiving amount of the node 23. Figure 5 The difference between the two curves at the beginning and Figure 6 The convexity of the curve at the beginning of the left side graph is due to the fact that the number of time slot applications is small when the node starts to transmit data, so the delay curve has a protrusion. During this period, there is a data packet accumulation situation, and the data packet needs to go through at least 6 hops to reach the destination node, so the end-to-end delay is large at the beginning, and the end-to-end delay gradually decreases after the data is transmitted smoothly.

[0090] Figure 7 The present invention provides a pulse time slot sorting table diagram of pulse source, source node and destination node in simulation. As can be seen from the figure, the pulse source divides time slots for child nodes and grandchild nodes. The pulse time slot sorting table of source node and destination node shows that nodes other than two hops have time slot reused. The time slot division method of the present invention can make full use of time slot resources while avoiding conflicts.

[0091] Figure 8 This is a data time slot diagram of each node provided in an embodiment of the present invention. Experimental results show that the time slots are distributed overall. The present invention employs distributed time slot allocation, which greatly reduces latency and enables timely forwarding of data packets, as demonstrated by the experimental results. Figure 6 It can be seen that the end-to-end delay is relatively small.

[0092] This invention solves the problem of time slot conflicts among nodes during pulses, fully reusing time slots to reduce network overhead, and is suitable for large-scale mobile ad hoc networks. It obtains neighbor node information within two hops through cooperative relay and neighbor interaction, optimizes the allocation method of pulse time slots and reserved time slots, reuses time slots beyond two hops, reduces time slot overhead, and avoids pulse packet forwarding conflicts. Reserved packets can be sent in either pulse or reserved time slots, further improving time slot utilization and reducing network overhead. Time slot allocation adopts a two-round interactive mode to improve the success rate of time slot allocation, while the interval time slot allocation method reduces the possibility of time slot allocation conflicts. Time slots are distributed throughout the time frame, enabling timely forwarding of data packets. Compared to centralized distribution, this effectively reduces end-to-end latency. Time slots beyond two hops can be reused, improving time slot utilization.

[0093] To better implement the time slot allocation based on the Layer 2 active-passive combined Pulse routing protocol in this embodiment of the invention, based on the time slot allocation based on the Layer 2 active-passive combined Pulse routing protocol, please refer to the corresponding documentation. Figure 9 , Figure 9 This is a schematic diagram of an embodiment of the time slot allocation device based on the Layer 2 active-passive combined Pulse routing protocol provided by the present invention. The embodiment of the present invention provides a time slot allocation device 900 based on the Layer 2 active-passive combined Pulse routing protocol, comprising:

[0094] The information acquisition module 901 is used to initiate flooding from the pulse source, and through cooperative relay, enable each node in the network to obtain the hop count information from itself to the pulse source, and through neighbor interaction, each node obtains the neighbor node information within two hops.

[0095] The rule establishing module 902 is configured to establish a time slot division rule with the pulse source as a center node based on the hop information of each node to the pulse source and the neighbor node information within two hops of each node, and generate a time slot spanning tree, the pulse source initiates a periodic pulse, each node obtains a route to the pulse source and forwards according to the time slot spanning tree;

[0096] The time slot optimization module 903 is configured to determine a transmission node in need of data transmission in the network, and initiate a route search based on the transmission node to perform time slot optimization according to the time slot spanning tree.

[0097] It should be noted that the apparatus 900 provided in the above embodiments can implement the technical solutions described in the above method embodiments, and the principles of the implementation of the above modules or units can be referred to the corresponding content in the above method embodiments, which will not be described here.

[0098] Those skilled in the art can understand that all or part of the processes of the above-mentioned embodiments can be completed by a computer program instructing related hardware, and the program can be stored in a computer readable storage medium. The computer readable storage medium includes a magnetic disk, an optical disk, a read-only memory, a random access memory, etc.

[0099] The above is only a preferred embodiment of the present application, but the protection scope of the present application is not limited to this. Any changes or replacements within the technical scope disclosed by the present application can be easily thought by those skilled in the art, which should be covered within the protection scope of the present application.

Claims

1. A time slot allocation method based on a Layer 2 active-passive combined Pulse routing protocol, characterized in that, include: The flooding is initiated by the pulse source, and the network enables each node to obtain the hop count information from itself to the pulse source through cooperative relay, and to obtain the neighbor node information within two hops through neighbor interaction. Based on the hop count information from each node to the pulse source and the neighbor node information within two hops of each node, a time slot allocation rule is established with the pulse source as the central node, and a time slot spanning tree is generated. The pulse source initiates periodic pulses, and each node obtains the route to the pulse source and forwards it according to the time slot spanning tree, including: Based on the neighbor information within two hops of the pulse source, the child nodes and grandchild nodes of the pulse source are divided into time slots to obtain a spanning tree based on time slot sorting. The spanning tree based on time slot sorting is then sent to the neighbor nodes of the pulse source along with the pulse data packets of the periodic pulse initiated by the pulse source. Each node obtains the route to the pulse source, and based on the two-hop neighbor information of each neighbor node and the number of hops from the pulse source to the pulse source, it re-divides the time slots for the grandchild nodes of the pulse source, and forwards the pulse data packets to the next neighbor node in the time slot of each neighbor node according to the spanning tree based on the time slot sorting. Identify the transmission nodes within the network that need to transmit data, and initiate routing based on the transmission nodes to optimize time slots according to the time slot spanning tree.

2. The time slot allocation method based on the Layer 2 active-passive combined Pulse routing protocol according to claim 1, characterized in that, Each node in the network obtains hop count information from itself to the pulse source node, including: The pulse source initiates flooding. Each node in the network determines the hop count from the pulse source node based on the time it receives the broadcast packet. Each node forwards the broadcast packet in the next time slot after the time slot in which it first receives the data packet.

3. The time slot allocation method based on the Layer 2 active-passive combined Pulse routing protocol according to claim 1, characterized in that, Each node obtains neighbor node information within two hops through neighbor interactions, including: Each node in the network sequentially sends Hello data packets to its neighboring nodes to perform neighbor interaction. The Hello data packets include one-hop neighbor information and the number of hops from each node to the pulse source. After two rounds of neighbor interactions, each node in the network obtains information about its neighboring nodes within two hops.

4. The time slot allocation method based on the Layer 2 active-passive combined Pulse routing protocol according to claim 1, characterized in that, The step of initiating routing based on the transmission node to optimize time slots according to the time slot spanning tree includes: The available reserved time slots for the transmission nodes are determined based on the time slot spanning tree. If the transmission node is a node that needs to transmit data or join the network, it sends a reserved data packet to the pulse source in the reserved time slot available on the transmission node, and causes other nodes on the routing path to forward the reserved data packet in their own reserved time slots.

5. The time slot allocation method based on the Layer 2 active-passive combined Pulse routing protocol according to claim 1, characterized in that, The method further includes: Each node in the network dynamically allocates resources through autonomous negotiation based on information from its neighboring nodes.

6. The time slot allocation method based on the Layer 2 active-passive combined Pulse routing protocol according to claim 5, characterized in that, Each node in the network dynamically allocates resources through autonomous negotiation based on neighbor node information, specifically including: According to the local time slot table and the preset time slot allocation rules, the time slots requested by neighboring nodes are arbitrated to apply for unoccupied time slots as needed, wherein the time slots are distributed. When forwarding pulse data packets to neighboring nodes within their own time slot, each neighboring node updates its local time slot table based on the received pulse data packets. The pulse data packets include each node's own data time slot request table. Based on the interaction of pulse data packets between each node and its neighboring nodes, the time slots for which contention failed are adjusted, and a new data time slot request form is sent to the neighboring nodes along with the reserved data packet, so that the neighboring nodes can arbitrate based on local information and send response data packets to the node. If each node successfully occupies a time slot, data transmission will occur within the data frame; if each node fails to occupy a time slot, the conflicting time slot will be released.

7. The time slot allocation method based on the Layer 2 active-passive combined Pulse routing protocol according to claim 1, characterized in that, The method further includes: The routing is optimized by listening and time slot contention information is sent to each node.

8. The time slot allocation method based on the Layer 2 active-passive combined Pulse routing protocol according to claim 7, characterized in that, The method of optimizing routing by listening and sending time slot contention conflict information to each node specifically includes: Each node optimizes its routing path by listening to and responding to its neighboring nodes; If each node detects a time slot contention conflict between the data slot request table in the reserved data packet and its own data slot request table, it sends a response data to the neighboring node so that the neighboring node can release the conflicting time slot.

9. A time slot allocation device based on a Layer 2 active-passive combined Pulse routing protocol, characterized in that, include: The information acquisition module is used to initiate flooding from the pulse source, and through cooperative relay, enable each node in the network to obtain the hop count information from itself to the pulse source, and through neighbor interaction, each node obtains the neighbor node information within two hops. The rule establishment module is used to establish time slot allocation rules centered on the pulse source based on the hop count information from each node to the pulse source and the neighbor node information within two hops of each node, and to generate a time slot spanning tree. The pulse source initiates periodic pulses, and each node obtains the route to the pulse source and forwards it according to the time slot spanning tree, including: Based on the neighbor information within two hops of the pulse source, the child nodes and grandchild nodes of the pulse source are divided into time slots to obtain a spanning tree based on time slot sorting. The spanning tree based on time slot sorting is then sent to the neighbor nodes of the pulse source along with the pulse data packets of the periodic pulse initiated by the pulse source. Each node obtains the route to the pulse source, and based on the two-hop neighbor information of each neighbor node and the number of hops from the pulse source to the pulse source, it re-divides the time slots for the grandchild nodes of the pulse source, and forwards the pulse data packets to the next neighbor node in the time slot of each neighbor node according to the spanning tree based on the time slot sorting. The time slot optimization module is used to determine the transmission nodes that need to transmit data within the network, and initiate routing based on the transmission nodes to optimize the time slots according to the time slot spanning tree.

Images