CN108337166A - A kind of highly reliable Routing Protocol of low time delay of Aviation cluster network - Google Patents
A kind of highly reliable Routing Protocol of low time delay of Aviation cluster network Download PDFInfo
- Publication number
- CN108337166A CN108337166A CN201810118928.8A CN201810118928A CN108337166A CN 108337166 A CN108337166 A CN 108337166A CN 201810118928 A CN201810118928 A CN 201810118928A CN 108337166 A CN108337166 A CN 108337166A
- Authority
- CN
- China
- Prior art keywords
- node
- groupings
- network
- mpr
- routing
- 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.)
- Granted
Links
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
Abstract
The invention discloses a kind of highly reliable Routing Protocols of low time delay of Aviation cluster network, it continues to use the basic thought of OLSR Routing Protocols, by building aviation cluster network virtual backbone network, trap mechanism is designed based on virtual backbone network, optimize MPR selection strategies, the higher node of trap can be selected in MPR node selections, it is effective to reduce the TC packet counts flooded in network, increase the probability that effective traffic information occupies physical channel, reduces propagation delay time, increases packet delivery fraction；And it is based on virtual backbone network design (calculated) load equilibrating mechanism, by ARIMA SVR model prediction subsequent time link load situations, avoids network that congestion phenomenon occurs, further reduces propagation delay time, increase packet delivery fraction；So as to preferably serve aviation cluster fight.
Description
Technical field
The present invention relates to routing protocol technology field more particularly to a kind of low time delay of Aviation cluster network are highly reliable
Routing Protocol.
Background technology
During Information Battlefield gradually evolution, on the one hand, variation gradually occurs for air combat mode, from initial finger
Platform+mono- type air platform cooperative combat is controlled, the ground location to the later stage in last century and charge platform+architecture of forming into columns in the air
It fights, the polymorphic type to the beginning of this century is formed into columns cooperation in the air, then to the current polymorphic type aerial platform cluster studied extensively
It is turned into war；On the other hand, with the proposition of the continuous development of aeronautical data chain and network-centric warfare theory, air battle battlefield is drawn
Networked Characteristics between platform become clear day by day, and network size, network service, network complexity etc. increasingly increase, networking process from
Initial simple data transmission link, to small-scale, full-mesh network, to extensive, relaying homogeneous network, then to it is extensive,
Multi-hop heterogeneous network.Aviation cluster fight rely on aeronautical communications network (hereinafter referred to as air net), by multiple types, it is multi-functional and
Large-scale someone's optimal in structure and unmanned battle platform flexible networking, are assisted by tactics between the effective support platform of air net
Make, realize that each platform capabilities have complementary advantages, it is ensured that in the entire Campaign Process of OODA (Observe-Orient-Decide-Act) not
The same stage, different task is continuous, coordinates and efficient implementation.Due to the platform diversity of aviation cluster fight, task otherness with
And Battle Field Electromagnetic complexity, so that the nodal properties of its air net relied on and node capacity is distinguished larger, network industry
The phasic Chang of business, demand for services and topological structure differs markedly from existing wireless network, therefore studies and support aviation
The air net technology of cluster fight seems particularly significant.
The key technology of routing, multiple access access and network management as air net networking, to supporting aviation cluster fight
Air net development it is most important.The aeronautical data chain task applied in air battle at present is fixed, based on full-mesh topology,
Networking technology mainly studies multiple access technique, shorter mention route technology.But the Platform Type of aviation cluster is more, scale amounts
Greatly, it has a very wide distribution, and platform mobility is high, network topology will be multi-hop topological structure, and mobile node need to rely on multi-hop chain
It completes to communicate with each other in road.Correspondingly, route technology research becomes inevitable.Wireless Ad Hoc network Routing Protocol is sent out according to routing
Existing strategy can be divided into active, on-demand and hybrid routing protocol；Active Routing Protocol in Active is also known as Table Driven agreement or proactive road
By agreement.In this agreement, regardless of whether there is communication requirement, periodically Broadcasting Control is grouped each node, interaction routing letter
Breath safeguards a routing table for reaching every other node in network, and by constantly detecting network topology and link-quality
Variation update routing table.Active Routing Protocol in Active occurs more early, and a variety of different occasions are adapted to by studying to have proposed for many years
Routing Protocol.According to the type and quantity of node maintenance routing table and the difference of routing table update mechanism, mainly have following
It is several：DSDV agreements, FSR agreements, OLSR agreements.On-demand routing protocol is also known as Reactive routing protocols, with active difference, presses
It needs Routing Protocol to establish routing table on demand according to the packet of transmission, is broadly divided into two ranks of route discovery and route maintenance
Section.In the route discovery stage, when source node will send data to destination node, inquires whether be stored with the purpose section first
The routing table of point initiates route finding process in the case of no, establishes effective routing information.In route maintenance phase, dimension
The routing in communication process is protected, stops route maintenance after communication process.On-demand routing protocol common are following several：
DSR agreements, AODV agreements.Hybrid routing protocol is the synthesis to reactiver outing and on-demand routing, is relatively suitable for large-scale wireless
Ad Hoc networks.Reactiver outing mode, overseas route querying is used then to use on-demand routing mode based on small range regional area.
The balanced active routing delays of hybrid routing protocol are small and the small advantage of on-demand routing expense, network bandwidth loss and routing prolong
It is all relatively low late.But mixed logic dynamic disadvantage is also obvious, and routing algorithm is more complicated, while also adding additional management
Expense represents agreement as ZRP agreements.
The research of existing wireless self-organization network route technology focuses primarily upon the fields such as vehicle-mounted net, wireless sensor network,
Compared with vehicle-mounted net and wireless sensor network, the application scenarios of aviation cluster fight so that aviation cluster network has obviously not
The characteristics of being same as conventional wireless self-organizing network.It is embodied in：(1) bandwidth demand differentiation.Due to support entire OODA
Continuous, the closed loop operation of each stage difference combat duty, the type of service of interaction is more between aviation cluster network node, number of services
Greatly, and business demand difference is big.Such as the high reconnaissance image information of bandwidth demand, single bandwidth demand is not high but transmission quantity is more
Situation information, the higher sensor detection information of bandwidth demand, bandwidth demand be not high but access requires high guidance information etc..
(2) harsher timeliness and higher reliability are required.Battlefield surroundings are fast changing, it is desirable that network management control between cluster member
Information processed and the propagation delay time of tactical information are as low as possible, to ensure the efficient completion of combat duty.For example, Collaborative Control is believed
The delay requirement second grade of breath, sensor parameters information, and the delay requirement Millisecond of complex tracking information, guidance information.Therefore
Compared to traditional wireless self-organization network, requirement of the aviation cluster network to time delay is more harsh.In addition, aviation cluster fight
Electromagnetic environment be in the defence space environment of both sides' electronic countermeasure fierceness, the electromagnetic interference of enemy will bring a large amount of information
Error of transmission or information are lost.Aviation cluster network, which should reduce the loss wrapped in data transmission procedure to the greatest extent, implements combat duty
Influence, therefore the information exchange between cluster member have higher reliability requirement.The routing of conventional wireless self-organizing network
Agreement cannot be satisfied aviation cluster network demand.Air net route technology research suitable for aviation cluster fight is just opened up
It opens.Therefore it is guidance with aviation cluster fight demand, further investigation is suitable for aviation cluster fight this completely new combat mode
Routing Protocol, to exploring satisfaction and supporting the air net technology of the following complicated Air-to-air Combat Environment that there is important basic theory to be worth
And realistic meaning.
To ensure that the efficient implementation of aviation cluster fight task, the timeliness and reliability requirement of aviation cluster network are universal
It is higher.And the different band of task carrys out the requirement of each operation stepped aging and reliability there are bigger difference, and such as collaboration is hit
The timeliness and reliability requirement in stage can 1~2 orders of magnitude higher than the command and guide stage.Therefore, the road of aviation cluster network
It must take into consideration the high-timeliness and high reliability request of multi-hop transmission by agreement research.
Proactive routing protocol has a clear superiority in terms of timeliness and reliability compared with On-demand routing agreement.OLSR is route
Agreement is research hotspot all the time as typical proactive routing protocol, wherein when for improving OLSR Routing Protocols
The research of effect property and reliability, mainly from the angle for the angle and load balancing for reducing network central control packet count.Herein
The basic thought for having continued to use OLSR Routing Protocols designs Aviation cluster network to improve timeliness and reliability as target
Routing Protocol.
Invention content
Shortcoming present in regarding to the issue above, it is high that the present invention provides a kind of low time delay of Aviation cluster network
Reliable routing agreement.
To achieve the above object, the present invention provides a kind of highly reliable Routing Protocol of low time delay of Aviation cluster network,
Including：
Step 1, structure aviation cluster network virtual backbone network：
Using node available bandwidth and node degree as parameter, structure node weight function formula；Connected based on node weights
The selection of logical dominant set is to complete the structure of virtual backbone network；Wherein, node weights are bigger, and node-routing transfer capability is stronger；
Node weight function is：
In formula, d (u) is node degree, and N, which is a domination point, can dominate other ideal quantities for being dominated point, and δ is that perseverance is more than
Zero constant, BuIt is node available bandwidth, BthrIt is node available bandwidth threshold value；
Step 2, the highly reliable Routing Protocol of the low time delay based on virtual backbone network：
It is that backbone node or non-backbone node judge to network node；
The HELLO groupings that backbone node processing receives obtain the topology information generation in 2 jump ranges and maintenance of neighbor table,
And MPR collection is selected based on trap mechanism；The TC groupings that backbone node processing receives, perception virtual backbone network Global Topological letter
Breath, generates and safeguards virtual backbone network topology table；Based on the topology table generated, the highly reliable Routing Protocol of low time delay passes through
Load-balancing mechanism and the variation for combining path service flow, calculate optimal routing, establish routing table；
The HELLO groupings that non-backbone node processing receives, generate and safeguard itself neighbor table and neighbours' table of comparisons, pass through neighbour
The routing iinformation that table knows itself double bounce neighbors is occupied, the neighbour for having mapping relations one by one with itself is known by neighbours' table of comparisons
Occupy the information of backbone node.
As a further improvement on the present invention, in step 1, the value of N is the average node degree of network, and δ values are
0.01。
As a further improvement on the present invention, in step 1, MIS construction algorithms are based on and CDS algorithms build aviation cluster
Network virtual backbone network；
The realization of MIS construction algorithms is completed by the transmitting-receiving of dominator groupings and dominated groupings, based on section
Point weight w (u) carries out the selection of maximal independent set；Setting network number of nodes is n,Indicate a jump of node u
Neighbours collect, Nu(w) the value information set of all nodes in node N (u), N are indicatedu(w)=w (i) | 0<i<N, i ≠ u }；Setting
C (u) indicates node state：
The flow of MIS construction algorithms is：
Step 11,Initialize C (u)=0；
Step 12,Judge whether that w (i) is more than w (u), w (i) ∈ Nu(w)；If in the presence of without appointing
What is operated；Otherwise, step 13 is gone to；
Step 13 judges whether i, 0<i<N so that w (i) is equal to w (u)；If in the presence of the selection in set { i, u }
The maximum node v of IP address least-significant byte, setting C (v)=2, and broadcast dominator groupings；Otherwise, setting C (u)=2, broadcast
Dominator is grouped；
Step 14,X ≠ u, v, if receiving dominator groupings, setting C (x)=1, dominated points of broadcast
Group；
Step 15,Y ≠ x, judges whether C (y) is equal to 2, if being equal to 2, does not do any operation；Otherwise, y is from N
(y) x is deleted；
Step 16,If the case where there is no C (u)=0, MIS construction completes；Otherwise, step 12 is gone to；
All node u that C values are 2 obtained by above-mentioned MIS algorithms are constituted into set D (n), all node v that C values are 1 are constituted
Set E (v)；By MIS build CDS method be：
Step 17,CALL groupings are sent,After receiving CALL groupings, itself w (u) is added
It is added in CALL groupings and forwards the grouping；If synchronization receives the CALL groupings that multiple domination nodes are sent, only turn
The maximum CALL groupings for dominating node of w (u) are sent out, remaining is directly abandoned；
Step 18,After receiving CALL groupings, if receiving there are one CALL packet counts, one is generated
The propagation path of a ACCESS groupings, ACCESS groupings is just opposite with the propagation path for receiving CALL groupings；Otherwise it chooses
The maximum CALL groupings of wherein w (u), generate an ACCESS grouping, and the propagation path and the w (u) of ACCESS groupings are maximum
The propagation path of CALL groupings is opposite；
Itself C value is set as 2 by step 19, the node for receiving ACCESS groupings, and oneself state is changed to dominate node；
After the completion of the above process, the node that all C values are 2 constitutes CDS, and CDS structures finish.
As a further improvement on the present invention, in step 2, backbone node handles HELLO groupings and TC points by reception
Group establishes the whole network neighbours' table of comparisons, and non-backbone node establishes itself hop neighbor table of comparisons by HELLO groupings.
As a further improvement on the present invention, in step 2, non-backbone node directly abandons if receiving TC groupings.
As a further improvement on the present invention, in step 2, the trap mechanism is for any one node I, I
∈ N (S), N (S) indicate that a hop neighbor collection of source node S, the trap of I refer to the N existed to node I2(I) isolated node in
Number；The isolated node isWherein N2(S) two-hop neighbors of source node S are indicated
Collection, N3(S) three hop neighbor collection of source node S are indicated, if there are node Y not to have link to node M, such Y nodes are referred to as
Isolated node.
As a further improvement on the present invention, in step 2, it is based on the load-balancing mechanism and designs ARIMA-SVR groups
Prediction model is closed, realizes the accurate prediction to aviation cluster network link load；The prediction side of ARIMA-SVR combination forecastings
Method is：
Step a, for current time load function sequence, by ARIMA models, tranquilization is carried out to it using calculus of finite differences
Processing determines that optimum prediction carries out load estimation by inspection, obtains linear prediction result；And the prediction result loads letter with former
The residual error of Number Sequence implies the nonlinear characteristic of the load function sequence；
Step b, the residual error for obtaining step a substitutes into SVR models, by Nonlinear Mapping to high-dimensional feature space, uses
Gaussian function determines linear function as kernel function, obtains the correction value of residual error；
Step c, the linear prediction result that step a is obtained is added with the correction value of the obtained residual errors of step b, is obtained next
Moment load estimation value.
As a further improvement on the present invention, the step 2 includes：
Step 21, initialization MPR collection are combined into Φ, and MPR (S) is added in the node that wish degree in N (S) is WILL_ALWAYS；
Step 22, the Connected degree for calculating all nodes in N (S), it is adjacent that Connected degree refers to the double bounce that N (S) interior joint can connect
Occupy the number of node；
Step 23, the selection node I, N in N (S)2(S) there are part of nodes could be communicated with node S by I in,
MPR (S), while the N that will be reached by I is added in I2(S) node in is from N2(S) removal in, repeats step 23, until
All nodes for meeting step 23 condition are all added in MPR (S)；
If step 24, at this time N2(S) there is node uncovered in, repeat following steps until all N2(S) section in
Point is all capped：
Step 241, to node S, calculate the coverage that MPR collector nodes are not added in its N (S), coverage refers in N (S)
Node can cover the number of remaining two-hop neighbor node；
Step 242, to select coverage not be 0, MPR is added in the highest node of wish degree；
Step 243, if there is multiple nodes for meeting step 242 condition, select the highest node of coverage that MPR is added
(S), and by the N of covering2(S) interior joint removes；
If step 244 still there are multiple nodes for meeting step 243 condition, select the highest node of Connected degree that MPR is added
(S), and by the N of covering2(S) interior joint removes；
Step 245, after the above step is finished, if still with the presence of multiple node Connected degrees and the identical feelings of coverage
Condition then chooses the higher node of trap and MPR collection is added；
Wherein, N (S) is a hop neighbor collection of source node S；N2(S) it is the two-hop neighbors collection of source node S；MPR (S) is indicated
The MPR of node S gathers；" wish degree " finger joint point is ready to provide the degree of routing forwarding for other nodes, and value is 0~7, value
It is higher, show that node is ready that the wish for providing routing forwarding service is higher；When value is 7, wish degree is expressed as WILL_
ALWAYS shows that node can provide routing forwarding service；
By ARIMA-SVR combination forecastings, node makees the load estimation value of the neighbor node subsequent time of acquisition
For the foundation of routed path selection, the generation of network congestion is avoided；It is 2/3 that load threshold, which is arranged, i.e. load estimation value is more than 2/3
When, it will produce network congestion；
Step 246, source node cross lookup neighbor table and topology table, and in a plurality of available routing, adjacent section is handled by receiving
The HELLO groupings of point, the loading condition of all neighbors subsequent times is known by ARIMA-SVR combination forecastings；
If step 247, the load estimation value of all neighbors are both less than 2/3, determine and jump according to shortest path principle
Numerical value establishes routing table；
Step 248 is more than 2/3 if there is neighbors load estimation value, then according to shortest path in remaining neighbors
Principle determines jumping figure value, establishes routing table；
If step 249, all neighbors load estimation values are both greater than 2/3, subsequent time load estimation value is selected most
Small neighbors determines hop count value according to the most short principle in path later, establishes routing table as next-hop node.
Compared with prior art, beneficial effects of the present invention are：
The present invention provides a kind of highly reliable Routing Protocol of low time delay of Aviation cluster network, continues to use OLSR routings association
The basic thought of view designs trap mechanism, optimization by building aviation cluster network virtual backbone network based on virtual backbone network
MPR selection strategies can select the higher node of trap in MPR node selections, effective to reduce the TC flooded in network
Packet count increases the probability that effective traffic information occupies physical channel, reduces propagation delay time, increases packet delivery fraction；And
It is avoided by ARIMA-SVR model prediction subsequent time link load situations based on virtual backbone network design (calculated) load equilibrating mechanism
Congestion phenomenon occurs for network, further reduces propagation delay time, increases packet delivery fraction；So as to preferably serve aviation collection
Group fights.
Description of the drawings
Fig. 1 is the flow of the highly reliable Routing Protocol of low time delay based on virtual backbone network disclosed in an embodiment of the present invention
Figure；
Fig. 2 is isolated node schematic diagram disclosed in an embodiment of the present invention；
Fig. 3 is ARIMA-SVR combination forecasting schematic diagrames disclosed in an embodiment of the present invention.
Specific implementation mode
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, ordinary skill people
The every other embodiment that member is obtained without making creative work, shall fall within the protection scope of the present invention.
The present invention is described in further detail below in conjunction with the accompanying drawings：
The present invention provides a kind of highly reliable routing association of low time delay of the Aviation cluster network based on virtual backbone network
View --- LHRVBN (Low delay and High reliability Routing protocol based on Virtual
Backbone Network), the basic thought of OLSR Routing Protocols is continued to use, by building aviation cluster network virtual backbone
Net designs trap mechanism based on virtual backbone network, optimizes MPR selection strategies, trap can be selected in MPR node selections
Higher node, it is effective to reduce the TC packet counts flooded in network, increase the probability that effective traffic information occupies physical channel,
It reduces propagation delay time, increase packet delivery fraction；And for the purpose of reducing link failure and network congestion, it is based on virtual backbone
Net design (calculated) load equilibrating mechanism avoids network that congestion occurs by ARIMA-SVR model prediction subsequent time link load situations
Phenomenon further reduces propagation delay time, increases packet delivery fraction；So as to preferably serve aviation cluster fight.
The present invention provides a kind of highly reliable Routing Protocol of low time delay of Aviation cluster network, including：
Step 1, structure aviation cluster network virtual backbone network：
Using node available bandwidth and node degree as parameter, structure node weight function formula passes through the node weight function
Formula portrays the size that node provides routing forwarding ability, and node weights are bigger, and node-routing transfer capability is stronger.Node weights
Function is：
Wherein, d (u) is node degree；N, which is a domination point, can dominate other ideal quantities for being dominated point, value
It is related with network density and communication distance, usually take the average node degree of network；δ is the permanent constant more than zero, and usual value is
0.01；BuIt is node available bandwidth, BthrIt is node available bandwidth threshold value.When available resources are when less than threshold value, weights will subtract
It is small, select the possibility of the node to be reduced by.Node degree and available bandwidth are bigger, and weight w (u) is bigger, and node provides routing and turns
The ability of hair is stronger, and selected priority is higher.
It regard node weight w (u) as important evidence, carries out the selection of connected dominating set to complete the structure of virtual backbone network
It builds.
Step 1 structure aviation cluster network virtual backbone network specific method be：
The realization of MIS construction algorithms is completed by the transmitting-receiving of dominator groupings and dominated groupings, based on section
Point weight w (u) carries out the selection of maximal independent set；Setting network number of nodes is n,N (u) indicates that the one of node u jumps neighbour
Occupy collection, Nu(w) the value information set of all nodes in node N (u), N are indicatedu(w)=w (i) | 0<i<N, i ≠ u }；Set C
(u) node state is indicated：
The flow of MIS construction algorithms is：
Step 11,Initialize C (u)=0；
Step 12,Judge whether that w (i) is more than w (u), w (i) ∈ Nu(w)；If in the presence of without appointing
What is operated；Otherwise, step 13 is gone to；
Step 13 judges whether i, 0<i<N so that w (i) is equal to w (u)；If in the presence of the selection in set { i, u }
The maximum node v of IP address least-significant byte, setting C (v)=2, and broadcast dominator groupings；Otherwise, setting C (u)=2, broadcast
Dominator is grouped；
Step 14,(x ≠ u, v), if receiving dominator groupings, setting C (x)=1 broadcasts dominated
Grouping；
Step 15,Y ≠ x, judges whether C (y) is equal to 2, if being equal to 2, does not do any operation；Otherwise, y is from N
(y) x is deleted；
Step 16,If the case where there is no C (u)=0, MIS construction completes；Otherwise, step 12 is gone to；
All node u that C values are 2 obtained by above-mentioned MIS algorithms are constituted into set D (n), all node v that C values are 1 are constituted
Set E (v)；By MIS build CDS method be：
Step 17,CALL groupings are sent,After receiving CALL groupings, itself w (u) is added
It is added in CALL groupings and forwards the grouping；If synchronization receives the CALL groupings that multiple domination nodes are sent, only turn
The maximum CALL groupings for dominating node of w (u) are sent out, remaining is directly abandoned；
Step 18,After receiving CALL groupings, if receiving there are one CALL packet counts, one is generated
The propagation path of a ACCESS groupings, ACCESS groupings is just opposite with the propagation path for receiving CALL groupings；Otherwise it chooses
The maximum CALL groupings of wherein w (u), generate an ACCESS grouping, and the propagation path and the w (u) of ACCESS groupings are maximum
The propagation path of CALL groupings is opposite；
Itself C value is set as 2 by step 19, the node for receiving ACCESS groupings, i.e., is changed to oneself state dominate section
Point；
After the completion of the above process, the node that all C values are 2 constitutes CDS, and CDS structures finish.
Step 2, the highly reliable Routing Protocol of the low time delay based on virtual backbone network (LHRVBN agreements)：
LHRVBN agreements have continued to use the basic thought of OLSR Routing Protocols, include mainly neighbor information maintenance, topology information
Maintenance and the links such as Route establishment and maintenance.The judgement to network node types is increased, judges network node for backbone node
Or non-backbone node, the control packet number flooded in virtual backbone network is reduced based on trap mechanism, and pass through load balancing
Mechanism reduces the probability that congestion occurs for virtual backbone network, and design neighbours' table of comparisons is non-backbone node for realizing destination node
Effective forwarding of business information.Agreement distinguishes backbone node and non-backbone node, double bounce of the backbone node in addition to safeguard itself
Outside neighbor information, the routing iinformation for safeguarding all nodes of other in virtual backbone network is also needed；Non- backbone node only needs to safeguard certainly
Body two-hop neighbors information.Safeguard that node determines such as according to own type in topology information maintenance process in neighbor information
Manage HELLO groupings and TC groupings in where.LHRVBN agreement flow diagrams are as shown in Figure 1.
The HELLO groupings that backbone node processing receives obtain the topology information generation in 2 jump ranges and maintenance of neighbor table,
And MPR collection is selected based on trap mechanism；The TC groupings that backbone node processing receives, perception virtual backbone network Global Topological letter
Breath, generates and safeguards virtual backbone network topology table；Based on the topology table generated, the highly reliable Routing Protocol of low time delay passes through
Load-balancing mechanism and the variation for combining path service flow, calculate optimal routing, establish routing table；
Similar to OLSR agreements, LHRVBN agreements will also carry out the selection of MPR collection, unlike, LHRVBN agreements are by MPR
The range of choice of collection narrows down to virtual backbone network, and MPR collection is selected in the case where considering node trap.
For non-backbone node, LHRVBN agreements simplify neighbor information maintenance process, only handle the HELLO groupings of reception,
It generates and safeguards itself neighbor table and neighbours' table of comparisons, the routing iinformation of itself double bounce neighbors is known by neighbor table, is passed through
Neighbours' table of comparisons knows the information for having neighbours' backbone node of mapping relations one by one with itself.And non-backbone node is without opening up
Maintenance of information is flutterred, does not generate TC groupings, is directly abandoned if receiving TC groupings.Neighbours' table of comparisons for determine non-backbone node with
Subordinate relation between backbone node, i.e., the forwarding object of the business information of clearly non-backbone node, establishes non-backbone node to bone
The mapping relations one by one of dry node.Backbone node handles HELLO groupings by reception and the whole network neighbours' table of comparisons is established in TC groupings；
Different from backbone node, non-backbone node only needs to establish itself hop neighbor table of comparisons by HELLO groupings.
Wherein：
The control packet number of network flooding is reduced by trap mechanism.The trap mechanism, trap define such as
Under, in definition using to isolated node concept provide together：
Isolated node：Wherein N2(S) the two-hop neighbors collection of source node S, N are indicated3
(S) indicate source node S three hop neighbor collection, if there are node Y do not have link arrive node M, such Y nodes be referred to as isolate section
Point.Isolated node schematic diagram is as shown in Figure 2.For scheming interior joint 2,3, the isolated node number of node 2 is 1, and node 3 isolates
Number of nodes is 0.
Trap：One hop neighbor collection of source node S, the absorption of I are indicated for any one node I, I ∈ N (S), N (S)
Degree, which refers to, has the N to node I2(I) number of isolated node in.
As shown in figure 3, designing ARIMA-SVR combination forecastings based on the load-balancing mechanism, realize to aviation collection
The accurate prediction of group network link load；The prediction technique of ARIMA-SVR combination forecastings is：
Step a, for current time load function sequence, by ARIMA models, tranquilization is carried out to it using calculus of finite differences
Processing determines that optimum prediction carries out load estimation by inspection, obtains linear prediction result；And the prediction result loads letter with former
The residual error of Number Sequence implies the nonlinear characteristic of the load function sequence；
Step b, the residual error for obtaining step a substitutes into SVR models, by Nonlinear Mapping to high-dimensional feature space, uses
Gaussian function determines linear function as kernel function, obtains the correction value of residual error；
Step c, the linear prediction result that step a is obtained is added with the correction value of the obtained residual errors of step b, is obtained next
Moment load estimation value.
The concrete methods of realizing of step 2 is：
Step 21, initialization MPR collection are combined into Φ, and MPR (S) is added in the node that wish degree in N (S) is WILL_ALWAYS；
Step 22, the Connected degree for calculating all nodes in N (S), it is adjacent that Connected degree refers to the double bounce that N (S) interior joint can connect
Occupy the number of node；
Step 23, the selection node I, N in N (S)2(S) there are part of nodes could be communicated with node S by I in,
MPR (S), while the N that will be reached by I is added in I2(S) node in is from N2(S) removal in, repeats step 23, until
All nodes for meeting step 23 condition are all added in MPR (S)；
If step 24, at this time N2(S) there is node uncovered in, repeat following steps until all N2(S) section in
Point is all capped：
Step 241, to node S, calculate the coverage that MPR collector nodes are not added in its N (S), coverage refers in N (S)
Node can cover the number of remaining two-hop neighbor node；
Step 242, to select coverage not be 0, MPR is added in the highest node of wish degree；
Step 243, if there is multiple nodes for meeting step 242 condition, select the highest node of coverage that MPR is added
(S), and by the N of covering2(S) interior joint removes；
If step 244 still there are multiple nodes for meeting step 243 condition, select the highest node of Connected degree that MPR is added
(S), and by the N of covering2(S) interior joint removes；
Step 245, after the above step is finished, if still with the presence of multiple node Connected degrees and the identical feelings of coverage
Condition then chooses the higher node of trap and MPR collection is added；
Wherein, N (S) is a hop neighbor collection of source node S；N2(S) it is the two-hop neighbors collection of source node S；MPR (S) is indicated
The MPR of node S gathers；" wish degree " finger joint point is ready to provide the degree of routing forwarding for other nodes, and value is 0~7, value
It is higher, show that node is ready that the wish for providing routing forwarding service is higher；When value is 7, wish degree is expressed as WILL_
ALWAYS shows that node can provide routing forwarding service；
By ARIMA-SVR combination forecastings, node makees the load estimation value of the neighbor node subsequent time of acquisition
For the foundation of routed path selection, the generation of network congestion is avoided；It is 2/3 that load threshold, which is arranged, i.e. load estimation value is more than 2/3
When, it will produce network congestion；
Step 246, source node cross lookup neighbor table and topology table, and in a plurality of available routing, adjacent section is handled by receiving
The HELLO groupings of point, the loading condition of all neighbors subsequent times is known by ARIMA-SVR combination forecastings；
If step 247, the load estimation value of all neighbors are both less than 2/3, determine and jump according to shortest path principle
Numerical value establishes routing table；
Step 248 is more than 2/3 if there is neighbors load estimation value, then according to shortest path in remaining neighbors
Principle determines jumping figure value, establishes routing table；
If step 249, all neighbors load estimation values are both greater than 2/3, subsequent time load estimation value is selected most
Small neighbors determines hop count value according to the most short principle in path later, establishes routing table as next-hop node.
The present invention continues to use the basic thought of OLSR Routing Protocols, by building aviation cluster network virtual backbone network, is based on
Virtual backbone network designs trap mechanism, optimizes MPR selection strategies, trap can be selected higher in MPR node selections
Node, it is effective to reduce the TC packet counts flooded in network, increase the probability that effective traffic information occupies physical channel, reduces
Propagation delay time increases packet delivery fraction；And it is based on virtual backbone network design (calculated) load equilibrating mechanism, passes through ARIMA-SVR models
It predicts subsequent time link load situation, avoids network that congestion phenomenon occurs, further reduce propagation delay time, increase packet and throw
Pass rate；So as to preferably serve aviation cluster fight.
It these are only the preferred embodiment of the present invention, be not intended to restrict the invention, for those skilled in the art
For member, the invention may be variously modified and varied.Any modification made by all within the spirits and principles of the present invention,
Equivalent replacement, improvement etc., should all be included in the protection scope of the present invention.
Claims (8)
1. a kind of highly reliable Routing Protocol of low time delay of Aviation cluster network, which is characterized in that including：
Step 1, structure aviation cluster network virtual backbone network：
Using node available bandwidth and node degree as parameter, structure node weight function formula；Connected component is carried out based on node weights
Selection with collection is to complete the structure of virtual backbone network；Wherein, node weights are bigger, and node-routing transfer capability is stronger；Node
Weight function is：
In formula, d (u) is node degree, and N, which is a domination point, can dominate other ideal quantities for being dominated point, and δ is permanent more than zero
Constant, BuIt is node available bandwidth, BthrIt is node available bandwidth threshold value；
Step 2, the highly reliable Routing Protocol of the low time delay based on virtual backbone network：
It is that backbone node or non-backbone node judge to network node；
The HELLO groupings that backbone node processing receives obtain the topology information generation in 2 jump ranges and maintenance of neighbor table, and base
MPR collection is selected in trap mechanism；The TC groupings that backbone node processing receives, perceive virtual backbone network Global Topological information, raw
At and safeguard virtual backbone network topology table；Based on the topology table generated, the highly reliable Routing Protocol of low time delay passes through load
Equilibrating mechanism and the variation for combining path service flow, calculate optimal routing, establish routing table；
The HELLO groupings that non-backbone node processing receives, generate and safeguard itself neighbor table and neighbours' table of comparisons, pass through neighbor table
The routing iinformation for knowing itself double bounce neighbors knows the neighbours' bone for having mapping relations one by one with itself by neighbours' table of comparisons
The information of dry node.
2. the highly reliable Routing Protocol of low time delay of Aviation cluster network as described in claim 1, which is characterized in that in step
In rapid 1, the value of N is the average node degree of network, and δ values are 0.01.
3. the highly reliable Routing Protocol of low time delay of Aviation cluster network as described in claim 1, which is characterized in that in step
In rapid 1, aviation cluster network virtual backbone network is built based on MIS construction algorithms and CDS algorithms；
The realization of MIS construction algorithms is completed by the transmitting-receiving of dominator groupings and dominated groupings, is based on node weight
Value w (u) carries out the selection of maximal independent set；Setting network number of nodes is n,N (u) indicates a hop neighbor of node u
Collection, Nu(w) the value information set of all nodes in node N (u), N are indicatedu(w)=w (i) | 0<i<N, i ≠ u }；Set C (u)
Indicate node state：
The flow of MIS construction algorithms is：
Step 11,Initialize C (u)=0；
Step 12,Judge whether that w (i) is more than w (u), w (i) ∈ Nu(w)；If in the presence of without any behaviour
Make；Otherwise, step 13 is gone to；
Step 13 judges whether i, 0<i<N so that w (i) is equal to w (u)；If in the presence of in set { i, u } with selecting IP
The maximum node v of location least-significant byte, setting C (v)=2, and broadcast dominator groupings；Otherwise, setting C (u)=2, broadcast
Dominator is grouped；
Step 14,X ≠ u, v, if receiving dominator groupings, setting C (x)=1, broadcast dominated groupings；
Step 15,Y ≠ x, judges whether C (y) is equal to 2, if being equal to 2, does not do any operation；Otherwise, y is from N (y)
Delete x；
Step 16,If the case where there is no C (u)=0, MIS construction completes；Otherwise, step 12 is gone to；
All node u that C values are 2 obtained by above-mentioned MIS algorithms are constituted into set D (n), all node v that C values are 1 constitute set E
(v)；By MIS build CDS method be：
Step 17,CALL groupings are sent,After receiving CALL groupings, itself w (u) is added to this
In CALL groupings and forward the grouping；If synchronization receives the CALL groupings that multiple domination nodes are sent, w (u) is only forwarded
The maximum CALL groupings for dominating node, remaining is directly abandoned；
Step 18,After receiving CALL groupings, if receiving there are one CALL packet counts, one is generated
ACCESS is grouped, and the propagation path of ACCESS groupings is just opposite with the propagation path for receiving CALL groupings；Otherwise it is chosen
The middle maximum CALL groupings of w (u), generate an ACCESS grouping, and the propagation path and the w (u) of ACCESS groupings are maximum
The propagation path of CALL groupings is opposite；
Itself C value is set as 2 by step 19, the node for receiving ACCESS groupings, and oneself state is changed to dominate node；
After the completion of the above process, the node that all C values are 2 constitutes CDS, and CDS structures finish.
4. the highly reliable Routing Protocol of low time delay of Aviation cluster network as described in claim 1, which is characterized in that in step
In rapid 2, backbone node handles HELLO groupings by reception and the whole network neighbours' table of comparisons is established in TC groupings, and non-backbone node passes through
Itself hop neighbor table of comparisons is established in HELLO groupings.
5. the highly reliable Routing Protocol of low time delay of Aviation cluster network as described in claim 1, which is characterized in that in step
In rapid 2, non-backbone node directly abandons if receiving TC groupings.
6. the highly reliable Routing Protocol of low time delay of Aviation cluster network as described in claim 1, which is characterized in that in step 2
In, the trap mechanism is to indicate a hop neighbor collection of source node S, the trap of I for any one node I, I ∈ N (S), N (S)
Refer to the N existed to node I2(I) number of isolated node in；The isolated node is
Wherein N2(S) the two-hop neighbors collection of source node S, N are indicated3(S) the three hop neighbor collection for indicating source node S, if there are node Y not to have
For link to node M, such Y nodes are referred to as isolated node.
7. the highly reliable Routing Protocol of low time delay of Aviation cluster network as claimed in claim 6, which is characterized in that in step
In rapid 2, ARIMA-SVR combination forecastings are designed based on the load-balancing mechanism, are realized negative to aviation cluster network link
The accurate prediction carried；The prediction technique of ARIMA-SVR combination forecastings is：
Step a, for current time load function sequence, by ARIMA models, it is carried out at tranquilization using calculus of finite differences
Reason determines that optimum prediction carries out load estimation by inspection, obtains linear prediction result；And the prediction result and former load function
The residual error of sequence implies the nonlinear characteristic of the load function sequence；
Step b, the residual error for obtaining step a substitutes into SVR models, by Nonlinear Mapping to high-dimensional feature space, using Gauss
Function determines linear function as kernel function, obtains the correction value of residual error；
Step c, the linear prediction result that step a is obtained is added with the correction value of the obtained residual errors of step b, obtains subsequent time
Load estimation value.
8. the highly reliable Routing Protocol of low time delay of Aviation cluster network as claimed in claim 7, which is characterized in that described
Step 2 includes：
Step 21, initialization MPR collection are combined into Φ, and MPR (S) is added in the node that wish degree in N (S) is WILL_ALWAYS；
Step 22, the Connected degree for calculating all nodes in N (S), Connected degree refer to the two-hop neighbors section that N (S) interior joint can connect
The number of point；
Step 23, the selection node I, N in N (S)2(S) there are part of nodes could be communicated with node S by I in, by I plus
Enter MPR (S), while the N that will be reached by I2(S) node in is from N2(S) removal in, repeats step 23, until all full
The node of sufficient step 23 condition is all added in MPR (S)；
If step 24, at this time N2(S) there is node uncovered in, repeat following steps until all N2(S) interior joint is all
It is capped：
Step 241, to node S, calculate the coverage that MPR collector nodes are not added in its N (S), coverage refers to N (S) interior joint
The number of remaining two-hop neighbor node can be covered；
Step 242, to select coverage not be 0, MPR is added in the highest node of wish degree；
Step 243, if there is multiple nodes for meeting step 242 condition, select the highest node of coverage that MPR (S) is added, and
By the N of covering2(S) interior joint removes；
If step 244 still there are multiple nodes for meeting step 243 condition, select the highest node of Connected degree that MPR (S) is added,
And by the N of covering2(S) interior joint removes；
Step 245, after the above step is finished, if still with the presence of multiple node Connected degrees situation identical with coverage,
It chooses the higher node of trap and MPR collection is added；
Wherein, N (S) is a hop neighbor collection of source node S；N2(S) it is the two-hop neighbors collection of source node S；MPR (S) indicates node S
MPR set；" wish degree " finger joint point is ready to provide the degree of routing forwarding for other nodes, and value is 0~7, and value is higher,
Show that node is ready that the wish for providing routing forwarding service is higher；When value is 7, wish degree is expressed as WILL_ALWAYS, table
Bright node can provide routing forwarding service；
By ARIMA-SVR combination forecastings, node is using the load estimation value of the neighbor node subsequent time of acquisition as road
By the foundation of Path selection, the generation of network congestion is avoided；It is 2/3 that load threshold, which is arranged, i.e., when load estimation value is more than 2/3,
It will produce network congestion；
Step 246, source node cross lookup neighbor table and topology table, and in a plurality of available routing, neighbors is handled by reception
HELLO is grouped, and the loading condition of all neighbors subsequent times is known by ARIMA-SVR combination forecastings；
If step 247, the load estimation value of all neighbors are both less than 2/3, jumping figure value is determined according to shortest path principle,
Establish routing table；
Step 248 is more than 2/3 if there is neighbors load estimation value, then according to shortest path principle in remaining neighbors
It determines jumping figure value, establishes routing table；
If step 249, all neighbors load estimation values are both greater than 2/3, subsequent time load estimation value minimum is selected
Neighbors determines hop count value according to the most short principle in path later, establishes routing table as next-hop node.
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 true CN108337166A (en) | 2018-07-27 |
| CN108337166B 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) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109547345A (en) * | 2019-01-22 | 2019-03-29 | 陈柯帆 | A kind of Routing Protocol of software definition onboard networks framework and content driven |
| CN109639588A (en) * | 2019-01-22 | 2019-04-16 | 中国人民解放军空军工程大学 | A kind of web impact factor method for routing of Aviation cluster |
| CN109714260A (en) * | 2019-01-04 | 2019-05-03 | 浙江大学 | Implementation method based on UCDS algorithm building virtual backbone network in OLSR Routing Protocol |
| CN109922488A (en) * | 2019-04-26 | 2019-06-21 | 电子科技大学 | The design method that URLLC grouping abandons in real-time radio control system |
| CN109922513A (en) * | 2019-03-06 | 2019-06-21 | 上海交通大学 | A kind of OLSR method for routing and system based on moving projection and latency prediction |
| CN111263419A (en) * | 2020-01-17 | 2020-06-09 | 西安交通大学 | 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 |
| CN111757414A (en) * | 2020-06-19 | 2020-10-09 | 北京交通大学 | SDMANET network networking method based on multimode radio station |
| CN113891399A (en) * | 2021-10-13 | 2022-01-04 | 北京慧清科技有限公司 | Load balancing oriented multipath weighted scheduling OLSR routing method |
| CN114727354A (en) * | 2022-03-30 | 2022-07-08 | 江苏杰泽罗通信科技有限公司 | Clustering optimal link state routing method based on virtual backbone network |
| CN115225560A (en) * | 2022-07-15 | 2022-10-21 | 国网河南省电力公司信息通信公司 | Route planning method in power communication service |
| WO2023184213A1 (en) * | 2022-03-30 | 2023-10-05 | 江苏杰泽罗通信科技有限公司 | Clustered optimized link state routing method based on virtual backbone network |
Citations (4)
| 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 |
-
2018
- 2018-02-06 CN CN201810118928.8A patent/CN108337166B/en active Active
Patent Citations (4)
| 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 |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109714260A (en) * | 2019-01-04 | 2019-05-03 | 浙江大学 | Implementation method based on UCDS algorithm building virtual backbone network in OLSR Routing Protocol |
| CN109714260B (en) * | 2019-01-04 | 2020-09-04 | 浙江大学 | Implementation method for building virtual backbone network based on UCDS algorithm in OLSR routing protocol |
| CN109639588B (en) * | 2019-01-22 | 2022-08-30 | 中国人民解放军空军工程大学 | Network congestion control routing method for aviation cluster |
| CN109639588A (en) * | 2019-01-22 | 2019-04-16 | 中国人民解放军空军工程大学 | A kind of web impact factor method for routing of Aviation cluster |
| CN109547345A (en) * | 2019-01-22 | 2019-03-29 | 陈柯帆 | A kind of Routing Protocol of software definition onboard networks framework and content driven |
| CN109922513A (en) * | 2019-03-06 | 2019-06-21 | 上海交通大学 | A kind of OLSR method for routing and system based on moving projection and latency prediction |
| CN109922488A (en) * | 2019-04-26 | 2019-06-21 | 电子科技大学 | The design method that URLLC grouping abandons in real-time radio control system |
| CN109922488B (en) * | 2019-04-26 | 2021-04-23 | 电子科技大学 | Design method for URLLC packet discarding in real-time wireless control system |
| CN111263419A (en) * | 2020-01-17 | 2020-06-09 | 西安交通大学 | Unmanned aerial vehicle-based dynamic routing method for stereo heterogeneous network in emergency scene |
| 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 |
| CN111757414A (en) * | 2020-06-19 | 2020-10-09 | 北京交通大学 | SDMANET network networking method based on multimode radio station |
| CN113891399A (en) * | 2021-10-13 | 2022-01-04 | 北京慧清科技有限公司 | Load balancing oriented multipath weighted scheduling OLSR routing method |
| CN113891399B (en) * | 2021-10-13 | 2023-08-01 | 北京慧清科技有限公司 | Load balancing-oriented multipath weighted scheduling (OLSR) routing method |
| CN114727354A (en) * | 2022-03-30 | 2022-07-08 | 江苏杰泽罗通信科技有限公司 | Clustering optimal link state routing method based on virtual backbone network |
| 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 |
| CN115225560A (en) * | 2022-07-15 | 2022-10-21 | 国网河南省电力公司信息通信公司 | Route planning method in power communication service |
| CN115225560B (en) * | 2022-07-15 | 2023-08-22 | 国网河南省电力公司信息通信公司 | Route planning method in power communication service |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108337166B (en) | 2020-11-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108337166A (en) | A kind of highly reliable Routing Protocol of low time delay of Aviation cluster network | |
| Villasenor-Gonzalez et al. | HOLSR: a hierarchical proactive routing mechanism for mobile ad hoc networks | |
| CN101415248B (en) | Method for establishing layer-striding dynamic source route protocol based on load balance | |
| Chang et al. | Cluster based self-organization management protocols for wireless sensor networks | |
| Sinwar et al. | Analysis and comparison of ant colony optimization algorithm with DSDV, AODV, and AOMDV based on shortest path in MANET | |
| EP1620977A1 (en) | Path selection in wireless networks | |
| JP2009518968A (en) | System and method for increasing the capacity of a wireless communication network using multiple radios | |
| EP1629677A1 (en) | Optical routing in ad hoc wireless communication network | |
| CN110267320B (en) | Multi-mesh-ring topology control method based on Bluetooth network and storage medium | |
| CN100459543C (en) | Routing method of hybrid network formed by honeycomb network and self-combining network | |
| Wang et al. | A cross-layer design of channel assignment and routing in Cognitive Radio Networks | |
| CN108449271A (en) | A kind of method for routing of monitoring path node energy and queue length | |
| Setiawan et al. | An optimum multiple metrics gateway selection mechanism in MANET and infrastructured networks integration | |
| CN108770003A (en) | A kind of self-organizing unmanned plane network routing discovering method based on particle group optimizing | |
| Sampaio et al. | A review of scalability and topological stability issues in IEEE 802.11 s wireless mesh networks deployments | |
| CN109639588A (en) | A kind of web impact factor method for routing of Aviation cluster | |
| CN106850436A (en) | Mine hybrid wireless mesh network routing protocols based on virtual potential energy field | |
| CN105636144A (en) | Method for prolonging life period of zigbee network | |
| Miao et al. | Study on research challenges and optimization for internetworking of hybrid MANET and satellite networks | |
| CN114040471B (en) | Distributed topology control method and terminal based on Bluetooth network | |
| Riaz et al. | Energy aware path selection based efficient AODV for MANETs | |
| CN102035730A (en) | Fusion network system architecture supporting WLAN to cross MANET for communication and on-demand routing method | |
| CN114867081A (en) | Mobile ad hoc network multi-source transmission routing method based on relay unmanned aerial vehicle node | |
| CN108282791A (en) | A method of the Ad Hoc transmission datas based on directive antenna | |
| Paruchuri et al. | Routing through backbone structures in sensor networks |
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 |