CN110138437A - Satellite communication network critical link sequence detecting method based on delay performance - Google Patents
Satellite communication network critical link sequence detecting method based on delay performance Download PDFInfo
- Publication number
- CN110138437A CN110138437A CN201910264314.5A CN201910264314A CN110138437A CN 110138437 A CN110138437 A CN 110138437A CN 201910264314 A CN201910264314 A CN 201910264314A CN 110138437 A CN110138437 A CN 110138437A
- Authority
- CN
- China
- Prior art keywords
- arc
- time
- satellite
- path
- expander graphs
- 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
- 238000004891 communication Methods 0.000 title claims abstract description 57
- 238000000034 method Methods 0.000 title claims abstract description 35
- 230000005540 biological transmission Effects 0.000 claims abstract description 61
- 238000012546 transfer Methods 0.000 claims abstract description 43
- 238000001514 detection method Methods 0.000 claims description 17
- 239000000203 mixture Substances 0.000 claims description 6
- XCWPUUGSGHNIDZ-UHFFFAOYSA-N Oxypertine Chemical compound C1=2C=C(OC)C(OC)=CC=2NC(C)=C1CCN(CC1)CCN1C1=CC=CC=C1 XCWPUUGSGHNIDZ-UHFFFAOYSA-N 0.000 claims description 3
- 239000011800 void material Substances 0.000 claims 1
- 230000000694 effects Effects 0.000 description 8
- 230000008859 change Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 238000012423 maintenance Methods 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000009472 formulation Methods 0.000 description 2
- 238000007689 inspection Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
- H04B7/18519—Operations control, administration or maintenance
-
- 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
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Radio Relay Systems (AREA)
Abstract
The invention belongs to Information Network fields, disclose a kind of satellite communication network critical link sequence detecting method based on delay performance；It include: to obtain target satellite network topology and business information；It constructs time expander graphs and models target satellite network；Minimum transfer arc cut set of the calculating virtual source vertex to virtual purpose vertex in time expander graphs；Calculate the conflict set of paths of every transmission arc in minimum transfer arc cut set；According to conflict set of paths, computational representation transmits the index time delay contribution margin of arc criticality；According to the time delay contribution margin of transmission arc, critical link sequence is calculated.All source summits can be represented to the path between purpose vertex based on minimum transfer arc cut set and comprising transmitting the minimum feature of arc number, the present invention is by cutting centralized detecting critical link sequence in minimum transfer arc, search space can be reduced, effectively reduces and calculates the time.
Description
Technical field
The invention belongs to Information Network field more particularly to a kind of satellite communication network based on delay performance are crucial
Link sequences detection method.
Background technique
Currently, the prior art commonly used in the trade is such that in recent years, satellite communication network is wide due to communication coverage
The advantages that in military and civilian field play increasingly important role.With the continuous growth of satellite communication network scale,
Network structure also becomes increasingly complicated, and the critical link in network, which becomes, effectively to be safeguarded network or attack is critical to
Element.From network operation safeguard angle, by critical link safeguard can with smaller expense Logistics networks by
The various sudden performances destroyed after (such as natural calamity, equipment fault, malicious attack)；From the angle of network attack,
By attacking to the critical link in network and network service capabilities can be kept badly damaged with smaller expense.Therefore, how
The fragility of network is assessed according to the topological structure feature of satellite communication network, to determine the critical link of network to net
Effective maintenance/attack of network has a very important significance.Different from traditional ground network, the topology of satellite communication network by
It is moved in satellite node along rail high speed and there is high dynamic characteristic.Therefore, the critical link of satellite communication network also has
Time-varying characteristics；For satellite communication network, need to search for the critical link for obtaining it in different time period, i.e. critical link sequence
Column.
Traditional network key chain circuit detecting method is all based on greatly static map theory, and core concept is by studying static network
The topological structure property of network obtains the critical link that can effectively divide network.The disadvantage is that required critical link is not become at any time
Change, is not suitable for the satellite communication network of dynamic change.Therefore it needs to study the dynamic characteristic of satellite communication network
Detect critical link sequence.Network is divided the research in relation to dynamic network critical link, the prior art one by existing a part
It is cut into discrete topological snapshot, and using the globally interconnected general character as network vulnerability evaluation index, it is fast by analyzing each topology
According to the contribution of the interior globally interconnected general character of link pair current network, the critical link for giving influence network overall situation connectivity is adaptive
Searching algorithm.This method only individually analyzes the contribution of the globally interconnected general character of link pair current network in each topological snapshot, nothing
Method portrays across the snapshot business for largely reaching purpose present in satellite network by storage-carrying-pass-through mode, therefore the party
The defect of method is to be only capable of providing in each independent snapshot influencing maximum link to network performance, in these link pair networks across
The influence of snapshot business is extremely limited.Solve the problems, such as that this can improve the accuracy of satellite network critical link detection well.
The prior art two considers the business in dynamic network across snapshot, is counted using that can portray the Line Chart tool across snapshot business
It lets it pass and divides the minimum critical link set of network source-destination node.Because this method only utilizes biography on the basis of Line Chart
The max-flow of system-minimal cut algorithm divides network source-destination node, and network can only be provided in this way by, which having, cuts
Collect and can not quantify the defect of the criticality of the link in network.In actual satellite communication network, since cost limits,
The number of links that can protect/attack is limited, thus quantify link in network criticality, in network have cost
Protection/attack option formulation of limitation has great importance.
In addition to this, there are a large amount of delay sensitive business in satellite communication network, such as meet an urgent need instruction, warning information etc.,
This kind of business need arrives at destination node in limited time delay range.Detection is to the maximum critical link sequence of this kind of service impact
Column need to consider the information propagation delay time of network, and above-mentioned existing critical link detection technique is all based on the connection of the network overall situation
Property, it not can guarantee influence of the critical link found for network delay, and then not can guarantee to delay sensitive business in network
Maintenance/attack accuracy.Therefore, in order to accurately detect the critical link sequence in satellite network, need to propose a kind of needle
To the new method of network delay performance.
In conclusion problem of the existing technology is: existing critical link detection method is mostly based on the network overall situation
Connectivity not can guarantee influence of the critical link found for network delay.
Solve the difficulty of above-mentioned technical problem:
Above-mentioned technical problem is solved, needs to establish the network model that can be portrayed across snapshot business in satellite network, and
The index of link in network criticality can be quantified by formulating from the angle of network delay, thus algorithm for design realize to
The target of fixed number purpose critical link detection.Therefore across snapshot business can be portrayed and can quantify such industry by how establishing one
Storage-carrying-forwarding communication delay model of business and how to formulate related to network delay performance and can reflect link
The index of criticality is at maximum difficult point to solve above-mentioned technical problem.
Solve the meaning of above-mentioned technical problem:
Above-mentioned technical problem is solved, influence network transfer delay performance in satellite communication network can be more accurately detected
Critical link sequence, and then it is more accurate instruct the formulation of network operation/attack option, reduce maintenance/attack of network
Cost.
Summary of the invention
In view of the problems of the existing technology, the present invention provides a kind of, and the satellite communication network based on delay performance is crucial
Link sequences detection method.
The invention is realized in this way a kind of satellite communication network critical link Sequence Detection based on delay performance
Method, which is characterized in that the satellite communication network critical link sequence detecting method based on delay performance first with when
Between extension graph model feature the business in satellite communication network across snapshot.When then being calculated with Ford-Fulkerson algorithm
Between in expander graphs virtual source summit set is named as minimum transfer arc cut set to the minimal cut set between virtual purpose vertex.Most
Afterwards based on minimum transfer arc cut set can represent all source summits to the path between purpose vertex and include transmission arc number it is minimum
The characteristics of, centralized detecting critical link sequence is cut in minimum transfer arc.
Further, the satellite communication network critical link sequence detecting method based on delay performance includes:
Step 1, initialization step obtain target satellite network topology and business information；
Step 2 constructs time expander graphs GT(V, A) models target satellite network；
Step 3 calculates virtual source vertex v in time expander graphss +To virtual purpose vertexMinimum transfer arc cut set
R；
Step 4 calculates the conflict set of paths of every transmission arc in minimum transfer arc cut set R；
Step 5, according to conflict set of paths path (i) (ri∈ R), computational representation transmits arc riThe index of criticality:
Time delay contribution margin tc(i), wherein tc(i) smaller, transmit arc riIt is more crucial；
Step 6 calculates critical link sequence S according to the time delay contribution margin of transmission arc.
Further, the step 1 obtains target satellite network topology and business information specifically includes:
(1) satellite network satellite set V is initialized1={ v1,v2,...,vn,...,vM, business source node vs, business mesh
Node vd, number of links K can be attacked；
(2) by the planning horizon of Information Network [0, ttotal] T isometric time slots are divided into, each time interval
Length is τ=ttotal/T；
(3) according to the motion profile of ephemeris Satellite, the visible situation of each time slot difference satellite node is calculated.
Further, the step 2 constructs time expander graphs GT(V, A) modeling target satellite network specifically includes:
(1) the T layer digraph of a blank is initialized, wherein kth layer represents k-th of time slot of satellite communication network；
(2) satellite set V is traversed1In all satellite, each observation satellite vn∈V1, vertex is added in time expander graphsWherein vertexPositioned at the kth layer of time expander graphs, the satellite v in k-th of time slot is indicatedn, by when
Between satellite vertex set in expander graphs be denoted as
(3) addition transmission arc: for any pair of satellite node viAnd vjIf mutually may be used in k-th of time slot, two satellites
See, then the addition transmission arc in time expander graphsBy the transmission arc set of time expander graphs
It is denoted as
(4) addition storage arc: for satellite vn∈V1, the addition storage arc in time expander graphs The storage arc set of time expander graphs is denoted as
(5) addition plus virtual source summitVirtual purpose vertexAs the source and destination vertex in time expander graphs,
Add virtual arcWithMake virtual source, purpose vertex and source, destination node phase in network
Even, the virtual arc set of time expander graphs is denoted as
(6) enabling time expander graphs is GT(V, A), wherein A=At∪As∪Avir,UsingAs
Source summit,Vertex as a purpose.
Further, the step 3 calculates virtual source vertex in time expander graphsTo virtual purpose vertexMinimum
Transmission arc cut set R is specifically included:
Pair (1) all transmission arc capacity in time expander graphs are set as 1, i.e.,Enable c (u, v)=1；
(2) by time expander graphs storage arc and virtual arc capacity be set as infinite, i.e., pair
It enables, c (u, v)=∞；
(3) the virtual source summit of time expander graphs is calculated with Ford-Fulkerson algorithmTo virtual purpose vertexBetween
Minimal cut set, which is named as minimum transfer arc cut set R.
Further, the conflict set of paths that the step 4 calculates every transmission arc in minimum transfer arc cut set R is specifically wrapped
It includes:
(1) initialize every transmission arc conflict set of paths in minimum transfer arc cut set R, i.e., forIt enablesWherein riIndicate that i-th transmission arc in minimum transfer arc cut set R, path (i) indicate riConflict set of paths；
(2) time expander graphs are calculated and exclude the remaining figure G after minimum transfer arc cut setsEven Gs=GT\R；
(3) rightIt executes following steps and updates its conflict set of paths path (i):
1) in figure G1=Gs∪{riIn calculate vertexIt arrivesBetween by transmission arc riShortest path pii, and should
The number of plies t that path is passed through in time expander graphsiiIt is denoted as the time delay in the path, enables path (i)=path (i) ∪ { pii}；
2) rightIn G2=Gs∪{ri,rjIn calculate vsTo vdCross R (i) shortest path pij；If pij
Meet: 1. time delay value tij< tii；②tij=min { t1j,…tnj, then enable pijFor the conflict path of R (i), enable path (i)=
path(i)∪{pij, wherein { t1j,…,tnjIndicate to use rjPath time delay set；
3) sort in all paths for the path (i) being calculated by time delay composition conflict set of paths from small to large
Further, the step 5 is according to conflict set of paths path (i) (ri∈ R), computational representation transmits arc riCrucial journey
The index time delay contribution margin t of degreec(i), wherein tc(i) smaller, transmit arc riIt is more crucial to specifically include；
(1) Done (i) identification transmission arc r is usediTime delay contribution margin whether determine, initialize the index, i.e.,
Done (i)=0；
(2) it enablesIfForDone (i)=
1, go to step (3)；IfGo to (4)；
(3) forIfCompareAnd tc(i):
If 1)ThenPath in path (j) is resequenced；
If 2)It willIt is revised as
(4) for conflict set of paths in shortest path be same transmission arc ri,rj, i.e., forCompare the time delay value of the second short pathWith
If 1)Then
If 2)Then
Further, the step 6 calculates critical link sequence S and specifically includes according to the time delay contribution margin of transmission arc:
(1) transmission arcs all in R are sorted from small to large according to time delay contribution margin, it may be assumed thatWherein tc(ni) indicate transmission arcTime delay tribute
Offer value；(2) K item transmits arc before taking in R, it may be assumed that { r1,r2,…rK|tc(1)≤tc(2)≤…≤tc(K)}；
(3) arc r will be transmitted1,r2,…rKIt sorts from small to large according to slot values where in time expander graphs and obtains key
Transmit sequence of arcs, it may be assumed that
(4) critical link sequence is converted by critical transmissions sequence of arcs: willIt is converted into (vli,
vlj,tl), indicate time slot tlSatellite vliTo satellite vljCommunication link, wherein tlSlot values where indicating link；That is S=
{(v1i,v1j,t1),(v2i,v2j,t2),…,(vKi,vKj,tK)|t1≤t2≤…≤tK}。
Another object of the present invention is to provide the satellite communication network chaining key described in a kind of application based on delay performance
Road sequence detecting method.
In conclusion advantages of the present invention and good effect are as follows: the present invention characterizes satellite communication network using time expander graphs
Network eliminates the shortcomings that cannot modeling across snapshot business with time-varying chart sign dynamic network.The present invention extends chart using the time
Satellite communication network is levied, chaining key of the source node to the K link composition between destination node will be solved in satellite communication network
Road sequence is converted into time expander graphs GTThe corresponding vertex of source node is solved on (V, A)To the corresponding vertex of destination nodeBetween critical transmissions arc set.
Based on minimum transfer arc cut set can represent all source summits to the path between purpose vertex and include transmission arc number
The minimum feature of mesh, the present invention can reduce search space, have by cutting centralized detecting critical link sequence in minimum transfer arc
The reduction of effect calculates the time.Algorithm proposed by the invention can not only provide critical link sequence in given critical link number
Column, and it can be sorted according to criticality, help can be provided to formulate protection/attacking network link scheme.
Detailed description of the invention
Fig. 1 is the satellite communication network critical link sequence detecting method provided in an embodiment of the present invention based on delay performance
Flow chart.
Fig. 2 is the satellite communication network critical link sequence detecting method provided in an embodiment of the present invention based on delay performance
Implementation flow chart.
Fig. 3 is to calculate to transmit the conflict set of paths of arc and the sub-process figure of time delay contribution margin step in R in the present invention.
Fig. 4 is the sub-process figure that conflict is solved in the present invention, wherein figure (a) is (5b), (5c) step in step 5
Sub-process figure, figure (b) are the sub-process figures of (5d) step in step 5.
Fig. 5 is the corresponding time expander graphs schematic diagram for being not added with dummy node of the network scenarios of embodiment 1 in the present invention.
Fig. 6 is to add the time expander graphs schematic diagram after virtual vertex in the present invention in embodiment 1.
Fig. 7 is vertex in embodiment 1 in the present inventionIt arrivesBetween by transmission arc riShortest path piiSchematic diagram.
Fig. 8 is the conflict path schematic diagram of each transmission arc recorded in embodiment 1 in the present invention.
Fig. 9 is the change curve schematic diagram of the packet receiving rate of the network destination node satellite of embodiment 2 in the present invention.
Figure 10 is the change curve schematic diagram of network source-destination node satellite communication delay of embodiment 2 in the present invention.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to embodiments, to the present invention
It is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not used to
Limit the present invention.
It is mostly based on network overall situation connectivity for existing critical link detection method, not can guarantee the chaining key found
The problem of influence of the road for network delay.The present invention is cut from network information transfer time delay angle based on minimum transfer arc
Collection can represent all source summits to the path between purpose vertex and include the minimum feature of transmission arc number, by most brief biography
Defeated arc cuts centralized detecting critical link sequence, can reduce search space, effectively reduces and calculates the time.
Application principle of the invention is explained in detail with reference to the accompanying drawing.
As shown in Figure 1, the satellite communication network critical link sequence inspection provided in an embodiment of the present invention based on delay performance
Survey method the following steps are included:
S101: target satellite network topology and business information are obtained；
S102: building time expander graphs model target satellite network；
S103: minimum transfer arc cut set of the calculating virtual source vertex to virtual purpose vertex in time expander graphs；
S104: the conflict set of paths of every transmission arc in minimum transfer arc cut set is calculated；
S105: according to conflict set of paths, computational representation transmits the index time delay contribution margin of arc criticality；
S106: according to the time delay contribution margin of transmission arc, critical link sequence is calculated.
Application principle of the invention is further described combined with specific embodiments below.
Embodiment 1
The embodiment of the present invention illustrates implementation process of the invention from a simple satellite communication network scene.Assuming that net
There are 6 satellite node { v in network1,...,v6, network entire planning horizon is [0,6 τ], and business source node is satellite v1, business
Destination node is satellite v6, 6 isometric time slots are partitioned the network into, the length of each time interval is τ, and critical link number is
2。
As shown in Fig. 2, the satellite communication network critical link sequence inspection provided in an embodiment of the present invention based on delay performance
Survey method comprises the following steps that
Step 1, initialization step obtain target satellite network topology and business information:
(1a) initializes satellite network satellite set V1={ v1,...,v6, business source node v1, business purpose node v6,
Number of links 2 can be attacked；
The planning horizon [0,6 τ] of Information Network is divided into 6 isometric time slots by (1b), each time interval
Length is τ；
(1c) calculates the visible situation of each time slot difference satellite node, obtains according to the motion profile of ephemeris Satellite
To the visible satellite node pair of each time slot are as follows: the 1st time slot: (v1,v4),(v1,v5), the 2nd time slot: (v1,v2), the 3rd
Time slot: (v1,v2),(v2,v3), the 4th time slot: (v2,v5),(v4,v5), (v5,v6), the 5th time slot: (v1,v5),(v4,v5),
6th time slot: (v2,v6),(v3,v6)。
Step 2 constructs time expander graphs GT(V, A) models target satellite network, such as Fig. 5 and Fig. 6.
(2a) initializes 6 layers of digraph of a blank, and wherein kth layer represents k-th of time slot of satellite communication network；
(2b) traverses satellite set V1In all satellite, each observation satellite vn∈V1, vertex is added in time expander graphsWherein vertexPositioned at the kth layer of time expander graphs, the satellite v in k-th of time slot is indicatedn, by when
Between satellite vertex set in expander graphs be denoted as
(2c) transmits arc to addition according to the visible satellite node of each time slot:
The above transmission arc composition transmission arc set is denoted as At；
(2d) addition storage arc: for satellite vn∈V1, addition observation storage arc Storage arc set is denoted asTransmission arc and storage arc are added
Time expander graphs it is as shown in Figure 5；
(2e) addition plus virtual source summitVirtual purpose vertexAs the source and destination top in time expander graphs
Point adds virtual arcWithMake virtual source, source, destination node in purpose vertex and network
It is connected, virtual arc set is denoted as
It is G that (2f), which enables time expander graphs,6(V, A), wherein A=At∪As∪Avir,UsingMake
For source summit,Vertex (such as Fig. 6) as a purpose.
Step 3 calculates virtual source vertex in time expander graphsTo virtual purpose vertexMinimum transfer arc cut
Collect R:
Pair all transmission arc capacity in time expander graphs are set as 1 by (3a), i.e.,Enable c (u, v)=1；
(3b) by time expander graphs storage arc and virtual arc capacity be set as infinite, i.e., pair
It enables, c (u, v)=∞；
(3c) calculates the virtual source summit of time expander graphs with Ford-Fulkerson algorithmTo virtual purpose vertex
Between minimal cut set, which is named as minimum transfer arc cut set R；Obtaining R isRespectively will
Three transmission arcs are denoted as r1、r2、r3, shown in time expander graphs as shown in phantom in Figure 6.
Step 4 calculates the conflict set of paths (such as Fig. 3) of every transmission arc in minimum transfer arc cut set R:
(4a) initializes every transmission arc conflict set of paths in minimum transfer arc cut set R, i.e., forIt enables
(4b) calculates time expander graphs and excludes the remaining figure G after minimum transfer arc cut setsEven Gs=G6\R；
(4c) is rightIt executes following steps and updates its conflict set of paths path (i):
(4c1) is in figure G1=Gs∪{riIn calculate vertexIt arrivesBetween by transmission arc riShortest path pii, three
Item transmits arc r1、r2、r3Corresponding path is respectively p11, p22And p332. 3., path shown in Fig. 7 is corresponded respectively to 1., wherein often
The corresponding time delay size of paths is respectively t11=4, t22=3, t33=3；Enable path (1)={ p11, path (2)={ p22,
Path (3)={ p33}；
The path that (4c2) is recorded required for being obtained according to (4c2) in the step of summary of the invention four is p31、p32And p23,
Path shown in Fig. 8 (1) and path (2) are respectively corresponded, path (2)=path (2) ∪ { p is enabled23, path (3)=path (3) ∪
{p31, p32, wherein its path delay of time size is respectively t31=2, t32=1, t23=1.
(4c3) sorts in all paths of the path (i) of calculating by time delay from small to large, obtains r1、r2、r3Conflict road
Diameter set is respectively as follows:Wherein each path
Corresponding path delay of time size is respectively as follows:
Step 5, according to conflict set of paths path (i) (ri∈ R), computational representation transmits arc riWhen the index of criticality
Prolong contribution margin tc(i) (such as Fig. 4):
(5a) initialization indicates transmission arc riTime delay contribution margin tc(i) the index Done (i) whether determined, i.e.,Done (i)=0；
(5b) enables R1={ r1, thenThen for transmitting arc r1,Done (1)=1 goes to step
(5c)；
(5c) is for r1∈R1, existThen compareAnd tc(1):
(5c2)By pathIt is retained in transmission arc r3Path set in, willIt is changed toRearrangement
It obtainsWherein
Step (5b) is gone to, thenGo to step (5d)；
(5d) is rightCompareWith
(5d2) ifThen
Step 6 calculates critical link sequence S according to the time delay contribution margin of transmission arc:
(6a) sorts transmission arcs all in R according to time delay contribution margin from small to large, it may be assumed that R={ r3,r2,r1|tc(3) < tc
(2) < tc(1) }, wherein tc(3),tc(2),tcIt (1) is respectively transmission arc r3,r2,r1Time delay contribution margin；
2 transmission arcs before (6b) takes in R, it may be assumed that { r3,r2|tc(3) < tc(2)}；
(6c) will transmit arc r2,r3It sorts from small to large according to slot values where in time expander graphs and obtains critical transmissions
Sequence of arcs, it may be assumed that
Critical transmissions sequence of arcs is converted critical link sequence: S={ (v by (6d)1,v2,3),(v5,v6,4)}。
It can be obtained by above step, r in the embodiment2,r3For critical transmissions arc, i.e. 3 Satellite v of time slot1To satellite v2And when
4 Satellite v of gap5To satellite v6Communication link be the embodiment Satellite network critical link.
A kind of critical link Sequence Detection based on minimum transfer arc cut set proposed by the invention is devised in the present invention
Method.This method features the business in satellite communication network across snapshot using time extension graph model, is based on minimum transfer arc
Cut set can represent all source summits to the path between purpose vertex and include to transmit the minimum feature of arc number, by minimum
Transmission arc cuts centralized detecting critical link sequence, improves critical link Sequence Detection efficiency.
It is explained in detail below with reference to effect of the emulation to network key link sequences detection of the invention.
1. simulating scenes
The present embodiment is made of two low rail circular orbits, two middle rail elliptic orbits and two high rail elliptical orbit satellite
Satellite communication network scene, satellite orbit parameter are as shown in table 1.In order to obtain the connected relation between satellite, established in STK
Using access tool to SEE time window is calculated between satellite two-by-two after above-mentioned scene, a time slot pair was used as using 20 seconds
Network has carried out equal slotted modes and has divided, and the time expander graphs of 120 time slots of above-mentioned simulating scenes is taken further to be emulated, will
The mentioned algorithm of the present invention is realized to have obtained the critical link sequence of different K values using MATLAB.Above-mentioned network is established using OPNET
Critical link is failed to obtain network performance with the change curve of K value in OPNET by scene.
1 satellite orbit parameter of table
2. simulation result and analysis
Fig. 9 is the change curve of the packet receiving rate of the network destination node satellite of the present embodiment, it can be seen that inter-satellite link
Random erasure cannot reduce the packet receiving rate of purpose satellite substantially, random erasure and institute of the present invention within the scope of minimum transfer arc cut set
It is suitable to propose algorithm effect on reducing network packet receiving rate, it can be seen that drop effect both has been carried out to network in connectivity.
Figure 10 is the change curve of network source-destination node satellite communication delay of the present embodiment, it can be seen that between star
Link random erasure cannot extend communication delay substantially, when random erasure can extend communication within the scope of minimum transfer arc cut set
Prolong, but has little effect, and the mentioned algorithm of the present invention can be very good to extend the intersatellite communication delay of network source-purpose.By
If carrying out drop effect to network just for network connectivty index known to upper, other performances of network can not be taken into account, therefore can see
Out for the importance of network delay drop effect detection critical link sequence.
The accuracy of detection method of the invention is essentially consisted in can be portrayed in satellite communication network using time expander graphs
Business across snapshot.The high efficiency of detection method of the invention essentially consist in based on minimum transfer arc cut set can represent institute it is active
Vertex is to the path between purpose vertex and includes to transmit the minimum feature of arc number, cuts centralized detecting chaining key in minimum transfer arc
Road sequence can reduce search space, improve detection efficiency.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all in essence of the invention
Made any modifications, equivalent replacements, and improvements etc., should all be included in the protection scope of the present invention within mind and principle.
Claims (9)
1. a kind of satellite communication network critical link sequence detecting method based on delay performance, which is characterized in that described to be based on
The satellite communication network critical link sequence detecting method of delay performance features satellite first with time extension graph model and leads to
Across the business of snapshot in communication network.Then with virtual source summit in Ford-Fulkerson algorithm calculating time expander graphs to void
Minimal cut set between quasi- purpose vertex, is named as minimum transfer arc cut set for set.It finally can based on minimum transfer arc cut set
All source summits are represented to the path between purpose vertex and include to transmit the minimum feature of arc number, in minimum transfer arc cut set
Detect critical link sequence.
2. the satellite communication network critical link sequence detecting method based on delay performance as described in claim 1, feature
It is, the satellite communication network critical link sequence detecting method based on delay performance includes:
Step 1, initialization step obtain target satellite network topology and business information；
Step 2 constructs time expander graphs GT(V, A) models target satellite network；
Step 3 calculates virtual source vertex in time expander graphsTo virtual purpose vertexMinimum transfer arc cut set R；
Step 4 calculates the conflict set of paths of every transmission arc in minimum transfer arc cut set R；
Step 5, according to conflict set of paths path (i) (ri∈ R), computational representation transmits arc riThe index time delay tribute of criticality
Offer value tc(i), wherein tc(i) smaller, transmit arc riIt is more crucial；
Step 6 calculates critical link sequence S according to the time delay contribution margin of transmission arc.
3. the satellite communication network critical link sequence detecting method based on delay performance as claimed in claim 2, feature
It is, the step 1 obtains target satellite network topology and business information specifically includes:
(1) satellite network satellite set V is initialized1={ v1,v2,...,vn,...,vM, business source node vs, business purpose section
Point vd, number of links K can be attacked；
(2) by the planning horizon of Information Network [0, ttotal] it is divided into T isometric time slots, the length of each time interval
For τ=ttotal/T；
(3) according to the motion profile of ephemeris Satellite, the visible situation of each time slot difference satellite node is calculated.
4. the satellite communication network critical link sequence detecting method based on delay performance as claimed in claim 2, feature
It is, the step 2 constructs time expander graphs GT(V, A) modeling target satellite network specifically includes:
(1) the T layer digraph of a blank is initialized, wherein kth layer represents k-th of time slot of satellite communication network；
(2) satellite set V is traversed1In all satellite, each observation satellite vn∈V1, vertex is added in time expander graphsWherein vertexPositioned at the kth layer of time expander graphs, the satellite v in k-th of time slot is indicatedn, by when
Between satellite vertex set in expander graphs be denoted as
(3) addition transmission arc: for any pair of satellite node viAnd vj, if k-th of time slot, two satellites mutually as it can be seen that if
The addition transmission arc in time expander graphsThe transmission arc set of time expander graphs is denoted asSatellite viAnd vjIt is visible in time slot k, 1≤k≤T }；
(4) addition storage arc: for satellite vn∈V1, the addition storage arc in time expander graphs The storage arc set of time expander graphs is denoted as
(5) virtual source summit is addedVirtual purpose vertexAs the source and destination vertex in time expander graphs, addition is empty
Quasi- arcWithVirtual source, purpose vertex is set to be connected with source, destination node in network, it will
The virtual arc set of time expander graphs is denoted as
(6) enabling time expander graphs is GT(V, A), wherein A=At∪As∪Avir,UsingIt is pushed up as source
Point,Vertex as a purpose.
5. the satellite communication network critical link sequence detecting method based on delay performance as claimed in claim 2, feature
It is, the step 3 calculates virtual source vertex in time expander graphsTo virtual purpose vertexMinimum transfer arc cut set
R is specifically included:
Pair (1) all transmission arc capacity in time expander graphs are set as 1, i.e.,Enable c (u, v)=1；
(2) by time expander graphs storage arc and virtual arc capacity be set as infinite, i.e., pairEnable c (u,
V)=∞；
(3) the virtual source summit of time expander graphs is calculated with Ford-Fulkerson algorithmTo virtual purpose vertexBetween most
The set is named as minimum transfer arc cut set R by small cut set.
6. the satellite communication network critical link sequence detecting method based on delay performance as claimed in claim 2, feature
It is, the conflict set of paths that the step 4 calculates every transmission arc in minimum transfer arc cut set R specifically includes:
(1) initialize every transmission arc conflict set of paths in minimum transfer arc cut set R, i.e., forIt enablesWherein riIndicate that i-th transmission arc in minimum transfer arc cut set R, path (i) indicate riConflict set of paths；
(2) time expander graphs are calculated and exclude the remaining figure G after minimum transfer arc cut setsEven Gs=GT\R；
(3) rightIt executes following steps and updates its conflict set of paths path (i):
1) in figure G1=Gs∪{riIn calculate vertexIt arrivesBetween by transmission arc riShortest path pii, and by the path
The number of plies t passed through in time expander graphsiiIt is denoted as the time delay in the path, enables path (i)=path (i) ∪ { pii}；
2) rightIn G2=Gs∪{ri,rjIn calculate vsTo vdCross R (i) shortest path pij；If pijMeet:
1. time delay value tij< tii；②tij=min { t1j,…tnj, then enable pijFor the conflict path of R (i), path (i)=path (i) is enabled
∪{pij, wherein { t1j,…,tnjIndicate to use rjPath time delay set；
3) sort in all paths for the path (i) being calculated by time delay composition conflict set of paths from small to large
7. the satellite communication network critical link sequence detecting method based on delay performance as claimed in claim 2, feature
It is, the step 5 is according to conflict set of paths path (i) (ri∈ R), computational representation transmits arc riThe index of criticality:
Time delay contribution margin tc(i), wherein tc(i) smaller, transmit arc riIt is more crucial to specifically include；
(1) Done (i) identification transmission arc r is usediTime delay contribution margin whether determine, initialize the index, i.e.,
(2) it enablesIfForTurn
To step (3)；IfGo to step (4)；
(3) forIfCompareAnd tc(i):
If 1)ThenPath in path (j) is resequenced；
If 2)It willIt is revised as
(4) for conflict set of paths in shortest path be same transmission arc ri,rj, i.e., forCompare the time delay value of the second short pathWith
If 1)Then
If 2)Then
8. the satellite communication network critical link sequence detecting method based on delay performance as claimed in claim 2, feature
It is, the step 6 calculates critical link sequence S and specifically include according to the time delay contribution margin of transmission arc:
(1) transmission arcs all in R are sorted from small to large according to time delay contribution margin, it may be assumed thatWherein tc(ni) indicate transmission arcTime delay tribute
Offer value；
(2) K item transmits arc before taking in R, it may be assumed that { r1,r2,…rK|tc(1)≤tc(2)≤…≤tc(K)}；
(3) arc r will be transmitted1,r2,…rKIt sorts from small to large according to slot values where in time expander graphs and obtains critical transmissions
Sequence of arcs, it may be assumed that
(4) critical link sequence is converted by critical transmissions sequence of arcs: willIt is converted into (vli,vlj,
tl), indicate time slot tlSatellite vliTo satellite vljCommunication link, wherein tlSlot values where indicating link；That is S={ (v1i,
v1j,t1),(v2i,v2j,t2),…,(vKi,vKj,tK)|t1≤t2≤…≤tK}。
9. a kind of satellite communication network critical link sequence using described in claim 1~8 any one based on delay performance
Detection method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910264314.5A CN110138437B (en) | 2019-04-03 | 2019-04-03 | Satellite communication network key link sequence detection method based on time delay performance |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910264314.5A CN110138437B (en) | 2019-04-03 | 2019-04-03 | Satellite communication network key link sequence detection method based on time delay performance |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110138437A true CN110138437A (en) | 2019-08-16 |
| CN110138437B CN110138437B (en) | 2021-04-20 |
Family
ID=67569196
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910264314.5A Expired - Fee Related CN110138437B (en) | 2019-04-03 | 2019-04-03 | Satellite communication network key link sequence detection method based on time delay performance |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110138437B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111641557A (en) * | 2020-06-02 | 2020-09-08 | 西安电子科技大学 | Minimum cost backup path method for delay tolerant network |
| CN112733357A (en) * | 2021-01-04 | 2021-04-30 | 西安建筑科技大学 | Heterogeneous space network data transmission task collaborative planning method |
| CN113630268A (en) * | 2021-07-29 | 2021-11-09 | 西安电子科技大学 | Method for acquiring maximum error separation path of fixed-length random interrupt scene in time-varying network |
| CN113992259A (en) * | 2021-10-22 | 2022-01-28 | 中国人民解放军63921部队 | Method for constructing time slot resource expansion diagram |
| CN115865740A (en) * | 2023-03-02 | 2023-03-28 | 中国人民解放军国防科技大学 | Network structure-based key link identification method and device |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101299713A (en) * | 2008-03-21 | 2008-11-05 | 哈尔滨工业大学深圳研究生院 | Method for setting multilayer satellite network system route |
| CN101483644A (en) * | 2009-03-25 | 2009-07-15 | 南京邮电大学 | Satellite network simulation platform constructing method based on multi-proxy |
| CN102395131A (en) * | 2011-10-10 | 2012-03-28 | 西安交通大学 | Non-fullness complete-non-correlation double-tree traversal protection method in mesh network |
| CN104683016A (en) * | 2015-03-15 | 2015-06-03 | 西安电子科技大学 | Method for distributing and routing optimal services of multi-layer satellite network based on minimum time delay |
| US20160211908A1 (en) * | 2015-01-15 | 2016-07-21 | Hughes Network Systems, Llc | High altitude platform with multibeam coverage for aero-based terminals |
| CN106100718A (en) * | 2016-05-30 | 2016-11-09 | 西安电子科技大学 | Information Network resource characterization methods based on time-varying figure |
| CN106209210A (en) * | 2016-07-29 | 2016-12-07 | 西安电子科技大学 | The Information Network method for managing resource of oriented mission |
| CN107070794A (en) * | 2016-12-08 | 2017-08-18 | 航天东方红卫星有限公司 | A kind of low rail information network optimal network benefit delay constraint method for routing |
| CN108718251A (en) * | 2018-05-10 | 2018-10-30 | 西安电子科技大学 | Information Network connectivity analysis methods based on resource time-varying figure |
-
2019
- 2019-04-03 CN CN201910264314.5A patent/CN110138437B/en not_active Expired - Fee Related
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101299713A (en) * | 2008-03-21 | 2008-11-05 | 哈尔滨工业大学深圳研究生院 | Method for setting multilayer satellite network system route |
| CN101483644A (en) * | 2009-03-25 | 2009-07-15 | 南京邮电大学 | Satellite network simulation platform constructing method based on multi-proxy |
| CN102395131A (en) * | 2011-10-10 | 2012-03-28 | 西安交通大学 | Non-fullness complete-non-correlation double-tree traversal protection method in mesh network |
| US20160211908A1 (en) * | 2015-01-15 | 2016-07-21 | Hughes Network Systems, Llc | High altitude platform with multibeam coverage for aero-based terminals |
| CN104683016A (en) * | 2015-03-15 | 2015-06-03 | 西安电子科技大学 | Method for distributing and routing optimal services of multi-layer satellite network based on minimum time delay |
| CN106100718A (en) * | 2016-05-30 | 2016-11-09 | 西安电子科技大学 | Information Network resource characterization methods based on time-varying figure |
| CN106209210A (en) * | 2016-07-29 | 2016-12-07 | 西安电子科技大学 | The Information Network method for managing resource of oriented mission |
| CN107070794A (en) * | 2016-12-08 | 2017-08-18 | 航天东方红卫星有限公司 | A kind of low rail information network optimal network benefit delay constraint method for routing |
| CN108718251A (en) * | 2018-05-10 | 2018-10-30 | 西安电子科技大学 | Information Network connectivity analysis methods based on resource time-varying figure |
Non-Patent Citations (4)
| Title |
|---|
| 刘润滋: "空间信息网络容量分析与资源管理方法研究", 《中国博士学位论文全文数据库》 * |
| 白建军: "天基网路由技术研究", 《中国博士学位论文全文数据库》 * |
| 黄皆雨 编: "《计算机通信网》", 31 July 2001, 《华南理工大学出版社》 * |
| 黄萍: "航天测控网资源分配和调度方法研究", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111641557A (en) * | 2020-06-02 | 2020-09-08 | 西安电子科技大学 | Minimum cost backup path method for delay tolerant network |
| CN111641557B (en) * | 2020-06-02 | 2023-04-28 | 西安电子科技大学 | Minimum cost path backup method for delay tolerant network |
| CN112733357A (en) * | 2021-01-04 | 2021-04-30 | 西安建筑科技大学 | Heterogeneous space network data transmission task collaborative planning method |
| CN112733357B (en) * | 2021-01-04 | 2024-01-23 | 西安建筑科技大学 | Heterogeneous space network data transmission task collaborative planning method |
| CN113630268A (en) * | 2021-07-29 | 2021-11-09 | 西安电子科技大学 | Method for acquiring maximum error separation path of fixed-length random interrupt scene in time-varying network |
| CN113630268B (en) * | 2021-07-29 | 2022-07-26 | 西安电子科技大学 | Method for acquiring maximum error separation path of fixed-length random interrupt scene in time-varying network |
| CN113992259A (en) * | 2021-10-22 | 2022-01-28 | 中国人民解放军63921部队 | Method for constructing time slot resource expansion diagram |
| CN113992259B (en) * | 2021-10-22 | 2023-05-16 | 中国人民解放军63921部队 | Method for constructing time slot resource expansion graph |
| CN115865740A (en) * | 2023-03-02 | 2023-03-28 | 中国人民解放军国防科技大学 | Network structure-based key link identification method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110138437B (en) | 2021-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110138437A (en) | Satellite communication network critical link sequence detecting method based on delay performance | |
| Bounceur et al. | CupCarbon: A new platform for the design, simulation and 2D/3D visualization of radio propagation and interferences in IoT networks | |
| Han et al. | Fault-tolerant relay node placement in heterogeneous wireless sensor networks | |
| CN103647664B (en) | Towards the distributing emulation system of many repeater satellite communications of deep space | |
| CN110336751A (en) | Low-track satellite network routing policy based on membership function | |
| Nayyar et al. | Opportunistic networks: present scenario-a mirror review | |
| Fernandes et al. | Scalable vanet simulations with ns-3 | |
| CN108964746A (en) | The more topology search shortest route methods of time-varying satellite network | |
| Zhou et al. | A Markov-Based Packet Dropout Model for UAV Wireless Communications. | |
| Shuhaimi et al. | Performance analysis of radio propagation models in VANET application | |
| Naser et al. | Implementation of RWP and Gauss Markov Mobility Model for Multi-UAV Networks in Search and Rescue Environment. | |
| Shahbazi et al. | Density-based clustering and performance enhancement of aeronautical ad hoc networks | |
| CN103745049A (en) | Novel multi-factor tactical internet connection reliability simulation method | |
| Kamath et al. | Distributed tomography with adaptive mesh refinement in sensor networks | |
| Bautista et al. | Extending IEEE 802.11 s mesh routing for 3-D mobile drone applications in ns-3 | |
| Alenazi et al. | Implementation of the AeroRP and AeroNP protocols in python | |
| González et al. | Analysis of channel models for LoRa-based direct-to-satellite IoT networks served by LEO nanosatellites | |
| Elsayed et al. | Performance evaluation of dynamic source routing protocol with variation in transmission power and speed | |
| Mouaffak et al. | Considering the environment's characteristics in wireless networks simulations: case of the simulator NS2 and the WSN | |
| Li et al. | Modeling for traffic replay in virtual network | |
| Hu et al. | Delay performance comparison across seven low-earth-orbit (LEO) satellite constellations | |
| Andersen et al. | A LoRa Mesh Network Asset Tracking Prototype | |
| Baloch et al. | Study on communication reliability in VANETs | |
| Safrianti et al. | Performance analysis of DSDV, AOMDV and ZRP routing protocols application simulation in pekanbaru vehicular Ad Hoc network (VANET) | |
| Geibig | Peer-to-Peer algorithms in wireless ad-hoc networks for Disaster Management |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20210420 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |