GEAR protocol routing method, router, terminal equipment and storage medium

By adding a hole avoidance table and calculating priority values ​​to routing nodes, the problems of routing holes and load imbalance in the GEAR protocol are solved, the data transmission path of the power Internet of Things is optimized, and the stability and reliability of the network are improved.

CN118945757APending Publication Date: 2024-11-12GUANGDONG POWER GRID CO LTD +1
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202410989680.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-23
Publication Date
2024-11-12

AI Technical Summary

Technical Problem

The existing GEAR routing protocol suffers from routing gaps and load imbalances in the power Internet of Things, leading to shortened network lifespan and unstable data transmission.

Method used

By adding a hole avoidance table to the routing nodes, the next-hop routing node is selected based on the estimated cost and urgency values ​​of neighboring routing nodes, and holes are avoided by calculating priority and estimated cost values, thus optimizing the data transmission path.

Benefits of technology

It effectively avoids routing holes, reduces data transmission latency and packet loss rate, and improves network load balancing and data transmission reliability.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118945757A_ABST
    Figure CN118945757A_ABST
Patent Text Reader

Abstract

The invention discloses a GEAR protocol routing method, a router, terminal equipment and a storage medium. The method comprises the following steps: acquiring a first estimated cost value of a current routing node and second estimated cost values of all neighbor routing nodes of the current routing node; according to the sequence of the second estimation cost values from low to high, hole judgment is carried out on the neighbor routes in sequence until a certain neighbor route is determined to be a non-hole route, and the neighbor route is used as a next hop route of the current route; and judging whether a second estimated cost value of the next-hop route is lower than the first estimated cost value, if so, sending the to-be-forwarded data packet to the next-hop route node, and if not, adding the current route into a hole avoiding table of the current route, and sending the to-be-forwarded data packet and the hole avoiding table to the next-hop route. According to the invention, the hole avoiding table is additionally arranged for the routing node and is used for judging whether the neighbor routing node is a hole or not, so that the routing hole phenomenon is avoided.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a GEAR protocol routing method, a router, a terminal device and a storage medium. Background Art

[0002] The power Internet of Things is an industrial-grade Internet of Things applied in the power field. It is the key to achieving comprehensive coordinated dispatching of new power systems and plays an important role in the power industry. As a transitional form of the power industry's iterative development towards the energy Internet, the power Internet of Things should be built and developed in the direction of reliable data transmission and massive terminal access. As a wireless access technology, wireless sensor networks have the corresponding characteristics of realizing massive terminal access, such as self-organization, low cost, and low power consumption. Therefore, wireless sensor networks are suitable as a technology for realizing data transmission in the power Internet of Things. In order to achieve reliable transmission of sensor data in the power Internet of Things, the ability of wireless sensors to transmit reliably and efficiently should be improved.

[0003] At present, geographic routing protocols for power IoT are not widely used, mainly focusing on the classic GPSR routing protocol and GEAR routing protocol. The GEAR protocol takes energy effectiveness into consideration and selects the next hop based on geographic location and remaining energy, which greatly extends the life cycle of the network, but there is a "routing hole" problem. Summary of the invention

[0004] The invention provides a GEAR protocol routing method, a router, a terminal device and a storage medium to solve the technical problems that the existing GEAR cannot avoid the "routing hole" phenomenon and load imbalance.

[0005] In order to solve the above technical problems, an embodiment of the present invention provides a GEAR protocol routing method, including:

[0006] Obtaining a first estimated cost value of a current routing node and second estimated cost values ​​of all neighbor routing nodes of the current routing node;

[0007] Selecting a neighbor routing node in order from low to high in the second estimated cost value, and performing a hole judgment on the neighbor routing node until a certain neighbor routing node is confirmed to be a non-hole routing node, and using the neighbor routing node that is a non-hole routing node as the next-hop routing node of the current routing node;

[0008] Determine whether the second estimated cost value of the next-hop routing node is lower than the first estimated cost value. If so, send the data packet to be forwarded to the next-hop routing node. If not, add the current node route to the hole avoidance table of the current node route, and send the data packet to be forwarded and the hole avoidance table to the next-hop routing node.

[0009] As a preferred solution, before obtaining the first estimated cost value of the current routing node and the second estimated cost values ​​of all neighboring routing nodes of the current routing node, the method further includes:

[0010] Get the urgency value of all data packets in the current routing node;

[0011] Selecting one data packet as the data packet to be forwarded in descending order of the urgency value;

[0012] For each selected data to be forwarded, perform the following operations:

[0013] Acquire a first residual energy value of a current routing node, a target area of ​​a data packet to be forwarded, and a first queuing delay of the data packet to be forwarded at the current routing node;

[0014] Acquire the second residual energy values ​​of all neighbor routing nodes of the current routing node and the second queuing delay of the to-be-forwarded data packet at each neighbor node;

[0015] Calculate a first estimated cost value of the to-be-forwarded data packet from the current routing node to the target area according to the first remaining energy value, the target area and the first queuing delay;

[0016] For each neighbor node, a second estimated cost value of the to-be-forwarded data packet from the neighbor node to the target area is calculated according to the corresponding second residual energy value, the target area and the corresponding second queuing delay.

[0017] As a preferred solution, obtaining the second queuing delay of the to-be-forwarded data packet at each neighboring node includes:

[0018] A probe packet is sent to each neighbor routing node, so that each neighbor routing node measures a second queuing delay of the neighbor routing node, and returns the second queuing delay to the current routing node.

[0019] As a preferred solution, the calculating, according to the first remaining energy value, the target area and the first queuing delay, a first estimated cost value of the to-be-forwarded data packet from the current routing node to the target area includes:

[0020] According to the target area, determining a first transmission distance from the current routing node to the target area;

[0021] Calculating a current priority value of the to-be-forwarded data packet at a current routing node according to the first transmission distance and the first queuing delay;

[0022] Calculating the first estimated cost value according to the current priority value, the first remaining energy value and the first queuing delay;

[0023] The calculating, according to the corresponding second residual energy value, the target area and the corresponding second queuing delay, a second estimated cost value of the to-be-forwarded data packet from the neighbor node to the target area comprises:

[0024] Determining, according to the target area, a second transmission distance from the neighbor routing node to the target area;

[0025] According to the second transmission distance and the second queuing delay, calculating the neighbor priority value of the to-be-forwarded data packet at the neighbor routing node;

[0026] Calculating the second estimated cost value according to the neighbor priority value, the second remaining energy value and the second queuing delay;

[0027] The calculation formula of the priority value is:

[0028] p(A,E,G)=d(A,E) / t(A,G);

[0029] In the formula, A represents the routing node; E represents the target area; G represents the data packet to be forwarded; p(A,E,G) represents the priority value of the data packet G to be forwarded with the target area E at the routing node A; d(A,E) represents the transmission distance from the routing node A to the target area E; t(A,G) represents the queuing delay of the data G to be processed at the routing node A;

[0030] The estimated cost value is calculated as:

[0031] c(A,E,G)=α*d(A,E)+β*p(A,E,G)+(1-α-β)*e(A);

[0032] Where c(A, E, G) represents the estimated cost value of the data packet G to be forwarded from routing node A to the target area E; e(A) represents the remaining capacity value of routing node A; α and β are adjustable parameters.

[0033] As a preferred solution, the performing hole determination on the neighbor routing node includes:

[0034] Determine whether the neighbor routing node is in the hole avoidance table, and if the neighbor routing node is in the hole avoidance table, confirm that the neighbor routing node is a hole routing node;

[0035] If the neighbor routing node is not in the hole avoidance table, it is determined whether there is an intermediate routing node in the hole avoidance table among all the intermediate routing nodes on the straight path from the neighbor routing node to the target area. If there is an intermediate routing node in the hole avoidance table, the neighbor routing node is confirmed to be a hole routing node. Otherwise, the neighbor routing node is determined to be a non-hole routing node.

[0036] As a preferred solution, the fields of the hole avoidance table include: routing node number;

[0037] The adding the current node route to the hole avoidance table of the current node route includes:

[0038] Get the current routing node number;

[0039] A data item is added to the hole avoidance table, and a routing node field of the data item is filled in according to the current routing node number.

[0040] As a preferred solution, the GEAR protocol routing method further includes:

[0041] When no data packet is received from a neighbor routing node within a preset detection period, the hole avoidance table of the current routing node is cleared;

[0042] When a hole avoidance table is received from a neighbor routing node, the hole avoidance table of the current routing node is updated according to the received hole avoidance table.

[0043] Based on the above embodiment, another embodiment of the present invention provides a router, including: a data acquisition module and a data processing module;

[0044] The data acquisition module is used to acquire a first estimated cost value of a current routing node and second estimated cost values ​​of all neighbor routing nodes of the current routing node;

[0045] The data processing module is used to select a neighbor routing node in turn according to the second estimated cost value from low to high order, perform hole judgment on the neighbor routing node, until a neighbor routing node is confirmed to be a non-hole routing node, and use the neighbor routing node that is a non-hole routing node as the next-hop routing node of the current routing node; judge whether the second estimated cost value of the next-hop routing node is lower than the first estimated cost value, if so, send the to-be-forwarded data packet to the next-hop routing node, if not, add the current node route to the hole avoidance table of the current node route, and send the to-be-forwarded data packet and the hole avoidance table to the next-hop routing node.

[0046] Based on the above embodiments, another embodiment of the present invention provides a terminal device, which includes a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, and when the processor executes the computer program, the GEAR protocol routing method described in the above invention embodiment is implemented.

[0047] Based on the above embodiment, another embodiment of the present invention provides a storage medium, which includes a stored computer program, wherein when the computer program is running, the device where the storage medium is located is controlled to execute the GEAR protocol routing method described in the above invention embodiment.

[0048] Compared with the prior art, the embodiments of the present invention have the following beneficial effects:

[0049] The present invention obtains the first estimated cost value of the current routing node and the second estimated cost values ​​of all neighbor routing nodes of the current routing node; selects a neighbor routing node in order from low to high according to the second estimated cost value, performs a hole judgment on the neighbor routing node, until a certain neighbor routing node is confirmed to be a non-hole routing node, and uses the neighbor routing node that is a non-hole routing node as the next-hop routing node of the current routing node; judges whether the second estimated cost value of the next-hop routing node is lower than the first estimated cost value, if so, sends the data packet to be forwarded to the next-hop routing node, if not, adds the current node route to the hole avoidance table of the current node route, and sends the data packet to be forwarded and the hole avoidance table to the next-hop routing node. The present invention adds a hole avoidance table to the routing node, which is used to judge whether the neighbor routing node is hole, so as to find the next-hop routing node that can avoid the hole phenomenon, thereby avoiding the "routing hole" phenomenon. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] Figure 1 It is a flow chart of a GEAR protocol routing method provided by one embodiment of the present invention;

[0051] Figure 2 The present invention is a schematic diagram of the structure of a router provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0052] In order to make the purpose, technical solutions and advantages of this application clearer, the technical solutions in this application will be clearly and completely described below in conjunction with the drawings in the embodiments of this application. Obviously, the described embodiments are part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0053] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by technicians in the technical field to which this application belongs; the terms used herein are only for the purpose of describing specific embodiments and are not intended to limit this application; the terms "including" and "having" in the specification and claims of this application and the above-mentioned figure descriptions and any variations thereof are intended to cover non-exclusive inclusions.

[0054] In the description of the embodiments of the present application, technical terms such as "first" and "second" are only used to distinguish different objects and cannot be understood as indicating or implying relative importance or implicitly indicating the number, specific order or primary and secondary relationship of the indicated technical features.

[0055] Reference to "embodiments" herein means that a particular feature, structure, or characteristic described in conjunction with the embodiments may be included in at least one embodiment of the present application. The appearance of the phrase in various locations in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It is explicitly and implicitly understood by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0056] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0057] Embodiment 1

[0058] Please refer to Figure 1 , is a flow chart of a GEAR protocol routing method provided by an embodiment of the present invention, comprising:

[0059] S1. Obtain a first estimated cost value of a current routing node and second estimated cost values ​​of all neighboring routing nodes of the current routing node.

[0060] It should be noted that the current routing node is the execution subject of the GEAR routing protocol of the present invention.

[0061] In a preferred embodiment, before obtaining the first estimated cost value of the current routing node and the second estimated cost values ​​of all neighboring routing nodes of the current routing node, the method further includes:

[0062] Get the urgency value of all data packets in the current routing node;

[0063] Selecting one data packet as the data packet to be forwarded in descending order of the urgency value;

[0064] For each selected data to be forwarded, perform the following operations:

[0065] Acquire a first residual energy value of a current routing node, a target area of ​​a data packet to be forwarded, and a first queuing delay of the data packet to be forwarded at the current routing node;

[0066] Acquire the second residual energy values ​​of all neighbor routing nodes of the current routing node and the second queuing delay of the to-be-forwarded data packet at each neighbor node;

[0067] Calculate a first estimated cost value of the to-be-forwarded data packet from the current routing node to the target area according to the first remaining energy value, the target area and the first queuing delay;

[0068] For each neighbor node, a second estimated cost value of the to-be-forwarded data packet from the neighbor node to the target area is calculated according to the corresponding second residual energy value, the target area and the corresponding second queuing delay.

[0069] It should be noted that the data packets to be forwarded refer to data packets that are about to be forwarded to other routing nodes by the current routing protocol.

[0070] In this embodiment, according to the importance and urgency of power grid data collection, an urgency value is artificially set for the data packet, and the urgency value determines the sending order of all data packets. According to the order of urgency value from high to low, one data packet is selected at a time, and the data packets are selected in sequence as the data packets to be forwarded this time.

[0071] The present invention takes into account factors such as the urgency and importance of an event, meets the demand for the urgency of data collection, thereby reducing the queuing delay of emergency messages and minimizing the impact of data packet loss.

[0072] In a preferred embodiment, obtaining the second queuing delay of the to-be-forwarded data packet at each neighbor node further includes:

[0073] A probe packet is sent to each neighbor routing node, so that each neighbor routing node measures a second queuing delay of the neighbor routing node, and returns the second queuing delay to the current routing node.

[0074] In this embodiment, the current routing node sends a probe packet to each of its neighbor routing nodes to measure the queuing delay of each neighbor routing node, so that the neighbor routing node returns the second queuing delay to the current routing node.

[0075] In a preferred embodiment, the calculating, according to the first remaining energy value, the target area and the first queuing delay, a first estimated cost value of the to-be-forwarded data packet from the current routing node to the target area includes:

[0076] According to the target area, determining a first transmission distance from the current routing node to the target area;

[0077] Calculate the current priority value of the to-be-forwarded data packet at the current routing node according to the first transmission distance and the first queuing delay by using a priority value calculation formula;

[0078] Calculate the first estimated cost value according to the current priority value, the first remaining energy value and the first queuing delay using an estimated cost value calculation formula;

[0079] The calculating, according to the corresponding second residual energy value, the target area and the corresponding second queuing delay, a second estimated cost value of the to-be-forwarded data packet from the neighbor node to the target area comprises:

[0080] Determining, according to the target area, a second transmission distance from the neighbor routing node to the target area;

[0081] Calculate the neighbor priority value of the to-be-forwarded data packet at the neighbor routing node according to the second transmission distance and the second queuing delay by using a priority value calculation formula;

[0082] Calculate the second estimated cost value according to the neighbor priority value, the second remaining energy value and the second queuing delay by using an estimated cost value calculation formula;

[0083] The priority value calculation formula is:

[0084] p(A,E,G)=d(A,E) / t(A,G);

[0085] In the formula, A represents the routing node; E represents the target area; G represents the data packet to be forwarded; p(A,E,G) represents the priority value of the data packet G to be forwarded with the target area E at the routing node A; d(A,E) represents the transmission distance from the routing node A to the target area E; t(A,G) represents the queuing delay of the data G to be processed at the routing node A;

[0086] The estimated cost value calculation formula is:

[0087] c(A,E,G)=α*d(A,E)+β*p(A,E,G)+(1-α-β)*e(A);

[0088] Where c(A, E, G) represents the estimated cost value of the data packet G to be forwarded from routing node A to the target area E; e(A) represents the remaining capacity value of routing node A; α and β are adjustable parameters.

[0089] In this embodiment, the priority value is the quotient of the distance from the routing node to the target area and the queuing delay of the data packet to be forwarded at the routing node. The higher the priority value, the better the traffic condition of the data packet to be forwarded at the routing node. The present invention proposes the concept of priority, and incorporates the priority value into the standard for judging a neighbor routing node as the next hop node, avoiding a large amount of data gathering at the same routing node and generating excessive queuing delay, so as to reduce forwarding congestion caused by load imbalance.

[0090] The estimated cost value is the weighted sum of the distance from the routing node to the target area, the remaining energy of the routing node, and the priority value of the data to be forwarded at the routing node. The present invention improves the estimated cost calculation formula in the traditional GEAR routing protocol, incorporates the priority value into the selection criteria for the next-hop route, and flexibly adjusts the weights of the transmission distance, network energy, and load balancing through adjustable parameters.

[0091] S2. Select a neighbor routing node in order from low to high according to the second estimated cost value, and perform a hole judgment on the neighbor routing node until a neighbor routing node is confirmed to be a non-hole routing node, and use the neighbor routing node that is a non-hole routing node as the next-hop routing node of the current routing node.

[0092] In step S2, the neighbor routing nodes are judged to be hollow in order from low to high according to the estimated cost of the neighbors. If a neighbor routing node is judged to be a hollow routing node, the next neighbor routing node is judged. If a neighbor routing node is judged to be a non-hollow routing node, the hollow judgment of the remaining neighbor routing nodes is stopped, and the neighbor routing node that is a non-hollow routing node is used as the next-hop routing node of the current routing node. In other words, the next-hop routing node of the current routing node must be the one with the smallest estimated cost value among the neighbor routing nodes that are non-hollow routing nodes. The present invention bypasses the neighbor routing node that is a hollow routing node.

[0093] In a preferred embodiment, the performing hole determination on the neighbor routing node includes:

[0094] Determine whether the neighbor routing node is in the hole avoidance table, and if the neighbor routing node is in the hole avoidance table, confirm that the neighbor routing node is a hole routing node;

[0095] If the neighbor routing node is not in the hole avoidance table, it is determined whether there is an intermediate routing node in the hole avoidance table among all the intermediate routing nodes on the straight path from the neighbor routing node to the target area. If there is an intermediate routing node in the hole avoidance table, the neighbor routing node is confirmed to be a hole routing node. Otherwise, the neighbor routing node is determined to be a non-hole routing node.

[0096] In this embodiment, to determine whether a neighbor routing node is a hole routing node, it is first necessary to determine whether there is a corresponding data item in the hole avoidance table that records the neighbor routing node. If so, it means that the neighbor routing node has been marked as a hole routing node, and the neighbor routing node is confirmed to be a hole routing node. If there is no data item corresponding to the neighbor routing node in the hole avoidance table, it is necessary to further determine whether there is an intermediate routing node on the straight path from the neighbor routing node to the target area that is a hole routing node. If there is a node in the middle that is a hole routing node, it means that the neighbor routing node is at risk of falling into a hole, and the neighbor routing node is confirmed to be a hole routing node. If the neighbor routing node is neither recorded in the hole avoidance table nor does it exist on the straight path to the target area, the neighbor routing node is confirmed to be a non-hole routing node.

[0097] It should be noted that the straight line path from the routing node to the target area refers to the shortest or most direct logical path between the two.

[0098] The present invention improves the solution strategy of the traditional GEAR protocol to "routing holes". By judging in advance whether there are empty routing nodes on the direct path, the empty routing nodes can be predicted earlier to a certain extent, which is conducive to bypassing the empty routing nodes in advance.

[0099] S3. Determine whether the second estimated cost value of the next-hop routing node is lower than the first estimated cost value. If so, send the data packet to be forwarded to the next-hop routing node. If not, add the current node route to the hole avoidance table of the current node route, and send the data packet to be forwarded and the hole avoidance table to the next-hop routing node.

[0100] In step S3, the second estimated cost value of the next-hop routing node is compared with the current routing cost value of the current routing node. If the second estimated cost value is lower than the first estimated cost value, it means that the current routing node has not fallen into a hole, and the data packet to be forwarded is directly sent to the next-hop routing node; if the second estimated cost value is not lower than the current estimated cost, it means that the current routing node has fallen into a hole, and the current routing node needs to be added to the hole avoidance table, and the hole avoidance table and the data packet to be forwarded are sent to the next-hop routing node together.

[0101] In a preferred embodiment, the fields of the hole avoidance table include: routing node number;

[0102] The adding the current node route to the hole avoidance table of the current node route includes:

[0103] Get the current routing node number;

[0104] A data item is added to the hole avoidance table, and a routing node field of the data item is filled in according to the current routing node number.

[0105] In this embodiment, the fields of the hole avoidance table are shown in the following table:

[0106]

[0107] The present invention can also set a field for node position information in the hole avoidance table so that non-adjacent nodes can also directly obtain the position of the hole node, which is conducive to planning the path in advance and thus avoiding the hole node.

[0108] In a preferred embodiment, the GEAR protocol routing method further includes:

[0109] When no data packet is received from a neighbor routing node within a preset detection period, the hole avoidance table of the current routing node is cleared;

[0110] When a hole avoidance table is received from a neighbor routing node, the hole avoidance table of the current routing node is updated according to the received hole avoidance table.

[0111] In this embodiment, if a message arrives at the current routing node within a preset detection cycle, the information in its hole avoidance table will not be cleared within the detection cycle. At the same time, if a hole avoidance table sent by a neighbor routing node is received, the hole avoidance table of the current routing node is updated; if no message arrives at the current routing node, the information in the hole avoidance table of the current routing node is cleared at the end of the cycle.

[0112] The present invention designs a hole avoidance table clearing mechanism to prevent the route maintenance cost caused by the hole avoidance table from being too high.

[0113] In summary, the present invention improves the GEAR routing protocol in the context of the electric power Internet of Things. By adding a hole avoidance table for the node, setting an urgency value for the data packet and calculating a priority value, the problems of routing holes and load imbalance are solved in the process of propagating data packets, thereby establishing a more optimal data transmission path, reducing the delay in the entire transmission process, effectively reducing the packet loss rate of data transmission, and making data transmission more reliable.

[0114] Embodiment 2

[0115] Please refer to Figure 2 , is a schematic diagram of the structure of a router provided by an embodiment of the present invention, comprising: a data acquisition module and a data processing module;

[0116] The data acquisition module is used to acquire a first estimated cost value of a current routing node and second estimated cost values ​​of all neighbor routing nodes of the current routing node;

[0117] The data processing module is used to select a neighbor routing node in turn according to the second estimated cost value from low to high order, perform hole judgment on the neighbor routing node, until a neighbor routing node is confirmed to be a non-hole routing node, and use the neighbor routing node that is a non-hole routing node as the next-hop routing node of the current routing node; judge whether the second estimated cost value of the next-hop routing node is lower than the first estimated cost value, if so, send the to-be-forwarded data packet to the next-hop routing node, if not, add the current node route to the hole avoidance table of the current node route, and send the to-be-forwarded data packet and the hole avoidance table to the next-hop routing node.

[0118] Embodiment 3

[0119] Accordingly, an embodiment of the present invention provides a terminal device, which includes a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, and when the processor executes the computer program, the GEAR protocol routing method described in the above-mentioned embodiment of the invention is implemented.

[0120] Embodiment 4

[0121] Accordingly, an embodiment of the present invention provides a storage medium, which includes a stored computer program, wherein when the computer program is running, the device where the storage medium is located is controlled to execute the GEAR protocol routing method described in the above-mentioned embodiment of the invention.

[0122] It should be noted that the device embodiments described above are merely schematic, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. In addition, in the accompanying drawings of the device embodiments provided by the present invention, the connection relationship between the modules indicates that there is a communication connection between them, which may be specifically implemented as one or more communication buses or signal lines. A person of ordinary skill in the art may understand and implement it without creative work.

[0123] Those skilled in the art can clearly understand that for the sake of convenience and brevity, the specific working process of the device described above can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here.

[0124] The terminal device may be a computing device such as a desktop computer, a notebook, a PDA, a cloud server, etc. The terminal device may include, but is not limited to, a processor and a memory.

[0125] The processor may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc. The processor is the control center of the device, and various interfaces and lines are used to connect various parts of the entire device.

[0126] The memory can be used to store the computer program, and the processor realizes various functions of the device by running or executing the computer program stored in the memory and calling the data stored in the memory. The memory can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, at least one application required for a function, etc.; the data storage area can store data created according to the use of the mobile phone, etc. In addition, the memory can include a high-speed random access memory, and can also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (FlashCard), at least one disk storage device, a flash memory device, or other volatile solid-state storage devices.

[0127] The storage medium is a storage medium, and the computer program is stored in the storage medium. When the computer program is executed by the processor, the steps of each method embodiment described above can be implemented. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form, etc. The computer readable medium may include: any entity or device capable of carrying the computer program code, recording medium, USB flash drive, mobile hard disk, disk, optical disk, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), electric carrier signal, telecommunication signal and software distribution medium, etc. It should be noted that the content contained in the computer readable medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, computer readable media do not include electric carrier signals and telecommunication signals.

[0128] The above is a preferred embodiment of the present invention. It should be pointed out that a person skilled in the art can make several improvements and modifications without departing from the principle of the present invention. These improvements and modifications are also considered to be within the scope of protection of the present invention.

Claims

1. A GEAR protocol routing method, characterized in that: include: Obtaining a first estimated cost value of a current routing node and second estimated cost values ​​of all neighbor routing nodes of the current routing node; Selecting a neighbor routing node in order from low to high in the second estimated cost value, and performing a hole judgment on the neighbor routing node until a certain neighbor routing node is confirmed to be a non-hole routing node, and using the neighbor routing node that is a non-hole routing node as the next-hop routing node of the current routing node; Determine whether the second estimated cost value of the next-hop routing node is lower than the first estimated cost value. If so, send the data packet to be forwarded to the next-hop routing node. If not, add the current node route to the hole avoidance table of the current node route, and send the data packet to be forwarded and the hole avoidance table to the next-hop routing node.

2. The GEAR protocol routing method according to claim 1, characterized in that: Before obtaining the first estimated cost value of the current routing node and the second estimated cost values ​​of all neighboring routing nodes of the current routing node, the method further includes: Get the urgency value of all data packets in the current routing node; Selecting one data packet as the data packet to be forwarded in descending order of the urgency value; For each selected data to be forwarded, perform the following operations: Acquire a first residual energy value of a current routing node, a target area of ​​a data packet to be forwarded, and a first queuing delay of the data packet to be forwarded at the current routing node; Acquire the second residual energy values ​​of all neighbor routing nodes of the current routing node and the second queuing delay of the to-be-forwarded data packet at each neighbor node; Calculate a first estimated cost value of the to-be-forwarded data packet from the current routing node to the target area according to the first remaining energy value, the target area and the first queuing delay; For each neighbor node, a second estimated cost value of the to-be-forwarded data packet from the neighbor node to the target area is calculated according to the corresponding second residual energy value, the target area and the corresponding second queuing delay.

3. The GEAR protocol routing method according to claim 2, characterized in that: Obtaining a second queuing delay of the to-be-forwarded data packet at each neighboring node includes: A probe packet is sent to each neighbor routing node, so that each neighbor routing node measures a second queuing delay of the neighbor routing node, and returns the second queuing delay to the current routing node.

4. The GEAR protocol routing method according to claim 2, characterized in that: The calculating, according to the first remaining energy value, the target area and the first queuing delay, a first estimated cost value of the to-be-forwarded data packet from the current routing node to the target area comprises: According to the target area, determining a first transmission distance from the current routing node to the target area; Calculating a current priority value of the to-be-forwarded data packet at a current routing node according to the first transmission distance and the first queuing delay; Calculating the first estimated cost value according to the current priority value, the first remaining energy value and the first queuing delay; The calculating, according to the corresponding second residual energy value, the target area and the corresponding second queuing delay, a second estimated cost value of the to-be-forwarded data packet from the neighbor node to the target area comprises: Determining, according to the target area, a second transmission distance from the neighbor routing node to the target area; According to the second transmission distance and the second queuing delay, calculating the neighbor priority value of the to-be-forwarded data packet at the neighbor routing node; Calculating the second estimated cost value according to the neighbor priority value, the second remaining energy value and the second queuing delay; The calculation formula of the priority value is: p(A,E,G)=d(A,E) / t(A,G); In the formula, A represents the routing node; E represents the target area; G represents the data packet to be forwarded; p(A,E,G) represents the priority value of the data packet G to be forwarded with the target area E at the routing node A; d(A,E) represents the transmission distance from the routing node A to the target area E; t(A,G) represents the queuing delay of the data G to be processed at the routing node A; The estimated cost value is calculated as: c(A,E,G)=α*d(A,E)+β*p(A,E,G)+(1-α-β)*e(A); Where c(A, E, G) represents the estimated cost value of the data packet G to be forwarded from routing node A to the target area E; e(A) represents the remaining capacity value of routing node A; α and β are adjustable parameters.

5. The GEAR protocol routing method according to claim 1, wherein: The performing a hole judgment on the neighbor routing node includes: Determine whether the neighbor routing node is in the hole avoidance table, and if the neighbor routing node is in the hole avoidance table, confirm that the neighbor routing node is a hole routing node; If the neighbor routing node is not in the hole avoidance table, it is determined whether there is an intermediate routing node in the hole avoidance table among all the intermediate routing nodes on the straight path from the neighbor routing node to the target area. If there is an intermediate routing node in the hole avoidance table, the neighbor routing node is confirmed to be a hole routing node. Otherwise, the neighbor routing node is determined to be a non-hole routing node.

6. The GEAR protocol routing method according to claim 1, wherein: The fields of the hole avoidance table include: routing node number; The adding the current node route to the hole avoidance table of the current node route includes: Get the current routing node number; A data item is added to the hole avoidance table, and a routing node field of the data item is filled in according to the current routing node number.

7. The GEAR protocol routing method according to claim 1, wherein: Also includes: When no data packet is received from a neighbor routing node within a preset detection period, the hole avoidance table of the current routing node is cleared; When a hole avoidance table is received from a neighbor routing node, the hole avoidance table of the current routing node is updated according to the received hole avoidance table.

8. A router, characterized in that: include: Data acquisition module and data processing module; The data acquisition module is used to acquire a first estimated cost value of a current routing node and second estimated cost values ​​of all neighboring routing nodes of the current routing node; The data processing module is used to select a neighbor routing node in turn according to the second estimated cost value from low to high order, perform hole judgment on the neighbor routing node, until a neighbor routing node is confirmed to be a non-hole routing node, and use the neighbor routing node that is a non-hole routing node as the next-hop routing node of the current routing node; judge whether the second estimated cost value of the next-hop routing node is lower than the first estimated cost value, if so, send the data packet to be forwarded to the next-hop routing node, if not, add the current node route to the hole avoidance table of the current node route, and send the data packet to be forwarded and the hole avoidance table to the next-hop routing node.

9. A terminal device, characterized in that: The method comprises a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor implements the GEAR protocol routing method according to any one of claims 1 to 7 when executing the computer program.

10. A storage medium, characterized in that: The storage medium includes a stored computer program, wherein when the computer program is running, the device where the storage medium is located is controlled to execute the GEAR protocol routing method according to any one of claims 1 to 7.

Citation Information

Cited By

  • Gear protocol routing method, router, terminal device and storage medium

    WO2026020714A1