Dynamic routing method and device for ultraviolet light flight ad hoc network, medium and product
By adopting a location-based dynamic routing method in the ultraviolet flying ad hoc network, the routing decision errors and topology change problems of ultraviolet FANET in three-dimensional space are solved, efficient data packet forwarding is achieved, and network performance is improved.
Patent Information
- Application Number
- CN202511049731.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-07-29
- Publication Date
- 2025-10-17
AI Technical Summary
Existing routing methods for ultraviolet flying ad hoc networks (FANETs) are prone to routing decision errors in three-dimensional space, are unable to cope with rapid changes in network topology, and do not fully consider the high-speed mobility of nodes, resulting in frequent disconnection of communication links and packet loss.
A location-based dynamic routing method is adopted. By setting the ultraviolet light communication mode, determining the RWP motion model, detecting neighbor nodes to generate an information table, updating node location information, and dynamically selecting greedy or peripheral forwarding mode, using beacon broadcasting and data packet propagation methods, the neighbor node location is predicted and the optimal path is selected for data packet forwarding.
It effectively reduces frequent routing disconnections and decision errors, reduces end-to-end latency and energy consumption, improves data packet delivery rate, and enhances routing robustness.
Smart Images

Figure CN120812694A_ABST
Abstract
Description
TECHNICAL FIELD
[0001] The present application relates to the technical field of unmanned aerial vehicle ad hoc network of ultraviolet light communication, in particular to a dynamic routing method, device, medium and product for ultraviolet light flight ad hoc network. BACKGROUND
[0002] Ultraviolet light communication realizes information transmission by means of scattering of gas molecules and aerosol particles in the atmosphere, has the advantages of low background noise, all-weather operation, all-around communication, no need for accurate alignment, good secrecy, strong anti-interference ability, no occupation of existing frequency band resources, etc., and has a wide application prospect in complex electromagnetic environment. However, due to the short wavelength of ultraviolet light, the attenuation in the atmospheric scattering process is large, which makes the communication distance short, resulting in limited communication coverage. Therefore, wireless networking communication technology can be used to build different ultraviolet light wireless communication networks, so as to extend the communication distance and realize secret communication between nodes in the network. Among many networking schemes, a typical networking example is ultraviolet light communication flying ad hoc network (FANET).
[0003] The ultraviolet light communication FANET is a network composed of unmanned aerial vehicles as nodes. The nodes in the network are equipped with ultraviolet light communication modules, and the nodes communicate with each other through ultraviolet light. Each node has the functions of host and router, and can exchange data with other nodes through multi-hop routing packet forwarding mechanism. However, the high-speed movement of network nodes will cause dynamic changes of network topology, which is easy to cause frequent disconnection of communication links and reduce network data transmission performance. In the face of the above challenges, it is urgent to design a routing protocol with short delay, low energy consumption and high data packet delivery rate.
[0004] At present, routing methods can be classified into two categories according to the basic information relied on for calculation, i.e. network topology-based routing method and geographic position-based routing method. On this basis, according to the maintenance principles of link state-based and distance vector-based routing, as well as the routing table maintenance methods of active, passive and interaction of the two, it can be divided into three categories of proactive, reactive and hybrid; according to the number of propagation paths, it can be divided into two categories of single path and multi-path; according to the spatial distribution dimension, it can be divided into two categories of two-dimensional plane and three-dimensional space. Since the current unmanned aerial vehicle nodes are generally equipped with positioning devices such as GPS or Beidou, which can provide accurate position and speed information, the geographic position-based routing method has attracted widespread attention from researchers.
[0005] The early location-based routing protocol, GPSR (Greedy Perimeter Stateless Routing), was applied to two-dimensional scenarios. It defaulted to greedy packet forwarding and, when trapped in a local minimum, forwarded packets according to the right-hand rule. This approach is ineffective for three-dimensional routing. The LAR (Location-Aided Routing) protocol uses both area and distance strategies to narrow the routing query range based on the location of nodes in the network, significantly reducing routing overhead. Building on this, the GRDAD (Geographic Routing Protocol based on Distance, Angle, and Density) routing protocol integrates mobility information such as location, speed, and connection angle into forwarding decisions, improving mobility adaptability. Furthermore, by predicting the locations of neighboring nodes, it effectively increases data transmission success rates. To adapt two-dimensional location-based routing methods to three-dimensional space, several studies have adapted these methods. The LAR-3D routing protocol combines the LAR protocol with the randomized AB3D routing algorithm and employs LAR partitioning.
[0006] However, the existing routing method of ultraviolet FANET still has the following shortcomings: 1. Existing UV FANET routing methods are usually based on planar network topology, ignoring the distribution of FANET nodes in three-dimensional space. Since two adjacent points on a two-dimensional plane may be far apart in three-dimensional space, such methods are prone to routing decision errors in three-dimensional space. 2. Due to the high dynamics of ultraviolet wireless communication networks, their topology changes rapidly, making it difficult to build stable routing based on the global network topology.
[0007] 3. When making routing decisions, UV FANET nodes do not fully consider the characteristics of high-speed movement of nodes in three-dimensional space flight scenarios. The neighbor node positions used are the historical positions detected at the previous moment, rather than the latest positions at the current moment, which easily generates incorrect data packet forwarding paths. Summary of the Invention
[0008] The present invention aims to provide a dynamic routing method, device, medium and product for ultraviolet light flying ad hoc network, so as to solve the problems existing in the above-mentioned routing methods of existing ultraviolet light FANET.
[0009] In a first aspect, the present invention provides a dynamic routing method for ultraviolet flying ad hoc networks, comprising: Set the communication mode of the UV light flying ad hoc network; Determine the motion model; Detecting network neighbor nodes, generating a neighbor node information table; Updating position information of each node in the neighbor node information table based on a motion model; Based on the updated neighbor node information table, dynamically adopting a data packet forwarding mode for data packet forwarding.
[0010] In a preferred embodiment, the communication mode of the ultraviolet light flying ad hoc network is set, comprising: Each node in the ultraviolet light flying ad hoc network is equipped with an ultraviolet light communication module; Each node adopts an omnidirectional transmission-omnidirectional reception communication mode to communicate with surrounding nodes, wherein the transmission elevation angle and the reception elevation angle are both 90° In a preferred embodiment, the motion model adopts an RWP motion model, in which a node generates an initial position in a simulated scene, moves from the current position to a new position at a constant time or distance with a random moving speed and direction; when the node moves to the edge zone of the simulated scene, the moving direction is calculated according to the optical reflection principle while the speed remains unchanged.
[0011] In a preferred embodiment, the detecting network neighbor nodes, generating a neighbor node information table, comprises: Each node detects neighbor nodes within its communication range by periodically broadcasting a beacon message; the beacon message contains position, speed, node unique identifier ID and transmission time; After each node receives the beacon message broadcast by a neighbor node, it extracts the position, speed, node unique identifier ID and transmission time to form a neighbor node information record, which is stored in the neighbor node information table.
[0012] In a preferred embodiment, when a node receives a new beacon message from a neighbor node in the neighbor node information table, it extracts the relevant information and updates the corresponding node record in the neighbor node information table; if a node does not receive a new beacon message broadcast by a neighbor node within a specified time, it considers the neighbor node to be a failed node and deletes the corresponding record from the neighbor node information table.
[0013] In a preferred embodiment, the updating position information of each node in the neighbor node information table based on a motion model comprises: According to the adopted RWP motion model, the node is regarded as a linear motion, and the linear motion equation is used to predict the node position; The predicting node position by using the linear motion equation refers to that the current node traverses the neighbor node information table, and according to the position and speed of the neighbor node at the historical time recorded in the neighbor node information table, the latest position of the neighbor node at the current time is predicted by substituting into the linear motion equation for calculation, and the position information of the neighbor node information table is updated.
[0014] In a preferred embodiment, the data packet forwarding mode is dynamically adopted based on the updated neighbor node information table, and the data packet forwarding mode comprises: The data packet forwarding mode comprises a greedy forwarding mode and a peripheral forwarding mode, and the greedy forwarding mode is adopted by default; and the peripheral forwarding mode is a limited flooding peripheral forwarding mode. The greedy forwarding mode takes the shortest Euclidean distance of the node as the path selection basis, makes the current optimal path selection based on the current local node state, and gradually obtains the overall optimal path or the approximate overall optimal path of the network by this way. When the greedy forwarding mode encounters a routing hole, the limited flooding peripheral forwarding mode is switched to, the limited flooding peripheral forwarding mode constantly expands the search space by gradually increasing the request time, broadcasts a routing request RREQ message to find a recovery node, and then returns to the greedy forwarding mode to continue forwarding the data packet of the target node; in the routing process, the two data packet forwarding modes are dynamically selected according to the actual situation until the data packet is successfully sent to the target node.
[0015] In a third aspect, the present application provides an electronic device, comprising: at least one processor; and a memory connected with the at least one processor in communication; The memory stores instructions executable by the at least one processor, and the at least one processor executes the instructions stored in the memory, so that the at least one processor executes the above-mentioned method.
[0016] In a third aspect, the present application provides a computer readable storage medium for storing instructions, when the instructions are executed, the above-mentioned method is realized.
[0017] In a fourth aspect, the present application provides a computer program product, when the computer program product is called by a computer, the computer executes the above-mentioned method.
[0018] As described above, due to the adoption of the above technical solutions, the present application has the following beneficial effects: 1. The application is designed to effectively deal with the routing problem caused by high-speed movement of FANET nodes in three-dimensional space, a location-based routing method is designed, by setting the communication mode, determining the motion model, mobility prediction, dynamic routing selection and recovery method, effectively reducing the problem of frequent disconnection and decision error caused by high-speed movement of nodes, while reducing the end-to-end delay and energy consumption, improving the delivery rate of data packets, and enhancing the robustness of routing.
[0019] 2. The application is simple and effective, effectively solves some technical problems existing in ultraviolet light ad hoc network, has important practical significance and application value, not only can be applied in ultraviolet light FANET, but also can be widely applied in various ad hoc network communication application scenes such as land and underwater. BRIEF DESCRIPTION OF DRAWINGS
[0020] Figure 1 A flow chart of a dynamic routing method for ultraviolet light flight ad hoc network is proposed for the embodiment of the application.
[0021] Figure 2a The schematic diagram of the omnidirectional sending-omnidirectional receiving mode of the ultraviolet light NLOS communication mode in the embodiment of the application.
[0022] Figure 2b The schematic diagram of the directional sending-omnidirectional receiving mode of the ultraviolet light NLOS communication mode in the embodiment of the application.
[0023] Figure 2c The schematic diagram of the directional sending-directional receiving mode of the ultraviolet light NLOS communication mode in the embodiment of the application.
[0024] Figure 3 The schematic diagram of the ultraviolet light NLOS communication link between unmanned aerial vehicles in the embodiment of the application adopts the omnidirectional sending-omnidirectional receiving mode.
[0025] Figure 4 The schematic diagram of the location prediction-based greedy forwarding mode in the embodiment of the application.
[0026] Figure 5 The flow chart of data packet forwarding in the embodiment of the application.
[0027] Figure 6 A structure schematic diagram of an electronic device is proposed for the embodiment of the application. DETAILED DESCRIPTION
[0028] In order to make the purposes, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only some of the embodiments of the present application, rather than all the embodiments. The components of the embodiments of the present application described and shown in the drawings can be arranged and designed in various different configurations.
[0029] Therefore, the following detailed description of the embodiments of the present application provided in the drawings is not intended to limit the scope of the claimed present application, but only represents selected embodiments of the present application. All other embodiments obtained by those of ordinary skill in the art based on the embodiments in the present application without creative labor are within the scope of protection of the present application.
[0030] As shown in Figure 1 , the embodiments of the present application propose a dynamic routing method for ultraviolet light flying ad hoc networks, which specifically includes the following steps: Step 1, setting the communication mode of the ultraviolet light flying ad hoc network.
[0031] In the flying ad hoc network operation space, there may be obstacles and other situations between nodes, so the present application adopts ultraviolet light NLOS communication mode for communication. According to the different transmission beam divergence angle, receiving field angle and transmission-reception elevation angle, the ultraviolet light NLOS communication mode can be divided into three types, which are Figure 2a omnidirectional transmission-omnidirectional reception as shown in Figure 2b directional transmission-omnidirectional reception as shown in Figure 2c directional transmission-directional reception as shown in
[0032] The ultraviolet light flying ad hoc network is usually composed of some small or micro unmanned aerial vehicles, and the platform size and load capacity of these unmanned aerial vehicles are limited, so it is difficult to install an antenna servo system to maintain accurate alignment of the ultraviolet light link. Therefore, in order to simplify the design of the ultraviolet light flying ad hoc network, the unmanned aerial vehicles all adopt omnidirectional transmission-omnidirectional reception in the ultraviolet light NLOS communication mode. The communication link between the unmanned aerial vehicles is as shown in Figure 3 , where node A and node B represent two unmanned aerial vehicles respectively installed with ultraviolet light communication modules, the transmission elevation angle and the receiving elevation angle are both 90°, node A transmits an ultraviolet light beam with a divergence angle of , and the power transmission height limit is , the receiving field angle of node B as the receiving end is , and the projection of the communication coverage area on the ground is a circular area with a radius of r :
[0033] Step 2, determining the motion model.
[0034] In the process of algorithm design, simulation is an effective means to verify the performance of routing protocol between nodes, which is not limited by the actual test site and can greatly reduce the experimental cost. An important content of simulation is to simulate the movement of nodes, and the rationality of the selected motion model determines the credibility of the simulation results. In the existing motion models, the Random Way-Point (RWP) motion model is a classic model for simulating unpredictable individuals in nature. In the model, the nodes generate an initial position in the simulation scene, and move from the current position to a new position with a random moving speed and direction every constant time or distance. When the node moves to the edge of the simulation scene, the speed remains unchanged, but the moving direction is calculated according to the optical reflection principle. The RWP motion model has the advantages of simple implementation and low computational complexity, and is an effective model for simulating the movement of unmanned aerial vehicles, which has been widely used. Therefore, in the simulation process, the performance of the routing protocol is verified based on the RWP motion model.
[0035] As shown in Figure 4 , the ultraviolet light ad hoc network nodes are randomly and uniformly distributed in three-dimensional space, and A-E and S represent part of the unmanned aerial vehicle nodes in the network, wherein S represents the source node and D represents the target node. The communication range of each node is regarded as a sphere, and the maximum communication distance is R, i.e. the radius of the sphere. Each node has a unique identifier ID to identify itself.
[0036] Step 3, probe the network neighbor nodes and generate a neighbor node information table.
[0037] Each node probes the neighbor nodes within its communication range by periodically broadcasting beacon messages to find candidate nodes for subsequent routing discovery and data packet forwarding. Each node obtains its position and speed information through the positioning device or sensor carried by the node, and encapsulates the information such as node unique identifier ID, beacon sending time, etc. in the beacon, and periodically broadcasts the beacon within its wireless communication range to report its state information to the neighbor nodes.
[0038] After receiving the beacon message broadcasted by the neighbor nodes, each node extracts the position, speed, unique identifier ID and sending time information in the beacon message, forms a neighbor node information record, and stores it in a neighbor node information table constructed locally by the node, as shown in Table 1.
[0039] Table 1, neighbor node information table:
[0040] When a node receives a new beacon message from a neighbor in its neighbor node information table, it extracts the relevant information and updates the corresponding node record in the neighbor node information table. If a node waits for a specified time (e.g., 4.5T, where T is the average beacon message broadcast period) without receiving a beacon message from a neighbor, it assumes that the neighbor is no longer within communication range and has timed out, deleting the corresponding record from the table. Similarly, when a beacon broadcast from a new neighbor is received, the node generates a new record for it and adds it to the neighbor node information table. The same method is used to perform maintenance operations on the table, such as storing, updating, and deleting data.
[0041] Through the beacon broadcasting method, each node can detect neighbor nodes within its communication range, receive the unique identification, location information and speed information of the neighbor nodes, establish a corresponding neighbor node information table, and obtain the local network topology.
[0042] Step 4: Based on the motion model, update the location information of each node in the neighbor node information table.
[0043] Geolocation-based routing protocols forward packets based on node location. However, due to the high dynamic nature of nodes, the location information recorded in the neighbor node information table is the historical location at the time of the most recent beacon message broadcast, not the current location. This information is not updated as the network topology changes, and therefore exhibits a certain lag. In this situation, the current node is prone to selecting a failed neighbor node as the next-hop data forwarding node, leading to incorrect routing decisions and severe packet loss, significantly degrading network performance. Therefore, when sending a packet, the current node needs to first predict and update the current three-dimensional location of the neighbor node. This will result in a more accurate and realistic location prediction, which will help optimize the routing decision process and improve the effectiveness of packet forwarding.
[0044] Since the average broadcast period T of the beacon is short, generally 1 to 3 seconds, the movement of the node in a short period of time can be regarded as linear motion according to the RWP motion model, and the linear motion equation can be used to predict the node position. Specifically, the current node traverses its neighbor node information table, and according to the neighbor nodes recorded in the neighbor node information table, At a historical moment Location ,speed , by substituting it into the linear motion equation to calculate and predict its current moment The latest position of , and updates the position information in the neighbor node information table. The calculation is shown in the following linear motion equation:
[0045] According to the above formula, we can get the neighbor nodes At the current momentThe latest predicted position of . .
[0046] Step 5, based on the updated neighbor node information table, dynamically adopt the data packet forwarding mode for data packet forwarding.
[0047] As Figure 5 shown, the network data packet forwarding mode includes the greedy forwarding mode and the periphery forwarding mode.
[0048] The greedy forwarding mode is not easy to find the optimal path from the entire network in view of the high dynamicity of nodes, and through the method of finding the local optimal path, the overall optimal path of the network is gradually realized, which has the characteristics of simplicity and high efficiency. Specifically, the greedy forwarding mode takes the shortest Euclidean distance of nodes as the path selection basis, makes the current optimal path selection based on the current local node state, and gradually obtains the overall optimal path or the approximate overall optimal path of the network through this way, as Figure 4 shown.
[0049] The current node In preparing to forward the data packet, first, according to the node latest position in the node neighbor node information table of the current node, the Euclidean distance between nodes is calculated, as shown in the following formula:
[0050] If , it indicates that the neighbor node is still within the communication coverage of the current node. If >R, it indicates that the neighbor node has moved out of the communication range of the current node , so the node is removed from the neighbor node table. Then, the Euclidean distance from the current node to the target node , and the Euclidean distance between its neighbor node and the target node are calculated, as shown in the following formula:
[0051]
[0052] If and , the greedy forwarding mode is adopted, and the specific neighbor node closest to the target node is selected as the next hop forwarding node for data packet forwarding. If the greedy forwarding mode cannot find a next hop node closer to the target node than itself from the neighbor nodes, it will lead to the data packet unable to continue to forward. Here, the current node The node is called a hole node, and the hole node The area in the communication range that is closer to the destination node than the hole node is called a routing hole. When a data packet reaches the routing hole, the node needs to switch to the peripheral forwarding mode to restore the route and continue forwarding the data packet.
[0053] The peripheral forwarding mode adopted by the present application is improved based on the Dynamic Source Routing (DSR) protocol, and the intermediate node that can bypass the routing hole is searched through the flooding message, so as to realize the forwarding of the data packet. In the search of the intermediate node, the search space is continuously expanded by gradually increasing the TTL value, which effectively limits the broadcast storm caused by the flooding message, avoids network congestion, and reduces network overhead.
[0054] Specifically, when switching to the limited flooding peripheral forwarding mode, the current hole node broadcasts a Route Request (RREQ) message, records the RREQ message sequence number, the unique identifier ID and the geographic position of the current hole node , and sets the request time TTL initial value for limiting the maximum hop number that the RREQ message can reach. After each node receives the RREQ message, the size of the RREQ message sequence number is analyzed and compared to determine whether the received RREQ message is the latest message or the first received message. If the RREQ message is not the latest message, the RREQ message is discarded. If the RREQ message is the latest message, it is first checked whether the address of the node itself is in the routing node address list. If it exists, it indicates that there is a routing loop, and the RREQ message is discarded. If there is no routing loop, each node calculates the Euclidean distance between itself and the target node , and compares it with the Euclidean distance from the hole node to the target node. If the node is farther from the target node , the unique identifier ID of the node is added to the recovery path, and the RREQ message is continuously broadcasted. Otherwise, it indicates that a node that can restore the greedy forwarding mode is found, and the node is called a recovery node. The recovery node adds its unique identifier ID to the recovery path of the RREQ message, and sends a RREP message to the routing hole node along the reverse path of the routing node address list. The composition information of the above beacon broadcast message, RREQ message and RREP message is shown in Table 2.
[0055] Table 2, main message composition table in the routing discovery process:
[0056] When the hole node receives the RREP message, a recovery path with the least hop number is selected from the message, and then the data packet is forwarded to the recovery node along the route node address list through a three-dimensional peripheral forwarding mode . The recovery node receives the data packet, and forwards the data packet again by switching to the greedy forwarding mode.
[0057] To prevent the route request from timing out, the hole node starts a timer each time the RREQ message is broadcast, and when the timer expires and the RREP message is still not received, the request time TTL is increased by an offset OFFSET, that is, TTL=TTL+OFFSET. If the RREP message is still not received within the increased request time TTL, the node continues to increase the offset OFFSET until the maximum request time TTL_MAX. If the request to the recovery node fails, the node waits for a few seconds and then initiates the RREQ message again or directly discards the packet. Similarly, other nodes that receive the RREQ message will also allocate relevant storage space and start a timer to perform the above operations. The above processing is sequentially cycled until the data packet is successfully sent to the target node.
[0058] From the above, it can be seen that the present application can solve the problems existing in the routing method of the existing ultraviolet FANET: 1. The routing method of the existing ultraviolet FANET is usually based on a planar network topology, ignoring the distribution of FANET nodes in three-dimensional space. Since two adjacent points on a two-dimensional plane can be far apart in three-dimensional space, such a method is prone to routing decision errors in three-dimensional space. To solve this problem, the present application considers the distribution of ultraviolet FANET in three-dimensional space when designing the routing method, calculates the Euclidean distance between nodes in three-dimensional space based on the position information of the nodes, and thus provides accurate distance information for routing decisions.
[0059] 2. Due to the high dynamics of the network, its topology changes rapidly, making it difficult to build a stable routing based on the global network topology. To solve this problem, the present application uses a local route discovery method to obtain a local network topology and determine the next hop data forwarding point. In addition, there is a time gap between obtaining the local network topology and forwarding the data packet, during which time a rapidly moving node can leave the communication range of the current node and become an invalid node. Therefore, to avoid sending to an invalid node and routing circuit, the current node needs to predict the mobility of the node position in the obtained local network topology when sending the data packet, and calculate the latest position after a period of time.
[0060] 3. When making routing decisions, UV FANET nodes fail to fully consider the high-speed movement of nodes in three-dimensional flight scenarios. The neighbor node locations used are the historical locations detected at the previous moment, rather than the latest locations at the current moment, which can easily lead to incorrect packet forwarding paths. To address this issue, the present invention combines the advantages of UV wireless optical communications to propose a location-based routing method. This method considers the operation of UV FANETs in three-dimensional space, uses a node position prediction algorithm to obtain more accurate location information, dynamically selects the optimal next-hop node, searches for a short-latency, low-overhead data exchange route, and sends packets to the target node through greedy forwarding mode and peripheral forwarding mode.
[0061] Based on the same technical concept, an embodiment of the present invention further provides an electronic device that can implement the process of the dynamic routing method for ultraviolet light flying ad hoc network provided in the above embodiment of the present invention. In one embodiment, the electronic device can be a server, or a terminal device or other electronic device. Figure 6 As shown, the electronic device may include: At least one processor, and a memory connected to the at least one processor. The embodiment of the present invention does not limit the specific connection medium between the processor and the memory. Figure 6 The example in this article is that the processor and memory are connected via a bus. Figure 6 The connections between the other components are shown in bold lines, which are only for illustration and not intended to be limiting. The bus can be divided into address bus, data bus, control bus, etc. Figure 6 The processor is represented by a single thick line, but this does not mean that there is only one bus or only one type of bus. Alternatively, the processor can also be called a controller, without any limitation on the name.
[0062] In an embodiment of the present invention, the memory stores instructions that can be executed by at least one processor. By executing the instructions stored in the memory, the at least one processor can execute the dynamic routing method for ultraviolet light flying ad hoc network discussed above.
[0063] Among them, the processor is the control center of the device, which can use various interfaces and lines to connect the various parts of the entire control device, and monitor the device as a whole by running or executing instructions stored in the memory and calling data stored in the memory, the various functions of the device and processing data.
[0064] In an alternative design, the processor can include one or more processing units, and the processor can integrate an application processor and a modem processor, wherein the application processor mainly processes operating systems, user interfaces, and application programs, and the modem processor mainly processes wireless communications. It can be understood that the above-mentioned modem processor can also not be integrated into the processor. In some embodiments, the processor and the memory can be implemented on the same chip, and in some embodiments, they can also be implemented on separate chips, respectively.
[0065] The processor can be a general purpose processor, such as a CPU, a digital signal processor, an application specific integrated circuit, a field programmable gate array, or other programmable logic device, a discrete gate or transistor logic, a discrete hardware component, and can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of the present application. The general purpose processor can be a microprocessor or any conventional processor. The steps of a method for dynamic routing of ultraviolet light ad hoc networks disclosed in the embodiments of the present application can be directly embodied as a hardware processor for execution, or a combination of hardware and software modules in the processor for execution.
[0066] The memory, as a non-volatile computer readable storage medium, can be used to store non-volatile software programs, non-volatile computer executable programs and modules. The memory can include at least one type of storage medium, such as flash memory, hard disk, multimedia card, card type memory, random access memory (RAM), static random access memory (SRAM), programmable read only memory (PROM), read only memory (ROM), electrically erasable programmable read only memory (EEPROM), magnetic storage, magnetic disk, optical disk, etc. The memory is any other medium capable of carrying or storing desired program code in the form of instructions or data structures and capable of being accessed by a computer, but is not limited to this. The memory in the embodiments of the present application can also be a circuit or any other device capable of realizing the storage function, used for storing program instructions and / or data.
[0067] By designing and programming the processor, the code corresponding to the method for dynamic routing of ultraviolet light ad hoc networks introduced in the above embodiments can be fixed into the chip, so that the chip can execute the steps of the method of the above embodiments at runtime. How to design and program the processor is a technology known to those skilled in the art, which will not be described here.
[0068] Based on the same inventive concept, the embodiments of the present application also provide a storage medium, which stores computer instructions, when the computer instructions are run on a computer, make the computer execute the above-mentioned dynamic routing method for ultraviolet light ad hoc network.
[0069] In some optional embodiments, the various aspects of the dynamic routing method for ultraviolet light ad hoc network can also be implemented in the form of a program product, which includes program codes, when the program product is run on an apparatus, the program codes are used to make the control device execute the steps in the above-mentioned dynamic routing method for ultraviolet light ad hoc network according to various exemplary embodiments of the present application described in the specification.
[0070] It should be noted that although several units or sub-units of the apparatus are mentioned in the above detailed description, such division is merely exemplary and not mandatory. In fact, according to the embodiments of the present application, the features and functions of two or more units described above can be embodied in one unit. Conversely, the features and functions of one unit described above can be further divided into units to be embodied. In addition, although the operations of the method of the present application are described in a particular order in the accompanying drawings, this does not require or imply that the operations must be performed in this particular order, or that all illustrated operations must be performed to achieve desirable results. Additionally or alternatively, certain steps can be omitted, combined into a single step, and / or divided into multiple steps.
[0071] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROMs, optical storage devices, etc.) containing computer-usable program code.
[0072] The present application is described with reference to the flowcharts and / or block diagrams of the methods, apparatus (systems) and computer program products according to the embodiments of the present application. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, and the combination of flows and / or blocks in the flowcharts and / or block diagrams can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing apparatus to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing apparatus produce a means for implementing the functions specified in the flowcharts and / or block diagrams. Figure 1one or more processes and / or blocks Figure 1
[0073] The program code may be implemented in any of a variety of programming languages such as object-oriented programming languages, for example, Java, C++, or the like, and conventional procedural programming languages, for example, "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's computing device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device or entirely on the remote computing device or server.
[0074] In the case of implementing remote computing devices, the remote computing devices may be connected to the user's computing device through any kind of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (for example, using an Internet service provider to access the Internet).
[0075] These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instructions which implement the flow Figure 1 one or more processes and / or blocks Figure 1
[0076] These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the flow Figure 1 one or more processes and / or blocks Figure 1 Figure 1
[0077] The above description is merely illustrative of the application, and not restrictive. Since the application can be modified in various ways and have several embodiments, it is intended that the application cover each and every modification and change that can come within the spirit and scope of the application. Therefore, the scope of the application should be determined not with reference to the description herein, but should be given the broadest interpretation consistent with the description being encompassed therein, and their equivalents.
[0078] The above description is merely illustrative of the application, and not restrictive. Since the application can be modified in various ways and have several embodiments, it is intended that the application cover each and every modification and change that can come within the spirit and scope of the application. Therefore, the scope of the application should be determined not with reference to the description herein, but should be given the broadest interpretation consistent with the description being encompassed therein, and their equivalents.
Claims
1. A dynamic routing method for ultraviolet flying ad hoc network, characterized in that: include: Set the communication mode of the UV light flying ad hoc network; Determine the motion model; Detect network neighbor nodes and generate neighbor node information table; Based on the motion model, update the location information of each node in the neighbor node information table; Based on the updated neighbor node information table, the data packet forwarding mode is dynamically adopted to forward data packets.
2. The dynamic routing method for ultraviolet flying ad hoc network according to claim 1, characterized in that: The communication mode of setting up the ultraviolet light flying ad hoc network includes: Each node in the UV flying ad hoc network is equipped with a UV communication module; Each node communicates with surrounding nodes using an omnidirectional transmission-omnidirectional reception communication mode, where the transmission elevation angle and the reception elevation angle are both 90°.
3. The dynamic routing method for ultraviolet flying ad hoc network according to claim 1, characterized in that: The motion model adopts the RWP motion model. In the RWP motion model, the node generates an initial position in the simulation scene and moves from the current position to a new position at a constant time or distance with a random moving speed and direction. When the node moves to the edge of the simulation scene, its speed remains unchanged, but the moving direction is calculated according to the optical reflection principle.
4. The dynamic routing method for ultraviolet flying ad hoc network according to claim 1, characterized in that: The detecting of network neighbor nodes and generating a neighbor node information table includes: Each node detects neighboring nodes within its communication range by periodically broadcasting beacon messages; the beacon messages contain location, speed, node unique ID, and transmission time; After receiving the beacon message broadcast by the neighbor node, each node extracts the position, speed, node unique identification ID and sending time to form a neighbor node information record, which is stored in the neighbor node information table.
5. The dynamic routing method for ultraviolet flying ad hoc network according to claim 4, characterized in that: When a node receives a new beacon message from a neighboring node in the neighboring node information table, it extracts relevant information and updates the corresponding node record in the neighboring node information table; If a node does not receive a new beacon message broadcast by a neighboring node within a specified time, the neighboring node is considered to be a failed node and the corresponding record is deleted from the neighboring node information table.
6. The dynamic routing method for ultraviolet flying ad hoc network according to claim 3, characterized in that: The updating of the location information of each node in the neighbor node information table based on the motion model includes: According to the adopted RWP motion model, the nodes are regarded as linear motion and the linear motion equation is used to predict the node positions; The use of linear motion equations to predict node positions means that the current node traverses its neighbor node information table, and according to the positions and speeds of the neighbor nodes at historical moments recorded in the neighbor node information table, it predicts its latest position at the current moment by substituting the linear motion equations for calculation, and updates the position information of the neighbor node information table.
7. The dynamic routing method for ultraviolet flying ad hoc network according to claim 1, characterized in that: The dynamically adopting the data packet forwarding mode to forward the data packet based on the updated neighbor node information table includes: The data packet forwarding mode includes greedy forwarding mode and peripheral forwarding mode, and the greedy forwarding mode is adopted by default; the peripheral forwarding mode is the limited flooding peripheral forwarding mode; The greedy forwarding mode uses the shortest Euclidean distance between nodes as the path selection basis, and makes the current optimal path selection based on the current local node status. In this way, the optimal path of the entire network or an approximate optimal path of the entire network is gradually obtained; When the greedy forwarding mode encounters a routing hole, it switches to the restricted flooding peripheral forwarding mode. This restricted flooding peripheral forwarding mode continuously expands the search space by gradually increasing the request time, broadcasts the routing request RREQ message to find the recovery node, and then reverts to the greedy forwarding mode to continue forwarding data packets to the target node. During the routing process, the two data packet forwarding modes are dynamically selected according to the actual situation until the data packet is successfully sent to the target node.
8. An electronic device, characterized in that: include: at least one processor; and a memory communicatively coupled to the at least one processor; The memory stores instructions that can be executed by the at least one processor, and the at least one processor executes the method according to any one of claims 1 to 7 by executing the instructions stored in the memory.
9. A computer-readable storage medium, characterized in that The computer-readable storage medium is used to store instructions, and when the instructions are executed, the method according to any one of claims 1 to 7 is implemented.
10. A computer program product, characterized in that When the computer program product is called by a computer, the computer is caused to execute the method according to any one of claims 1 to 7.
Citation Information
Patent Citations
Sensor network real-time routing method based on data-driven link estimation
CN102036338A
AANET combined routing algorithm based on geographical location information
CN104202724A
Network connectivity division integration calculation method for ultraviolet light cooperative unmanned aerial vehicle communication
CN113193900A
Unmanned aerial vehicle ad hoc network routing method based on position prediction
CN116506915A
Aviation ad hoc network spatial awareness routing protocol based on position prediction
CN117915427A
