CN108718251A - Information Network connectivity analysis methods based on resource time-varying figure - Google Patents
Information Network connectivity analysis methods based on resource time-varying figure Download PDFInfo
- Publication number
- CN108718251A CN108718251A CN201810442297.5A CN201810442297A CN108718251A CN 108718251 A CN108718251 A CN 108718251A CN 201810442297 A CN201810442297 A CN 201810442297A CN 108718251 A CN108718251 A CN 108718251A
- Authority
- CN
- China
- Prior art keywords
- arc
- varying
- node
- resource
- time
- 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
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
- H04L43/0811—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Radio Relay Systems (AREA)
Abstract
The present invention proposes a kind of Information Network connectivity analysis methods based on resource time-varying figure, it aims to solve the problem that the prior art existing technical problem relatively low because of the connectivity analysis accuracy caused by the relevance not accounted between path when weighing network connectivty, realizes that step is：Build the resource time-varying figure G of Information NetworkT(V,A)；Definition space information network connectivity index；Based on resource time-varying figure GTThe connectivity of (V, A) analysis space information network.The present invention obtains the relevance parameter between nonintersecting paths number, time slot length of window and nonintersecting paths in Information Network using resource time-varying figure, can more fine granularity weighbridge quantity space information network connectivity, the accuracy for improving Information Network connectivity analysis can be used for assessing the design of Information Network connectivity and guiding space information network.
Description
Technical field
The invention belongs to Spatial Information Technology fields, are related to a kind of analysis method of Information Network connectivity, especially
It is related to a kind of Information Network connectivity analysis methods based on resource time-varying figure, can be used for assessing Information Network connection
The design of property and guiding space information network.
Background technology
Resource time-varying figure be one kind can between Information Network node at any time continually changing connected relation into
The multilayer digraph of row characterization.It constructs thinking：The cycle of operation of Information Network is evenly dividing；Initialization is more than one
Layer digraph；According to the communication range of the node set of Information Network and each node, section is added into multilayer digraph
Point and different resource arc；Multilayer digraph is the resource time-varying figure of Information Network.
Information Network be with space platform (such as synchronous satellite or in, low-orbit satellite and someone or unmanned fly
Machine etc.) it is carrier, it obtains in real time, the network system of transmission and processing space information.At the node in Information Network
Among high-speed motion, network topology often has the characteristics that change over time, discontinuously be connected to, therefore Information Network is
One kind of state network.And satellite node generally use storage-carrying-forwarding rather than the mode of storage-forwarding transmits number
According to.Compared with traditional ground network, Information Network has broad covered area, networking flexibility, limit etc. and dashed forward by geographical environment
Go out feature, so as to ensure high rate data transmission and provide wider bandwidth, supports flexible, large-scale network structure.Closely
Nian Lai, Information Network play increasingly important role at many aspects.
Connectivity is as an important indicator for weighing the communication capacity after communication network is interfered, the planning to network
It is of great significance with optimization.Network is divided into static network and dynamic network according to whether network topology changes over time, because
Be likely between dynamic network node there is no the mode of real-time communication link and generally use storage-carrying-forwarding into
A period of time is usually crossed in row data transmission, the path in dynamic network.In traditional dynamic network connectivity analysis, if
Within given time, the source node in dynamic network and between destination node there are a space-time path, then claim node it
Between have connectivity.Connectivity analysis in conventional dynamic network only considered whether there is between given time range interior nodes
Path, in no quantitative analysis dynamic network between source node and destination node path number, lead to dynamic network connectivity
The accuracy of analysis is relatively low.
In view of the above-mentioned problems, application publication number is CN 104917650A, it is entitled " reachable when a kind of sky for challenging network
Property analysis method " patent application in, disclose it is a kind of challenge network sky when analysis method of reachability.It is also one to challenge network
The dynamic network that kind network topology changes over time, the method overcome conventional dynamic Connectivity analysis of network methods can not be accurate
The deficiency of network communication performance is challenged in quantitative analysis.This method is changed static network connection figure by introducing time dimension
For the network changed over time, proposing more traditional " connectivity " more wide in range message on basis herein " can when n skies
Up to property " concept and analyzed.This method considers path number and time range, improves the connectivity of dynamic network
The accuracy of analysis.But it has a defect that the relevance between not accounting for path, is deposited among the nodes in dynamic network
Link may lead to the not available situation within continuous a period of time due to breaking down, and lead to the connectivity point of dynamic network
The accuracy of analysis is still relatively low.
Invention content
It is an object of the invention to overcome the problems of the above-mentioned prior art, it is proposed that a kind of based on resource time-varying figure
Information Network connectivity analysis methods, it is existing because not examining when weighing network connectivty for solving the prior art
Consider the relatively low technical problem of connectivity analysis accuracy caused by the relevance between path.
The present invention technical thought be：Using resource time-varying figure by the dynamic topology of Information Network multilayer digraph
It indicates, has considered nonintersecting paths number k, time slot length of window L and the non-phase in Information Network on this basis
Relevance parameter n between cross-channel diameter proposes (k, n, L) connectivity index of Information Network, and further with graph theory phase
It closes algorithm to analyze connectivity index, reflect in the multiple time slots of arbitrary continuation, network is by logical after lasting interference
Letter ability provides quantitative analysis method for the connectivity measurement of Information Network.
According to above-mentioned technical thought, realize that the technical solution that the object of the invention is taken includes the following steps：
(1) the resource time-varying figure G of Information Network is builtT(V,A)：
By the cycle of operation [0, T of Information Networktotal] T isometric time slots are divided into, and according to obtained space
The time slot sets Γ of information network and the communication range of satellite set CS and each satellite node construct Information Network
Resource time-varying figure GT(V, A), wherein and Γ={ 1 ..., T }, T ∈ [2, ∞), CS={ cs1,cs2,...,csi,...csM, M
For the total number of Information Network Satellite, csiIndicate that i-th of satellite node, i ∈ [1, M], V are CS in each time slot
Copy composition set, A be include storage arc set As, transmission arc set AtWith auxiliary arc set ArThe resource arc collection of composition
It closes；
(2) definition space information network connectivity index：
(2a) defines resource time-varying figure GTPath in (V, A)：
By resource time-varying figure GTThe definition in path is that N items are end to end between source node s and destination node d in (V, A)
The sequence J of resource arc composition：J={ e1,e2,...,ei,ei+1,...,eN, wherein ei∈ A, N ∈ [1, ∞), start (e1)=
S, end (eN)=d, start (ei+1)=end (ei), start (ei) and end (ei) respectively represent resource arc eiStart node and
Terminal node；
(2b) defines resource time-varying figure GTN nonintersecting paths in (V, A)：
Assuming that resource time-varying figure GTPresence is formed from source node s to the path of destination node d by several in (V, A)
Set, and arbitrary two paths J in the set1And J2Meet correlation (J1,J2)=min { d (e1,e2),Then all paths in the set are referred to as n disjoint, wherein N is the relevance parameter of nonintersecting paths, if two paths are n not phases
Hand over, then this two paths in continuous n time slot all without use same satellite node between link, when certain link because of
When cloud cover or failure cause continuous n time slot unavailable, a paths can at most be made to fail；
(2c) definition is based on resource time-varying figure GTThe Information Network connectivity index of (V, A)：
Assuming that resource time-varying figure GTIn (V, A) there is k items in source node s and destination node d in L time slot of arbitrary continuation
N nonintersecting paths, then by (k, n, L) connectivity as Information Network connectivity index, wherein k is source node s and purpose
The number of node d existing n nonintersecting paths in L time slot of arbitrary continuation, n nonintersecting paths can be carried out at the same time data biography
Defeated, L is time slot length of window, and numerical value is equal with the average number of time slot of data transmission, and L≤T；
(3) it is based on resource time-varying figure GTThe connectivity of (V, A) analysis space information network：
(3a) initiation parameter：
According to network actual scene and analysis demand, to the relevance parameter n and time slot length of window L of nonintersecting paths into
Row initialization, and judge whether n is equal to 1, if so, step (3b) is executed, it is no to then follow the steps (3c)；
The connectivity index of (3b) analysis space information network：
(3b1) initiation parameter：
If iterations are t and are initialized as t=1, the number k of 1 nonintersecting paths1=∞；
Resource time-varying figure G is arranged in (3b2)TThe capacity of (V, A) resource arc：
Resource time-varying figure G is setTThe capacity of each storage arc and each auxiliary arc is ∞, each in (V, A)
The capacity for transmitting arc is 1；
(3b3) computing resource time-varying figureMax-flow k' between middle source node s and destination node d1：
Using augmenting path algorithm, pass through resource time-varying figureThe capacity of middle resource arc calculatesMiddle source section
Max-flow is k' between point s and destination node d1, whereinIndicate GTSlot range is [t, t+L-1] institute in (V, A)
The resource time-varying figure of composition；
(3b4) judges k'1< k1It is whether true, if so, enabling k1=k'1, otherwise t=t+1 enables t=t+1；
(3b5) judges whether current iteration number t > T-L+1 are true, if so, Information Network has (k1,1,L)
Connectivity, it is no to then follow the steps (3b3)；
The connectivity index of (3c) analysis space information network：
(3c1) initiation parameter：
If iterations are t' and are initialized as t'=1, n nonintersecting paths numbers kn=∞；
(3c2) is to resource time-varying figureMiddle resource arc carries out weight assignment：
Resource time-varying figure is setThe weight of middle each storage arc and each auxiliary arc is 0, each
Transmit arcWeight be in n time slot window with transmission arc e using same satellite inter-node link biography
The size of defeated arc set, i.e.,Wherein,For GTSlot range in (V, A)
For the resource time-varying figure that [t', t'+T-1] is constituted, if resource time-varying figureBetween middle source node s and destination node d
Resource arc weight and the number of minimal path are k'n, and initialize k'n=0；
(3c3) judges resource time-varying figure according to breadth first traversal algorithmMiddle source node s and destination node d are
It is no that there are paths, if so, step (3c4) is executed, it is no to then follow the steps (3c5)；
(3c4) computing resource time-varying figureResource arc weight and minimal path between middle source node s and destination node d
Diameter, and update
Using Dijkstra shortest path firsts, computing resource time-varying figureMiddle source node s and destination node d it
Between resource arc weight and minimal path, and by each for including in minimal path transmit arcWith at n
The transmission arc of same satellite inter-node link is used in gap window with transmission arc e'From
Middle deletion, enables k'n=k'n+ 1, execute step (3c3)；
(3c5) judges k'n< knIt is whether true, if so, enabling kn=k'n, otherwise t'=t'+1 enables t'=t'+1；
(3c6) judges whether current iteration number t'> T-L+1 are true, if so, Information Network has (kn,n,
L) connectivity, it is no to then follow the steps (3c2).
Compared with prior art, the present invention having the following advantages that：
The present invention obtains nonintersecting paths number k, time slot length of window L in Information Network using resource time-varying figure
And the relevance parameter n between nonintersecting paths, it proposes (k, n, L) the connectivity index of Information Network and is analyzed,
Can more fine granularity weighbridge quantity space information network connectivity be effectively improved Information Network compared with prior art
The accuracy of connectivity analysis.
Description of the drawings
Fig. 1 is the implementation flow chart of the present invention；
Fig. 2 is the resource time-varying figure of Information Network in the embodiment of the present invention；
Fig. 3 is the path profile in resource time-varying figure between source node and destination node in the embodiment of the present invention；
Fig. 4 is 2 nonintersecting paths figures in resource time-varying figure in the embodiment of the present invention.
Specific implementation mode
Below in conjunction with the drawings and specific embodiments, the present invention is described in detail, and embodiment is merely to illustrate the present invention,
Do not constitute any limitation of the invention.
Referring to Fig.1, a kind of Information Network connectivity analysis methods based on resource time-varying figure, include the following steps：
Step 1) builds the resource time-varying figure G of Information Network4(V,A)：
Consider that the Information Network being made of 4 satellites, satellite set are denoted as CS={ cs1,cs2,cs3,cs4, source is defended
Star node is cs1, purpose satellite node be cs4If the cycle of operation of the network is [0,4 τ], 4 etc. will be divided into the cycle of operation
Long time slot obtains time slot sets Γ={ 1,2,3,4 } of Information Network, according to satellite set CS, time slot sets Γ with
And the communication range of each satellite node, construct the resource time-varying figure G of Information Network4(V,A)；
Step 1a) initialization：
By the resource time-varying figure G of Information Network to be constructed4(V, A) is initialized as 4 layers of digraph of a blank,
Wherein, V is the set of copy compositions of the CS in each time slot, A be include storage arc set As, transmission arc set AtAnd auxiliary
Arc set ArThe resource arc set of composition enables
Step 1b) into 4 layers of digraph add node：
All satellite nodes in satellite set CS are traversed, to each satellite node csi∈ CS, into T layers of digraph
Add nodeWherein,In l layers of digraph, node set is updated
Step 1c) the addition transmission arc A into 4 layers of digrapht：
All satellite nodes in satellite set CS are traversed to csi,csj∈ CS, csi≠csj, according to defending in ephemeris
The communication range of star trails and satellite node it is found thatWithWithWithWithWith
WithWithWithWithWithWithMutually in communication range, therefore, at 4 layers
Addition transmission arc in digraph Resource arc is undirected arc, more new resources arc set A=A ∪ At；
Step 1d) the addition storage arc A into 4 layers of digraphs：
All satellite nodes in satellite set CS are traversed, to each satellite node csi∈ CS, in T layers of digraph
The cs of all adjacent layersiBetween addition storage arc Storage arc is directed arc, more new resources arc set A=A ∪ As；
Step 1e) source node s and destination node d is added into 4 layers of digraph：
The middle addition source node s and destination node d in 4 layers of digraph, update node set V=V ∪ { s, d }；
Step 1f) the addition auxiliary arc A into 4 layers of digraphr：
To source node s and source satellite node cs1Copy in 4 layers of digraph in all time slotsIt
Between and purpose satellite node cs4Copy in 4 layers of digraph in all time slotsWith destination node d it
Between, addition auxiliary arc
It is directed arc to assist arc, more new resources arc set A=A ∪ Ar, the T layer digraphs added with node and resource arc are space letter
Cease the resource time-varying figure G of network4(V, A), as shown in Fig. 2, solid line therein, dotted line and dotted line respectively represent resource time-varying figure
G4Storage arc, transmission arc in (V, A) and auxiliary arc；
Step 2) definition space information network connectivity index：
Step 2a) define resource time-varying figure G4Path in (V, A)：
Because link in Information Network has a discontinuously connection characteristic, therefore the path in Information Network can be with
Across multiple time slots, the path in corresponding resource time-varying figure can be with spanning multilayer.Based on above-mentioned property, by resource time-varying figure G4
The definition in path is the sequence J of the end to end resource arc composition of N items between source node s and destination node d in (V, A)：J=
{e1,e2,...,ei,ei+1,...,eN, wherein ei∈ A, N ∈ [1, ∞), start (e1)=s, end (eN)=d, start
(ei+1)=end (ei), start (ei) and end (ei) respectively represent resource arc eiStart node and terminal node, in Fig. 3
That heavy solid line arrows indicate is resource time-varying figure G4A paths in (V, A) between source node s and destination node d
Step 2b) define resource time-varying figure G4N nonintersecting paths in (V, A)：
Assuming that resource time-varying figure G4There is the set formed from source node s to the path of destination node d by several in (V, A),
And arbitrary two paths J in the set1And J2MeetThen claim the institute active node s in the set
It is that n is disjoint to the path between destination node d, whereinn
For the relevance parameter of nonintersecting paths.If two paths are n disjoint, this two paths in continuous n time slot all
The link between same satellite node is not used, when certain link because cloud cover or failure cause continuous n time slot can not
Used time can at most make a paths fail.In Fig. 4, two paths represented by heavy solid line arrows
WithIt is 2 disjoint；
Step 2c) it defines based on resource time-varying figure G4The Information Network connectivity index of (V, A)：
Assuming that resource time-varying figure G4In (V, A) there is k items in source node s and destination node d in L time slot of arbitrary continuation
N nonintersecting paths, then by (k, n, L) connectivity as Information Network connectivity index, wherein k is source node s and purpose
The number of node d existing n nonintersecting paths in L time slot of arbitrary continuation, n nonintersecting paths can be carried out at the same time data biography
Defeated, L is time slot length of window, and numerical value is equal with the average number of time slot of data transmission, and L≤T.If Information Network
With (k, n, L) connectivity, k n nonintersecting paths simultaneous transmission can be used in the L time slot since any time slot simultaneously
Data, and when the continuous n time slot of certain link is unavailable, still can be transmitted using remaining k-1 paths, space letter
The connectivity of breath network is protected；
Step 3) is based on resource time-varying figure G4The connectivity of (V, A) analysis space information network：
Step 3a) initiation parameter：
According to network actual scene and analysis demand, to the relevance parameter n and time slot length of window L of nonintersecting paths into
Row initialization, n can take 1 or be more than 1 any integer.In the present embodiment, analysis space information network is respectively 1 in L=3, n
Step (3b) is executed when n is equal to 1 with the connectivity in the case of 2 two kinds, when n is equal to 2, executes step (3c)；
Step 3b) analysis space information network connectivity index：
Step 3b1) initiation parameter：
If iterations are t and are initialized as t=1, the number k of 1 nonintersecting paths1=∞；
Step 3b2) setting resource time-varying figure G4The capacity of (V, A) resource arc：
Resource time-varying figure G is set4Arc is stored in (V, A) With auxiliary arcCapacity be ∞, transmit arc
Capacity be 1；
Step 3b3) computing resource time-varying figureMax-flow k' between middle source node s and destination node d1：
Using augmenting path algorithm, pass through resource time-varying figureThe capacity of middle resource arc calculatesMiddle source section
Max-flow is k' between point s and destination node d1=4, whereinIndicate G4Slot range is [1,3] institute structure in (V, A)
At resource time-varying figure；
Step 3b4) k'1< k1It sets up, enables k1=k'1=4, t=t+1=2；
Step 3b5) current iteration number t > 2 are invalid, execute step 3b6)；
Step 3b6) computing resource time-varying figureMax-flow k' between middle source node s and destination node d1：
Using augmenting path algorithm, pass through resource time-varying figureThe capacity of middle resource arc calculatesMiddle source section
Max-flow k' between point s and destination node d1=3, whereinIndicate G4Slot range is constituted by [2,4] in (V, A)
Resource time-varying figure；
Step 3b7) k'1< k1It sets up, enables k1=k'1=3, t=t+1=3；
Step 3b8) establishments of current iteration number t > 2, then Information Network is with (3,1,3) connectivity；
Step 3c) analysis space information network connectivity index：
Step 3c1) initiation parameter：
If iterations are t' and are initialized as t'=1,2 nonintersecting paths number k2=∞；
Step 3c2) to resource time-varying figureMiddle resource arc carries out weight assignment：
Resource time-varying figure is setMiddle storage arc With auxiliary arc 's
Weight is 0, and each transmits arcWeight be in n time slot window with transmit arc e defended using identical
The size of the transmission arc set of star inter-node link, i.e.,Therefore, It passes
Defeated arc weight is bigger, illustrates that the influence that this transmission arc generates other transmission arcs is bigger.For G4Time slot in (V, A)
The resource time-varying figure that ranging from [1,3] is constituted, if resource time-varying figureResource between middle source node s and destination node d
Arc weight and the number of minimal path are k'2, and initialize k'2=0；
Step 3c3) resource time-varying figure obtained according to breadth first traversal algorithmMiddle source node s and destination node d
Between there are path, execute step 3c4)；
Step 3c4) computing resource time-varying figureResource arc weight and minimum between middle source node s and destination node d
Path, and update
Using Dijkstra shortest path firsts, resource time-varying figure is calculatedMiddle source node s and destination node d
Between resource arc weight and minimal path beFor the transmission arc for including in minimal pathSince there is no in 2 time slot windows with transmission arcUse the transmission arc of same satellite inter-node linkOnly need byFromMiddle deletion, enables k'2=k'2+ 1=1 executes step
3c5)；
Step 3c5) resource time-varying figure obtained according to breadth first traversal algorithmMiddle source node s and destination node d
Between there are path, execute step 3c6)；
Step 3c6) computing resource time-varying figureResource arc weight and minimum between middle source node s and destination node d
Path, and update
Using Dijkstra shortest path firsts, resource time-varying figure is calculatedMiddle source node s and destination node d
Between resource arc weight and minimal path beThe transmission arc that will include in minimal pathWithAnd in 2 time slot windows withWithUse same satellite inter-node link
Transmission arcFromMiddle deletion, enables k'2=k'2+ 1=2 executes step 3c7)；
Step 3c7) resource time-varying figure obtained according to breadth first traversal algorithmMiddle source node s and destination node d
Between there are path, execute step 3c8)；
Step 3c8) computing resource time-varying figureResource arc weight and minimum between middle source node s and destination node d
Path, and update
Using Dijkstra shortest path firsts, resource time-varying figure is calculatedMiddle source node s and destination node d
Between resource arc weight and minimal path beThe transmission arc that will include in minimal pathWithAnd in 2 time slot windows withWithUse same satellite inter-node link
Transmission arcWithFromMiddle deletion, enables k'2=k'2+ 1=3 executes step 3c9)；
Step 3c9) resource time-varying figure obtained according to breadth first traversal algorithmMiddle source node s and destination node d
There is no paths, execute step 3c10)；
Step 3c10) k'2< k2It sets up, enables k2=k'2=3, t'=t'+1=2；
Step 3c11) current iteration number t'> 2 is invalid, execute step 3c12)；
Step 3c12) to resource time-varying figureMiddle resource arc carries out weight assignment：
Resource time-varying figure is setMiddle storage arc With auxiliary arc
Weight be 0, each transmit arcWeight be in n time slot window with transmission arc e use same satellite
The size of the transmission arc set of inter-node link, i.e.,Therefore,
Transmission arc weight is bigger, illustrates that the influence that this transmission arc generates other transmission arcs is bigger.For G4When in (V, A)
The resource time-varying figure that gap ranging from [2,4] is constituted, if resource time-varying figureIt is provided between middle source node s and destination node d
Source arc weight and the number of minimal path are k'2, and initialize k'2=0；
Step 3c13) resource time-varying figure obtained according to breadth first traversal algorithmMiddle source node s and destination node
There are paths between d, execute step 3c14)；
Step 3c14) computing resource time-varying figureResource arc weight and most between middle source node s and destination node d
Small path, and update
Using Dijkstra shortest path firsts, resource time-varying figure is calculatedMiddle source node s and destination node d
Between resource arc weight and minimal path beFor the transmission arc for including in minimal pathWithSince there is no in 2 time slot windows with transmission arcWithUse phase
With the transmission arc of link between satellite nodeTherefore only need byWithFromMiddle deletion, enables k'2=k'2+ 1=1 executes step 3c15)；
Step 3c15) resource time-varying figure obtained according to breadth first traversal algorithmMiddle source node s and destination node
There are paths between d, execute step 3c16)；
Step 3c16) computing resource time-varying figureResource arc weight and most between middle source node s and destination node d
Small path, and update
Using Dijkstra shortest path firsts, resource time-varying figure is calculatedMiddle source node s and destination node d
Between resource arc weight and minimal path beThe transmission arc that will include in minimal pathWithAnd in 2 time slot windows with transmission arcWithUse same satellite
The transmission arc of inter-node linkWithFromMiddle deletion, enables k'2=k'2+ 1=2 executes step
3c17)；
Step 3c17) resource time-varying figure obtained according to breadth first traversal algorithmMiddle source node s and destination node
Path is not present between d, executes step 3c18)；
Step 3c18) k'2< k2It sets up, enables k2=k'2=2, t'=t'+1=3；
Step 3c19) establishments of current iteration number t'> 2, then Information Network is with (2,2,3) connectivity.
Above description is only example of the present invention, it is clear that for those skilled in the art, is being understood
After the content of present invention and principle, all it may be carried out in form and details without departing substantially from the principle of the invention, structure
Various modifications and variations, but these modifications and variations based on inventive concept are still in the claims of the present invention
Within.
Claims (2)
1. a kind of Information Network connectivity analysis methods based on resource time-varying figure, it is characterised in that include the following steps：
(1) the resource time-varying figure G of Information Network is builtT(V,A)：
By the cycle of operation [0, T of Information Networktotal] T isometric time slots are divided into, and according to obtained spatial information
The time slot sets Γ of network and the communication range of satellite set CS and each satellite node, construct the money of Information Network
Source time-varying figure GT(V, A), wherein and Γ={ 1 ..., T }, T ∈ [2, ∞), CS={ cs1,cs2,...,csi,...csM, M is sky
Between information network Satellite total number, csiIndicate that i-th of satellite node, i ∈ [1, M], V are pairs of the CS in each time slot
The set of this composition, A be include storage arc set As, transmission arc set AtWith auxiliary arc set ArThe resource arc set of composition；
(2) definition space information network connectivity index：
(2a) defines resource time-varying figure GTPath in (V, A)：
By resource time-varying figure GTThe definition in path is the end to end resource arc of N items between source node s and destination node d in (V, A)
The sequence J of composition：J={ e1,e2,...,ei,ei+1,...,eN, wherein ei∈ A, N ∈ [1, ∞), start (e1)=s, end
(eN)=d, start (ei+1)=end (ei), start (ei) and end (ei) respectively represent resource arc eiStart node and termination
Node；
(2b) defines resource time-varying figure GTN nonintersecting paths in (V, A)：
Assuming that resource time-varying figure GTThere is the set formed from source node s to the path of destination node d by several in (V, A),
And arbitrary two paths J in the set1And J2MeetThen
All paths in the set are referred to as n disjoint, wherein
N is the relevance parameter of nonintersecting paths, if two paths are n disjoint, this two paths is in continuous n time slot
All without using the link between same satellite node, when certain link because cloud cover or failure lead to continuous n time slot
When unavailable, a paths can at most be made to fail；
(2c) definition is based on resource time-varying figure GTThe Information Network connectivity index of (V, A)：
Assuming that resource time-varying figure GTIn (V, A) there is k n not phases in source node s and destination node d in L time slot of arbitrary continuation
Cross-channel diameter, then by (k, n, L) connectivity as Information Network connectivity index, wherein k is source node s and destination node d
The number of existing n nonintersecting paths, n nonintersecting paths can be carried out at the same time data transmission, L in L time slot of arbitrary continuation
For time slot length of window, numerical value is equal with the average number of time slot of data transmission, and L≤T；
(3) it is based on resource time-varying figure GTThe connectivity of (V, A) analysis space information network：
(3a) initiation parameter：
According to network actual scene and analysis demand, relevance parameter n and time slot length of window L to nonintersecting paths are carried out just
Beginningization, and judge whether n is equal to 1, if so, step (3b) is executed, it is no to then follow the steps (3c)；
The connectivity index of (3b) analysis space information network：
(3b1) initiation parameter：
If iterations are t and are initialized as t=1, the number k of 1 nonintersecting paths1=∞；
Resource time-varying figure G is arranged in (3b2)TThe capacity of (V, A) resource arc：
Resource time-varying figure G is setTThe capacity of each storage arc and each auxiliary arc is ∞ in (V, A), and each transmits arc
Capacity be 1；
(3b3) computing resource time-varying figureMax-flow k between middle source node s and destination node d1'：
Using augmenting path algorithm, pass through resource time-varying figureThe capacity of middle resource arc calculatesMiddle source node s and
Max-flow is k between destination node d1', whereinIndicate GTSlot range is that [t, t+L-1] is constituted in (V, A)
Resource time-varying figure；
(3b4) judges k1' < k1It is whether true, if so, enabling k1=k1', otherwise t=t+1 enables t=t+1；
(3b5) judges whether current iteration number t > T-L+1 are true, if so, Information Network has (k1, 1, L) and connection
Property, it is no to then follow the steps (3b3)；
The connectivity index of (3c) analysis space information network：
(3c1) initiation parameter：
If iterations are t' and are initialized as t'=1, n nonintersecting paths numbers kn=∞；
(3c2) is to resource time-varying figureMiddle resource arc carries out weight assignment：
Resource time-varying figure is setThe weight of middle each storage arc and each auxiliary arc is 0, and each transmits arcWeight be in n time slot window with transmission arc e using same satellite inter-node link transmission arc collection
The size of conjunction, i.e.,Wherein,For GTSlot range is [t', t' in (V, A)
+ T-1] the resource time-varying figure that is constituted, if resource time-varying figureResource arc is weighed between middle source node s and destination node d
The number of weight and minimal path is k'n, and initialize k'n=0；
(3c3) judges resource time-varying figure according to breadth first traversal algorithmWhether middle source node s and destination node d deposit
In path, if so, step (3c4) is executed, it is no to then follow the steps (3c5)；
(3c4) computing resource time-varying figureResource arc weight and minimal path between middle source node s and destination node d, and
Update
Using Dijkstra shortest path firsts, computing resource time-varying figureIt is provided between middle source node s and destination node d
Source arc weight and minimal path, and each for including in minimal path is transmitted into arcWith in n time slot window
The transmission arc of same satellite inter-node link is used in mouthful with transmission arc e'FromIn delete
It removes, enables k'n=k'n+ 1, execute step (3c3)；
(3c5) judges k'n< knIt is whether true, if so, enabling kn=k'n, otherwise t'=t'+1 enables t'=t'+1；
(3c6) judges whether current iteration number t'> T-L+1 are true, if so, Information Network has (kn, n, L) and connection
Property, it is no to then follow the steps (3c2).
2. the Information Network connectivity analysis methods according to claim 1 based on resource time-varying figure, feature exist
In the resource time-varying figure G of the construction Information Network described in step (1)T(V, A) realizes that step is：
(1a) is initialized：
By the resource time-varying figure G of Information Network to be constructedT(V, A) is initialized as the T layer digraphs of a blank, wherein
V is the set of copy compositions of the CS in each time slot, and A is resource arc set, is enabled
(1b) adds node into T layers of digraph：
All satellite nodes in satellite set CS are traversed, to each satellite node csi∈ CS add section into T layers of digraph
PointWherein,In l layers of digraph, node set is updated
(1c) addition transmission arc A into T layers of digrapht：
All satellite nodes in satellite set CS are traversed to csi,csj∈ CS, csi≠csjIf the satellite in first of time slot
csjIn satellite csiCommunication range in, then in l layers of digraph addition transmission arcUpdate
Resource arc set A=A ∪ At；
(1d) addition storage arc A into T layers of digraphs：
All satellite nodes in satellite set CS are traversed, to each satellite node csi∈ CS, all phases in T layers of digraph
The cs of adjacent bediBetween addition storage arcMore new resources arc set A=A ∪ As；
(1e) adds source node s and destination node d into T layers of digraph：
Source node s and destination node d, update node set V=V ∪ { s, d } are added in T layers of digraph；
(1f) addition auxiliary arc A into T layers of digraphr：
According to source satellite node ss ∈ CS, the purpose satellite node sd ∈ CS in Information Network, to source node s and source satellite
Between copies of the node ss in T layers of digraph in all time slots and purpose satellite node sd in T layers of digraph institute sometimes
Between copy in gap and destination node d, addition auxiliary arc Ar={ (s,ss l)|ss∈CS,l∈Γ}∪{(sdl,d)|sd∈
CS, l ∈ Γ }, more new resources arc set A=A ∪ Ar, the T layer digraphs added with node and resource arc are spatial information net
The resource time-varying figure G of networkT(V,A)。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810442297.5A CN108718251B (en) | 2018-05-10 | 2018-05-10 | Spatial information network connectivity analysis method based on resource time-varying graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810442297.5A CN108718251B (en) | 2018-05-10 | 2018-05-10 | Spatial information network connectivity analysis method based on resource time-varying graph |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108718251A true CN108718251A (en) | 2018-10-30 |
| CN108718251B CN108718251B (en) | 2021-01-29 |
Family
ID=63899641
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810442297.5A Active CN108718251B (en) | 2018-05-10 | 2018-05-10 | Spatial information network connectivity analysis method based on resource time-varying graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108718251B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109560860A (en) * | 2018-12-25 | 2019-04-02 | 长沙天仪空间科技研究院有限公司 | A kind of satellite communication method for routing and system |
| CN109711638A (en) * | 2019-01-16 | 2019-05-03 | 中国大恒(集团)有限公司北京图像视觉技术分公司 | A kind of industrial machinery arm transport path planing method based on time-varying digraph |
| CN110138437A (en) * | 2019-04-03 | 2019-08-16 | 西安建筑科技大学 | Satellite communication network critical link sequence detecting method based on delay performance |
| CN110288018A (en) * | 2019-06-24 | 2019-09-27 | 桂林电子科技大学 | A kind of WiFi personal identification method merging deep learning model |
| CN110572198A (en) * | 2019-06-12 | 2019-12-13 | 南京大学 | Method for realizing satellite-ground laser communication network maximum network communication rate |
| CN111313960A (en) * | 2020-02-20 | 2020-06-19 | 中国西安卫星测控中心 | Evaluation method for chain establishment execution effect of Beidou third-order inter-satellite link |
| 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 |
| CN113660677A (en) * | 2021-07-29 | 2021-11-16 | 西安电子科技大学 | Maximum error independent path calculation method of weighted time-varying network under consumption limit |
| CN114500296A (en) * | 2022-01-25 | 2022-05-13 | 西安电子科技大学 | Communication, storage and computing resource unified characterization method based on function expansion diagram |
| CN115774736A (en) * | 2023-02-10 | 2023-03-10 | 之江实验室 | NUMA (non Uniform memory Access) architecture time-varying graph processing method and device for delayed data transmission |
| CN116683981A (en) * | 2023-07-28 | 2023-09-01 | 成都本原星通科技有限公司 | Low-orbit satellite path planning method based on multidimensional time-varying resource diagram |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH05209935A (en) * | 1992-01-31 | 1993-08-20 | Fujitsu Ltd | Lsi device and lsi test method |
| CN101548568A (en) * | 2006-12-04 | 2009-09-30 | 皇家飞利浦电子股份有限公司 | Inter-channel communication methods in multi-channel wireless networks |
| CN106788664A (en) * | 2015-11-23 | 2017-05-31 | 上海交通大学 | Link allocation method based on perfect matching model in constellation communication network |
-
2018
- 2018-05-10 CN CN201810442297.5A patent/CN108718251B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH05209935A (en) * | 1992-01-31 | 1993-08-20 | Fujitsu Ltd | Lsi device and lsi test method |
| CN101548568A (en) * | 2006-12-04 | 2009-09-30 | 皇家飞利浦电子股份有限公司 | Inter-channel communication methods in multi-channel wireless networks |
| CN106788664A (en) * | 2015-11-23 | 2017-05-31 | 上海交通大学 | Link allocation method based on perfect matching model in constellation communication network |
Non-Patent Citations (2)
| Title |
|---|
| RUNZI LIU ;RUNZI LIU，MIN SHENG，KING-SHAN LUI: "An Analytical Framework for Resource-Limited Small Satellite Networks", 《IEEE COMMUNICATIONS LETTERS》 * |
| 张威，张更新，边东明等: "基于分层自治域空间信息网络模型与拓扑控制算法", 《通信学报》 * |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109560860A (en) * | 2018-12-25 | 2019-04-02 | 长沙天仪空间科技研究院有限公司 | A kind of satellite communication method for routing and system |
| CN109560860B (en) * | 2018-12-25 | 2021-02-09 | 长沙天仪空间科技研究院有限公司 | Satellite communication routing method and system |
| CN109711638B (en) * | 2019-01-16 | 2020-12-04 | 中国大恒(集团)有限公司北京图像视觉技术分公司 | Industrial mechanical arm carrying path planning method based on time-varying directed graph |
| CN109711638A (en) * | 2019-01-16 | 2019-05-03 | 中国大恒(集团)有限公司北京图像视觉技术分公司 | A kind of industrial machinery arm transport path planing method based on time-varying digraph |
| CN110138437A (en) * | 2019-04-03 | 2019-08-16 | 西安建筑科技大学 | Satellite communication network critical link sequence detecting method based on delay performance |
| CN110138437B (en) * | 2019-04-03 | 2021-04-20 | 西安建筑科技大学 | Satellite communication network key link sequence detection method based on time delay performance |
| CN110572198A (en) * | 2019-06-12 | 2019-12-13 | 南京大学 | Method for realizing satellite-ground laser communication network maximum network communication rate |
| CN110572198B (en) * | 2019-06-12 | 2021-05-25 | 南京大学 | Method for realizing satellite-ground laser communication network maximum network communication rate |
| CN110288018A (en) * | 2019-06-24 | 2019-09-27 | 桂林电子科技大学 | A kind of WiFi personal identification method merging deep learning model |
| CN110288018B (en) * | 2019-06-24 | 2022-08-12 | 桂林电子科技大学 | WiFi identity recognition method fused with deep learning model |
| CN111313960A (en) * | 2020-02-20 | 2020-06-19 | 中国西安卫星测控中心 | Evaluation method for chain establishment execution effect of Beidou third-order inter-satellite link |
| CN111313960B (en) * | 2020-02-20 | 2021-08-03 | 中国西安卫星测控中心 | Evaluation method for chain establishment execution effect of Beidou third-order inter-satellite link |
| 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 |
| CN113660677A (en) * | 2021-07-29 | 2021-11-16 | 西安电子科技大学 | Maximum error independent path calculation method of weighted time-varying network under consumption limit |
| 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 |
| CN114500296A (en) * | 2022-01-25 | 2022-05-13 | 西安电子科技大学 | Communication, storage and computing resource unified characterization method based on function expansion diagram |
| CN115774736A (en) * | 2023-02-10 | 2023-03-10 | 之江实验室 | NUMA (non Uniform memory Access) architecture time-varying graph processing method and device for delayed data transmission |
| CN116683981A (en) * | 2023-07-28 | 2023-09-01 | 成都本原星通科技有限公司 | Low-orbit satellite path planning method based on multidimensional time-varying resource diagram |
| CN116683981B (en) * | 2023-07-28 | 2023-10-13 | 成都本原星通科技有限公司 | Low-orbit satellite path planning method based on multidimensional time-varying resource diagram |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108718251B (en) | 2021-01-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108718251A (en) | Information Network connectivity analysis methods based on resource time-varying figure | |
| Subramanya et al. | Machine learning-driven service function chain placement and scaling in MEC-enabled 5G networks | |
| Agarwal et al. | VNF placement and resource allocation for the support of vertical services in 5G networks | |
| Zhan et al. | Trajectory design for distributed estimation in UAV-enabled wireless sensor network | |
| Li et al. | QTCP: Adaptive congestion control with reinforcement learning | |
| Marfoq et al. | Throughput-optimal topology design for cross-silo federated learning | |
| Chen et al. | Task replication for vehicular cloud: Contextual combinatorial bandit with delayed feedback | |
| Gatzianas et al. | A distributed algorithm for maximum lifetime routing in sensor networks with mobile sink | |
| Allalouf et al. | Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation | |
| CN110336751A (en) | Low-track satellite network routing policy based on membership function | |
| CN109905281A (en) | The group of stars network Telemetry Service transmission method of multipath maximum throughput | |
| Odarchenko et al. | Improved method of routing in UAV network | |
| US9614735B2 (en) | Bounded-budget monitor deployment in monitoring networks via end-to-end probes | |
| Shah et al. | Network flows for function computation | |
| Polverini et al. | Traffic matrix estimation enhanced by SDNs nodes in real network topology | |
| CN104580002B (en) | The big balanced retransmission method of current load and device | |
| Zhang et al. | Queue resource reallocation strategy for traffic systems in scale-free network | |
| Vallet et al. | Online OSPF weights optimization in IP networks | |
| Yan et al. | Local information-based congestion control scheme for space delay/disruption tolerant networks | |
| Pan et al. | Satellite network load balancing strategy for SDN/NFV collaborative deployment | |
| Ward et al. | Complexity results on labeled shortest path problems from wireless routing metrics | |
| Hou et al. | Bandwidth scheduling for big data transfer with two variable node-disjoint paths | |
| US11516144B2 (en) | Incremental data processing | |
| Osuagwu et al. | Low and Expensive Bandwidth Remains Key Bottleneck for Nigeria’s Internet Diffusion: A Proposal for a Solution Model. | |
| Toledo et al. | CloudPilot: Flow acceleration in the cloud |
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 |