CN113572691B - Method for realizing hybrid routing protocol based on time pulse source - Google Patents
Method for realizing hybrid routing protocol based on time pulse source Download PDFInfo
- Publication number
- CN113572691B CN113572691B CN202111103954.1A CN202111103954A CN113572691B CN 113572691 B CN113572691 B CN 113572691B CN 202111103954 A CN202111103954 A CN 202111103954A CN 113572691 B CN113572691 B CN 113572691B
- Authority
- CN
- China
- Prior art keywords
- pulse
- node
- path
- message
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/26—Connectivity information management, e.g. connectivity discovery or connectivity update for hybrid routing by combining proactive and reactive routing
Abstract
The invention provides a method for realizing a hybrid routing protocol based on a time pulse source, which belongs to the technical field of communication, and aims to balance network routing overhead and delay overhead and provide a high-capacity, low-delay and high-dynamic ad hoc network routing protocol for a system, wherein the method mainly solves the problems of the invention, and the scheme comprises the following steps: the routing protocol actively and periodically broadcasts pulse messages through the pulse nodes to complete the establishment and maintenance of the path tree, and the non-pulse nodes complete the establishment, maintenance and path optimization of the path along the path tree as required when data is needed. The invention has the beneficial effects that: the method better solves the problems that the path discovery and path maintenance cost is high due to the adoption of a flooding mode of an active routing protocol and a passive routing protocol, the method is not suitable for the condition of large-scale nodes, and the end-to-end delay of the passive routing protocol is large.
Description
Technical Field
The invention belongs to the technical field of communication, and particularly relates to a method for realizing a hybrid routing protocol based on a time pulse source.
Background
A wireless Ad Hoc network (manet) is a technology different from a conventional wireless communication network. Conventional wireless cellular communication networks require support from fixed network equipment, such as base stations, for data forwarding and user service control. The wireless self-organizing network does not need the support of fixed equipment, each node, namely the user terminal, is self-organized, and when in communication, other user nodes forward data. The network form breaks through the geographical limitation of the traditional wireless cellular network, can be deployed more quickly, conveniently and efficiently, and is suitable for the communication requirements of some emergency occasions, such as individual soldier communication systems in battlefields and wide application in civil fields, such as rescue after earthquake and water disaster.
The wireless ad hoc network is divided into active routing and on-demand routing according to a discovery strategy of the routing. The active routing maintains paths in the whole network in real time and provides routing information as much as possible for data packets in the network. Meanwhile, a large amount of control overhead causes the active routing protocol to occupy too many transmission bandwidth resources in the ad hoc network, and the active routing protocol cannot be suitable for a large-scale networking scene.
In the on-demand routing protocol, the generation of service data can excite the route searching process of the corresponding route. And in the data transmission process, the maintenance of the route is also carried out as required, namely the stop of the service data can also cause the termination of the route maintenance, and excessive control overhead can not be generated. However, with the popularization and research of ad hoc on-demand distance vector (AODV) routing protocols, Dynamic Source Routing (DSR) protocols, and other on-demand routing protocols, the exposed problem is more and more obvious, that is, the on-demand mechanism can increase the end-to-end transmission delay of data packets to a great extent, and cause great delay fluctuation.
How to balance network routing overhead and delay overhead and provide a high-capacity, low-delay and high-dynamic ad hoc network routing protocol for a system is the problem mainly solved by the invention.
Disclosure of Invention
In view of this, the present invention aims to provide a method for implementing a hybrid routing protocol based on a time pulse source, which overcomes the disadvantages of active and on-demand routing protocols, better solves the problem of suppressing flooding of the active routing protocol, avoids the problem of end-to-end delay of the on-demand routing protocol, and better solves the problems of large-scale mobile ad hoc network, rapid change of network topology structure, and large network node scale.
In order to achieve the purpose, the technical scheme of the invention is realized as follows:
a method for implementing a hybrid routing protocol based on a time pulse source comprises the following steps:
and a path tree establishing stage: the method comprises pulse nodes and non-pulse nodes, wherein the pulse nodes periodically send pulse messages to the non-pulse nodes after being electrified, and the non-pulse nodes establish a one-way path tree from the current non-pulse nodes to the pulse nodes after receiving the pulse messages;
a path request phase: when a non-pulse node has a data request, the non-pulse node having the data request becomes a source node, the source node replies a pulse reply message with a destination address to the pulse node through the unidirectional path tree, the pulse node carries out path addressing after receiving the pulse reply message, and meanwhile, a reverse path tree from the pulse node to the source node is established; the destination node receives the pulse message with the destination address, unicasts a pulse reply message to the pulse node along the path tree, and simultaneously establishes a reverse path tree between the pulse node and the destination node;
data transmission and optimized transmission stage: after receiving the pulse reply message, the nodes on the path tree from the destination node to the pulse node judge whether a path reaching the source node exists, if so, the pulse reply message is forwarded to the pulse node and the source node, and the source node is informed of the existence of a routing path; after receiving the message, the source node establishes a routing path from the source node to the destination node, when a data request exists, the data is directly sent to the destination node along the routing path, and if the routing path does not exist, data propagation is continuously carried out according to a path tree of the source node, the pulse node and the destination node;
when receiving a pulse reply message replied by the destination node, judging whether a path reachable by the 1 hop of the destination node exists, if so, unicasting a reply quick response message to the source node, and informing the source node of the existence of a routing path; after receiving the quick response message, the source node establishes a routing path from the source node to the destination node, when a data request exists, data is directly sent to the destination node along the routing path, and if the routing path does not exist, data propagation is continuously carried out according to a path tree of the source node, the pulse node and the destination node;
if no routing path exists in the data transmission and optimized transmission stage, the propagation route is as follows: source node-pulse node-destination node; if one routing path exists, the routing path is propagated according to the routing path, and if a plurality of routing paths exist, the shortest path in the plurality of routing paths is selected through judgment of the source node, namely the optimal path;
further, the method for obtaining the optimal path to the destination node comprises the following steps: firstly defining a path tree between a destination node and a pulse node as a tree node, defining the pulse node not on the tree as a non-tree node, when a pulse reply message is propagated along the tree node, the nodes of 1 hop around the path tree also receive the pulse reply message, judging whether a path of 1 hop reaching a source node exists after the nodes in 1 hop around the path tree receive the pulse reply message, if so, unicast replying a quick response message to the source node to inform the source node of the existence of a shortest path, and when the source node receives the quick response message and has a data request, directly sending data to the destination node along the path.
Further, when a plurality of routing paths exist, the shortest path in the plurality of routing paths is selected by judging through the source node, and the shortest path is the optimal path.
Furthermore, each non-pulse node takes a pulse node as a synchronous reference of a routing control packet and a data packet, a routing protocol takes a pulse period as a minimum communication unit, and the routing protocol is divided into four stages of electrifying, pulse transmission, pulse reply and data transmission according to a time proportion in one pulse period;
the power-on stage is used for avoiding time errors among the non-pulse nodes, and the non-pulse nodes can start receiving in advance and wait for receiving pulse messages;
in the pulse transmission stage, pulse nodes broadcast pulse messages, and meanwhile non-pulse nodes receive the pulse messages and establish a one-way path tree to the pulse nodes;
in the pulse reply stage, after receiving the pulse message, the node with the routing request unicasts the pulse reply message along the path tree and requests a path from the pulse node;
in the data transmission stage, a source node sends data to a path tree, and the data is propagated to a destination node through the propagation of the path tree.
Further, after the node is powered on, whether the node becomes a pulse node is judged according to a preset value; the preset value is a plurality of grades, and the node with the highest grade can send a pulse message at the first time; if the node can not receive the pulse message, the node transmits the pulse message at a specified time according to the level of the node to become a pulse node.
Further, the path tree establishment phase comprises the following steps:
a1, the pulse node sends pulse information according to fixed period, the pulse information includes time information, used for each non-pulse node to carry on time synchronization;
a2, the non-pulse node judges the time of next power-on phase according to the last received pulse interval, enters the receiving state at the specified time, and is in the non-active state at other time, at this time, the node can enter the sleep state to save the electric quantity;
if the node is started for the first time, judging whether the node is a pulse node or not, if the node is a non-pulse node, directly entering a power-on stage, and waiting for a pulse message;
a3, non-pulse nodes receive the pulse message, judge according to the serial number of the pulse message, link measurement, when the pulse serial number is the latest or the pulse serial number is the same as the pulse node serial number but the link measurement is small, store the path tree path and forward the pulse, the process needs to be finished in the time specified in the pulse transmission stage, at the same time, ensure the pulse message to reach each node in the network;
and A4, establishing a one-way path tree to the pulse node by the non-pulse node through the process.
Further, the path request and data transmission and optimized transmission comprise the following methods:
b1, when the source node has data request, judging whether there is available path, if yes, sending data to the pulse node in the data transmission phase, if there is route path, sending data to the destination node through the route node on the route path, if not, entering step B2;
b2, the source node judges whether it is in the pulse reply phase, if it is, it replies the pulse reply message with the destination address to the pulse node to request the path, and sends the data to the pulse node along the path tree in the data transmission phase, if not, it enters into step B3;
b3, the source node judges whether it is in the data transmission stage, if yes, the data is sent to the pulse node directly along the path tree; if not, when the node enters the pulse reply stage, replying a pulse reply message with a destination address to the pulse node, requesting a path, and sending data to the pulse node along the path tree in the data transmission stage;
b4, the nodes on the path tree from the source node to the pulse node will forward the pulse reply message or data message, and unicast the corresponding message to other nodes on the path tree until the message reaches the destination node;
b5, when receiving the pulse reply message from the source node, the nodes in the 1 hop around the path tree from the source node to the pulse node establish the route path to the source node in the route table;
b6, the pulse node receives the pulse reply message with the destination address, or the received data message can send the pulse message with the destination address in the next pulse period to carry out the path addressing;
b7, all non-pulse node sections receive the pulse message with destination address, complete the process of 'establishing path tree', and realize the reconstruction of path tree;
b8, the destination node receives the pulse message with destination address, unicasts the pulse reply message to the pulse node along the path tree in the pulse reply stage, and establishes a bidirectional path from the destination node to the pulse node;
b9, when receiving the pulse reply message, the nodes in 1 hop around the path tree from the destination node to the pulse node judge whether there is a path that can be reached by 1 hop to the source node, if yes, unicast reply quick response message to the source node, and inform the source node of the existence of the shortest path;
b10, after the source node receives the quick response message or the impulse message of the destination node forwarded by other nodes, when there is data request, it sends data to the destination node along the shortest path directly, if it does not receive the quick response message, it continues to transmit data according to the path of the source node-impulse node-destination node.
Compared with the prior art, the implementation method of the hybrid routing protocol based on the time pulse source has the following beneficial effects:
(1) the invention better solves the problem of high cost caused by flooding of the active routing protocol and the passive routing protocol, is not suitable for the condition of large-scale nodes, solves the problem of high end-to-end delay of the passive routing protocol, and is more suitable for the conditions of quick change of a network topology structure and large scale of network nodes;
(2) the routing protocol provided by the invention adopts a synchronization mechanism based on pulse nodes, takes a pulse period as a unit, divides a pulse unit into four stages, each stage is carried out in fixed time, the cost controlled by the routing protocol is only related to the time distributed by the first three stages and is not related to the number of the routing nodes, the method increases the ductility of the routing protocol and solves the problem of large-scale networking;
(3) the routing protocol provided by the invention adopts a method for realizing a hybrid routing protocol based on a time pulse source, actively maintains a path tree, generates a path from a source node to a destination node as required, and can directly send data in advance along the direction of the path tree under the condition that the source node has no path, thereby avoiding the problem of large end-to-end delay of the routing protocol as required;
(4) according to the routing protocol provided by the invention, in the process of finding the routing path, the path finding information is maximally applied, the optimal routing path can be found under the condition of not increasing the routing overhead, and the problem that the shortest path cannot be found by adopting a traditional path tree mode is avoided;
(5) the routing protocol provided by the invention adopts a priority mode to configure the pulse nodes, simplifies the node selection process, avoids the routing overhead of node selection and shortens the routing networking time.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate an embodiment of the invention and, together with the description, serve to explain the invention and not to limit the invention. In the drawings:
FIG. 1 is a schematic diagram of the routing protocol stage division of the present invention;
FIG. 2 is a schematic diagram of a path tree established after a pulse period of the routing protocol of the present invention;
FIG. 3 is a schematic diagram of a path tree established after a source node of a routing protocol has a data request to send a pulse reply message according to the present invention;
FIG. 4 is a schematic diagram of a path tree established after a destination node of a routing protocol sends a pulse reply according to the present invention;
FIG. 5 is a schematic diagram of a source node path request processing flow according to the present invention;
fig. 6 is a process of the destination node implementing the path establishment procedure and a flow diagram of the shortest path establishment according to the present invention.
Detailed Description
It should be noted that the embodiments and features of the embodiments may be combined with each other without conflict.
The present invention will be described in detail below with reference to the embodiments with reference to the attached drawings.
In the scheme, each non-pulse node takes a pulse node as a synchronous reference of a routing control packet and a data packet, a routing protocol takes a pulse period as a minimum communication unit, and the routing protocol is divided into four stages of electrifying, pulse transmission, pulse reply and data transmission according to time proportion in one pulse period, and the specific implementation method is as follows:
step X1: the whole system takes the pulse node as the synchronous reference of a routing control packet and a data packet, the routing protocol takes a pulse period as a minimum communication unit, and the whole system is divided into four stages of electrifying, pulse propagation, pulse reply and data according to the time proportion in one pulse period.
Step X2: in the power-on stage, mainly to avoid time errors of different nodes, the nodes can start receiving in advance and wait for receiving the pulse message.
Step X3: the pulse propagation stage means that the pulse node broadcasts pulse messages, and other nodes receive the pulse messages to establish a path tree to the pulse node.
Step X4: and in the pulse reply stage, the nodes with the routing requests are shown, and after the pulse messages are received, the pulse reply messages are unicast along the path tree to request paths from the pulse nodes.
Step X5: and the data transmission stage represents that the source node sends data to the path tree, and the data is propagated to the destination node through the propagation of the path tree.
Step X6: the triggering conditions of the four stages are all timed by receiving pulse messages of pulse nodes, each node carries out the corresponding stage within the specified time of the stage, and the protocol strictly divides the routing control messages and the data in terms of time.
The implementation method of the hybrid routing protocol based on the time pulse source comprises the following steps:
(1) selecting a pulse node:
after the node is electrified, judging whether the node becomes a pulse node or not according to a preset value; the preset value is a plurality of grades, and the node with the highest grade can send a pulse message at the first time; if the node can not receive the pulse message, the node transmits the pulse message at a specified time according to the level of the node to become a pulse node.
(2) Establishing a path tree:
step Y1: the pulse nodes send pulse messages according to a fixed period, and the pulse messages comprise time information and are used for time synchronization of all the nodes.
Step Y2: the non-pulse node judges the time of entering the power-on stage next time according to the pulse interval received last time, and enters a receiving state at the characteristic time; the other time is in an inactive state, and the node can enter a dormant state to save the electric quantity;
if the node is started for the first time, whether the node is a pulse node needs to be judged, and if the node is a non-pulse node, the node directly enters a power-on stage and waits for a pulse message.
Step Y3: after receiving the pulse message, the node judges according to the serial number of the pulse message and the link measurement, and when the pulse serial number is latest or the pulse serial number is the same as the source pulse serial number but the link measurement is small, the path tree path is stored and the pulse is forwarded at the same time. This process needs to be completed within the time specified in the pulse propagation phase while ensuring that the pulse message reaches every node in the network.
Step Y4: through the above process, the non-pulse node establishes a one-way path tree to the pulse node.
(3) Path request and data transmission and optimized transmission:
step Z1: when a source node has a data request, judging whether an available path exists, and if so, sending data to a routing node or a destination node in a data transmission stage; if step Z2 is not entered.
Step Z2: the source node judges whether it is in the pulse reply phase, if so, replies a pulse reply message with the destination address to the pulse node, requests the path, and sends data to the destination pulse node along the path tree in the data transmission phase, if not, step Z3 is entered.
Step Z3: and the source node judges whether the data transmission stage is performed, if so, the data is directly sent to the pulse node along the path tree, and if not, when the node enters the pulse reply stage, the node replies a pulse reply message with a destination address to the pulse node to request the path and sends the data to the destination node along the path tree in the data transmission stage.
Step Z4: nodes on the path tree may forward the ping reply message or data message and unicast the corresponding message to other nodes on the tree until the message reaches the ping node.
Step Z5: the pulse message with the destination address is sent in the next pulse period to carry out the path addressing when the pulse message with the destination address is sent to the pulse message with the destination address or the received data message.
Step Z6: all non-pulse nodes receive pulse messages with destination addresses, complete the process of establishing a path tree and realize the reconstruction of the path tree;
step Z7: the destination node receives the pulse message with the destination address, and unicast the pulse reply message to the source node along the path tree to establish a bidirectional path to the source node in the pulse reply stage.
Step Z8: and the nodes on the path tree receive the pulse reply message, judge whether a path reaching the source node exists or not, and if so, unicast the pulse reply message to the source node and simultaneously forward the pulse reply message to the source node.
Step Z9: and when receiving the pulse reply message, the nodes in 1 hop around the path tree judge whether a path which can be reached by 1 hop exists to the source node, if so, unicast replies a quick response message to the source node, and informs the source node of the existence of the shortest path.
Step Z10: after the source node receives the quick response message and has a data request, the source node directly sends data to the destination node along the shortest path; and if the quick response message is not received, performing the next round of data transmission process according to the path of the source node, the pulse node and the destination node.
The following describes a further implementation process of a hybrid routing protocol design method based on time pulse nodes with reference to the accompanying drawings:
figure 1 is a detailed partitioning of the various stages within a pulse cycle unit based on a pulse node routing protocol.
The first three stages are the bandwidth time occupied by the control command of the routing protocol, and the last stage is the bandwidth time occupied by the data transmission stage (including data receiving and data sending). Such as: one pulse period is 1 second, the first three phases take 100 milliseconds, and the fourth phase takes 900 milliseconds, for example. The routing protocol occupies 10% of the total bandwidth resources and this overhead is fixed regardless of the number of nodes in the network.
Fig. 2 is a schematic diagram of a path tree established by each node in the network after a pulse node sends a pulse message.
Step V1: the pulse node periodically sends pulse messages;
step V2: each node in the network can establish a unique one-way optimal path tree reaching the pulse node after receiving the pulse message;
step V3: nodes on the network can periodically rebuild the path tree according to the pulse period, and real-time availability of the path tree is ensured.
After the above process, the nodes in the network can establish a path tree reaching the pulse node, for example, the path from the node 5 to the pulse node is 5-4-1; the path from node 7 to the pulse node is 7-6-1.
Fig. 3 is a schematic diagram of a reverse path formed after a source node has a data request and unicasts a pulse reply message.
Step U1: the source node unicasts a pulse reply message to the pulse node according to the path tree of the first arrow 7-6-1;
step U2: the source node and the nodes above the path tree both establish a path in the direction indicated by the third arrow, for example, path tree nodes 6 and 1 establish reverse paths 6-7 and 1-6-7 to the source node;
step U3: the node of 1 hop above the path tree will establish the path shown by the second arrow by using the received pulse reply message, and this process does not increase the network routing overhead, for example, the nodes 8 and 5 of 1 hop around the path tree will respectively establish the reverse paths 8-7 and 5-6-7 to the source node.
Fig. 4 is a schematic diagram of a reverse path formed after the destination node replies to the pulse reply message after receiving the pulse message.
Step T1: the destination node unicasts a pulse reply message to the pulse node according to the path tree of the first arrow 11-10-9-1;
step T2: the destination node and the nodes above the path tree all establish a path in the direction shown by the third arrow, for example, nodes 10, 9 and 1 above the path tree establish reverse paths of 10-11, 9-10-11 and 1-9-10-11 to the destination node;
step T3: the node of 1 hop outside the path tree establishes a path shown by a second arrow by using the received pulse reply message, and the process does not increase the network routing overhead, for example, the node 8 establishes a reverse path of 8-11;
step T4: the node 8 has the shortest path to the destination node, and unicasts the quick reply message to the source node, and at this time, the shortest path shown by a fourth arrow 7-8-11 is established.
Fig. 5 and 6 are flow charts of establishing a path to a destination node when a source node has a data request and realizing data optimized transmission. Fig. 5 and 6 illustrate the processing procedure of the source node, the pulse node, the node on the path tree, the 1-hop node around the path tree, and the destination node in detail.
Fig. 5 is a schematic diagram of a source node path request processing flow of the present invention, and the specific scheme is as follows: when the source node has a data request, judging whether the data request is in a pulse reply stage; if so, unicasting a pulse reply message with a destination address along the path tree; the nodes on the path tree receive the pulse reply message with the destination address, establish a reverse path to the source node, and forward the message until the pulse nodes receive the pulse reply message with the destination address, at this time, the pulse nodes establish the reverse path to the source node, and send the pulse message with the destination address in the next pulse period; and one hop of nodes around the path tree receive the pulse reply message with the destination address and establish a reverse path reaching the source node.
If not, judging whether the data transmission stage is in, if so, unicasting the data to the pulse node along the path tree, and if not, waiting to reach the data transmission stage to send the data.
Fig. 6 is a process diagram of the target node implementing the path establishment procedure and the procedure for establishing the shortest path according to the present invention, and the specific scheme is as follows: the destination node receives the pulse message with the destination address and judges whether the pulse message is in a pulse reply stage; if so, unicasting a pulse reply message with a destination address along the path tree; the nodes on the path tree receive the pulse reply message with the destination address, establish a reverse path to the destination node, and forward the message until the pulse nodes receive the pulse reply message with the destination address, and at the moment, the pulse nodes establish the reverse path to the destination node; and one hop of nodes around the path tree receive the pulse reply message with the destination address, establish a reverse path to the destination node, then judge whether the shortest path exists, if so, reply the quick response message to the source node, after receiving the quick response message, establish the shortest path to the destination node, if not, do no processing, and end the flow of judging the shortest path.
If not, waiting to reach a pulse recovery stage;
those of ordinary skill in the art will appreciate that the elements and method steps of the examples described in connection with the embodiments disclosed herein may be embodied in electronic hardware, computer software, or combinations of both, and that the components and steps of the examples have been described in a functional general in the foregoing description for the purpose of clearly illustrating the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the several embodiments provided in the present application, it should be understood that the disclosed method and system may be implemented in other ways. For example, the above described division of elements is merely a logical division, and other divisions may be realized, for example, multiple elements or components may be combined or integrated into another system, or some features may be omitted, or not executed. The units may or may not be physically separate, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment of the present invention.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; such modifications and substitutions do not depart from the spirit and scope of the present invention, and they should be construed as being included in the following claims and description.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (8)
1. A method for implementing a hybrid routing protocol based on a time pulse source, wherein the routing protocol comprises a pulse node and a non-pulse node, and the method comprises the following steps:
s1, path tree establishment: the method comprises the steps that pulse nodes periodically send pulse messages to non-pulse nodes after being electrified, and the non-pulse nodes establish a one-way path tree from the current non-pulse nodes to the pulse nodes after receiving the pulse messages;
s2, path request: when a non-pulse node has a data request, the non-pulse node having the data request becomes a source node, the source node replies a pulse reply message with a destination address to the pulse node through the unidirectional path tree, the pulse node carries out path addressing after receiving the pulse reply message, and meanwhile, a reverse path tree from the pulse node to the source node is established; the destination node receives the pulse message with the destination address, unicasts a pulse reply message to the pulse node along the path tree, and simultaneously establishes a reverse path tree between the pulse node and the destination node;
data transmission and optimized transmission: after receiving the pulse reply message, the nodes on the path tree from the destination node to the pulse node judge whether a path reaching the source node exists, if so, the pulse reply message is forwarded to the pulse node and the source node, and the source node is informed of the existence of a routing path; after receiving the message, the source node directly sends data to the destination node along the route path when there is a data request, if there is no route path, the data transmission is continued according to the route tree of the source node, the pulse node and the destination node.
2. The method of claim 1, wherein the hybrid routing protocol based on the time pulse source comprises: when receiving a pulse reply message replied by the destination node, judging whether a path reachable by the 1 hop of the destination node exists, if so, unicasting a reply quick response message to the source node, and informing the source node of the existence of a routing path; after receiving the quick response message, the source node establishes a routing path from the source node to the destination node, when a data request exists, the source node directly sends data to the destination node along the routing path, and if the routing path does not exist, data propagation is continuously carried out according to a path tree of the source node, the pulse node and the destination node.
3. The method of claim 2, wherein the hybrid routing protocol based on the time pulse source comprises: if no routing path exists in the data transmission and optimized transmission stage, the propagation route is as follows: source node-pulse node-destination node; if one routing path exists, the propagation is carried out according to the routing path, and if a plurality of routing paths exist, the shortest path in the plurality of routing paths is selected through judgment of the source node, namely the optimal path.
4. The method for implementing a hybrid routing protocol based on a time pulse source as claimed in claim 3, wherein the method for obtaining the optimal path to the destination node comprises: firstly, defining nodes on a path tree between a destination node and a pulse node as tree nodes, defining nodes not on the tree as non-tree nodes, when a pulse reply message is propagated along the tree nodes, nodes of 1 hop around the path tree also receive the pulse reply message, judging whether a path which can reach a source node by 1 hop exists after the nodes in the 1 hop around the path tree receive the pulse reply message, if so, unicast replying a quick response message to the source node to inform the source node of the existence of a shortest path, and when the source node receives the quick response message and has a data request, directly sending data to the destination node along the routing path.
5. The method of claim 1, wherein the hybrid routing protocol based on the time pulse source comprises: each non-pulse node takes a pulse node as a synchronous reference of a routing control packet and a data packet, a routing protocol takes a pulse period as a minimum communication unit, and the routing protocol is divided into four stages of electrifying, pulse transmission, pulse reply and data transmission according to a time proportion in one pulse period;
the power-on stage is used for avoiding time errors among the non-pulse nodes, and the non-pulse nodes can start receiving in advance and wait for receiving pulse messages;
in the pulse transmission stage, pulse nodes broadcast pulse messages, and meanwhile non-pulse nodes receive the pulse messages and establish a one-way path tree to the pulse nodes;
in the pulse reply stage, after receiving the pulse message, the node with the routing request unicasts the pulse reply message along the path tree and requests a path from the pulse node;
in the data transmission stage, a source node sends data to a path tree, and the data is propagated to a destination node through the propagation of the path tree.
6. The method of claim 5, wherein the hybrid routing protocol based on the time pulse source comprises: after the node is electrified, judging whether the node becomes a pulse node or not according to a preset value; the preset value is a plurality of grades, and the node with the highest grade can send a pulse message at the first time; if the node can not receive the pulse message, the node transmits the pulse message at a specified time according to the level of the node to become a pulse node.
7. The method of claim 5, wherein the path tree establishment phase comprises the following steps:
a1, the pulse node sends pulse information according to fixed period, the pulse information includes time information, used for each non-pulse node to carry on time synchronization;
a2, the non-pulse node judges the time of next power-on phase according to the last received pulse interval, enters the receiving state at the specified time, and is in the non-active state at other time, at this time, the node can enter the sleep state to save the electric quantity;
if the node is started for the first time, judging whether the node is a pulse node or not, if the node is a non-pulse node, directly entering a power-on stage, and waiting for a pulse message;
a3, non-pulse nodes receive the pulse message, judge according to the serial number of the pulse message, link measurement, when the pulse serial number is the latest or the pulse serial number is the same as the serial number of the pulse node but the link measurement is small, store the path of the path tree and forward the pulse message, the process needs to be completed in the time specified in the pulse transmission stage, and simultaneously ensure that the pulse message reaches each node in the network;
and A4, establishing a one-way path tree to the pulse node by the non-pulse node through the process.
8. The method of claim 5, wherein in step S2, the path request and the data transmission and the optimized transmission comprise the following methods:
b1, when the source node has data request, judging whether there is available path, if yes, sending data to the destination node through the route node on the route path in the data transmission stage, if not, entering step B2;
b2, the source node judges whether it is in the pulse reply phase, if it is, it replies the pulse reply message with the destination address to the pulse node to request the path and sends the data to the pulse node along the path tree in the data transmission phase, if not, it enters into step B3;
b3, the source node judges whether it is in the data transmission stage, if yes, the data is sent to the pulse node directly along the path tree; if not, when the node enters the pulse reply stage, replying a pulse reply message with a destination address to the pulse node, requesting a path, and sending data to the pulse node along the path tree in the data transmission stage;
b4, the node on the path tree from the source node to the pulse node will forward the pulse reply message or the data message, and unicast the corresponding message to other nodes on the path tree until the message reaches the pulse node;
b5, when receiving the pulse reply message sent by the source node, the source node establishes a route path to the source node in the route table;
b6, the pulse node receives the pulse reply message with the destination address, or the received data message can send the pulse message with the destination address in the next pulse period to carry out the path addressing;
b7, all non-pulse node sections receive the pulse message with destination address, complete the process of 'establishing path tree', and realize the reconstruction of path tree;
b8, the destination node receives the pulse message with destination address, unicasts the pulse reply message to the pulse node along the path tree in the pulse reply stage, and establishes a bidirectional path from the destination node to the pulse node;
b9, when receiving the pulse reply message, the nodes in 1 hop around the path tree from the destination node to the pulse node judge whether there is a path that can be reached by 1 hop to the source node, if yes, unicast reply quick response message to the source node, and inform the source node of the existence of the shortest path;
b10, after the source node receives the quick response message or the impulse message of the destination node forwarded by other nodes, when there is data request, it sends data to the destination node along the shortest path directly, if it does not receive the quick response message, it continues to transmit data according to the path of the source node-impulse node-destination node.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111103954.1A CN113572691B (en) | 2021-09-22 | 2021-09-22 | Method for realizing hybrid routing protocol based on time pulse source |
| PCT/CN2021/139688 WO2023045143A1 (en) | 2021-09-22 | 2021-12-20 | Time pulse source-based hybrid routing protocol implementation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111103954.1A CN113572691B (en) | 2021-09-22 | 2021-09-22 | Method for realizing hybrid routing protocol based on time pulse source |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113572691A CN113572691A (en) | 2021-10-29 |
| CN113572691B true CN113572691B (en) | 2021-12-07 |
Family
ID=78173825
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111103954.1A Active CN113572691B (en) | 2021-09-22 | 2021-09-22 | Method for realizing hybrid routing protocol based on time pulse source |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN113572691B (en) |
| WO (1) | WO2023045143A1 (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113572691B (en) * | 2021-09-22 | 2021-12-07 | 天津七一二通信广播股份有限公司 | Method for realizing hybrid routing protocol based on time pulse source |
| CN114371617A (en) * | 2021-12-13 | 2022-04-19 | 重庆邮电大学 | Pulse control-based grouping consistency control method of multi-agent system with switching topological structure |
| CN116095815B (en) * | 2023-04-11 | 2023-08-11 | 天津七一二通信广播股份有限公司 | TDMA and routing protocol fusion method and fusion system based on neighbor node information |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102577194A (en) * | 2009-08-25 | 2012-07-11 | Sem技术公司 | Measurement and adjustment of real-time values according to residence time in networking equipment without access to real time |
| CN104936249A (en) * | 2015-06-05 | 2015-09-23 | 电子科技大学 | Route self-healing method suitable for wireless network |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| ES2361545B1 (en) * | 2009-02-24 | 2012-05-08 | Universidad De Alcala De Henares | PROCEDURE OF FURNITURE OF DATA SECTIONS AND NETWORK BRIDGE. |
| CN105656779B (en) * | 2016-01-18 | 2019-08-23 | 西安三星电子研究有限公司 | The method, apparatus and system of routing are selected in asymmetric link |
| US20210250271A1 (en) * | 2020-02-10 | 2021-08-12 | NOIA Network Limited | Automated formation and optimization of a group of nodes for distributed data routing over computer networks |
| US11863444B2 (en) * | 2020-02-10 | 2024-01-02 | Syntropy Network Limited | System and method for autonomous determination of data routing paths having reduced latencies across the internet |
| CN113572691B (en) * | 2021-09-22 | 2021-12-07 | 天津七一二通信广播股份有限公司 | Method for realizing hybrid routing protocol based on time pulse source |
-
2021
- 2021-09-22 CN CN202111103954.1A patent/CN113572691B/en active Active
- 2021-12-20 WO PCT/CN2021/139688 patent/WO2023045143A1/en unknown
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102577194A (en) * | 2009-08-25 | 2012-07-11 | Sem技术公司 | Measurement and adjustment of real-time values according to residence time in networking equipment without access to real time |
| CN104936249A (en) * | 2015-06-05 | 2015-09-23 | 电子科技大学 | Route self-healing method suitable for wireless network |
Non-Patent Citations (8)
| Title |
|---|
| "Congruent routing protocols in diverse tree topology ZigBee built home area networks";Rajesh kanna B 等;《Materials Today: Proceedings2020》;20201021;全文 * |
| "Enhanced STR based geographic location in ZigBee wireless networks: a hybrid PSACO method";P.S Shiju Kumar 等;《International Journal of Electronics》;20210504;第108卷(第5期);全文 * |
| 一种基于ZigBee树状路由协议的改进算法ATSPF;周鑫等;《科学技术与工程》;20121118(第32期);全文 * |
| 代数码书分级分段优化搜索方法研究;李凤莲等;《信号处理》;20130225(第02期);全文 * |
| 周鑫等.一种基于ZigBee树状路由协议的改进算法ATSPF.《科学技术与工程》.2012,(第32期), * |
| 基于Phong模式的分裂Monte Carlo模拟红外室内信道脉冲响应函数;张海涛等;《物理学报》;20050812(第08期);全文 * |
| 基于最小生成树的非均匀分簇路由协议;廖福保等;《传感技术学报》;20170915(第09期);全文 * |
| 张海涛等.基于Phong模式的分裂Monte Carlo模拟红外室内信道脉冲响应函数.《物理学报》.2005,(第08期), * |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2023045143A1 (en) | 2023-03-30 |
| CN113572691A (en) | 2021-10-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113572691B (en) | Method for realizing hybrid routing protocol based on time pulse source | |
| EP2280517B1 (en) | Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation | |
| US20090147723A1 (en) | Method and Device for Data Routing and Bandwidth Reservation in Small Scale Distributed Networks | |
| US20040018839A1 (en) | Protocol and structure for mobile nodes in a self-organizing communication network | |
| EP3203689B1 (en) | Peer-to-peer communications in ami with source-tree routing | |
| CN102318316B (en) | Method and network and equipment for communication in including the network without battery ZigBee equipment | |
| US20070195728A1 (en) | Automated method for constructing a routing infrastructure in an ad-hoc network | |
| US7660258B2 (en) | Method for automatically configuring network addresses in mobile multi-hop network | |
| CN105873169A (en) | Wireless ad-hoc network communication method | |
| CN101247339B (en) | Method for centralized resource reservation management in mobile wireless sensor network | |
| JP6264856B2 (en) | Node device, control program, wireless communication system, and data communication method | |
| EP2430819B1 (en) | A method of assigning a network address for communicating in a segmented network | |
| WO2002078272A1 (en) | A method and system for providing bridged mobile ad-hoc networks | |
| CN112351509A (en) | Self-organizing network protocol based on determinacy management method | |
| JP2008167362A (en) | Wireless communication system | |
| JP4767329B2 (en) | Network system and communication method | |
| KR20090034111A (en) | Query-based zigbee mesh routing protocol | |
| WO2009129669A1 (en) | Method and device for data routing and bandwidth reservation in small scale distributed networks | |
| CN110996266A (en) | Multicast group data transmission method of ad hoc network system | |
| CN112822751B (en) | Hybrid wireless network routing method | |
| CN105553854B (en) | A kind of system and its multicast route method based on mobile ad-hoc network | |
| CN110971524B (en) | Centralized routing method for wireless sensor network | |
| CN107566166B (en) | Integrated extensible communication device and method for simplifying terminal configuration operation | |
| JP2009171407A (en) | Radio network system | |
| JP2011109412A (en) | Node device, ad hoc network system, and method of participating in network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |