CN113992259A - Method for constructing time slot resource expansion diagram - Google Patents
Method for constructing time slot resource expansion diagram Download PDFInfo
- Publication number
- CN113992259A CN113992259A CN202111237874.5A CN202111237874A CN113992259A CN 113992259 A CN113992259 A CN 113992259A CN 202111237874 A CN202111237874 A CN 202111237874A CN 113992259 A CN113992259 A CN 113992259A
- Authority
- CN
- China
- Prior art keywords
- time
- time slot
- link
- nodes
- resource expansion
- 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
- 238000010586 diagram Methods 0.000 title claims abstract description 37
- 238000000034 method Methods 0.000 title claims description 31
- 239000011159 matrix material Substances 0.000 claims abstract description 69
- 238000010276 construction Methods 0.000 claims abstract description 5
- 239000004576 sand Substances 0.000 claims description 7
- 238000005070 sampling Methods 0.000 claims description 6
- 230000002123 temporal effect Effects 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 abstract description 9
- 230000002776 aggregation Effects 0.000 description 10
- 238000004220 aggregation Methods 0.000 description 10
- 230000008569 process Effects 0.000 description 9
- 230000003068 static effect Effects 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 5
- 230000008859 change Effects 0.000 description 5
- 238000012546 transfer Methods 0.000 description 5
- 238000012512 characterization method Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 230000004931 aggregating effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000010076 replication Effects 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Images
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/18513—Transmission in a satellite or space-based system
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention relates to a time slot resource expansion diagram construction method, which comprises the following steps: s1, establishing a contact table according to the connection relation among the nodes of the satellite network; s2, dividing time slots, defining a time slot resource expansion diagram, obtaining a snap chart of the time slot resource expansion diagram at each time slot according to the contact table, and determining the types of nodes, links and weights in the time slot resource expansion diagram; s3, constructing an adjacent matrix and a characteristic matrix of the node connection relation of each time slot snap graph; s4, constructing an adjacency matrix and a characteristic matrix of the node connection relation between the adjacent time slot snap graphs; and S5, constructing an adjacency matrix and a feature matrix of the time slot resource expansion diagram. The time slot resource expansion graph of the invention can directly jump to other time slots through the connection relation between adjacent time slots to search the data transmission path from the source node to the destination node. And according to the service quality of service transmission, the link weight parameters in the graph model are properly added and deleted, so that the computational complexity of a routing algorithm can be reduced.
Description
Technical Field
The invention belongs to the technical field of satellite communication, and relates to a method for constructing a time slot resource expansion diagram.
Background
The spatial information network has the characteristics of dynamic topology change, scarce link resources, limited node storage, various service types, different service quality requirements and the like. Therefore, a static graph model and a static graph theory of the traditional connected network cannot be directly suitable for modeling and analyzing of the spatial information network, and a time-varying graph needs to be established. The time-varying graph is a mathematical representation of networking resources of the time-varying network and the relation thereof, and is a theoretical basis for designing a time-varying network protocol and an algorithm. The evaluation of the superiority and inferiority of the time-varying model mainly considers the following two factors: firstly, the accuracy can accurately represent the change relation of networking resources along with time and the mutual restriction relation among the resources. And the second is high efficiency, including the small storage resource occupied by the model and the high efficiency of the algorithm for analyzing the network performance based on the model.
The existing commonly used time-varying graph model comprises a time expansion graph, a time aggregation graph and a storage time aggregation graph. The time expansion graph connects discrete time snapshots by introducing storage arcs, so that modeling of a network topology evolution process from a time dimension and a space dimension is realized. The time expansion graph connects corresponding nodes in the snapshot subgraph by using the storage link, so that a storage, hosting and forwarding mechanism can be represented, and the representation precision is high. However, when the number of snapshot subgraphs is large and the network scale is large, the time expansion graph occupies a large storage space and the routing computation complexity is high.
And the time aggregation graph is used for aggregating the snapshot graphs together and characterizing the weights of different periods of the link by using the link weight sequence list. The time aggregation graph model does not need node replication, the storage capacity of the model is small, the storage is efficient, multiple paths in the time expansion graph can be calculated through one-time routing calculation, and the complexity of a routing algorithm is low. However, due to the lack of characterization of a constraint relation between the time-segment link and the cache, the time aggregation graph cannot solve the maximum flow of the network, and the model accuracy is low.
The storage time aggregation graph adds the node storage transfer sequence on the nodes of the time aggregation graph, so that the storage resource transfer relation is actually realized, the restriction relation among time-segment links is accurately represented, the maximum flow of the time-varying network is obtained, and the accuracy and the efficiency of the time-varying network are superior to those of the time aggregation graph. But the model emphasizes the transfer information of the characterization resources, so the model is not suitable for the shortest route calculation.
Disclosure of Invention
The invention aims to solve the problems and provides a time slot resource expansion graph construction method for English shortest route calculation and used for describing dynamic network topology change conditions and network resource distribution conditions.
To achieve the object of the present invention, the present invention provides a method for constructing a slot resource expansion map,
the method comprises the following steps:
s1, establishing a contact table according to the connection relation among the nodes of the satellite network;
s2, dividing time slots, defining a time slot resource expansion diagram, obtaining a snap chart of the time slot resource expansion diagram at each time slot according to the contact table, and determining the types of nodes, links and weights in the time slot resource expansion diagram;
s3, constructing an adjacent matrix and a characteristic matrix of the node connection relation of each time slot snap graph;
s4, constructing an adjacency matrix and a characteristic matrix of the node connection relation between the adjacent time slot snap graphs;
and S5, constructing an adjacency matrix and a feature matrix of the time slot resource expansion diagram.
According to an aspect of the present invention, the step S1 includes:
s11 modeling satelliteNetwork model, computing satellite network at [ t ]0，t0+T]Connecting relations among the N nodes in the time period, and exporting connecting relation data;
s12, connecting corresponding contact lists according to the connection relation data, wherein the contact lists comprise a plurality of connection relations ct, and the connection relations ct comprise characteristics S, d, tstart，tendBL, CL, where s and d denote the presence of two satellite nodes connected, tstart，tendRespectively represent the starting time of the connection relation and the ending time of the connection relation, BL represents the link bandwidth, and CL represents the link capacity.
According to one aspect of the invention, the satellite network model is built using STK software.
According to an aspect of the present invention, the step S2 includes:
s21, giving a time interval, and defining a time slot resource expansion graph and the combination of nodes and links thereof;
s22, sampling the information in the contact table to obtain a snapshot of each time slot;
s23, determining the node type of the time slot resource expansion graph;
s24, determining the link type of the time slot resource expansion diagram;
and S5, determining the link weight type of the time slot resource expansion graph.
According to an aspect of the present invention, the step S2 includes:
designating discrete time interval as tau, defining time slot resource expansion diagram as Gs(Vs，Es), wherein Vs＝{vi|i＝1，...，(T/τ)·N}，Es＝{e(vi，vj)|i，j∈Vs}，Vs and EsRespectively representing a node set and an edge set, and constructing T/tau time slots for a satellite network containing N nodes, wherein each time slot uses TSkDenotes, k ═ 1., T/τ;
from t0Sampling information in the touch table at intervals of tau from the beginning of time, and if the starting time and the ending time of the connection relation in the touch table satisfy tstart＜t0+k·τ≤tendK 1.. T/τ, it is determined that the connection exists in the time slot TSkAnd obtains the connection relation span from the start time and the end time of the connection (t)end-tstart) T time intervals from the [ (t)start-t0)/τ]A time slot, ending at the [ (t) thend-t0)/τ]Each time slot is traversed and recorded according to the judgment method, and the whole dynamic topological network is determined in the time period t after traversing is finished0，t0+T]Each time slot TS inkSnapshot map G ofk(V, E) and the total amount of nodes of the time slot is | | | Vs||＝(T/τ)·N；
Dividing nodes in a time slot resource graph into two types of different nodes in the same time slot and the same nodes in different time slots according to the relation between the time slots of all the nodes, wherein the relation between the different nodes in the same time slot represents the relation between two actually existing nodes which exist simultaneously in time and are distributed at different physical positions and is respectively marked as vi+t·N and vj+t·NT1, 2.. and T/τ, where the relationship between the same nodes in different time slots represents the relationship between the node at the current time and the virtual node mapped to the other time within the time domain of the node, and each is denoted as vi and vi+t·N，t＝1，2，...，T/τ；
Dividing links in a time slot resource expansion graph into two types of space links and time links, wherein the space links represent links between nodes in the same time slot in a satellite network, and a link set is marked as Es1＝{e(vi+t·N，vj+t·N)|t＝1，2，...，T/τ；i，j∈VsAnd the time link represents a virtual link between virtual nodes of nodes mapped in different time slots in the satellite network, and the virtual link set is marked as Etl＝{e(vi，vi+t·N)|t＝1，2，...，T/τ；i∈VsAnd determining a corresponding link weight type according to the determined link type.
According to one aspect of the invention, W is utilizeds＝{ω(vi，vj)|i，j∈VcDetermining weight types of spatial links and temporal links, wherein Ws＝{ω(vi，vj)|i，j∈VcRepresents the set of edge weights, e (v) for each edge in each slot for the spatial linki，vj)∈EslThe weight above contains three elements: the link delay, link bandwidth and link remaining capacity, may be expressed as ω (v)i，vj)＝[Delay(i，j)，BL(i，j)，CL(i，j)]；
Wherein, the link Delay(i，j)Calculated by the formula:
wherein F is a link e (v)i，vj) The amount of transmitted traffic data;
link bandwidth BL(i，j)Namely link e (v)i，vj) Bandwidth of (c), link remaining capacity CL(i，j)Is a link e (v)i，vj) Within a slot length tau, according to the bandwidth BL(i，j)Amount of data transferred, by CL(i，j)＝BL(i，j)τ.
According to one aspect of the invention, each edge e (v) is for a time linki，vj)∈EtlThe weight above contains three elements: the slot length, 0 and the node remaining buffer, may be expressed as ω (v)i，vj)＝[τ，0，Cache(i，j)]。
According to an aspect of the invention, step S3 includes:
s31, drawing G according to each time slotkSpatial links within (V, E) establish adjacency matrix Ak：
The adjacent matrix is an N square matrix, and N is the total number of nodes;
wherein ,
1≤i，j≤N
1≤k≤m，m＝T/τ；
s32, and then according to the established adjacency matrix AkConstructing a feature matrix Wk：
wherein ,
1≤i，j≤N
1≤k≤m，m＝T/τ。
according to an aspect of the present invention, the step S4 includes:
s41 snap map G according to adjacent time slotsk-1(V, E) and GkTime links between (V, E) to establish adjacency matrix Ak-1，k：
2≤k≤m，m＝T/τ；
S42, obtaining the adjacency matrix Ak-1，kConstructing a feature matrix Wk-1，k：
2≤k≤m，m＝T/τ。
According to an aspect of the present invention, the step S5 includes:
s51, constructing an adjacency matrix AsIs a square matrix of mN dimensions:
s52, constructing a feature matrix Ws：
Wherein I is an N-dimensional square matrix with elements [ ∞ 00 ]:
compared with the traditional static graph, the time slot resource expansion graph constructed according to the method of the invention not only can represent the topology change of the satellite network in detail through the snapshot on each time slot, but also can depict the service transmission process by a space link, and can also construct a time link by utilizing the node cache characteristic, represent the process that service data is stored in a network node to wait for the space link, and connect the snapshot of all time slots in an observation interval through the time link, so that the dynamic topology network can process the static graph.
Compared with a storage time aggregation graph, the time slot resource expansion graph constructed according to the method reserves the description of the link capacity, ignores the data volume flowing through the node in the service transmission process, increases the representation of the link bandwidth, shows the transfer process of the node storage in the form of a time link, can represent the transmission process and the storage process in the form of the link, and only needs to consider the edge in the time slot resource expansion graph when designing a routing algorithm based on some classical shortest path algorithms (such as Dijkstra algorithm and Floyd algorithm), so that the complexity of the routing algorithm design can be reduced.
In a satellite network scenario, the point-to-point data transmission process in a dynamic network can be modeled as a point-to-point shortest path planning problem on a time varying graph. In order to better capture the topology transformation of the satellite network, some time-varying graph models, such as space-time diagrams, are widely used for modeling the satellite network topology. However, the space-time diagram has the disadvantages of insensitive time delay, high storage redundancy and high calculation complexity, and the time slot resource expansion diagram provided by the invention also has the characteristic that the space-time diagram can distinguish a space link and a time link.
In addition, the time slot resource expansion diagram and the weighted time expansion diagram WTEG adopt a mode of representing node connection information by a matrix, and a link characteristic matrix Ws and a time delay weight combination matrix Graph are respectively designed. The model matrix of the weighted time expansion graph WTEG can only represent the connection state of a link and the time delay of the link, and the time slot resource expansion graph increases the representation of the link bandwidth and the link capacity on the basis of the model matrix, contains the link characteristic data required by route calculation, and can directly distinguish different link types according to the content of each element in the link characteristic matrix Ws so as to improve the compatibility and the expansibility of the model matrix to various links.
Drawings
FIG. 1 is a flow chart of a method for constructing a slot resource expansion map according to the present invention;
FIG. 2 is a schematic representation of a node type diagram;
FIG. 3 is a schematic representation of a link type diagram;
fig. 4 schematically shows a link weight type diagram.
Detailed Description
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments will be briefly described below. It is obvious that the drawings in the following description are only some embodiments of the invention, and that for a person skilled in the art, other drawings can be derived from them without inventive effort.
The present invention is described in detail below with reference to the drawings and the specific embodiments, which are not repeated herein, but the embodiments of the present invention are not limited to the following embodiments.
As shown in fig. 1, the present invention provides a method for constructing a time slot resource expansion diagram, including S1, establishing a contact table according to a connection relationship between nodes of a satellite network; s2, dividing time slots, defining a time slot resource expansion diagram, obtaining a snap chart of the time slot resource expansion diagram at each time slot according to the contact table, and determining the types of nodes, links and weights in the time slot resource expansion diagram; s3, constructing an adjacent matrix and a characteristic matrix of the node connection relation of each time slot snap graph; s4, constructing an adjacency matrix and a characteristic matrix of the node connection relation between the adjacent time slot snap graphs; and S5, constructing an adjacency matrix and a feature matrix of the time slot resource expansion diagram.
According to an embodiment of the present invention, in step S1, the STK software may be used to model a satellite network model to calculate the satellite network at [ t0，t0+T]And (4) connection relations among the N nodes in the time period, and deriving connection relation data. Then the connection relation data is connected with the corresponding contact list, and the specific structure is as follows:
| starting node | Terminating node | Starting time | End time | Other link parameters |
| S | d | tstart | tend | BL、CL |
Each row in the contact list represents a connection relation denoted as ct, and the connection relation ct includes features s, d, tstart，tendBL, CL, where s and d denote the presence of two satellite nodes connected, tstart，tendRespectively represent the starting time of the connection relation and the ending time of the connection relation, BL represents the link bandwidth, and CL represents the link capacity.
After obtaining the contact list, step S2 is performed, which includes: s21, giving a time interval, and defining a time slot resource expansion graph and the combination of nodes and links thereof; s22, sampling the information in the contact table to obtain a snapshot of each time slot; s23, determining the node type of the time slot resource expansion graph; s24, determining the link type of the time slot resource expansion diagram; and S5, determining the link weight type of the time slot resource expansion graph.
Specifically, first, let the discrete time interval be τ, and define the slot resource expansion map as Gs(Vs，Es), wherein Vs＝{vi|i＝1，...，(T/τ)·N}，Es＝{e(vi，vj)|i，j∈Vs}，Vs and EsRespectively representing a node set and an edge set, and constructing T/tau time slots for a satellite network containing N nodes, wherein each time slot uses TSkDenotes, k ═ 1., T/τ;
from t0Sampling information in the touch table at intervals of tau from the beginning of time, and if the starting time and the ending time of the connection relation in the touch table satisfy tstart＜t0+k·τ≤tendK 1.. T/τ, it is determined that the connection exists in the time slot TSkAnd obtaining the connection from the start time and the end time of the connectionConnection relationship spanning (t)end-tstart) T time intervals from the [ (t)start-t0)/τ]A time slot, ending at the [ (t) thend-t0)/τ]Each time slot is traversed and recorded according to the judgment method, and the whole dynamic topological network is determined in the time period t after traversing is finished0，t0+T]Each time slot TS inkSnapshot map G ofk(V, E) and the total amount of nodes of the time slot is | | | Vs||＝(T/τ)·N；
According to the relation between the time slots of all the nodes, the nodes in the time slot resource diagram are divided into two types of different nodes in the same time slot and the same nodes in different time slots, and the relation between the different nodes in the same time slot represents the relation between two actually existing nodes which exist simultaneously in time and are distributed at different physical positions, such as A in FIG. 21 and B1Are respectively denoted as vi+t·N and vj+t·NT1, 2., T/τ, the relationship between the same nodes in different time slots represents the node at the current time (e.g., a in fig. 2)1) And virtual nodes (such as A in figure 2) mapped at other moments in the time domain of existence of the node2) The relationships between each other are respectively denoted as vi and vi+t·N，t＝1，2，...，T/τ；
Dividing links in a time slot resource expansion graph into two types of space links and time links, wherein the space links represent links between nodes in the same time slot in a satellite network, and a link set is marked as Esl＝{e(vi+t·N，vj+t·N)|t＝1，2，...，T/τ；i，j∈VsAnd the time link represents a virtual link between virtual nodes of nodes mapped in different time slots in the satellite network, and the virtual link set is marked as Etl＝{e(vi，vi+t·N)|t＝1，2，...，T/τ；i∈VsAnd determining a corresponding link weight type according to the determined link type.
Specifically, using, Ws＝{ω(vi，vj)|i，j∈VcDetermining weight types of spatial links and temporal links, wherein，Ws＝{ω(vi，vj)|i，j∈VcRepresents the set of edge weights, e (v) for each edge in each slot for the spatial linki，vj)∈EslThe weight above contains three elements: the link delay, link bandwidth and link remaining capacity, may be expressed as ω (v)i，vj)＝[Delay(i，j)，BL(i，j)，CL(i，j)]As shown in fig. 4.
Wherein, the link Delay(i，j)Calculated by the formula:
wherein F is a link e (v)i，vj) The amount of transmitted traffic data;
link bandwidth BL(i，j)Namely link e (v)i，vj) Bandwidth of (c), link remaining capacity CL(i，j)Is a link e (v)i，vj) Within a slot length tau, according to the bandwidth BL(i，j)The amount of data transmitted, i.e. the amount of data that the link can carry at most in one timeslot, is determined by the CL(i，j)＝BL(i，j)τ. The weights on each link characterize the resource status of only one slot.
For a time link, each edge e (v)i，vj)∈EtlThe weight above contains three elements: the slot length, 0 and the node remaining buffer, may be expressed as ω (v)i，vj)＝[τ，0，Cache(i，j)]As shown in fig. 4. Assuming that the node Cache is not limited, the Cache(i，j)＝∞。
Then, step S3 is performed, including:
s31, drawing G according to each time slotkSpatial links within (V, E) establish adjacency matrix Ak：
The adjacent matrix is an N square matrix, and N is the total number of nodes;
wherein ,
1≤i，j≤N
1≤k≤m，m＝T/τ；
s32, and then according to the established adjacency matrix AkConstructing a feature matrix Wk：
wherein ,
1≤i，j≤N
1≤k≤m，m＝T/τ。
thereafter in step S4:
s41 snap map G according to adjacent time slotsk-1(V, E) and GkTime links between (V, E) to establish adjacency matrix Ak-1，k：
2≤k≤m，m＝T/τ；
S42, obtaining the adjacency matrix Ak-1，kConstructing a feature matrix Wk-1，k：
2≤k≤m，m＝T/τ。
Finally, in step S5, adjacency matrix A is constructedsAnd a feature matrix WsCompleting the construction of the development diagramThe body includes:
s51 construction of adjacency matrix AsIs a square matrix of mN dimensions:
s52, constructing a feature matrix Ws：
Wherein I is an N-dimensional square matrix with elements [ ∞ 00 ]:
compared with the traditional static graph, the time slot resource expansion graph constructed according to the method of the invention not only can represent the topology change of the satellite network in detail through the snapshot on each time slot, but also can depict the service transmission process by a space link, and can also construct a time link by utilizing the node cache characteristic, represent the process that service data is stored in a network node to wait for the space link, and connect the snapshot of all time slots in an observation interval through the time link, so that the dynamic topology network can process the static graph.
Compared with a storage time aggregation graph, the time slot resource expansion graph constructed according to the method reserves the description of the link capacity, ignores the data volume flowing through the node in the service transmission process, increases the representation of the link bandwidth, shows the transfer process of the node storage in the form of a time link, can represent the transmission process and the storage process in the form of the link, and only needs to consider the edge in the time slot resource expansion graph when designing a routing algorithm based on some classical shortest path algorithms (such as Dijkstra algorithm and Floyd algorithm), so that the complexity of the routing algorithm design can be reduced.
The above description is only one embodiment of the present invention, and is not intended to limit the present invention, and it is apparent to those skilled in the art that various modifications and variations can be made in the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A time slot resource expansion graph construction method comprises the following steps:
s1, establishing a contact table according to the connection relation among the nodes of the satellite network;
s2, dividing time slots, defining a time slot resource expansion diagram, obtaining a snap chart of the time slot resource expansion diagram at each time slot according to the contact table, and determining the types of nodes, links and weights in the time slot resource expansion diagram;
s3, constructing an adjacent matrix and a characteristic matrix of the node connection relation of each time slot snap graph;
s4, constructing an adjacency matrix and a characteristic matrix of the node connection relation between the adjacent time slot snap graphs;
and S5, constructing an adjacency matrix and a feature matrix of the time slot resource expansion diagram.
2. The method for constructing a slot resource expansion map according to claim 1, wherein the step S1 includes:
s11, modeling a satellite network model, and calculating the satellite network at [ t ]0，t0+T]Connecting relations among the N nodes in the time period, and exporting connecting relation data;
s12, connecting corresponding contact lists according to the connection relation data, wherein the contact lists comprise a plurality of connection relations ct, and the connection relations ct comprise characteristics S, d, tstart，tendBL, CL, where s and d denote the presence of two satellite nodes connected, tstart，tendRespectively represent the starting time of the connection relation and the ending time of the connection relation, BL represents the link bandwidth, and CL represents the link capacity.
3. The method for constructing a slot resource expansion diagram according to claim 2, wherein a satellite network model is established by using STK software.
4. The method for constructing a slot resource expansion map according to claim 2 or 3, wherein the step S2 includes:
s21, giving a time interval, and defining a time slot resource expansion graph and the combination of nodes and links thereof;
s22, sampling the information in the contact table to obtain a snapshot of each time slot;
s23, determining the node type of the time slot resource expansion graph;
s24, determining the link type of the time slot resource expansion diagram;
and S5, determining the link weight type of the time slot resource expansion graph.
5. The method for constructing a slot resource expansion map according to claim 4, wherein the step S2 includes:
designating discrete time interval as tau, defining time slot resource expansion diagram as Gs(Vs，Es), wherein Vs＝{vi|i＝1，...，(T/τ)·N}，Es＝{e(vi，vj)|i，j∈Vs}，Vs and EsRespectively representing a node set and an edge set, and constructing T/tau time slots for a satellite network containing N nodes, wherein each time slot uses TSkDenotes, k ═ 1., T/τ;
from t0Sampling information in the touch table at intervals of tau from the beginning of time, and if the starting time and the ending time of the connection relation in the touch table satisfy tstart＜t0+k·τ≤tendK 1.. T/τ, it is determined that the connection exists in the time slot TSkAnd obtains the connection relation span from the start time and the end time of the connection (t)end-tstart) T time intervals from the [ (t)start-t0)/τ]A time slot, ending at the [ (t) thend-t0)/τ]A time slot, according to which each of the contact tables is traversedConnecting and recording, and determining the time period t of the whole dynamic topological network after traversing0，t0+T]Each time slot TS inkSnapshot map G ofk(V, E) and the total amount of nodes of the time slot is | | | VsN, | where V ═ Ni|i＝1，...，N}，E＝{e(vi，vj) I, j belongs to V, V and E respectively represent a node set and an edge set of the snapshot graph, and each snapshot graph is a subset of the time slot resource expansion graph and meets the requirement of
Dividing nodes in a time slot resource graph into two types of different nodes in the same time slot and the same nodes in different time slots according to the relation between the time slots of all the nodes, wherein the relation between the different nodes in the same time slot represents the relation between two actually existing nodes which exist simultaneously in time and are distributed at different physical positions and is respectively marked as vi+t·N and vj+t·NT1, 2.. and T/τ, where the relationship between the same nodes in different time slots represents the relationship between the node at the current time and the virtual node mapped to the other time within the time domain of the node, and each is denoted as vi and vi+t·N，t＝1，2，...，T/τ；
Dividing links in a time slot resource expansion graph into two types of space links and time links, wherein the space links represent links between nodes in the same time slot in a satellite network, and a link set is marked as Esl＝{e(vi+t·N，vj+t·N)|t＝1，2，...，T/τ；i，j∈VsAnd the time link represents a virtual link between virtual nodes of nodes mapped in different time slots in the satellite network, and the virtual link set is marked as Etl＝{e(vi，vi+t·N)|t＝1，2，...，T/τ；i∈VsAnd determining a corresponding link weight type according to the determined link type.
6. The method of claim 5, wherein W is utilizeds＝{ω(vi，vj)|i，j∈VcDetermining weight types of spatial links and temporal links, wherein Ws＝{ω(vi，vj)|i，j∈VcRepresents the set of edge weights, e (v) for each edge in each slot for the spatial linki，vj)∈EslThe weight above contains three elements: the link delay, link bandwidth and link remaining capacity, may be expressed as ω (v)i，vj)＝[Delay(i，j)，BL(i，j)，CL(i，j)]；
Wherein, the link Delay(i，j)Calculated by the formula:
wherein F is a link e (v)i，vj) The amount of transmitted traffic data;
link bandwidth BL(i，j)Namely link e (v)i，vj) Bandwidth of (c), link remaining capacity CL(i，j)Is a link e (v)i，vj) Within a slot length tau, according to the bandwidth BL(i，j)Amount of data transferred, by CL(i，j)＝BL(i，j)τ.
7. The method of claim 6, wherein each edge e (v) is a time linki，vj)∈EtlThe weight above contains three elements: the slot length, 0 and the node remaining buffer, may be expressed as ω (v)i，vj)＝[τ，0，Cache(i，j)]。
8. The method for constructing a slot resource expansion map according to claim 7, wherein step S3 includes:
s31, drawing G according to each time slotkSpatial links within (V, E) establish adjacency matrix Ak：
The adjacent matrix is an N square matrix, and N is the total number of nodes;
wherein ,
1≤i，j≤N
1≤k≤m，m＝T/τ；
s32, and then according to the established adjacency matrix AkConstructing a feature matrix Wk：
wherein ,
1≤i，j≤N
1≤k≤m，m＝T/τ。
9. the method for constructing a slot resource expansion map according to claim 8, wherein the step S4 includes:
s41 snap map G according to adjacent time slotsk-1(V, E) and GkTime links between (V, E) to establish adjacency matrix Ak-1，k：
2≤k≤m，m＝T/τ；
S42, obtaining the adjacency matrix Ak-1，kConstructing a feature matrix Wk-1，k：
10. The method for constructing a slot resource expansion map according to claim 9, wherein the step S5 includes:
s51, constructing an adjacency matrix AsIs a square matrix of mN dimensions:
s52, constructing a feature matrix Ws：
Wherein I is an N-dimensional square matrix with elements [ ∞ 00 ]:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111237874.5A CN113992259B (en) | 2021-10-22 | 2021-10-22 | Method for constructing time slot resource expansion graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111237874.5A CN113992259B (en) | 2021-10-22 | 2021-10-22 | Method for constructing time slot resource expansion graph |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113992259A true CN113992259A (en) | 2022-01-28 |
| CN113992259B CN113992259B (en) | 2023-05-16 |
Family
ID=79740714
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111237874.5A Active CN113992259B (en) | 2021-10-22 | 2021-10-22 | Method for constructing time slot resource expansion graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113992259B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114978279A (en) * | 2022-05-05 | 2022-08-30 | 长春理工大学 | Method for selecting and distributing satellite network cache nodes |
| CN115801093A (en) * | 2022-10-14 | 2023-03-14 | 西安空间无线电技术研究所 | Path planning method for guaranteeing end-to-end deterministic time delay of satellite network |
| CN116683981A (en) * | 2023-07-28 | 2023-09-01 | 成都本原星通科技有限公司 | Low-orbit satellite path planning method based on multidimensional time-varying resource diagram |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE3044101A1 (en) * | 1979-11-27 | 1981-08-27 | Western Electric Co., Inc., 10038 New York, N.Y. | SATELLITE ARRANGEMENT AND METHOD FOR INCREASING THE RAIN LIMIT OF A MESSAGE SYSTEM |
| CN1121296A (en) * | 1994-03-15 | 1996-04-24 | 日本电气株式会社 | CDMA comminication with a propagation delay between a base and a mobile station taken into account |
| WO2014180447A1 (en) * | 2013-08-20 | 2014-11-13 | 中兴通讯股份有限公司 | Bandwidth map update method and device |
| CN104301966A (en) * | 2014-10-17 | 2015-01-21 | 中国科学院上海微系统与信息技术研究所 | Semi-structured transmission dispatching method orienting wireless sensor network data collection |
| CN109873860A (en) * | 2018-12-31 | 2019-06-11 | 中国科学院软件研究所 | A kind of satellite network resources information storage means, discovery method and system |
| CN110138437A (en) * | 2019-04-03 | 2019-08-16 | 西安建筑科技大学 | Satellite communication network critical link sequence detecting method based on delay performance |
| WO2020001090A1 (en) * | 2018-06-28 | 2020-01-02 | 中兴通讯股份有限公司 | Service path optimization method, apparatus, device, and readable storage medium |
| US20200151289A1 (en) * | 2018-11-09 | 2020-05-14 | Nvidia Corp. | Deep learning based identification of difficult to test nodes |
| CN111224875A (en) * | 2019-12-26 | 2020-06-02 | 北京邮电大学 | Method, device, equipment and storage medium for determining information acquisition and transmission strategy |
| CN112235035A (en) * | 2020-10-08 | 2021-01-15 | 军事科学院系统工程研究院网络信息研究所 | Spatial information network networking method based on distributed constellation |
| CN112600609A (en) * | 2020-11-30 | 2021-04-02 | 中国人民解放军国防科技大学 | Network capacity estimation method of satellite network system |
| CN112733357A (en) * | 2021-01-04 | 2021-04-30 | 西安建筑科技大学 | Heterogeneous space network data transmission task collaborative planning method |
| CN112821940A (en) * | 2021-01-15 | 2021-05-18 | 重庆邮电大学 | Satellite network dynamic routing method based on inter-satellite link attribute |
| CN113364609A (en) * | 2021-04-29 | 2021-09-07 | 西安交通大学 | Multidimensional resource modeling method and system under air-space-ground integrated network |
-
2021
- 2021-10-22 CN CN202111237874.5A patent/CN113992259B/en active Active
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE3044101A1 (en) * | 1979-11-27 | 1981-08-27 | Western Electric Co., Inc., 10038 New York, N.Y. | SATELLITE ARRANGEMENT AND METHOD FOR INCREASING THE RAIN LIMIT OF A MESSAGE SYSTEM |
| CN1121296A (en) * | 1994-03-15 | 1996-04-24 | 日本电气株式会社 | CDMA comminication with a propagation delay between a base and a mobile station taken into account |
| WO2014180447A1 (en) * | 2013-08-20 | 2014-11-13 | 中兴通讯股份有限公司 | Bandwidth map update method and device |
| CN104301966A (en) * | 2014-10-17 | 2015-01-21 | 中国科学院上海微系统与信息技术研究所 | Semi-structured transmission dispatching method orienting wireless sensor network data collection |
| WO2020001090A1 (en) * | 2018-06-28 | 2020-01-02 | 中兴通讯股份有限公司 | Service path optimization method, apparatus, device, and readable storage medium |
| US20200151289A1 (en) * | 2018-11-09 | 2020-05-14 | Nvidia Corp. | Deep learning based identification of difficult to test nodes |
| CN109873860A (en) * | 2018-12-31 | 2019-06-11 | 中国科学院软件研究所 | A kind of satellite network resources information storage means, discovery method and system |
| CN110138437A (en) * | 2019-04-03 | 2019-08-16 | 西安建筑科技大学 | Satellite communication network critical link sequence detecting method based on delay performance |
| CN111224875A (en) * | 2019-12-26 | 2020-06-02 | 北京邮电大学 | Method, device, equipment and storage medium for determining information acquisition and transmission strategy |
| CN112235035A (en) * | 2020-10-08 | 2021-01-15 | 军事科学院系统工程研究院网络信息研究所 | Spatial information network networking method based on distributed constellation |
| CN112600609A (en) * | 2020-11-30 | 2021-04-02 | 中国人民解放军国防科技大学 | Network capacity estimation method of satellite network system |
| CN112733357A (en) * | 2021-01-04 | 2021-04-30 | 西安建筑科技大学 | Heterogeneous space network data transmission task collaborative planning method |
| CN112821940A (en) * | 2021-01-15 | 2021-05-18 | 重庆邮电大学 | Satellite network dynamic routing method based on inter-satellite link attribute |
| CN113364609A (en) * | 2021-04-29 | 2021-09-07 | 西安交通大学 | Multidimensional resource modeling method and system under air-space-ground integrated network |
Non-Patent Citations (3)
| Title |
|---|
| BING DU: "Dynamic Graph Optimization and Performance Evaluation for Delay-Tolerant Aeronautical Ad Hoc Network", IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 69, NO. 9, SEPTEMBER 2021 * |
| 成宝芝;赵春晖;张丽丽;张健沛;: "联合空间预处理与谱聚类的协同稀疏高光谱异常检测", 光学学报 * |
| 窦志斌等: "一种卫星网络中的星地轻量化认证鉴权架构", 一种卫星网络中的星地轻量化认证鉴权架构 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114978279A (en) * | 2022-05-05 | 2022-08-30 | 长春理工大学 | Method for selecting and distributing satellite network cache nodes |
| CN114978279B (en) * | 2022-05-05 | 2023-05-09 | 长春理工大学 | Method for selecting and distributing satellite network cache nodes |
| CN115801093A (en) * | 2022-10-14 | 2023-03-14 | 西安空间无线电技术研究所 | Path planning method for guaranteeing end-to-end deterministic time delay of satellite network |
| 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 |
|---|---|
| CN113992259B (en) | 2023-05-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113992259A (en) | Method for constructing time slot resource expansion diagram | |
| CN109150627A (en) | The construction method mapped based on dynamic resource demand and the virtual network of topology ambiguity | |
| CN106936645B (en) | The optimization method of tree network topology structure based on queueing theory | |
| CN103746852B (en) | Service routing configuration method and network management equipment | |
| CN109446385B (en) | Method for establishing network resource equipment map and using method of equipment map | |
| WO2001071545A2 (en) | Systems and methods for analyzing network traffic | |
| Wang et al. | Cost of not splitting in routing: Characterization and estimation | |
| CN111770019A (en) | Q-learning optical network-on-chip self-adaptive route planning method based on Dijkstra algorithm | |
| CN104320324A (en) | Virtual network mapping method based on link interference | |
| CN107104824A (en) | A kind of network topology determines method and apparatus | |
| CN105515987A (en) | SDN framework based virtual optical network oriented mapping method | |
| EP1798894A1 (en) | A fast simulated annealing for traffic matrix estimation | |
| CN111404815B (en) | Constrained routing method based on deep learning | |
| CN115086202A (en) | Time delay analysis method and system based on network digital twin | |
| CN115333958A (en) | Software defined network performance prediction method and device, electronic equipment and storage medium | |
| CN107947988A (en) | A kind of Real Time Communication Network analogue system | |
| CN113054651B (en) | Network topology optimization method, device and system | |
| CN112333102B (en) | Software defined network routing method and system based on knowledge graph | |
| Li et al. | QoS routing algorithm based on entropy granularity in the network transmission | |
| CN114925523A (en) | Traffic user balance robust optimization method and system based on uncertain supply and demand | |
| CN111369052B (en) | Simplified road network KSP optimization algorithm | |
| CN105917621A (en) | Methods and systems for data routing | |
| CN113992520A (en) | Virtual network resource deployment method and system | |
| CN113392280A (en) | Cross-region-oriented multi-master model distributed graph calculation method | |
| Arakawa et al. | Analyzing and modeling router-level internet topology and application to routing control |
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 |