Ad hoc network communication routing method and system considering battery residual energy, and medium

Abstract

The invention relates to the technical field of ad hoc network data communication, in particular to an ad hoc network communication routing method and system considering battery residual energy and a medium. According to the method, residual energy virtual hops are calculated according to battery residual energy of a reference node, multipath attenuation and environmental factor influences are considered at the same time, and node receiving signal strength virtual hops are calculated according to signal strength of a transmitting node. In the path selection process, the node receiving signal strength virtual hops and the residual energy virtual hops serve as judgment bases, the routing path with higher quality and stability is selected, transmission along a single path is avoided while transmission reliability is guaranteed, node energy consumption is balanced, and the problems of resource waste and overhigh local node energy consumption are avoided. The reliability and stability of the communication transmission process are ensured, and meanwhile, the node resources are reasonably scheduled, so that the node energy consumption is balanced.

Description

Technical Field

[0001] The present invention relates to the technical field of self-organizing network data communication, and in particular to a self-organizing network communication routing method, system and medium taking into account the remaining energy of a battery. Background Art

[0002] In the process of monitoring the status of equipment and personnel in civil air defense passages or underground coal mines, the topological scene of the wireless ad hoc network underground should be approximately rectangular, and most of the wireless nodes are randomly distributed. The network can be established through mobile terminal devices and wireless nodes carried by personnel. The wireless nodes are powered by batteries and are mobile. The number may change dynamically, and the transmit and receive power will also change with the distance. Therefore, the topological structure of the wireless ad hoc network is also changing dynamically. Adjacent nodes can directly interact with data information, and non-adjacent nodes communicate through multi-hop forwarding. Multi-hop forwarding is the main information interaction method of the wireless ad hoc network. All network nodes in the wireless ad hoc network have equal status and have both terminal reception and routing forwarding functions. When there is no fixed infrastructure, the routing forwarding function of the node can still be used to establish a communication network. When some intermediate nodes cannot work normally due to exhaustion or damage, the remaining normal nodes in the network can also continue to establish network connections to achieve effective data transmission.

[0003] At present, the wireless ad hoc network on-demand plane distance vector routing protocol (Ad hoc On-Demand Distance Vector Routing, AODV) commonly used in ad hoc network communication selects the path based on the shortest transmission hop count. It only needs to update the route according to the actual number of hops passed during the packet forwarding process and the newness of the route. The protocol is simple and easy to implement. AODV is a reactive routing protocol, that is, when sending a packet to the destination node, the source node initiates the route search process in the network to find the corresponding route. On the contrary, many common Internet routing protocols are a priori, that is, they do not rely on whether the nodes on the path want to send packets, but each node maintains a routing table containing the routing information to other nodes. Nodes continuously update their own routing tables by periodically exchanging routing information so that they can timely reflect the network topology and changes, and maintain consistent, timely and accurate routing information. As the name of the protocol suggests, the wireless ad hoc network on-demand plane distance vector routing protocol is a plane distance vector routing protocol.

[0004] However, when the link quality is poor, data packets may be lost or delayed, which will result in multiple retransmissions during the route discovery phase, thereby increasing network latency, which will increase network overhead and management burdens, occupy bandwidth and time, and reduce overall transmission efficiency. In addition, in large-scale networks, there are a large number of nodes, but the protocol only stores one transmission path in its routing table. The nodes on this path will undertake a large amount of data packet forwarding work, which consumes more energy than other nodes, and will also cause some areas to be overloaded while other areas are idle, thus affecting the transmission performance of the overall network. At present, wireless ad hoc networks basically prioritize data transmission with the shortest path. When a node on a shortest path works multiple times, it will increase the energy consumption of the node and cause other nodes to be unused for a long time, thus causing a waste of resources and increasing costs. In addition, there is also a problem of signal strength differences between nodes on the shortest path, and there may be unstable signals, which will lead to a significant decrease in transmission rate and reliability, and the selected path is not the theoretically optimal path. Summary of the invention

[0005] The technical problem to be solved by the present invention is to provide a wireless ad hoc network communication routing method, system and medium that take into account the remaining battery energy. A better routing path is selected based on the remaining battery energy and the strength of the transmitted and received signals, thereby ensuring the reliability and stability of the communication transmission process and reasonably scheduling the resources of each node, thereby balancing the node energy consumption.

[0006] In order to solve the technical problem, the technical solution adopted by the present invention is: a self-organizing network communication routing method considering the remaining battery energy, comprising the following steps: S01. Define the packet data structure of the routing protocol, including routing table, routing request packet, and routing reply packet; The routing table includes the destination node IP address, network interface, destination node serial number, next hop node, hop count, routing flag, received signal strength difference ratio, remaining energy proportion and virtual hop count. The received signal strength difference ratio field stores the difference ratio between the received signal strength of the next hop node and the received signal strength threshold, and the corresponding received signal strength virtual hop count is determined according to the value. The remaining energy proportion field stores the remaining energy proportion of the next hop node, and the corresponding remaining energy virtual hop count is determined according to the value. The virtual hop count field stores the total virtual hop count from the source node to the current node, and the sum of the total virtual hop count and the real hop count is used as the comprehensive hop count required for path selection. The routing request packet includes the routing request ID, the destination node IP address, the destination node serial number, the source node IP address, the source node serial number, the received signal strength difference ratio and the remaining energy ratio. Two fields, the received signal strength difference ratio and the remaining energy ratio, are added to the routing request packet to store the received signal strength virtual hop count and the remaining energy virtual hop count of the previous path, which is convenient for calculating the comprehensive hop count of the current path. S02, route discovery, route discovery is completed by establishing reverse routing and forward routing, the specific process is as follows: Before sending a data packet, the source node first checks whether the available route to the destination node has been saved in its routing table. If it has been saved, the source node directly sends the data packet to the destination node. If not, the source node starts the route request process and broadcasts the route request packet to the surrounding neighboring nodes. The intermediate node that receives the route request packet first determines whether the route request packet is sent by itself or has received the same route request packet. If so, the route request packet is discarded. If not, the intermediate node calculates the virtual hop count of the received signal strength and the virtual hop count of the remaining energy according to its own received signal strength and the proportion of the remaining battery energy. Then, the intermediate node continues to forward the route request packet until it reaches the destination node. Finally, the sum of the total virtual hop count and the real hop count is taken as the comprehensive hop count of the path. There is a waiting time after the routing request packet is delivered to the destination node. After the waiting time expires, the path with the smallest comprehensive hop value is selected as the reverse route. The destination node sends the routing reply packet back to the source node along the established reverse route. The routing reply packet arrives at the source node to complete the establishment of the forward route. The completion of the establishment of both the forward and reverse routes indicates that a complete routing path has been constructed.

[0007] Furthermore, the remaining energy virtual jump count is calculated as follows: (1), in Indicates the number of remaining energy virtual jumps, is a natural number greater than 1. Indicates the remaining energy ratio of the node, (2), represents the initial energy of the node, Indicates the energy consumed by the node; The calculation method of received signal strength virtual hop count is: Set the node receiving signal strength to , the received signal strength threshold is set to ,when When the received signal strength virtual hop count is 0, When , the difference ratio between the received signal strength of the node and the received signal strength threshold is calculated. (3), in It represents the difference ratio between the node received signal strength and the received signal strength threshold, and the received signal strength virtual hop count is: (4), in is a natural number greater than 1; The comprehensive hop count calculation method of the route discovery process is: (5), in Indicates the comprehensive hop count. Indicates the actual number of hops that the source node takes to forward the routing request message to the destination node. , , is the proportionality coefficient.

[0008] Furthermore, when calculating the comprehensive hop count of a path, the virtual hop count is the sum of the virtual hop counts of all nodes on the path except the source node.

[0009] Furthermore, the processing flow of the routing request packet is as follows: S11, the intermediate node receives the route request packet to establish a reverse route, and determines whether the same route request packet has been received. If it has been received, the route request packet is discarded. If it has not been received, step S12 is executed; S12, calculate the remaining energy virtual hop count of the node according to formula (1) and (2), and determine whether the received signal strength is greater than the received signal strength threshold. If so, set the signal strength virtual hop count to 0 and proceed to step S14. If not, proceed to step S13. S13, calculating the received signal strength virtual hop count according to formulas (3) and (4), and executing step S14; S14, continue to forward the routing request packet until it reaches the destination node; S15. Calculate the comprehensive hop count according to formula (5).

[0010] Furthermore, the process of route discovery is as follows: S21, node A receives a data packet, determines whether the received data packet is a routing request packet, if it is a routing request packet, determines whether node A is an intermediate node, if it is an intermediate node, executes step S22, if it is not an intermediate node, executes step S23; if it is not a routing request packet, determines whether the received data packet is a routing reply packet, if it is not a routing reply packet, ends the process, if it is a routing reply packet, executes step S23; S22, calculate the received signal strength virtual hop count and the remaining energy virtual hop count, continue forwarding the routing request packet until it reaches the destination node, calculate the comprehensive hop count, and establish a reverse route; S23, node A replies with a routing reply packet, and determines whether the routing reply packet is received by the source node, if yes, establishes a forward route, if not, continues to forward the routing reply packet until it reaches the source node; S24. The forward route and the reverse route constitute the completed route.

[0011] Furthermore, it also includes step S03 route maintenance, broadcasting a detection message at a fixed period to detect the connection status between nodes. Once no reply is received from the adjacent node within the time limit, it is considered that the connection may have been interrupted, and local repair is performed. If the local repair is unsuccessful, the route discovery process is restarted to establish a new route.

[0012] The present invention also discloses a self-organizing network communication routing system that takes the remaining battery energy into consideration, comprising a processor and a memory storing program instructions, wherein the processor is configured to execute the self-organizing network communication routing method that takes the remaining battery energy into consideration as described above when running the program instructions.

[0013] The present invention also discloses a storage medium storing program instructions, which, when running, execute the self-organizing network communication routing method considering the remaining battery energy as described above.

[0014] Beneficial effects of the present invention: Compared with the existing methods, the present invention calculates the number of virtual hops of residual energy with reference to the battery residual energy of the node. At the same time, the multipath attenuation and environmental factors are considered, the strength of the received signal is calculated according to the signal strength of the transmitting node, and the number of virtual hops of the received signal strength of the node is calculated. When selecting a path, the node received signal strength and residual energy are used as the basis for judgment, and a more high-quality and stable routing path is selected, while ensuring transmission reliability and avoiding transmission along a single path, balancing node energy consumption, avoiding resource waste and excessive energy consumption of local nodes.

[0015] Through this method, the average round-trip delay and packet loss rate of the network can be greatly improved, and the network stability and reliability can be significantly improved. In addition, the communication node has both wireless terminal and routing functions, flexible networking, and strong scalability. The research results can be quickly deployed and can be applied to various spaces such as urban transportation, mines, tunnels, subways, etc. It is expected to have broad prospects for promotion and application, and have high economic and social benefits. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] Figure 1 It is a schematic diagram of the TCP / IP network reference model; Figure 2 A flow chart for routing request packet processing; Figure 3 Flowchart for route discovery; Figure 4 Schematic diagram for route discovery; Figure 5 This is a schematic diagram of the network topology structure of a self-organizing network. DETAILED DESCRIPTION

[0017] The present invention will be further described below in conjunction with the accompanying drawings and specific implementations.

[0018] Example 1 This embodiment discloses a wireless ad hoc network communication routing method considering the remaining battery energy. Figure 1 The TCP / IP network reference model is shown in . This method mainly improves the routing protocol in the network layer of the wireless ad hoc network communication protocol, and is a practical ad hoc network for low-power wide area networks (LPWANs).

[0019] This method aims to select a better routing path based on the on-demand plane distance vector routing protocol (AODV) in wireless ad hoc networks when the wireless nodes in the wireless ad hoc networks are powered by batteries, combined with the Shadowing wireless transmission model, taking into account the remaining battery energy and the strength of the transmitted and received signals, so as to ensure the reliability and stability of the communication transmission process, and reasonably schedule the resources of each node, thereby balancing the node energy consumption.

[0020] This method mainly consists of three parts: 1. Calculate the number of virtual network paths based on the remaining battery energy and the received signal strength, and determine the comprehensive number of path hops based on the real number of hops and the virtual number of hops.

[0021] First, consider the influence of various factors in the environment. According to the size of the application environment, the obstacles in the propagation path, and whether there are electronic devices in the environment that can affect signal propagation, determine the resource allocation plan for each node to reduce the signal multipath attenuation problem and the external influence on the propagation signal. The resource allocation includes allocating more power to nodes that are used more frequently, or if there are objects in a certain environment that have a greater impact on the quality of signal propagation, more nodes will be allocated to the mirror or hardware with stronger signal transmission capabilities will be used.

[0022] Combine the wireless transmission environment and the remaining battery energy of each node to define the remaining energy ratio of the node : (2), in represents the initial energy of the node, Indicates the energy consumed by the node.

[0023] The remaining energy of the battery of the reference node is used to calculate the number of remaining energy virtual hops, and the proportion of the remaining energy is divided into levels, with different virtual hops set for different levels. The larger the value is, the more residual energy the node has, and the smaller the residual energy virtual hop count is set at this time; The smaller the value, the more serious the node's energy consumption is. In this case, the remaining energy virtual hop number should be set larger. for: (1), in It is a natural number greater than 1 and can be adjusted according to the specific requirements of the network.

[0024] Set the node receiving signal strength to , the received signal strength threshold is set to ,when When , it indicates that the communication path established through this node is highly stable, the possibility of signal instability is small, and it is a high-quality path. Therefore, the number of virtual hops of the received signal strength is set to 0. When , the difference between the received signal strength of the calculation node and the received signal strength threshold is : (3), in Represents the difference between the node's received signal strength and the received signal strength threshold. When the value is large, it indicates that the node signal strength is very poor. However, in order to avoid the situation where the routing connection cannot be established, the virtual hop number of the node signal strength is set to be large. When the value is small, the signal strength of the node is not optimal, but the impact is small, so the virtual hop number is set to be small. Therefore, the virtual hop number of the node's received signal strength is defined as: (4), in It is a natural number greater than 1 and can be adjusted according to the specific requirements of the network.

[0025] In this method, the path hop count consists of two parts. The first part is the actual hop count that the source node forwards the routing request message to the destination node. The second part is the virtual jump count mentioned above, including the residual energy virtual jump count and received signal strength virtual hop count , so the comprehensive hop count calculation method of the route discovery process is: (5), in Indicates the comprehensive hop count. Indicates the actual number of hops that the source node takes to forward the routing request message to the destination node. , , is the proportionality coefficient, Determined by the ratio of real hops to virtual hops. and The proportion of the two virtual hops is defined according to the needs of the site. Finally, the residual energy virtual hops, the received signal strength virtual hops and the real hops are added in a certain proportion to obtain the comprehensive hop count. For the destination node, the virtual hop count refers to the sum of the virtual hop counts of all nodes on the path from the source node to the destination node; for the intermediate node, the virtual hop count refers to the sum of the virtual hop counts of all nodes from the source node to the current node.

[0026] 2. The packet data structure that defines the routing protocol includes routing tables, route request packets (RREQs), and route reply packets (RREPs).

[0027] (1) Routing table The routing table of the routing protocol contains the destination node IP address, network interface, destination node serial number, next hop node, hop count, routing flag, received signal strength difference ratio, remaining energy ratio and virtual hop count. The received signal strength difference ratio field stores the difference ratio between the received signal strength of the next hop node and the threshold. After determining the value, the corresponding number of virtual hops is determined using formula (1); the remaining energy percentage field stores the remaining energy percentage of the next hop node. According to the ratio, the corresponding number of virtual hops is determined using formula (4); the virtual hop count field stores the total number of virtual hops from the source node to the current node. The sum of the total number of virtual hops and the real number of hops is used as the comprehensive number of hops required for path selection.

[0028] (2) RREQ routing request packet The format of the route request packet includes the route request ID, the destination node IP address, the destination node serial number, the source node IP address, the source node serial number, the received signal strength difference ratio and the remaining energy ratio. When the source node fails to find a valid route to the destination node in the routing table, it will broadcast the route request packet. The route request ID is the unique identifier of each route request packet. In addition, the IP address and serial number information of the destination node and the source node are stored in the route request packet, and the received signal strength difference ratio and the remaining energy ratio are added. The two fields are stored in correspondence with the virtual hop count of the previous path, which is convenient for calculating the comprehensive hop count of the current path. Here, calculating the comprehensive hop count of the current path means that when a node receives the RREQ route request packet when establishing a route, and then according to the virtual hop count of the previous path (the path from the source node to the node forwarding the RREQ route request packet) stored in the packet, the virtual hop count of the received signal strength and the virtual hop count of the remaining energy are added to the virtual hop count of the current node to obtain the comprehensive hop count of the path from the source node to the current node. If the node is not the destination node, the RREQ routing request packet will continue to be forwarded until it reaches the destination node, the total integrated hop count of the routing path will be calculated, and a complete route will be established.

[0029] (3) RREP routing reply packet When a route request packet reaches a destination node or an intermediate node knows a valid route to the destination node, a route reply packet is generated. The route reply packet is used to unicast a reply to the route from the source node that sent the route request packet to the destination node. Through this process, a forward route can be established from the intermediate node that receives the route reply packet to the destination node. In this embodiment, the format of the route reply packet is not changed and remains consistent with the original AODV protocol.

[0030] 3. Final routing path selection, including routing discovery and routing maintenance.

[0031] (1) Route discovery Route discovery is accomplished by establishing reverse routes and forward routes. Before sending a data packet, the source node needs to find a path connecting itself and the destination node. The source node will first check whether a valid route to the destination node has been saved in its routing table. If so, the source node can directly send the data packet to the destination node. If no available route is found in the routing table, the source node will start the route request process and broadcast the RREQ route request packet to the surrounding neighboring nodes.

[0032] The intermediate node that receives the route request packet first determines whether the packet is sent by itself. If so, it discards the route request packet. Otherwise, it determines whether it is the first time to receive the route request packet. If it is the first time, it compares its own received signal strength with the threshold, and obtains the corresponding received signal strength virtual hop number and residual energy virtual hop number through formulas (1) and (4). Then it continues to forward the route request packet until it reaches the destination node. Finally, the sum of the total virtual hop number and the real hop number is taken as the comprehensive hop number of the path.

[0033] When the destination node receives the RREQ packet, it will unicast the RREP routing response packet to the source node. While forwarding the RREP packet, the intermediate node will complete the establishment of the forward route. When both the forward route and the reverse route are established, it means that the complete routing path has been successfully established. Figure 4 shown.

[0034] After the routing request packet arrives at the destination node, there will be a short waiting time. After the timeout, the comprehensive hop count of each path will be calculated based on the routing table information, and the path with the smallest comprehensive hop count will be selected as the reverse route. The destination node will send the routing reply packet back to the source node along the established reverse route. The routing reply packet arrives at the source node to complete the establishment of the forward route. The completion of the establishment of both the forward and reverse routes indicates that a complete routing path has been constructed.

[0035] like Figure 2 As shown in the figure, the processing flow of routing request packets is as follows: S11, the intermediate node receives the route request packet to establish a reverse route, and determines whether the same route request packet has been received. If it has been received, the route request packet is discarded. If it has not been received, step S12 is executed; S12, calculate the remaining energy virtual hop count of the node according to formula (1) and (2), and determine whether the received signal strength is greater than the received signal strength threshold. If so, set the signal strength virtual hop count to 0 and proceed to step S14. If not, proceed to step S13. S13, calculating the received signal strength virtual hop count according to formulas (3) and (4), and executing step S14; S14, continue to forward the routing request packet until it reaches the destination node; S15. Calculate the comprehensive hop count according to formula (5).

[0036] like Figure 3 As shown in the figure, the process of route discovery is: S21, node A receives a data packet, determines whether the received data packet is a routing request packet, if it is a routing request packet, determines whether node A is an intermediate node, if it is an intermediate node, executes step S22, if it is not an intermediate node, executes step S23; if it is not a routing request packet, determines whether the received data packet is a routing reply packet, if it is not a routing reply packet, ends the process, if it is a routing reply packet, executes step S23; S22, calculate the received signal strength virtual hop count and the remaining energy virtual hop count, continue forwarding the routing request packet until it reaches the destination node, calculate the comprehensive hop count, and establish a reverse route; S23, node A replies with a routing reply packet, and determines whether the routing reply packet is received by the source node, if yes, establishes a forward route, if not, continues to forward the routing reply packet until it reaches the source node; S24. The forward route and the reverse route constitute the completed route.

[0037] (2) Route maintenance The improvement of AODV routing protocol is mainly aimed at the route discovery process. The route maintenance process is consistent with the original protocol, that is, a detection message is broadcast once at a fixed period to detect the connection status between nodes. Once a timeout is exceeded and no reply is received from the adjacent node, it is considered that the connection may have been interrupted. The node will first perform local repair. If the local repair is unsuccessful, the route discovery process will be restarted to establish a new route.

[0038] When implementing this method, a self-organizing network communication test node is designed with a high-performance microprocessor as the core. To facilitate networking tests in various environments, multiple wireless communication methods such as LoRa and ZETA are designed on a single node with low power consumption and long communication distance as the selection conditions. The designed node has both communication terminal and routing forwarding functions, providing a hardware foundation for flexible and reliable networking.

[0039] Self-build development environment, select common embedded drivers and application modules, and select appropriate development frameworks, including storage, display, network and other driver frameworks and corresponding file application development processes. System layered development and task allocation are more conducive to speeding up the development progress and building a more complete wireless network communication test system. The design content has strong network functions, which facilitates remote configuration of communication nodes, data reading and recording during the test process.

[0040] Select wireless network communication technology with low power consumption and long transmission distance to build an ad hoc network. Adopt a variety of different transmission methods in different time periods for the network, and combine the deep sleep mode of the node to carry out low power consumption design. At the same time, multi-level routing is further used in ad hoc network communication to achieve multi-hop transmission and further extend the communication distance. Through software development and configuration, a distributed ad hoc network is realized, and the topology of the distributed network composed of Internet of Things technology is designed. Figure 5 shown.

[0041] Adjacent nodes can directly transmit data, and non-adjacent nodes communicate through multi-hop forwarding. Except for the gateway, all nodes have the same status. All nodes aggregate data through the gateway and connect to the external Ethernet, sending the data of each node to the PC. The application layer is responsible for data reception, data storage and display, and the wireless network is tested through the above networks and devices.

[0042] The remaining energy of the battery of the reference node is used to calculate the number of virtual hops of remaining energy. At the same time, considering the influence of multipath attenuation and environmental factors, the strength of the received signal is calculated according to the signal strength of the transmitting node, and the number of virtual hops of the received signal strength of the node is calculated. When selecting a path, the node received signal strength and remaining energy are used as the basis for judgment to select a better and more stable routing path.

[0043] Finally, after setting up the software and hardware environment, the above method was used to conduct multiple tests on the network's round-trip delay and packet loss rate, and multiple motherboards were used to form a wireless ad hoc network for connectivity and performance testing.

[0044] Example 2 The embodiment of the present disclosure provides a self-organizing network communication routing system considering the remaining battery energy, including a processor and a memory. Optionally, the device may also include a communication interface and a bus. The processor, the communication interface, and the memory may communicate with each other through the bus. The communication interface may be used for information transmission. The processor may call the logic instructions in the memory to execute the self-organizing network communication routing method considering the remaining battery energy of the above embodiment.

[0045] In addition, the logic instructions in the above-mentioned memory can be implemented in the form of software functional units and can be stored in a computer-readable storage medium when sold or used as an independent product.

[0046] The memory, as a computer-readable storage medium, can be used to store software programs and computer executable programs, such as program instructions / modules corresponding to the method in the embodiment of the present disclosure. The processor executes the functional application and data processing by running the program instructions / modules stored in the memory, that is, the self-organizing network communication routing method considering the remaining battery energy in the above embodiment is implemented.

[0047] The memory may include a program storage area and a data storage area, wherein the program storage area may store an operating system and an application required for at least one function; the data storage area may store data created according to the use of the terminal device, etc. In addition, the memory may include a high-speed random access memory and may also include a non-volatile memory.

[0048] Example 3 An embodiment of the present disclosure provides a computer-readable storage medium storing computer-executable instructions, wherein the computer-executable instructions are configured to execute the above-mentioned self-organizing network communication routing method considering the remaining battery energy.

[0049] The computer-readable storage medium mentioned above may be a transient computer-readable storage medium or a non-transitory computer-readable storage medium.

[0050] The technical solution of the embodiment of the present disclosure can be embodied in the form of a software product, which is stored in a storage medium and includes one or more instructions for enabling a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method described in the embodiment of the present disclosure. The aforementioned storage medium may be a non-transient storage medium, including: a USB flash drive, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a disk or an optical disk, and other media that can store program codes, or a transient storage medium.

[0051] The above description and the accompanying drawings fully illustrate the embodiments of the present disclosure so that those skilled in the art can practice them. Other embodiments may include structural, logical, electrical, process and other changes. The embodiments represent only possible changes. Unless explicitly required, separate components and functions are optional, and the order of operation may vary. The parts and features of some embodiments may be included in or replace the parts and features of other embodiments. Moreover, the words used in this application are only used to describe the embodiments and are not used to limit the scope of protection. As used in the description in the text, unless the context clearly indicates, the singular forms of "a", "an" and "the" are intended to include plural forms as well. Similarly, the term "and / or" as used in this application refers to any and all possible combinations of one or more associated listings. In addition, when used in this application, the term "comprise" and its variants "comprises" and / or comprising refer to the presence of stated features, wholes, steps, operations, elements, and / or components, but do not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or groups thereof. In the absence of further restrictions, the elements defined by the sentence "including one..." do not exclude the presence of other identical elements in the process, method or device including the elements. In this article, each embodiment may focus on the differences from other embodiments, and the same and similar parts between the embodiments may refer to each other. For the methods, products, etc. disclosed in the embodiments, if they correspond to the method part disclosed in the embodiments, then the relevant parts can refer to the description of the method part.

[0052] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software may depend on the specific application and design constraints of the technical solution. The technicians may use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the embodiments of the present disclosure. The technicians may clearly understand that for the convenience and simplicity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments, and will not be repeated here.

Claims

1. A communication routing method for an ad hoc network taking into account the remaining energy of a battery, characterized in that: The following steps are involved: S01. Define the packet data structure of the routing protocol including routing table, routing request packet, and routing reply packet; The routing table includes the destination node IP address, network interface, destination node serial number, next hop node, hop count, routing flag, received signal strength difference ratio, remaining energy proportion and virtual hop count. The received signal strength difference ratio field stores the difference ratio between the received signal strength of the next hop node and the received signal strength threshold, and the corresponding received signal strength virtual hop count is determined according to the value. The remaining energy proportion field stores the remaining energy proportion of the next hop node, and the corresponding remaining energy virtual hop count is determined according to the value. The virtual hop count field stores the total virtual hop count from the source node to the current node, and the sum of the total virtual hop count and the real hop count is used as the comprehensive hop count required for path selection. The routing request packet includes the routing request ID, the destination node IP address, the destination node serial number, the source node IP address, the source node serial number, the received signal strength difference ratio and the remaining energy ratio. Two fields, the received signal strength difference ratio and the remaining energy ratio, are added to the routing request packet to store the received signal strength virtual hop count and the remaining energy virtual hop count of the previous path, which is convenient for calculating the comprehensive hop count of the current path. S02, route discovery, route discovery is completed by establishing reverse routing and forward routing, the specific process is as follows: Before sending a data packet, the source node first checks whether the available route to the destination node has been saved in its routing table. If it has been saved, the source node directly sends the data packet to the destination node. If not, the source node starts the route request process and broadcasts the route request packet to the surrounding neighboring nodes. The intermediate node that receives the route request packet first determines whether the route request packet is sent by itself or has received the same route request packet. If so, the route request packet is discarded. If not, the intermediate node calculates the virtual hop count of the received signal strength and the virtual hop count of the remaining energy according to its own received signal strength and the proportion of the remaining battery energy. Then, the intermediate node continues to forward the route request packet until it reaches the destination node. Finally, the sum of the total virtual hop count and the real hop count is taken as the comprehensive hop count of the path. There is a waiting time after the routing request packet is delivered to the destination node. After the waiting time expires, the path with the smallest comprehensive hop value is selected as the reverse route. The destination node sends the routing reply packet back to the source node along the established reverse route. The routing reply packet arrives at the source node to complete the establishment of the forward route. The completion of the establishment of both the forward and reverse routes indicates that a complete routing path has been constructed.

2. The method for ad hoc network communication routing considering the remaining battery energy according to claim 1, characterized in that: The calculation method of the remaining energy virtual jump number is: （1）， in Indicates the number of remaining energy virtual jumps, is a natural number greater than 1. Represents the remaining energy ratio of the node, （2）， represents the initial energy of the node, Indicates the energy consumed by the node; The calculation method of received signal strength virtual hop count is: Set the node receiving signal strength to , the received signal strength threshold is set to ,when When the received signal strength virtual hop count is 0, When , the difference ratio between the received signal strength of the node and the received signal strength threshold is calculated. （3）， in It represents the difference ratio between the node received signal strength and the received signal strength threshold, and the received signal strength virtual hop count is: （4）， in is a natural number greater than 1; The comprehensive hop count calculation method of the route discovery process is: （5）， in Indicates the comprehensive hop count. Indicates the actual number of hops that the source node takes to forward the routing request message to the destination node. , , is the proportionality coefficient.

3. The method for communication routing in an ad hoc network taking into account the remaining battery energy according to claim 2, characterized in that: When calculating the comprehensive hop count of a path, the virtual hop count is the sum of the virtual hop counts of all nodes on the path except the source node.

4. The method for communication routing in an ad hoc network taking into account the remaining battery energy according to claim 2, characterized in that: The processing flow of routing request packets is as follows: S11, the intermediate node receives the route request packet to establish a reverse route, and determines whether the same route request packet has been received. If it has been received, the route request packet is discarded. If it has not been received, step S12 is executed; S12, calculate the remaining energy virtual hop count of the node according to formula (1) and (2), and determine whether the received signal strength is greater than the received signal strength threshold. If so, set the signal strength virtual hop count to 0 and proceed to step S14. If not, proceed to step S13. S13, calculating the received signal strength virtual hop count according to formulas (3) and (4), and executing step S14; S14, continue to forward the routing request packet until it reaches the destination node; S15. Calculate the comprehensive hop count according to formula (5).

5. The method for communication routing in an ad hoc network taking into account the remaining battery energy according to claim 1 or 2, characterized in that: The process of route discovery is: S21, node A receives a data packet, determines whether the received data packet is a routing request packet, if it is a routing request packet, determines whether node A is an intermediate node, if it is an intermediate node, executes step S22, if it is not an intermediate node, executes step S23; if it is not a routing request packet, determines whether the received data packet is a routing reply packet, if it is not a routing reply packet, ends the process, if it is a routing reply packet, executes step S23; S22, calculate the received signal strength virtual hop count and the remaining energy virtual hop count, continue forwarding the routing request packet until it reaches the destination node, calculate the comprehensive hop count, and establish a reverse route; S23, node A replies with a routing reply packet, and determines whether the routing reply packet is received by the source node, if yes, establishes a forward route, if not, continues to forward the routing reply packet until it reaches the source node; S24. The forward route and the reverse route constitute the completed route.

6. The method for communication routing in an ad hoc network taking into account the remaining battery energy according to claim 1, characterized in that: It also includes step S03 route maintenance, which broadcasts a detection message at a fixed period to detect the connection status between nodes. Once no reply is received from the adjacent node within the time limit, it is considered that the connection may have been interrupted, and a local repair is performed. If the local repair is unsuccessful, the route discovery process is restarted to establish a new route.

7. A self-organizing network communication routing system considering the remaining battery energy, comprising a processor and a memory storing program instructions, characterized in that: The processor is configured to execute the self-organizing network communication routing method considering the remaining battery energy as described in any one of claims 1 to 6 when running the program instructions.

8. A storage medium storing program instructions, characterized in that: When the program instructions are executed, the self-organizing network communication routing method considering the remaining battery energy as described in any one of claims 1 to 6 is executed.

Images