CN109067453A - The elastic routing algorithm of the unpredictable interruption of satellite DTN network based on space-time graph model - Google Patents
The elastic routing algorithm of the unpredictable interruption of satellite DTN network based on space-time graph model Download PDFInfo
- Publication number
- CN109067453A CN109067453A CN201811165304.8A CN201811165304A CN109067453A CN 109067453 A CN109067453 A CN 109067453A CN 201811165304 A CN201811165304 A CN 201811165304A CN 109067453 A CN109067453 A CN 109067453A
- Authority
- CN
- China
- Prior art keywords
- node
- time
- space
- network
- satellite
- 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.)
- Withdrawn
Links
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/18521—Systems of inter linked satellites, i.e. inter satellite service
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
- H04B7/18519—Operations control, administration or maintenance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/142—Network analysis or design using statistical or mathematical methods
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Aviation & Aerospace Engineering (AREA)
- Astronomy & Astrophysics (AREA)
- Mathematical Analysis (AREA)
- Pure & Applied Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Mathematical Physics (AREA)
- Mathematical Optimization (AREA)
- Algebra (AREA)
- Radio Relay Systems (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The elastic routing algorithm algorithm of the unpredictable interruption of the satellite DTN network that the present invention provides a kind of based on space-time graph model, applied in Information Network, give the mathematical model of specific satellite network parameter and space-time diagram model construction algorithm and routing algorithm, and calculate the capacity and energy expense of satellite network Intersatellite Link, it is satellite network when unpredictable interruption occurs, the transmission problem of data provides a kind of practicable scheme.Example is generated by a specific algorithm, it is effective for demonstrating algorithm proposed by the present invention.Unpredictable interruption elasticity routing algorithm of the invention is able to solve in satellite network unpredictable interruption occurs after, guarantee the normal transmission of data and its energy expense made to reach minimum.So the elastic routing algorithm designed using the present invention can effectively solve unpredictable disruption in satellite network compared to other traditional routing algorithms.
Description
Technical field
The present invention relates to satellite network technical field of data transmission more particularly to a kind of satellite DTN network it is unpredictable in
Disconnected elasticity routing algorithm.
Background technique
Information Network be integrate sky, day, resource integrated information network, since the height of institute's carrying platform is dynamic
State property feature, the data transmission performance of Information Network are largely limited by time-varying network topology.The on-off shape of link
State develops at any time, and network is caused frequently to be cut, and lacks end-to-end path, causes ICP/IP protocol that can not be competent at empty day environment
Data transmission.In recent years, the appearance of DTN (Delay/Disrupt-Tolerant Networking) is to solve empty day network
Reliable data transmission problem provide advantageous opportunity and the solution that can refer to.
DTN is by the interconnection and interoperability between introducing coating (Bundle layer) realization heterogeneous network, favorably
It utilizes in the integration of infrastructure in realization network-wide basis and efficiently；Meanwhile used Store and forword mechanism can ensure that number
According to the reliable transmission in limited network environment (Challenging environment), the variation of network topology is coped with.
For reply Information Network complex environment and overcome the transmission drawback of ICP/IP protocol system in the present context,
For space environment feature, spatial data consulting suggestion committee CCSDS develops the CFDP based on Store and forword mechanism
(CCSDS Files Delivery Protocol) agreement.To improve link utilization efficiency, control signaling interaction, the association are reduced
View takes negative response (NAK) mechanism.CFDP efficiency is higher, is used by more space flight mechanism, however it is to empty day high dynamic
The adaptability of link and mobile access capability are weaker, and need to carry out protocol conversion and could interconnect with ground network, increase agreement
The difficulty of realization.To solve to interrupt the transmission problem frequently and under long delay chain environment, DTN technology is widely used, has assisted
View system mainly includes BP, LTP, Saratoga, LTP-T (LTP Transport) and DTTP (Delay-Tolerant
Transport Protocol) agreement etc..
The thought that space-time diagram is taken is similar to calculus mathematically, using sufficiently small time interval to it is of interest when
Between section carry out it is discrete.In this time interval, the topology of time-varying network is considered as stable (actually discrete interval representative
Network maintains stable minimum time section).Therefore, in each time interval, network can be described with static map G (V, E)
(wherein V, E are respectively node and Bian Ji).Our this series of static map is referred to as the snapshot (Snapshot) of time-varying network, is led to
Crossing these snapshots can be generated corresponding space-time diagram to describe the dynamic topology of time-varying network.
Data transmit time interval of interest and have been divided time interval, connecting each other between topological snapshot interior joint,
The copy that each layer (each topology snapshot) possesses all nodes of network, is added in space-time diagram according to Topology connection situation
Directed edge is divided into time link and space link.Time link is indicated in the node certain time store data inside；Space link
Indicate the connection in physical meaning.Forwarding of the node to data can have not only been indicated by two class directed edges of space-time diagram, but also can be with
The storage management process of data in node is described.Therefore, space-time graph model is highly suitable for portraying using Store and forword machine
The DTN dynamic network of system.
Route technology based on connection: in order to merge ATM network and circuit-switched voice network answering in satellite network
With the route technology of earlier satellite network mainly uses the route pattern based on connection.Wemer et al. is first in LEO satellite net
The concept that ATM network routing is introduced in network, is divided to routing policy to two processes: firstly, using virtual topology method, by consecutive hours
The satellite network of change is discrete to turn to a series of static topologicals, and discrete time piece, which is chosen with the variation of physical topology and linkage length, is
Then foundation calculates the set of paths in all discrete topology sequences between any satellite；Secondly, according to optimization aim from path
Optimal path is selected in set.LEO satellite network model is a series of equal prolonged limited in the system period by Chang et al.
State automata FSA (finite state automata), using the visuality between satellite establish each state can visibility range
Then battle array calculates optimum link distribution mechanism according to flow demand, realize making full use of for finite link resource.
The routing of IP-based distribution: Henderson et al. proposes the distributed routing calculation for LEO satellite network
Method.The basic process of the algorithm is: first centered on purpose satellite, link state flooding is carried out within the scope of certain radius,
Optimal path is calculated using Dijkstra shortest path first；And the routing except range is then opened up using the two-dimentional mesh of network
Feature is flutterred, forwards grouping by the position of destination node.Although also proposed some other IP-based distributed routing algorithm,
Basic routing policy is still identical as DRA, and in addition to the calculating and storage that dramatically reduce routing load, these distributions are calculated
Method can eliminate the influence of satellite failure and flow congestion to a certain extent.
The prior art there are the problem of and defect
What the present invention mainly studied is the unpredictable interruption elasticity routing issue of satellite network, in satellite network, in
It is disconnected to be divided into predictable interrupt and unpredictable interruption.Wherein, predictable interruption can be according to satellite transit track and period forecasting
Planning path avoidance breakout in advance.And unpredictable interruption, such as node damage, link down, memory spilling, hostile interference,
They will destroy the routing planned in network topology, and data lose end-to-end path, may cause transmission in extreme circumstances
Mission failure.If unpredictable interruption occurs for DTN network node, refuse being transferred to for data packet in satellite network, then related road
It will be in the recovery to be interrupted such as local node by the data packet of upper interruption node upper hop node forwarding.Under extreme case, if
Permanent discontinuation, then in preconfigured routing table it is all correlation route breaks, data are in upper hop Node latency mistake
Length will lead to data cannot complete to transmit at the appointed time.Further, since data are surrounded by limitation life cycle, therefore too long
Residence time may result in loss of data.Problem above is solved currently without specific satellite routing algorithm.
Existing concentrated route algorithm can plan distribution data in advance, reach of overall importance optimal of network, most such as time delay
It is short, expense is minimum, handling capacity is maximum etc..But concentrated route algorithm lack to flow congestion, satellite failure, network interruption from
Adaptability.When unpredictable interruption occurs for satellite network, the data on satellite node wait in a network, cause congestion,
Loss of data, network paralysis.Distributed routing algorithm is loaded in addition to the calculating and storage that dramatically reduce routing, can
The influence of satellite failure and flow congestion is eliminated to a certain extent, but their routing decision is confined to local information, it cannot
It is solved these problems from the overall situation.Distributed routing algorithm cannot since the limitation of optimization aim causes routing performance limited
Meet growing multimedia application, such as the needs of voice, Video service, lacks flow equilibrium ability.
Summary of the invention
In order to solve the problems in the prior art, the present invention provides a kind of satellite DTN network based on space-time graph model
The elastic routing algorithm of unpredictable interruption, to solve the unpredictable disruption occurred in satellite network.The present invention is specifically led to
Following technical solution is crossed to realize:
The elastic routing algorithm of the unpredictable interruption of a kind of satellite DTN network based on space-time graph model, firstly, providing satellite
The design parameter of network, and the operating condition of analog satellite is logical in whole cycle to obtain satellite node in STK software
Disconnected situation table；Then, the constructing tactics space-time diagram divided by time slot knows the time link and space link letter of satellite network
Breath；Finally, using the elastic routing algorithm of unpredictable interruption in the space-time diagram.
The beneficial effects of the present invention are: The present invention gives specific satellite network parameters and space-time diagram model construction to calculate
The mathematical model of method and routing algorithm, and the capacity and energy expense of satellite network Intersatellite Link are calculated, it is satellite network
For network when unpredictable interruption occurs, the transmission problem of data provides a kind of practicable scheme.Of the invention can not be pre-
It surveys and interrupts after elastic routing algorithm is able to solve in satellite network unpredictable interruption occurs, guarantee the normal transmission of data and make
Its energy expense reaches minimum.So using the elastic routing algorithm of the invention designed compared to other traditional routing algorithms, it can
Effectively to solve unpredictable disruption in satellite network.
Detailed description of the invention
Fig. 1 is system block diagram of the invention；
Fig. 2 (a) is the static time-varying topology figure of satellite network；
Fig. 2 (b) is the space-time graph model of satellite network of the invention；
Fig. 3 is unpredictable interruption space-time graph model；
Fig. 4 is energy variation under different interruption durations；
Fig. 5 is the time delay under different interruption durations.
Specific embodiment
The present invention is further described for explanation and specific embodiment with reference to the accompanying drawing.
In the present invention, the dynamic characteristic and development law of network topology are accurately portrayed based on time-varying graph model.Space-time diagram
Middle link side right value is respectively link capacity and energy expense, and splits data into the processing of two classes according to network concrete condition, is held
The elastic routing algorithm of the unpredictable interruption of row.
As shown in Figure 1, system block diagram of the invention, firstly, the design parameter of setting satellite network:
No. 2 remote sensing satellites (GF-II) of (1) earth remote sensing satellite --- China's high score, running on height is 631km
Sun-synchronous orbit on, 97.908 ° of inclination angle；
(2) six repeater satellites, constellation are Walker (6/6/4), and wherein seed satellite transit is in being highly
On the circuit orbit of 1414km (using Globalstar orbit altitude), inclination angle is 52 °；
(3) three earth stations are located at the Miyun (40.3 ° of N, 116.8 ° of E) in China, Keshen (39.5 ° of N, 76 ° of E) and three
Sub- (18.2 ° of N, 109.5 ° of E).
The observed object being arranged in experiment be located at Sahara (28 ° of N, 11.5 ° of E) corresponding transformation task be (12:
00 (UTC), 2h), and the operating condition of analog satellite obtains on-off of the satellite node in a whole cycle in STK software
Situation table；Secondly, the constructing tactics time-varying figure (Space-time Graph) divided by time slot, knows the time of satellite network
Link and space link information, and accordingly in space-time diagram using the elastic routing algorithm of unpredictable interruption proposed by the present invention；
Finally under different interrupt conditions, routing cost caused by the routing algorithm is analyzed, to obtain proposed by the invention
Algorithm solve the unpredictable disruption occurred in satellite network.
[space-time diagram construction]
Satellite network is a dynamic network with temporal evolution, node predictable for the characteristics of motion in network
It says, in some timeslice as satellite network can be regarded to a static network, be equivalent to the division for carrying out time slot, obtain a series of
The static topology map of satellite network, as shown in Fig. 2 (a), the dynamic topology of network can use a series of topological structure snapshot
To indicate.But routed according to such topology the problem is that, the static topological model in each timeslice is mutual
It is independent, it simultaneously include topological diagram --- the space-time of time dimension and Spatial Dimension information with one to improve this situation
Graph model (such as Fig. 2 (b) shown in) reflects the dynamic changing process of satellite network node Temporal Evolution, which is by a system
Column static topology map is transformed according to certain rule, is a kind of dynamic topology model.
In space-time diagram Gt=(Vt, Et, Ct, Wt) in, t=0,1,2,3 ..., T define T+1 node layer, and wherein T represents the time
The number of piece, every layer has n node, represents all nodes in satellite network.Node set is used
It indicates, i.e.,Represent i-th of node of t-th of time slot.It is as follows in topological diagram interior joint set expression:
And link set then uses EtIt indicates, contains two types: time link (Time) and space link (Space),
That is Et=(Time, Space).Wherein time link is usedIt indicates, the information for representing i-th of node in t-th of time slot is deposited
Energy storage power.Space link is then usedIt indicates, represents node viIn i-th of time slot and node vjCommunication capacity.According to DTN net
The BP/LTP agreement of network calculates the link capacity c of satellite network Intersatellite Link and satellite-ground linkijWith energy expense wij, will hold
Amount and two weights of the expense as space-time diagram.Here, we are carried out for the connection in 5 time slots by 5 nodes
Explanation.
After carrying out the modeling of time-varying figure to satellite network, according to the BP/LTP agreement of DTN network, satellite network culminant star is calculated
Between the link capacity and energy expense of link and satellite-ground link, using capacity and expense as two weights of space-time diagram.
[space-time diagram developing algorithm]
For given a certain transformation taskIn time interval [t0, t0+ γ] in change in topology.Assuming that network
Node serial number is 1 integer for arriving N, wherein number " 1 " represents source node, number successively represents NG earth station from N-NG+1 to N,
Remaining number successively indicates NS repeater satellite.
It establishes contact table (ConTact Graph, CTG) and describes the activity of link on-off.The structure of CTG is as shown in table 1, wherein
Every a line represents a connection, is abbreviated as ct (nf, nt, tstart, tend).Assuming that there are a suitable time interval τ, (i.e. τ can
To capture the switching point of link on-off) time dimension is separated into multiple time slots, then space-time diagram can as follows from
CTG building.
Table 1 contacts table structure
| Start node | Zhongdao node | Initial time | End time | Other link parameters |
| nf | nt | tstart | tend | Transmission rate, BER |
According to BP/LTP agreement in DTN network, link capacity and energy expense mathematical model are as follows:
The capacity of space link i → j (is denoted as cij)
The unit transmission expense of space link i → j (is denoted as wij)
Wherein, TpropFor propagation delay, PER (PERRS) it is Segment (RS) packet loss, Ts(TRS) it is Segment (RS)
Sending time, RTkIt is retransmitted for k-th of feedback procedure and loses the segment time,For the RS timer of k-th of feedback procedure
Value, cjFor the transmission times of j-th of segment, M is maximum number of times of transmission needed for all segment of transmission, N Bundle
Middle segment sum.
2 space-time diagram developing algorithm of table
[the unpredictable interruption elasticity routing algorithm based on space-time graph model]
For given transformation taskOne group is found in space-time diagram can walking along the street P={ p1... ..., pnUse
It is transmitted in completion data and reaches energy expense minimum, pmFor the set of paths planned in network,To flow through planning in network
The flow in path, wmnFor energy expense needed for unit of transfer's data volume.Routing issue of interest can be described with mathematical form
It is as follows:
Wherein s and d respectively represent source node and destination node.First constraint ensures the data volume etc. from source node s
InSecond constraint is capacity-constrained, flow through some while data volume no more than this while capacity.Third constraint is flow
Confined condition, the data volume (other than source node and destination node) for flowing out node, which is equal to, flows into data volume therein.In space-time diagram
In, cost of energy is the objective function for finding shortest path, then successively updates network capacity until completing remaining data amount.
Assuming that unpredictable interruption occurs in i-th node of the time t on the end-to-end path of task, source is saved
Point, if these data, which have been planned, will be lost to mesh by interrupting node i, the data to be sent at source node in time t
Ground feasible path.In addition, the data that a part is being transmitted will be trapped in those nodes directly connecting with interruption node
On.Therefore Optimized model is divided into two parts,Source node also not sent data when occurring are interrupted,It interrupts direct when occurring
With the data for interrupting node connected node.Preferential optimization regeneration node data, prevents data from occurring congestion in a network, leads to source
The data of node re-optimization can not normal transmission.
(1) relay node
(2) source node
When unpredictable interruption occurs, it is assumed that unpredictable interruption occurs in i point t moment, when duration is len
Gap (assuming that space-time map unit time slot τ can capture the on-off of link and the generation of interruption just) updates space-time diagram.In algorithm
In, capacity and energy expense are defined as two weights on a side by we, and update these weights after interrupting generation.It deletes
The time link of { j N+i → (j+i) N+i | j=k ..., k+len }.Definition jN+i | and j=k ..., k+len } it is that space-time diagram is empty
Between link start node, { jN+i | j=k ..., k+len } is the terminal node of space link, updates space-time diagram.New source section
Point will redistribute the data of these nodes, unpredictable interruption space-time diagram such as Fig. 3 to interrupt the upper hop node before node
It is shown.
The elastic routing algorithm pseudocode of unpredictable interruption is as follows:
The elastic routing algorithm of the unpredictable interruption of table 3
Performance evaluation
Dummy satellite is built: (1) No. 2 remote sensing satellites (GF-II) of an earth remote sensing satellite --- China's high score, operation
In height be 631km sun-synchronous orbit on, 97.908 ° of inclination angle；(2) six repeater satellites, constellation Walker
(6/6/4), wherein on the circuit orbit that height is 1414km (using Globalstar orbit altitude), inclination angle is for seed satellite transit
52°；(3) three earth stations are located at the Miyun (40.3 ° of N, 116.8 ° of E) in China, Keshen (39.5 ° of N, 76 ° of E) and Sanya
(18.2 ° of N, 109.5 ° of E).
4 simulation parameter of table
In emulation, the time of time and all-links is rounded up to immediate integer minute, and start time is " 0 ".
The discrete time intervals that time interval τ is 1 minute.Change and interrupt duration and transmission total amount of data, compares energy expense variation.
Figure 4, it is seen that with the increase of duration of interruption length, energy expense is become much larger, because interrupting
The path than previous smaller energy expense can be found after recovery.The node on least energy cost path occurs when interrupting
When, stop when interrupting, data flow still can be redistributed.On the other hand, since data volume is small, with the change for interrupting duration
Change, energy expense variation is unobvious.
From figure 5 it can be seen that when the amount of data is large, break period length becomes larger, and time delay becomes larger.Because in the middle
When the break period of disconnected node is elongated, the available path in spatial network is reduced.It in this way can be in the transmission data of identical quantity
In the case where increase propagation time delay.
When table 5 shows that break period length is 20 minutes, primary routing table in network and the again path after planning
Table.According to the connection between observing time range interior nodes, it can almost be considered as permanent discontinuation within 20 minutes.It can see
Out, a part of data for interrupting node are transmitted by other relay nodes, lead to longer time delay and bigger network energy
Expense.
5 routing table of table
Table 6 shows the original path that the break period is 1 minute (in a time interval) and again planning path
Compare.Stop it will be seen that once interrupting, plans the different paths to generate, energy again according to elastic routing policy
Amount cost and time delay become smaller.
6 routing table of table
To sum up, the present invention devises a kind of unpredictable interruption elasticity routing of the satellite DTN network based on space-time graph model
Algorithm algorithm is applied in Information Network.Give specific satellite network parameter and space-time diagram model construction algorithm
With the mathematical model of routing algorithm, and the capacity and energy expense of satellite network Intersatellite Link are calculated, is satellite network
When unpredictable interruption occurs, the transmission problem of data provides a kind of practicable scheme.Pass through a specific calculation
Method generates example, and it is effective for demonstrating algorithm proposed by the present invention.Unpredictable interruption elasticity routing algorithm energy of the invention
It enough solves after unpredictable interruption occurs in satellite network, guarantee the normal transmission of data and its energy expense is made to reach minimum.
So the elastic routing algorithm designed using the present invention can effectively solve satellite network compared to other traditional routing algorithms
In unpredictable disruption.
Those skilled in the art of the present technique have been appreciated that in the present invention the various operations crossed by discussion, method, in process
Steps, measures, and schemes can be replaced, changed, combined or be deleted.Further, each with having been crossed by discussion in the present invention
Kind of operation, method, other steps, measures, and schemes in process may also be alternated, changed, rearranged, decomposed, combined or deleted.
Further, in the prior art to have and the step in various operations, method disclosed in the present invention, process, measure, scheme
It may also be alternated, changed, rearranged, decomposed, combined or deleted.
The above description is only a preferred embodiment of the present invention, is not intended to limit the scope of the invention, all utilizations
Equivalent structure or equivalent flow shift made by description of the invention and accompanying drawing content is applied directly or indirectly in other correlations
Technical field, be included within the scope of the present invention.
For those skilled in the art, without departing from the inventive concept of the premise, several letters can also be made
Single deduction or replace, all shall be regarded as belonging to protection scope of the present invention.
Claims (3)
1. a kind of elastic routing algorithm of the unpredictable interruption of satellite DTN network based on space-time graph model, it is characterised in that: first
First, the design parameter of satellite network is provided, and the operating condition of analog satellite obtains satellite node entire in STK software
Break-make situation table in period；Then, by time slot divide constructing tactics space-time diagram, know satellite network time link and
Space link information；Finally, using the elastic routing algorithm of unpredictable interruption in the space-time diagram；Wherein, the routing is calculated
Method: for given transformation taskOne group is found in space-time diagram can walking along the street P={ p1... ..., pnFor completing
Data are transmitted and reach energy expense minimum, pmFor the set of paths planned in network,To flow through planning path in network
Flow, wmnFor energy expense needed for unit of transfer's data volume；Routing issue of interest is described as follows with mathematical form:
Wherein s and d respectively represent source node and destination node,For task data total amount, t0For sending instant, γ is time delay appearance
Degree of bearing；Assuming that unpredictable interruption occurs in i-th node of the time t on the end-to-end path of task, for source node, such as
These data of fruit have been planned in time t by interrupting node i, then the data to be sent at source node will be lost to destination
Feasible path；In addition, the data that a part is being transmitted will be trapped on the node that those directly connect with interruption node；Therefore
Optimized model is divided into two parts,Source node also not sent data when occurring are interrupted,Interrupt occur when directly with interruption
The data of node connected node；Preferential optimization regeneration node data, prevents data from occurring congestion in a network, leads to source node weight
The data newly optimized can not normal transmission, in which:
Relay node
Source node
When unpredictable interruption occurs, it is assumed that unpredictable interruption occurs in i point t moment, and duration is len time slot,
Space-time diagram is updated, and updates these weights after interrupting generation；Delete { j N+i → (j+i) N+i | j=k ..., k+len } when
Between link；Definition { j N+i | j=k ..., k+len } is the start node of space-time diagram space link, and j N+i | j=k ..., k+
Len } be space link terminal node, update space-time diagram；New source node is the upper hop node before interrupting node, will be weighed
Newly distribute the data of these nodes.
2. routing algorithm according to claim 1, it is characterised in that: for given a certain transformation taskWhen
Between section [t0, t0+ γ] in change in topology, establish contact table CTG and describe link on-off activity, wherein every a line represents one
Connection, is abbreviated as ct (nf, nt, tstart, tend), wherein nfFor start node, ntFor Zhongdao node, tstartFor initial time,
tendFor the end time；Assuming that i.e. τ can capture the switching point of link on-off, by the time there are a suitable time interval τ
Dimension is separated into multiple time slots, constructs space-time diagram from CTG；The space-time diagram Gt=(Vt, Et, Ct, Wt) in, t=0,1,2,
3 ..., T defines T+1 node layer, and wherein T represents the number of timeslice, and every layer has n node, represents the institute in satellite network
There is node；Node set is usedIt indicates, i.e.,Represent i-th of node of t-th of time slot；Chain
Road set then uses EtIt indicates, contains two types: time link Time and space link Space, i.e. Et=(Time,
Space)；According to the BP/LTP agreement of DTN network, the link capacity c of satellite network Intersatellite Link and satellite-ground link is calculatedijWith
Energy expense wij, using capacity and expense as two weights of space-time diagram.
3. routing algorithm according to claim 1, it is characterised in that: the design parameter of the satellite network includes a ground
Ball remote sensing satellite, six repeater satellites and three earth stations.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811165304.8A CN109067453A (en) | 2018-09-30 | 2018-09-30 | The elastic routing algorithm of the unpredictable interruption of satellite DTN network based on space-time graph model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811165304.8A CN109067453A (en) | 2018-09-30 | 2018-09-30 | The elastic routing algorithm of the unpredictable interruption of satellite DTN network based on space-time graph model |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109067453A true CN109067453A (en) | 2018-12-21 |
Family
ID=64767202
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811165304.8A Withdrawn CN109067453A (en) | 2018-09-30 | 2018-09-30 | The elastic routing algorithm of the unpredictable interruption of satellite DTN network based on space-time graph model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109067453A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110896557A (en) * | 2019-12-23 | 2020-03-20 | 北京邮电大学 | Satellite communication routing method and device |
| CN111405654A (en) * | 2020-03-22 | 2020-07-10 | 西安电子科技大学 | Information transmission method between high dynamic wireless nodes |
| CN111726338A (en) * | 2020-05-19 | 2020-09-29 | 中国科学院信息工程研究所 | Link flooding attack protection method and device |
| CN111970044A (en) * | 2020-08-15 | 2020-11-20 | 哈尔滨工业大学（威海） | Satellite network time slot allocation and routing planning method based on Lagrange relaxation |
| CN112134611A (en) * | 2020-09-10 | 2020-12-25 | 中国人民解放军空军工程大学 | Multilayer satellite network modeling and simulation analysis method based on time reachability graph |
| CN112821940A (en) * | 2021-01-15 | 2021-05-18 | 重庆邮电大学 | Satellite network dynamic routing method based on inter-satellite link attribute |
| CN113067627A (en) * | 2021-03-18 | 2021-07-02 | 西安电子科技大学 | Self-adaptive survivable satellite routing method based on virtual nodes |
| CN114157337A (en) * | 2021-11-02 | 2022-03-08 | 西安电子科技大学 | Low-orbit satellite inter-satellite switching prediction method based on time-varying graph |
| CN115276759A (en) * | 2022-06-21 | 2022-11-01 | 重庆邮电大学 | Double-layer satellite network connection plan design method based on weighted space-time diagram |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102982209A (en) * | 2012-12-03 | 2013-03-20 | 哈尔滨工业大学深圳研究生院 | Space network visual simulation system and method based on HLA (high level architecture) |
| CN104821844A (en) * | 2015-05-21 | 2015-08-05 | 哈尔滨工业大学 | Time slot optimization-based double-layer satellite network routing method |
| CN106209624A (en) * | 2016-07-12 | 2016-12-07 | 哈尔滨工业大学深圳研究生院 | Earth observation satellite network minimal-overhead method for routing based on space-time diagram |
| CN107346988A (en) * | 2017-06-20 | 2017-11-14 | 大连大学 | A kind of appearance based on low-track satellite network late/hold circuit network route computing method |
| CN107370536A (en) * | 2017-07-19 | 2017-11-21 | 哈尔滨工业大学深圳研究生院 | Satellite network multi-broadcast routing method and system based on minimum connected dominating set |
-
2018
- 2018-09-30 CN CN201811165304.8A patent/CN109067453A/en not_active Withdrawn
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102982209A (en) * | 2012-12-03 | 2013-03-20 | 哈尔滨工业大学深圳研究生院 | Space network visual simulation system and method based on HLA (high level architecture) |
| CN104821844A (en) * | 2015-05-21 | 2015-08-05 | 哈尔滨工业大学 | Time slot optimization-based double-layer satellite network routing method |
| CN106209624A (en) * | 2016-07-12 | 2016-12-07 | 哈尔滨工业大学深圳研究生院 | Earth observation satellite network minimal-overhead method for routing based on space-time diagram |
| CN107346988A (en) * | 2017-06-20 | 2017-11-14 | 大连大学 | A kind of appearance based on low-track satellite network late/hold circuit network route computing method |
| CN107370536A (en) * | 2017-07-19 | 2017-11-21 | 哈尔滨工业大学深圳研究生院 | Satellite network multi-broadcast routing method and system based on minimum connected dominating set |
Non-Patent Citations (1)
| Title |
|---|
| NAN HE 等: "A Space-Time Graph Based Unpredictable Interruptions-Resilient Routing Algorithm in Satellite Disruption-Tolerant Networks", 《WIRELESS INTERNET》 * |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110896557A (en) * | 2019-12-23 | 2020-03-20 | 北京邮电大学 | Satellite communication routing method and device |
| CN111405654B (en) * | 2020-03-22 | 2021-08-20 | 西安电子科技大学 | Information transmission method between high dynamic wireless nodes |
| CN111405654A (en) * | 2020-03-22 | 2020-07-10 | 西安电子科技大学 | Information transmission method between high dynamic wireless nodes |
| CN111726338A (en) * | 2020-05-19 | 2020-09-29 | 中国科学院信息工程研究所 | Link flooding attack protection method and device |
| CN111726338B (en) * | 2020-05-19 | 2021-07-13 | 中国科学院信息工程研究所 | Link flooding attack protection method and device |
| CN111970044A (en) * | 2020-08-15 | 2020-11-20 | 哈尔滨工业大学（威海） | Satellite network time slot allocation and routing planning method based on Lagrange relaxation |
| CN112134611A (en) * | 2020-09-10 | 2020-12-25 | 中国人民解放军空军工程大学 | Multilayer satellite network modeling and simulation analysis method based on time reachability graph |
| CN112821940A (en) * | 2021-01-15 | 2021-05-18 | 重庆邮电大学 | Satellite network dynamic routing method based on inter-satellite link attribute |
| CN113067627A (en) * | 2021-03-18 | 2021-07-02 | 西安电子科技大学 | Self-adaptive survivable satellite routing method based on virtual nodes |
| CN114157337A (en) * | 2021-11-02 | 2022-03-08 | 西安电子科技大学 | Low-orbit satellite inter-satellite switching prediction method based on time-varying graph |
| CN114157337B (en) * | 2021-11-02 | 2022-08-19 | 西安电子科技大学 | Low-orbit satellite inter-satellite switching prediction method based on time-varying graph |
| CN115276759A (en) * | 2022-06-21 | 2022-11-01 | 重庆邮电大学 | Double-layer satellite network connection plan design method based on weighted space-time diagram |
| CN115276759B (en) * | 2022-06-21 | 2024-02-02 | 重庆邮电大学 | Double-layer satellite network connection plan design method based on weighted space-time diagram |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109067453A (en) | The elastic routing algorithm of the unpredictable interruption of satellite DTN network based on space-time graph model | |
| Lai et al. | Starperf: Characterizing network performance for emerging mega-constellations | |
| Araniti et al. | Contact graph routing in DTN space networks: overview, enhancements and performance | |
| US5654958A (en) | System and method for learning and dynamic routing of data in a mobile communication network | |
| Rao et al. | Agent-based load balancing routing for LEO satellite networks | |
| Fischer et al. | Predictable mobile routing for spacecraft networks | |
| CN105227483A (en) | Based on the low complex degree Load Balance Routing Algorithms of LEO satellite network | |
| Tang | Dynamically adaptive cooperation transmission among satellite-ground integrated networks | |
| CN106685834A (en) | Trusted routing method based on medium earth orbit/low earth orbit network | |
| Jiang et al. | A space–time graph based multipath routing in disruption-tolerant earth-observing satellite networks | |
| CN113315569B (en) | Satellite reliability routing method and system with weighted link survival time | |
| CN105471493A (en) | Multi-measure routing method applicable to double-layer satellite network | |
| CN109586785B (en) | Low-orbit satellite network routing strategy based on K shortest path algorithm | |
| CN106452555A (en) | Multi-path optimization algorithm planning method based on medium and low earth orbit satellite network | |
| CN110266368A (en) | Incorporate information network emulation mode based on cloud platform | |
| Barroca et al. | Improving message delivery in UAV-based delay tolerant networks | |
| CN107276663B (en) | Satellite network snapshot route optimization method | |
| CN114422018B (en) | Satellite network simulation system, testing method, testing device, storage medium and product | |
| CN115333606B (en) | Distributed coded data downloading and repairing method for low-orbit constellation storage network | |
| CN113507722A (en) | Implementation method of NS 3-based platform for controlling congestion of low-orbit satellite | |
| Liu et al. | Routing for predictable multi-layered satellite networks | |
| Zhou et al. | Adaptive Routing Strategy Based on Improved Double Q‐Learning for Satellite Internet of Things | |
| Liang et al. | The effect of routing under local information using a social insect metaphor | |
| CN107302396A (en) | Network route planning method between dynamic star based on mixed strategy | |
| CN117041132B (en) | Distributed load balancing satellite routing method based on deep reinforcement learning |
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 | ||
| WW01 | Invention patent application withdrawn after publication | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20181221 |