CN108337166B - Low-delay high-reliability routing method for aviation cluster network - Google Patents

Low-delay high-reliability routing method for aviation cluster network Download PDF

Info

Publication number
CN108337166B
CN108337166B CN201810118928.8A CN201810118928A CN108337166B CN 108337166 B CN108337166 B CN 108337166B CN 201810118928 A CN201810118928 A CN 201810118928A CN 108337166 B CN108337166 B CN 108337166B
Authority
CN
China
Prior art keywords
node
nodes
network
neighbor
packet
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201810118928.8A
Other languages
Chinese (zh)
Other versions
CN108337166A (en
Inventor
吕娜
张步硕
陈柯帆
曹芳波
刘创
周家欣
邹鑫清
朱梦圆
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN201810118928.8A priority Critical patent/CN108337166B/en
Publication of CN108337166A publication Critical patent/CN108337166A/en
Application granted granted Critical
Publication of CN108337166B publication Critical patent/CN108337166B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/124—Shortest path evaluation using a combination of metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/147—Network analysis or design for predicting network behaviour
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/026—Details of "hello" or keep-alive messages
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/121—Shortest path evaluation by minimising delays
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/125—Shortest path evaluation based on throughput or bandwidth
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a low-delay high-reliability routing method for an aviation cluster network, which follows the basic idea of an OLSR routing protocol, optimizes an MPR selection strategy by constructing a virtual backbone network of the aviation cluster network and designing an absorbance mechanism based on the virtual backbone network, can select nodes with higher absorbance when the MPR nodes are selected, effectively reduces the flooded TC grouping number in the network, increases the probability that effective service information occupies a physical channel, reduces transmission delay and increases the packet delivery rate; a load balancing mechanism is designed based on a virtual backbone network, the load condition of a link at the next moment is predicted through an ARIMA-SVR model, the network congestion phenomenon is avoided, the transmission time delay is further reduced, and the packet delivery rate is increased; thereby being capable of better serving aviation cluster battles.

Description

Low-delay high-reliability routing method for aviation cluster network
Technical Field
The invention relates to the technical field of routing protocols, in particular to a low-delay high-reliability routing method for an aviation cluster network.
Background
In the gradual evolution process of the information-based battlefield, on one hand, the air battle mode is gradually changed from the initial command control platform + single-type air platform formation battle to the ground detection and command control platform + air formation systematized battle in the later period of the last century, to the multi-type air formation cooperative battle in the beginning of the century, and to the multi-type air platform clustering battle widely researched at present; on the other hand, with the continuous development of an air data link and the proposal of a network central war concept, the networking characteristics among the battle platforms in the air battle field are becoming more and more obvious, the network scale, the network service, the network complexity and the like are increasing day by day, and the networking process is from an initial simple data transmission link, to a small-scale fully-connected network, to a large-scale relay isomorphic network, to a large-scale multi-hop heterogeneous network. The aviation cluster battle relies on an aviation communication network (hereinafter referred to as an aviation network), various, multifunctional and large-scale manned battle platforms and unmanned battle platforms are flexibly networked, tactical cooperation among the platforms is effectively supported through the aviation network, the capability advantage complementation of each platform is realized, and continuous, coordinated and efficient implementation of different stages and different tasks in the whole battle process of OODA (airborne-aided-Decode-Act) is ensured. Due to the platform diversity, the task difference and the battlefield electromagnetic environment complexity of the aviation cluster battle, the node characteristics and the node capabilities of the aviation network supported by the aviation cluster battle are greatly different, and the stage changes of network services, service requirements and a topological structure are obviously different from those of the existing wireless network, so that the research of the aviation network technology supporting the aviation cluster battle is very important.
Routing, multiple access and network management are used as key technologies of aviation network networking and are of great importance to the development of aviation networks supporting aviation trunking battles. At present, an air data link task applied in air combat is fixed, a fully connected topology is taken as a main task, a networking technology mainly researches a multiple access technology, and a routing technology is less involved. However, the aviation cluster has the advantages of multiple platform types, large scale quantity, wide distribution range and high platform mobility, the network topology is a multi-hop topology structure, and mobile nodes need to complete communication among each other by means of multi-hop links. Accordingly, routing technology research becomes necessary. The wireless Ad Hoc network routing protocol can be divided into active, on-demand and hybrid routing protocols according to a route discovery strategy; the proactive routing protocol is also called a table-driven routing protocol or a proactive routing protocol. In this protocol, each node periodically broadcasts control packets, interacts with routing information, maintains a routing table to all other nodes in the network, and updates the routing table by constantly detecting changes in network topology and link quality, regardless of whether there is a communication need. Active routing protocols have appeared earlier, and many routing protocols adapted to different situations have been proposed through years of research. According to the type and quantity of the node maintenance routing table and the difference of the routing table updating mechanism, the following are mainly provided: DSDV protocol, FSR protocol, OLSR protocol. The on-demand routing protocol is also called a reactive routing protocol, and is different from an active type, and the on-demand routing protocol establishes a routing table according to the sent data packets on demand, and mainly comprises two stages of route discovery and route maintenance. In the route discovery phase, when a source node needs to send data to a destination node, whether a route table to the destination node is stored is firstly inquired, and a route discovery process is initiated under the condition that the route table is not stored, so that effective route information is established. And in the route maintenance stage, maintaining the route in the communication process, and stopping the route maintenance after the communication process is finished. The following are common to on-demand routing protocols: DSR protocol, AODV protocol. The hybrid routing protocol is the synthesis of active routing and on-demand routing, and is more suitable for large-scale wireless Ad Hoc networks. Based on the small-range local area, an active routing mode is adopted, and an on-demand routing mode is adopted for searching out the route outside the area. The hybrid routing protocol balances the advantages of small active routing time delay and small routing cost on demand, and the network bandwidth loss and the routing delay are low. But the hybrid routing has obvious disadvantages, the routing algorithm is more complex, and meanwhile, the additional management overhead is also increased, which represents that the protocol is the ZRP protocol.
The research of the existing wireless self-organizing network routing technology mainly focuses on the fields of vehicle-mounted networks, wireless sensor networks and the like, and compared with the vehicle-mounted networks and the wireless sensor networks, the application scene of aviation cluster battle enables the aviation cluster network to have the characteristics obviously different from the traditional wireless self-organizing network. The concrete expression is as follows: (1) bandwidth requirements are differentiated. Because continuous and closed-loop operation of different operation tasks at each stage of the whole OODA needs to be supported, the interaction service types among the nodes of the aviation cluster network are many, the service quantity is large, and the service requirement difference is large. Such as scout image information with high bandwidth demand, situation information with low single bandwidth demand but large transmission quantity, sensor detection information with high bandwidth demand, guidance information with low bandwidth demand but high access requirement, and the like. (2) More stringent timeliness and higher reliability are required. The battlefield environment is changeable instantly, and the transmission time delay of the network management control information and the tactical information among the cluster members is required to be as low as possible so as to ensure the efficient completion of the battle mission. For example, the time delay of the cooperative control information and the sensor parameter information requires the order of seconds, while the time delay of the composite tracking information and the guidance information requires the order of milliseconds. Therefore, compared with the traditional wireless self-organizing network, the aviation trunking network has more strict requirements on time delay. In addition, the electromagnetic environment of the aviation trunking battle is already in a rejection space environment with intense electronic countermeasures between two parties, and electromagnetic interference of enemy can bring about a large amount of information transmission errors or information loss. The aviation cluster network should reduce the influence of packet loss in the data transmission process on the implementation of the combat mission as much as possible, so that the information interaction among cluster members has higher reliability requirements. The routing protocol of the traditional wireless self-organizing network cannot meet the requirement of an aviation cluster network. The research on the aviation network routing technology suitable for aviation cluster battles is just being developed. Therefore, the routing protocol applicable to a brand-new operation mode of aviation trunking operation is deeply researched by taking aviation trunking operation requirements as guidance, and the routing protocol has important basic theoretical value and practical significance for exploring an aviation network technology which meets and supports future complex air operation environments.
In order to ensure efficient implementation of aviation cluster battle tasks, the requirements on timeliness and reliability of an aviation cluster network are generally high. And the different tasks bring about great difference in the requirements of timeliness and reliability of each combat phase, for example, the requirements of timeliness and reliability of the cooperative attack phase are 1-2 orders of magnitude higher than those of the command and guide phase. Therefore, the routing protocol research of the aviation trunking network must consider the requirements of high timeliness and high reliability of multi-hop transmission.
The proactive routing protocol has obvious advantages in time effectiveness and reliability compared with the on-demand routing protocol. The OLSR routing protocol is a typical proactive routing protocol, and is a research hotspot from the past, wherein, a research aiming at improving timeliness and reliability of the OLSR routing protocol mainly starts from the perspective of reducing the number of control packets in a network and the perspective of load balancing. The basic idea of the OLSR routing protocol is used, and the routing protocol facing to the aviation cluster network is designed with the aim of improving timeliness and reliability.
Disclosure of Invention
Aiming at the defects in the problems, the invention provides a low-delay high-reliability routing method for an aviation cluster network.
In order to achieve the above object, the present invention provides a low-delay high-reliability routing method for an aviation trunking network, comprising:
step 1, constructing an aviation cluster network virtual backbone network:
constructing a node weight function formula by taking the available node bandwidth and the node degree as parameters; selecting a connected dominating set based on the node weight to complete the construction of a virtual backbone network; the larger the node weight is, the stronger the node routing forwarding capability is; the node weight function is:
Figure GDA0002572273400000031
where d (u) is the degree of node, N is the ideal number of dominant points that can dominate the other dominated points,is a constant greater than zero, BuIs the available bandwidth of the node, BthrIs the node available bandwidth threshold;
step 2, a low-delay high-reliability routing protocol based on the virtual backbone network:
judging whether the network node is a backbone node or a non-backbone node;
the backbone node processes the received HELLO packet, acquires topology information in a 2-hop range, generates and maintains a neighbor table, and selects an MPR set based on an absorbance mechanism; the backbone node processes the received TC packets, senses the global topology information of the virtual backbone network, and generates and maintains a virtual backbone network topology table; based on the generated topological table, the low-delay high-reliability routing protocol calculates the optimal route by a load balancing mechanism and combining the change of the path service flow, and establishes a routing table;
the non-backbone node processes the received HELLO packet, generates and maintains a self neighbor table and a neighbor comparison table, acquires the routing information of the self two-hop neighbor node through the neighbor table, and acquires the information of the neighbor backbone node which has a one-to-one mapping relation with the self through the neighbor comparison table.
As a further improvement of the present invention, in step 1, the value of N is the average node degree of the network,the value is 0.01.
As a further improvement of the invention, in step 1, an aviation trunking network virtual backbone network is constructed based on an MIS construction algorithm and a CDS algorithm;
the implementation of the MIS construction algorithm is completed through the receiving and sending of a dominator group and a dominated group, and the selection of a large independent set is carried out based on the node weight w (u); the number of network nodes is set to n,
Figure GDA0002572273400000041
n (u) one-hop neighbor set representing node u, Nu(w) represents a set of weight information for all nodes in node N (u), Nu(w)＝{w(i)|0<i<n, i ≠ u }; setting c (u) to represent the node state:
Figure GDA0002572273400000042
the flow of the MIS construction algorithm is as follows:
step 11,
Figure GDA0002572273400000043
Initializing c (u) to 0;
step 12,
Figure GDA0002572273400000044
Determining whether w (i) is greater than w (u), w (i) is ∈ Nu(w); if so, not performing any operation; otherwise, go to step 13;
step 13, judging whether i exists, 0< i < n, so that w (i) is equal to w (u); if so, selecting the node v with the largest lower 8 bits of the IP address in the set { i, u }, setting C (v) ═ 2, and broadcasting a dominator packet; otherwise, set c (u) 2, broadcast dominator packet;
step 14,
Figure GDA0002572273400000045
x ≠ u, v, if a dominator packet is received, c (x) is set to 1, and the dominated packet is broadcasted;
step 15,
Figure GDA0002572273400000051
y is not equal to x, whether C (y) is equal to 2 or not is judged, and if yes, no operation is carried out; otherwise, y deletes x from N (y);
step 16,
Figure GDA0002572273400000052
If there is no case where c (u) is 0, the MIS structure is completed; otherwise, go to step 12;
all nodes u with the C value of 2 obtained by the MIS algorithm form a set D (n), and all nodes v with the C value of 1 form a set E (v); the method for constructing CDS by MIS is as follows:
step 17,
Figure GDA0002572273400000053
A CALL packet is sent out of the network,
Figure GDA0002572273400000054
after receiving the CALL packet, adding w (u) of the CALL packet to the CALL packet and forwarding the CALL packet; if receiving CALL packets sent by a plurality of dominating nodes at the same time, only forwarding the CALL packet of w (u) the largest dominating node, and directly discarding the rest;
step 18,
Figure GDA0002572273400000055
After the receipt of the CALL packet,if only one CALL packet is received, generating an ACCESS packet, wherein the propagation path of the ACCESS packet is exactly opposite to the propagation path of the received CALL packet; otherwise, selecting w (u) maximum CALL packet to generate an ACCESS packet, wherein the propagation path of the ACCESS packet is opposite to that of the w (u) maximum CALL packet;
step 19, the node receiving the ACCESS grouping sets the C value of the node to be 2, and changes the state of the node to be a dominant node;
after the above process is completed, all the nodes with the C value of 2 form the CDS, and the CDS is constructed.
As a further improvement of the present invention, in step 2, the backbone node establishes a whole network neighbor comparison table by receiving and processing the HELLO packet and the TC packet, and the non-backbone node establishes its own one-hop neighbor comparison table by the HELLO packet.
As a further improvement of the present invention, in step 2, the non-backbone node directly discards the TC packet if it receives it.
As a further improvement of the invention, in step 2, the mechanism of the absorbance is that for any node I, I ∈ N (S), N (S) represents a one-hop neighbor set of the source node S, and the absorbance of I means that N existing to the node I exists2(I) The number of isolated nodes; the isolated node is
Figure GDA0002572273400000056
Figure GDA0002572273400000057
Wherein N is2(S) two-hop neighbor set, N, representing source node S3(S) represents a three-hop neighbor set of the source node S, and if there is a node Y without a link to node M, such a node Y is called an orphaned node.
As a further improvement of the invention, in step 2, an ARIMA-SVR combined prediction model is designed based on the load balancing mechanism to realize accurate prediction of the link load of the aviation trunking network; the prediction method of the ARIMA-SVR combined prediction model comprises the following steps:
step a, for a load function sequence at the current moment, through an ARIMA model, carrying out stabilization processing on the load function sequence by using a difference method, and determining optimal prediction through inspection to carry out load prediction to obtain a linear prediction result; and the residual error between the prediction result and the original load function sequence implies the nonlinear characteristic of the load function sequence;
b, substituting the residual error obtained in the step a into an SVR model, mapping the residual error to a high-dimensional feature space through nonlinearity, and determining a linear function by using a Gaussian function as a kernel function to obtain a correction value of the residual error;
and c, adding the linear prediction result obtained in the step a and the correction value of the residual error obtained in the step b to obtain a load prediction value at the next moment.
As a further improvement of the present invention, the step 2 comprises:
step 21, initializing MPR set to phi, adding a node with willingness of WILL _ ALWAYS in N (S) into MPR (S);
step 22, calculating the connectivity of all nodes in N (S), wherein the connectivity refers to the number of two-hop neighbor nodes which can be connected by the nodes in N (S);
step 23, selecting the node I, N in N (S)2(S) there is a part of nodes which must communicate with the node S through I, I is added into MPR (S), and N which can be reached through I2Nodes in (S) from N2(S), removing the nodes, and repeating the step 23 until all the nodes meeting the condition of the step 23 are added into the MPR (S);
step 24, if N is present2(S) if nodes are not covered, repeating the following steps until all N nodes are covered2(S) nodes are all covered:
step 241, calculating the coverage of the node S which is not added with the MPR set node in N (S), wherein the coverage refers to the number of the nodes which can cover the rest two-hop neighbor nodes in N (S);
step 242, selecting a node with the coverage degree not being 0 and the highest willingness degree to join the MPR;
step 243, if there are multiple nodes meeting the condition of step 242, selecting the node with the highest coverage to join into the MPR (S), and adding the covered N2(S) removing the nodes;
step 244, if there are more than one satisfied stepThe node with the condition 243 selects the node with the highest connectivity degree to join the MPR (S), and covers the N2(S) removing the nodes;
step 245, after the steps are completed, if a plurality of nodes have the condition that the connectivity and the coverage are the same, selecting the node with higher absorbance to add into the MPR set;
wherein, N (S) is a one-hop neighbor set of the source node S; n is a radical of2(S) is a two-hop neighbor set of the source node S; MPR (S) MPR set representing node S; the willingness degree refers to the degree that a node is willing to provide routing forwarding for other nodes, the value is 0-7, and the higher the value is, the higher the willingness of the node to provide routing forwarding service is shown; when the value is 7, the willingness degree is represented as WILL _ ALWAYS, and the node can ALWAYS provide the route forwarding service;
through an ARIMA-SVR combined prediction model, the node takes the obtained load prediction value of the neighbor node at the next moment as the basis for selecting a routing path, so that the occurrence of network congestion is avoided; setting the load threshold to 2/3, namely, when the load predicted value exceeds 2/3, network congestion is generated;
step 246, the source node searches the neighbor table and the topology table, and obtains the load condition of all the neighbor nodes at the next moment through an ARIMA-SVR combined prediction model by receiving and processing the HELLO packet of the neighbor nodes in a plurality of available routes;
step 247, if the load predicted values of all the neighboring nodes are less than 2/3, determining hop values according to the shortest path principle, and establishing a routing table;
step 248, if the predicted value of the load of the adjacent node is greater than 2/3, determining hop values in the rest adjacent nodes according to the principle of shortest path, and establishing a routing table;
and step 249, if the load predicted values of all the neighbor nodes are greater than 2/3, selecting the neighbor node with the smallest load predicted value at the next moment as a next hop node, then determining a routing hop value according to the shortest path principle, and establishing a routing table.
Compared with the prior art, the invention has the beneficial effects that:
the invention provides a low-delay high-reliability routing method facing an aviation cluster network, which follows the basic idea of an OLSR routing protocol, optimizes an MPR selection strategy by constructing a virtual backbone network of the aviation cluster network and designing an absorbance mechanism based on the virtual backbone network, can select nodes with higher absorbance when the MPR nodes are selected, effectively reduces the flooded TC grouping number in the network, increases the probability that effective service information occupies a physical channel, reduces transmission delay and increases the packet delivery rate; a load balancing mechanism is designed based on a virtual backbone network, the load condition of a link at the next moment is predicted through an ARIMA-SVR model, the network congestion phenomenon is avoided, the transmission time delay is further reduced, and the packet delivery rate is increased; thereby being capable of better serving aviation cluster battles.
Drawings
Fig. 1 is a flowchart of a low-latency high-reliability routing method based on a virtual backbone network according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of an isolated node according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of an ARIMA-SVR combined prediction model according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present invention.
The invention is described in further detail below with reference to the attached drawing figures:
the invention provides an aviation trunking network-oriented virtual backbone network-based low-delay High-reliability Routing protocol-LHRVBN (Low delay and High reliability Routing protocol based on virtual backhaul backbone network), which follows the basic idea of OLSR Routing protocol, optimizes MPR selection strategy by constructing virtual backbone network of aviation trunking network and designing an absorbance mechanism based on virtual backbone network, can select nodes with higher absorbance when MPR nodes are selected, effectively reduces flooded TC grouping number in network, increases the probability that effective service information occupies physical channels, reduces transmission delay and increases packet delivery rate; the aim of reducing link failure and network congestion is achieved, a load balancing mechanism is designed based on a virtual backbone network, the load condition of a link at the next moment is predicted through an ARIMA-SVR model, the network congestion phenomenon is avoided, the transmission delay is further reduced, and the packet delivery rate is increased; thereby being capable of better serving aviation cluster battles.
The invention provides a low-delay high-reliability routing method for an aviation cluster network, which comprises the following steps:
step 1, constructing an aviation cluster network virtual backbone network:
the node available bandwidth and the node degree are used as parameters, a node weight function formula is constructed, the size of the routing forwarding capability provided by the node is described through the node weight function formula, and the larger the node weight is, the stronger the node routing forwarding capability is. The node weight function is:
Figure GDA0002572273400000081
wherein d (u) is the node degree; n is the ideal number that one dominant point can dominate other dominated points, the value of which is related to the network density and the communication distance, and the average node degree of the network is generally taken;is a constant that is constantly greater than zero, typically taking the value 0.01; b isuIs the available bandwidth of the node, BthrIs the node available bandwidth threshold. When the available resources are less than the threshold, the weight will decrease and the likelihood of selecting the node decreases. The larger the node degree and the available bandwidth are, the larger the weight w (u) is, the stronger the capability of the node for providing route forwarding is, and the higher the priority is selected.
And taking the node weight w (u) as an important basis, and selecting a connected dominating set to complete the construction of the virtual backbone network.
The specific method for constructing the virtual backbone network of the aviation cluster network in the step 1 comprises the following steps:
the implementation of the MIS construction algorithm is completed through the receiving and sending of a dominator group and a dominated group, and the selection of a large independent set is carried out based on the node weight w (u); the number of network nodes is set to n,
Figure GDA0002572273400000091
n (u) one-hop neighbor set representing node u, Nu(w) represents a set of weight information for all nodes in node N (u), Nu(w)＝{w(i)|0<i<n, i ≠ u }; setting c (u) to represent the node state:
Figure GDA0002572273400000092
the flow of the MIS construction algorithm is as follows:
step 11,
Figure GDA0002572273400000093
Initializing c (u) to 0;
step 12,
Figure GDA0002572273400000094
Determining whether w (i) is greater than w (u), w (i) is ∈ Nu(w); if so, not performing any operation; otherwise, go to step 13;
step 13, judging whether i exists, 0< i < n, so that w (i) is equal to w (u); if so, selecting the node v with the largest lower 8 bits of the IP address in the set { i, u }, setting C (v) ═ 2, and broadcasting a dominator packet; otherwise, set c (u) 2, broadcast dominator packet;
step 14,
Figure GDA0002572273400000095
(x ≠ u, v), if a dominator packet is received, setting c (x) 1, broadcasting the dominated packet;
step 15,
Figure GDA0002572273400000096
y is not equal to x, whether C (y) is equal to 2 or not is judged, and if yes, no operation is carried out; otherwise, y deletes x from N (y);
step 16,
Figure GDA0002572273400000097
If there is no case where c (u) is 0, the MIS structure is completed; otherwise, go to step 12;
all nodes u with the C value of 2 obtained by the MIS algorithm form a set D (n), and all nodes v with the C value of 1 form a set E (v); the method for constructing CDS by MIS is as follows:
step 17,
Figure GDA0002572273400000098
A CALL packet is sent out of the network,
Figure GDA0002572273400000099
after receiving the CALL packet, adding w (u) of the CALL packet to the CALL packet and forwarding the CALL packet; if receiving CALL packets sent by a plurality of dominating nodes at the same time, only forwarding the CALL packet of w (u) the largest dominating node, and directly discarding the rest;
step 18,
Figure GDA0002572273400000101
After receiving the CALL packet, if only one CALL packet is received, generating an ACCESS packet, wherein the propagation path of the ACCESS packet is exactly opposite to the propagation path of the received CALL packet; otherwise, selecting w (u) maximum CALL packet to generate an ACCESS packet, wherein the propagation path of the ACCESS packet is opposite to that of the w (u) maximum CALL packet;
step 19, the node receiving the ACCESS grouping sets the C value of the node to be 2, namely, the node changes the state of the node to be a dominant node;
after the above process is completed, all the nodes with the C value of 2 form the CDS, and the CDS is constructed.
Step 2, a low-delay high-reliability routing protocol (LHRVBN protocol) based on the virtual backbone network:
the LHRVBN protocol follows the basic idea of OLSR routing protocol, and mainly includes links such as neighbor information maintenance, topology information maintenance, and route establishment and maintenance. The judgment of the network node type is added, the network node is judged to be a backbone node or a non-backbone node, the number of control packets flooded in the virtual backbone network is reduced based on an absorbance mechanism, the probability of congestion of the virtual backbone network is reduced through a load balancing mechanism, and a neighbor comparison table is designed for effectively forwarding the service information of which the target node is the non-backbone node. The protocol distinguishes backbone nodes and non-backbone nodes, and the backbone nodes need to maintain routing information of all other nodes in a virtual backbone network besides self two-hop neighbor information; the non-backbone nodes only need to maintain the self two-hop neighbor information. In the processes of neighbor information maintenance and topology information maintenance, the node determines how to process the HELLO packet and the TC packet according to the type of the node. The flow diagram of LHRVBN protocol is shown in figure 1.
The backbone node processes the received HELLO packet, acquires topology information in a 2-hop range, generates and maintains a neighbor table, and selects an MPR set based on an absorbance mechanism; the backbone node processes the received TC packets, senses the global topology information of the virtual backbone network, and generates and maintains a virtual backbone network topology table; based on the generated topological table, the low-delay high-reliability routing protocol calculates the optimal route by a load balancing mechanism and combining the change of the path service flow, and establishes a routing table;
similar to the OLSR protocol, the LHRVBN protocol also performs MPR set selection, except that the LHRVBN protocol narrows the MPR set selection range to the virtual backbone network and selects MPR sets in consideration of node absorbance.
For non-backbone nodes, the LHRVBN protocol simplifies the maintenance process of neighbor information, only processes received HELLO packets, generates and maintains a self neighbor table and a neighbor comparison table, acquires the routing information of self two-hop neighbor nodes through the neighbor table, and acquires the information of neighbor backbone nodes which have one-to-one mapping relation with the self through the neighbor comparison table. And the non-backbone nodes do not maintain topology information and do not generate TC packets, and if the TC packets are received, the TC packets are directly discarded. The neighbor comparison table is used for determining the subordination relationship between the non-backbone nodes and the backbone nodes, namely, the forwarding objects of the service information of the non-backbone nodes are determined, and the one-to-one mapping relationship from the non-backbone nodes to the backbone nodes is established. The backbone node establishes a whole network neighbor comparison table by receiving and processing the HELLO packet and the TC packet; unlike the backbone nodes, the non-backbone nodes only need to establish a one-hop neighbor comparison table per se through the HELLO packets.
Wherein:
the number of control packets flooded by the network is reduced by the mechanism of the degree of absorption. In the absorbance mechanism, the absorbance is defined as follows, and isolated node concepts used in the definition are given together:
an isolated node:
Figure GDA0002572273400000111
Figure GDA0002572273400000112
wherein N is2(S) two-hop neighbor set, N, representing source node S3(S) represents a three-hop neighbor set of the source node S, and if there is a node Y without a link to node M, such a node Y is called an orphaned node. A schematic diagram of isolated nodes is shown in fig. 2. Taking nodes 2 and 3 in the figure as an example, the number of isolated nodes of the node 2 is 1, and the number of isolated nodes of the node 3 is 0.
Absorption degree: for any node I, I belongs to N (S), N (S) represents a one-hop neighbor set of a source node S, and the absorptivity of I means that N existing to the node I2(I) The number of isolated nodes in the cluster.
As shown in fig. 3, an ARIMA-SVR combined prediction model is designed based on the load balancing mechanism to realize accurate prediction of the link load of the aviation trunking network; the prediction method of the ARIMA-SVR combined prediction model comprises the following steps:
step a, for a load function sequence at the current moment, through an ARIMA model, carrying out stabilization processing on the load function sequence by using a difference method, and determining optimal prediction through inspection to carry out load prediction to obtain a linear prediction result; and the residual error between the prediction result and the original load function sequence implies the nonlinear characteristic of the load function sequence;
b, substituting the residual error obtained in the step a into an SVR model, mapping the residual error to a high-dimensional feature space through nonlinearity, and determining a linear function by using a Gaussian function as a kernel function to obtain a correction value of the residual error;
and c, adding the linear prediction result obtained in the step a and the correction value of the residual error obtained in the step b to obtain a load prediction value at the next moment.
The specific implementation method of the step 2 is as follows:
step 21, initializing MPR set to phi, adding a node with willingness of WILL _ ALWAYS in N (S) into MPR (S);
step 22, calculating the connectivity of all nodes in N (S), wherein the connectivity refers to the number of two-hop neighbor nodes which can be connected by the nodes in N (S);
step 23, selecting the node I, N in N (S)2(S) there is a part of nodes which must communicate with the node S through I, I is added into MPR (S), and N which can be reached through I2Nodes in (S) from N2(S), removing the nodes, and repeating the step 23 until all the nodes meeting the condition of the step 23 are added into the MPR (S);
step 24, if N is present2(S) if nodes are not covered, repeating the following steps until all N nodes are covered2(S) nodes are all covered:
step 241, calculating the coverage of the node S which is not added with the MPR set node in N (S), wherein the coverage refers to the number of the nodes which can cover the rest two-hop neighbor nodes in N (S);
step 242, selecting a node with the coverage degree not being 0 and the highest willingness degree to join the MPR;
step 243, if there are multiple nodes meeting the condition of step 242, selecting the node with the highest coverage to join into the MPR (S), and adding the covered N2(S) removing the nodes;
step 244, if a plurality of nodes meeting the condition of the step 243 still exist, selecting the node with the highest connectivity degree to join into the MPR (S), and covering N2(S) removing the nodes;
step 245, after the steps are completed, if a plurality of nodes have the condition that the connectivity and the coverage are the same, selecting the node with higher absorbance to add into the MPR set;
wherein, N (S) is a one-hop neighbor set of the source node S; n is a radical of2(S) is a two-hop neighbor set of the source node S; MPR (S) representation sectionMPR set of points S; the willingness degree refers to the degree that a node is willing to provide routing forwarding for other nodes, the value is 0-7, and the higher the value is, the higher the willingness of the node to provide routing forwarding service is shown; when the value is 7, the willingness degree is represented as WILL _ ALWAYS, and the node can ALWAYS provide the route forwarding service;
through an ARIMA-SVR combined prediction model, the node takes the obtained load prediction value of the neighbor node at the next moment as the basis for selecting a routing path, so that the occurrence of network congestion is avoided; setting the load threshold to 2/3, namely, when the load predicted value exceeds 2/3, network congestion is generated;
step 246, the source node searches the neighbor table and the topology table, and obtains the load condition of all the neighbor nodes at the next moment through an ARIMA-SVR combined prediction model by receiving and processing the HELLO packet of the neighbor nodes in a plurality of available routes;
step 247, if the load predicted values of all the neighboring nodes are less than 2/3, determining hop values according to the shortest path principle, and establishing a routing table;
step 248, if the predicted value of the load of the adjacent node is greater than 2/3, determining hop values in the rest adjacent nodes according to the principle of shortest path, and establishing a routing table;
and step 249, if the load predicted values of all the neighbor nodes are greater than 2/3, selecting the neighbor node with the smallest load predicted value at the next moment as a next hop node, then determining a routing hop value according to the shortest path principle, and establishing a routing table.
The invention follows the basic idea of an OLSR routing protocol, optimizes the MPR selection strategy by constructing a virtual backbone network of an aviation cluster network and designing an absorbance mechanism based on the virtual backbone network, can select nodes with higher absorbance when the MPR nodes are selected, effectively reduces the flooding TC grouping number in the network, increases the probability that effective service information occupies a physical channel, reduces transmission delay and increases the packet delivery rate; a load balancing mechanism is designed based on a virtual backbone network, the load condition of a link at the next moment is predicted through an ARIMA-SVR model, the network congestion phenomenon is avoided, the transmission time delay is further reduced, and the packet delivery rate is increased; thereby being capable of better serving aviation cluster battles.
The above is only a preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes will occur to those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (4)

1. A low-delay high-reliability routing method for an aviation cluster network is characterized by comprising the following steps:
step 1, constructing an aviation cluster network virtual backbone network:
constructing a node weight function formula by taking the available node bandwidth and the node degree as parameters; selecting a connected dominating set based on the node weight to complete the construction of a virtual backbone network; the larger the node weight is, the stronger the node routing forwarding capability is; the node weight function is:
Figure FDA0002572273390000011
wherein d (u) is the node degree, N is the ideal number that one dominant point can dominate other dominated points, and the value of N is the average node degree of the network; is a constant greater than zero, BuIs the available bandwidth of the node, BthrIs the node available bandwidth threshold; wherein the content of the first and second substances,
in step 1, constructing an aviation trunking network virtual backbone network based on an MIS construction algorithm and a CDS algorithm;
the implementation of the MIS construction algorithm is completed through the receiving and sending of a dominator group and a dominated group, and the selection of a large independent set is carried out based on the node weight w (u); the number of network nodes is set to n,
Figure FDA0002572273390000012
one-hop neighbor set, N, representing node uu(w) represents a set of weight information for all nodes in node N (u), Nu(w)＝{w(i)|0<i<n, i ≠ u }; setting c (u) to represent the node state:
Figure FDA0002572273390000013
the flow of the MIS construction algorithm is as follows:
step 11,
Figure FDA0002572273390000014
Initializing c (u) to 0;
step 12,
Figure FDA0002572273390000015
Determining whether w (i) is greater than w (u), w (i) is ∈ Nu(w); if so, not performing any operation; otherwise, go to step 13;
step 13, judging whether i exists, 0< i < n, so that w (i) is equal to w (u); if so, selecting the node v with the largest lower 8 bits of the IP address in the set { i, u }, setting C (v) ═ 2, and broadcasting a dominator packet; otherwise, set c (u) 2, broadcast dominator packet;
step 14,
Figure FDA0002572273390000016
x ≠ u, v, if a dominator packet is received, c (x) is set to 1, and the dominated packet is broadcasted;
step 15,
Figure FDA0002572273390000017
y is not equal to x, whether C (y) is equal to 2 or not is judged, and if yes, no operation is carried out; otherwise, y deletes x from N (y);
step 16,
Figure FDA0002572273390000021
If there is no case where c (u) is 0, the MIS structure is completed; otherwise, go to step 12;
all nodes u with the C value of 2 obtained by the MIS algorithm form a set D (n), and all nodes v with the C value of 1 form a set E (v); the method for constructing CDS by MIS is as follows:
step 17,
Figure FDA0002572273390000022
A CALL packet is sent out of the network,
Figure FDA0002572273390000023
after receiving the CALL packet, adding w (u) of the CALL packet to the CALL packet and forwarding the CALL packet; if receiving CALL packets sent by a plurality of dominating nodes at the same time, only forwarding the CALL packet of w (u) the largest dominating node, and directly discarding the rest;
step 18,
Figure FDA0002572273390000024
After receiving the CALL packet, if only one CALL packet is received, generating an ACCESS packet, wherein the propagation path of the ACCESS packet is exactly opposite to the propagation path of the received CALL packet; otherwise, selecting w (u) maximum CALL packet to generate an ACCESS packet, wherein the propagation path of the ACCESS packet is opposite to that of the w (u) maximum CALL packet;
step 19, the node receiving the ACCESS grouping sets the C value of the node to be 2, and changes the state of the node to be a dominant node;
after the process is completed, all the nodes with the C value of 2 form a CDS, and the construction of the CDS is completed;
step 2, a low-delay high-reliability routing protocol based on the virtual backbone network:
judging whether the network node is a backbone node or a non-backbone node;
the backbone node processes the received HELLO packet, acquires topology information in a 2-hop range, generates and maintains a neighbor table, and selects an MPR set based on an absorbance mechanism; the backbone node processes the received TC packets, senses the global topology information of the virtual backbone network, and generates and maintains a virtual backbone network topology table; based on the generated topological table, the low-delay high-reliability routing protocol calculates the optimal route by a load balancing mechanism and combining the change of the path service flow, and establishes a routing table; wherein, the absorbing degree mechanism is that for any node I, I is equal to N (S), N (S) represents one hop of the source node SNeighbor set, i.e. the degree of absorption of I means that N exists to node I2(I) The number of isolated nodes; the isolated node is
Figure FDA0002572273390000025
Wherein N is2(S) two-hop neighbor set, N, representing source node S3(S) represents a three-hop neighbor set of a source node S, if a node Y does not have a link to a node M, the node Y is called an isolated node;
the non-backbone node processes the received HELLO packet, generates and maintains a self neighbor table and a neighbor comparison table, acquires the routing information of the self two-hop neighbor node through the neighbor table, and acquires the information of the neighbor backbone node which has a one-to-one mapping relation with the self through the neighbor comparison table; wherein the content of the first and second substances,
in step 2, an ARIMA-SVR combined prediction model is designed based on the load balancing mechanism, so that the accurate prediction of the link load of the aviation cluster network is realized; the prediction method of the ARIMA-SVR combined prediction model comprises the following steps:
step a, for a load function sequence at the current moment, through an ARIMA model, carrying out stabilization processing on the load function sequence by using a difference method, and determining optimal prediction through inspection to carry out load prediction to obtain a linear prediction result; and the residual error between the prediction result and the original load function sequence implies the nonlinear characteristic of the load function sequence;
b, substituting the residual error obtained in the step a into an SVR model, mapping the residual error to a high-dimensional feature space through nonlinearity, and determining a linear function by using a Gaussian function as a kernel function to obtain a correction value of the residual error;
c, adding the linear prediction result obtained in the step a and the correction value of the residual error obtained in the step b to obtain a load prediction value at the next moment;
the step 2 comprises the following steps:
step 21, initializing MPR set to phi, adding a node with willingness of WILL _ ALWAYS in N (S) into MPR (S);
step 22, calculating the connectivity of all nodes in N (S), wherein the connectivity refers to the number of two-hop neighbor nodes which can be connected by the nodes in N (S);
step 23Selecting nodes I, N in N (S)2(S) there is a part of nodes which must communicate with the node S through I, I is added into MPR (S), and N which can be reached through I2Nodes in (S) from N2(S), removing the nodes, and repeating the step 23 until all the nodes meeting the condition of the step 23 are added into the MPR (S);
step 24, if N is present2(S) if nodes are not covered, repeating the following steps until all N nodes are covered2(S) nodes are all covered:
step 241, calculating the coverage of the node S which is not added with the MPR set node in N (S), wherein the coverage refers to the number of the nodes which can cover the rest two-hop neighbor nodes in N (S);
step 242, selecting a node with the coverage degree not being 0 and the highest willingness degree to join the MPR;
step 243, if there are multiple nodes meeting the condition of step 242, selecting the node with the highest coverage to join into the MPR (S), and adding the covered N2(S) removing the nodes;
step 244, if a plurality of nodes meeting the condition of the step 243 still exist, selecting the node with the highest connectivity degree to join into the MPR (S), and covering N2(S) removing the nodes;
step 245, after the steps are completed, if a plurality of nodes have the condition that the connectivity and the coverage are the same, selecting the node with higher absorbance to add into the MPR set;
wherein, N (S) is a one-hop neighbor set of the source node S; n is a radical of2(S) is a two-hop neighbor set of the source node S; MPR (S) MPR set representing node S; the willingness degree refers to the degree that a node is willing to provide routing forwarding for other nodes, the value is 0-7, and the higher the value is, the higher the willingness of the node to provide routing forwarding service is shown; when the value is 7, the willingness degree is represented as WILL _ ALWAYS, and the node can ALWAYS provide the route forwarding service;
through an ARIMA-SVR combined prediction model, the node takes the obtained load prediction value of the neighbor node at the next moment as the basis for selecting a routing path, so that the occurrence of network congestion is avoided; setting the load threshold to 2/3, namely, when the load predicted value exceeds 2/3, network congestion is generated;
step 246, the source node searches the neighbor table and the topology table, and obtains the load condition of all the neighbor nodes at the next moment through an ARIMA-SVR combined prediction model by receiving and processing the HELLO packet of the neighbor nodes in a plurality of available routes;
step 247, if the load predicted values of all the neighboring nodes are less than 2/3, determining hop values according to the shortest path principle, and establishing a routing table;
step 248, if the predicted value of the load of the adjacent node is greater than 2/3, determining hop values in the rest adjacent nodes according to the principle of shortest path, and establishing a routing table;
and step 249, if the load predicted values of all the neighbor nodes are greater than 2/3, selecting the neighbor node with the smallest load predicted value at the next moment as a next hop node, then determining a routing hop value according to the shortest path principle, and establishing a routing table.
2. The aviation trunking network-oriented low-latency high-reliability routing method of claim 1, wherein in step 1, the value is 0.01.
3. The aviation trunking network-oriented low-latency high-reliability routing method according to claim 1, wherein in step 2, the backbone nodes establish the whole-network neighbor comparison table by receiving and processing the HELLO packets and the TC packets, and the non-backbone nodes establish their own one-hop neighbor comparison table by the HELLO packets.
4. The aviation trunking network-oriented low-latency high-reliability routing method of claim 1, wherein in step 2, the non-backbone nodes directly discard the TC packets if they receive the TC packets.
CN201810118928.8A 2018-02-06 2018-02-06 Low-delay high-reliability routing method for aviation cluster network Active CN108337166B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810118928.8A CN108337166B (en) 2018-02-06 2018-02-06 Low-delay high-reliability routing method for aviation cluster network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810118928.8A CN108337166B (en) 2018-02-06 2018-02-06 Low-delay high-reliability routing method for aviation cluster network

Publications (2)

Publication Number Publication Date
CN108337166A CN108337166A (en) 2018-07-27
CN108337166B true CN108337166B (en) 2020-11-03

Family

ID=62928181

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810118928.8A Active CN108337166B (en) 2018-02-06 2018-02-06 Low-delay high-reliability routing method for aviation cluster network

Country Status (1)

Country Link
CN (1) CN108337166B (en)

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109714260B (en) * 2019-01-04 2020-09-04 浙江大学 Implementation method for building virtual backbone network based on UCDS algorithm in OLSR routing protocol
CN109547345B (en) * 2019-01-22 2020-11-03 陈柯帆 Software-defined airborne network system and content-driven routing method
CN109639588B (en) * 2019-01-22 2022-08-30 中国人民解放军空军工程大学 Network congestion control routing method for aviation cluster
CN109922513B (en) * 2019-03-06 2020-08-18 上海交通大学 OLSR routing method and system based on mobile prediction and time delay prediction
CN109922488B (en) * 2019-04-26 2021-04-23 电子科技大学 Design method for URLLC packet discarding in real-time wireless control system
CN111263419B (en) * 2020-01-17 2021-12-28 西安交通大学 Unmanned aerial vehicle-based dynamic routing method for stereo heterogeneous network in emergency scene
CN111432434A (en) * 2020-03-13 2020-07-17 中国国家铁路集团有限公司 Low-delay monitoring and detecting method and system for railway engineering
CN111757414B (en) * 2020-06-19 2022-05-20 北京交通大学 SDMANET network networking method based on multimode radio station
CN113891399B (en) * 2021-10-13 2023-08-01 北京慧清科技有限公司 Load balancing-oriented multipath weighted scheduling (OLSR) routing method
WO2023184213A1 (en) * 2022-03-30 2023-10-05 江苏杰泽罗通信科技有限公司 Clustered optimized link state routing method based on virtual backbone network
CN114727354B (en) * 2022-03-30 2023-12-01 江苏杰泽罗通信科技有限公司 Clustering optimal link state routing method based on virtual backbone network
CN115225560B (en) * 2022-07-15 2023-08-22 国网河南省电力公司信息通信公司 Route planning method in power communication service

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101062317B1 (en) * 2010-10-28 2011-09-06 삼성탈레스 주식회사 Method for selecing multipoint relay candidate terminal in olsr protocol to send datta efficiently
CN102802228A (en) * 2012-08-23 2012-11-28 西北工业大学 AdHoc network multipath routing method oriented to link stability
CN104836733A (en) * 2015-04-14 2015-08-12 中国人民解放军国防科学技术大学 Method for achieving optimal link state routing protocol
CN107645711A (en) * 2016-07-21 2018-01-30 北京信威通信技术股份有限公司 A kind of method and device of network route

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101062317B1 (en) * 2010-10-28 2011-09-06 삼성탈레스 주식회사 Method for selecing multipoint relay candidate terminal in olsr protocol to send datta efficiently
CN102802228A (en) * 2012-08-23 2012-11-28 西北工业大学 AdHoc network multipath routing method oriented to link stability
CN104836733A (en) * 2015-04-14 2015-08-12 中国人民解放军国防科学技术大学 Method for achieving optimal link state routing protocol
CN107645711A (en) * 2016-07-21 2018-01-30 北京信威通信技术股份有限公司 A kind of method and device of network route

Also Published As

Publication number Publication date
CN108337166A (en) 2018-07-27

Similar Documents

Publication Publication Date Title
CN108337166B (en) Low-delay high-reliability routing method for aviation cluster network
Alshabtat et al. Low latency routing algorithm for unmanned aerial vehicles ad-hoc networks
CN1926820B (en) Method, communication device and system for checking neighbor node using NDP in wireless multi-hop network
US11343817B2 (en) Multi-tier density-aware location-based channel assignment and adaptive power control method for mobile ad-hoc networks
EP2372951B1 (en) Network layer topology management for mobile ad-hoc networks and associated methods
Shenbagapriya et al. A survey on proactive routing protocols in MANETs
CN103929790A (en) Two-layer routing method for Ad Hoc network
Bhangwar et al. On routing protocols for high performance
CN109803342B (en) Unmanned aerial vehicle self-organizing network routing method oriented to energy balance
Nawaz et al. Implementation of cross layer design for efficient power and routing in UAV communication networks
Li et al. Ad hoc network routing protocol based on location and neighbor sensing
Nurcahyani et al. Performance analysis of ad-hoc on-demand distance vector (aodv) and dynamic source routing (dsr) routing protocols during data broadcast storm problem in wireless ad hoc network
CN116782330A (en) Method and medium for selecting path in SD-UANET by considering load and link change
Yoshihiro et al. A new hybrid approach for scalable table-driven routing in MANETs
CN114449608A (en) Unmanned aerial vehicle ad hoc network self-adaptive routing method based on Q-Learning
Aitha et al. A strategy to reduce the control packet load of aodv using weighted rough set model for manet
Johansson et al. An analysis of the fisheye routing technique in highly mobile ad hoc networks
Avallone et al. Layer-2.5 routing in multi-radio wireless mesh networks
Zhao et al. A Grid-Based Virtual Routing Algorithm for UAV Systems in Three-Dimensional Space
Firoiu et al. Scaling MANETs using long-range radios and protocol adaptation
Kardoust et al. Introducing a method for improving the performance of routing algorithms in unmanned aeronautical ad-hoc networks
CN116456419A (en) Multi-unmanned aerial vehicle data return route method for energy balance high-reliability transmission
Bamhdi et al. Dynamic-power AODV routing protocol based on node density
Liu et al. A location based QoS routing protocol for ad hoc networks
Ranjan et al. Route discovery in Mobile Ad hoc Network using an optimum angle selection based approach

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant