CN106100719B - Moonlet network efficient resource dispatching method based on earth observation task - Google Patents
Moonlet network efficient resource dispatching method based on earth observation task Download PDFInfo
- Publication number
- CN106100719B CN106100719B CN201610394928.1A CN201610394928A CN106100719B CN 106100719 B CN106100719 B CN 106100719B CN 201610394928 A CN201610394928 A CN 201610394928A CN 106100719 B CN106100719 B CN 106100719B
- Authority
- CN
- China
- Prior art keywords
- satellite
- link
- time slot
- node
- ground
- 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.)
- Active
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/1851—Systems using a satellite or space-based relay
Abstract
The invention discloses a kind of moonlet network efficient resource dispatching method based on earth observation task, it solves in resource-constrained moonlet network earth observation scene since scheduling process does not fully consider Internet resources, leads to the problem that end-to-end handling capacity is low, efficient network resource usage is low.Realization process are as follows: establish node serial number according to network initial topology, while initializing network resource scheduling planning time collection；Ground control centre solves the corresponding maximum independent set of the conflict graph, obtains network non-conflict scheduling link set according to current network state and scheduling of resource conflict constraint construction link scheduling conflict graph；Using the link set, using the Resource Allocation Formula and data transfer mode of linear programming for solution peak optimizating network benefit, until cut-off time slot.The present invention improves resource utilization, improves vital task data back efficiency, improves moonlet earth observation network performance, the scheduling of resource for the transmission of earth observation systems data efficient.
Description
Technical field
The invention belongs to technical field of satellite communication, relate generally to the Lothrus apterus allocation plan and data transmission of spaceborne resource
Mode is made rational planning for, specifically a kind of moonlet network efficient resource dispatching method based on earth observation task, can
For moonlet network earth observation systems.
Background technique
Compared to the earth observation network relayed by geosynchronous satellite, moonlet network because be distributed in low layer track,
Therefore there are the characteristics such as low time delay, low pathloss and low-power to obtain the extensive concern of people in recent years, becomes satisfaction
One indispensable platform establishment construct of the more and more earth observation mission requirements of people.In addition, by between moonlet
Cooperation, improve observation data back efficiency so that when certain observation moonlet need observe data back to
The observation data when earth station for establishing link with it may be not present, can be transmitted to by face by the inter-satellite link between moonlet
Other can establish the moonlet of communication link with earth station, so that data back will be quickly observed to ground, meanwhile, it releases
The storage resource of the observation moonlet can carry out more observation missions, to promote the level of resources utilization of network.
But since spaceborne storage resource, energy resource, the transceiver number on moonlet are limited and earth station's quantity
It is limited, cause moonlet network to become the network being discontinuously connected to, is not necessarily present transmission path end to end, i.e. Current observation is small
After the data that moonscope is transmitted to observation point, it is not necessarily present the path for transferring data to earth station, but needs little Wei
Star stores the observation data, could be by data back to earth station when until star path is set up.In addition,
For a period of time, the observation mission demand of network is different, also, different observation missions correspond to different priority, and different nets
Network Topology connection state, satellite battery state of charge and free memory determine the corresponding transmission side data of task again
Formula, therefore, in order to efficiently utilize the various resources (antenna, transceiver, energy, storage) in network, so that at one section
Time, the task data as much as possible that priority is high passed back to earth station, it would be highly desirable to design a kind of efficient scheduling of resource side
Method.
The comparison forward position proposed for the resource scheduling of the satellite network with interrupted connection characteristic, current research person
Method have following two: the first is that the authors such as J.Fraire deliver on IEEE Communications Magazine
“Design Challenges in Contact Plans for Disruption-tolerant Satellite
The Topology Control Algorithm mentioned in Networks ", the algorithm is by utilizing time expander graphs and satellite node motion profile can
The Topology connection state of network Satellite node in each time slot in one period is modeled as a static map by predictability,
And calculated on the static map and any one node in network is kept to be connected to the initial time in the period with finish time,
The minimum cost link of required foundation, to reduce the wasting of resources caused by the maintenance of unnecessary link；It is for second
" the Topology Control for that the authors such as M.Huang deliver on IEEE Transactions on Computers
The opening up based on fairness mentioned in Time Evolving and Predictable Delay-tolerant Networks "
Planning algorithm is flutterred, the factor which is limited in view of the spaceborne transceiver resources of network Satellite node (is not visual
Node to centainly can establish communication link, a satellite node can only be built in a time slot with other satellite node
Vertical inter-satellite link), characteristic can be predicted according to satellite node motion profile, describe network in a period using time expander graphs
Interior joint each time slot topology status, and the number of links of communication, while support chain can be established in maximization network
It is target that fairness (so that each pair of visible elements have relatively impartial link establishment chance in a period of time) is established on road,
Calculate practicable topology planning in network during this period of time.
But above two resource regulating method does not account for spaceborne energy and storage resource is limited, moreover, not having yet
Consider specific mission requirements, only from the scheduling strategy of network topology angle research link in network, is not particularly suited for existing
Some satellite systems, so that above two strategy may can only transmit a small amount of business in the case where executing actual task conditions of demand.
Summary of the invention
The purpose of the present invention is the deficiencies of the moonlet network resource regulating method for current forward position, propose that one kind is based on
The moonlet network efficient resource dispatching method of earth observation task, to efficiently use spaceborne resource, and then will be more more important
Observation mission data are transferred to earth station.
The present invention is a kind of moonlet network efficient resource dispatching method based on earth observation task, which is characterized in that
Include the following steps:
(1) initialization network parameter, ground control centre are seen according to satellite node, ground tiny node and the task in network
The longitude and latitude that measuring point is presently in respectively is numbered network Satellite node, ground tiny node and task observation point；
(2) time slot divides, and the time collection Γ that given network resource scheduling is planned=1,2 ... i...T }, wherein 0 is the 0th
A time slot, i.e. initial slot, i indicate i-th of time slot, each time slot be it is isometric, Δ t is slot length, and initialization is current
Time slot t=0；
(3) acquisition of topological structure, in current time slots t, ground control centre obtains the battery status of all satellite nodes
And the mission requirements at current time, while obtain the time slot and next time slot network topological structure G (E (t), V (t)) and
G (E (t+1), V (t+1)), wherein E (t) and V (t) be respectively link set and node set in time slot t, and network is opened up
It flutters and is kept constant in each time slot；
(4) according to the topological structure G of time slot t (E (t), V (t)) and the energy state of satellite, satellite-ground link set is calculated
Esg(t) value of the link in；
(5) the satellite-ground link set for obtaining non-conflict scheduling, constructs the satellite-ground link scheduling conflict figure CG of time slot tg(Eg
(t),Vg(t)), wherein the link in the node respective links set in conflict graph, node value are equal to respective links set
In link value, and then solve the conflict graph it is corresponding with maximum node value independent sets, obtain non-conflict scheduling
Satellite-ground link set Encsg(t)；
(5a) constructs the node set in satellite-ground link conflict graph: by satellite-ground link set Esg(t) it corresponds in conflict graph
Node set；
Line set in (5b) construction satellite-ground link conflict graph: judge that certain both links whether there is in satellite-ground link set
Conflict relationship, when a certain satellite can establish satellite-ground link with other Liang Ge earth stations or some earth station can be same simultaneously
When establishing satellite-ground link with other two satellites, conflict exists, then between node pair corresponding in conflict graph plus a line,
Conversely, not edged between the node pair；
(5c) is according to the satellite-ground link conflict graph CG of constructiong(Eg(t),Vg(t)), solving has the only of maximum node value
Vertical collection, according to the one-to-one relationship of node collection and link set, obtains the satellite-ground link set E of non-conflict schedulingncsg(t)；
(6) according to the star of the topological structure G of time slot t (E (t), V (t)), the energy state of satellite and non-conflict scheduling
Link set Encsg(t), inter-satellite link set E is calculatedss(t) value of the link in；
(7) the inter-satellite link set for obtaining non-conflict scheduling, constructs the inter-satellite link scheduling conflict figure CG of time slot ts(Es
(t),Vs(t)), wherein the link in the node respective links set in conflict graph, node value are equal to respective links set
In link value, and then solve the conflict graph it is corresponding with maximum node value independent sets, to obtain Lothrus apterus tune
The inter-satellite link set E of degreencss(t)；
(7a) constructs the node set V in inter-satellite link conflict graphs(t): by link set Ess(t) it corresponds in conflict graph
Node set；
(7b) constructs the line set E in inter-satellite link conflict graphs(t): judging that certain both links is in inter-satellite link set
No there are conflict relationships, that is, inter-satellite link can be established with other two satellites simultaneously by judging whether there is a certain satellite, if depositing
Then adding a line between node pair corresponding in conflict graph, conversely, side is not present between the node pair；
(7c) is according to the inter-satellite link conflict graph CG of constructions(Es(t),Vs(t)), solving has the only of maximum node value
Vertical collection, and then obtain the inter-satellite link set E of non-conflict schedulingncss(t)；
(8) transmission mode that business datum is solved by linear programming, according to the satellite-ground link set of non-conflict scheduling
Encsg(t) and inter-satellite link set Encss(t) and the energy state of current time slots initial time network Satellite node and storage
Status information is solved in current time slots t using maximization network income as the linear programming of target, is obtained in current time slots business number
According to corresponding transmission mode；
(9) at the end of time slot t, using the state of satellite battery and storage state as next time slot t+1 initial time
The initial value of satellite battery state and storage state；
(10) t=t+1 is enabled, while judging whether t is equal to T:
If t=T, algorithm has gone to the last one time slot, terminates to the scheduling process of moonlet Internet resources；
If t ≠ T, (3) are thened follow the steps, continue the topological structure for obtaining latter two time slot, carry out new round operation, until
The last one time slot is reached, the scheduling to moonlet Internet resources is completed.
The present invention is limited for spaceborne storage resource, energy resource, the transceiver number on moonlet and earth station's number
The problem of amount is limited and data transfer path is caused to be not present, in conjunction with difference and the observation mission institute of network observations mission requirements
The difference of corresponding priority, propose antenna in a kind of efficient dispatch network, transceiver, energy, storage resource method, mention
The level of resources utilization for having risen network improves the efficiency of observation data back.
Compared with the prior art, the invention has the following advantages:
1) present invention considers actual earth observation task scene, carries out Internet resources tune according to specific mission requirements
More vital tasks can be passed back to earth station in a period of time, to improve net by the reasonable efficient utilization of resources by degree
Network benefit.
2) present invention considers spaceborne energy resource limited features, due to period of satellite appears in the back and sun of the earth
Face, when being in sunny side, satellite can absorb energy by solar panel, and store it in battery, conversely, being in the back
When, satellite can only consume the electricity of battery, and the time that low-orbit satellite is in the earth back is about the 30% of its period, and
Satellite sending and receiving data and observation mission are required to consumption energy, however the remaining capacity of satellite battery cannot be below its trouble free service
Energy threshold, therefore the capacity factor that studies a question has realistic meaning very much, in addition, invention also contemplates that spaceborne storage resource by
Characteristic is limited, the influence that storage resource transmits data is had studied.
3) characteristic of cycle movement can be predicted using satellite trajectory by the present invention, model moonlet earth observation net by figure
Network and then establishes link circuit resource scheduling conflict figure by the figure in the topology status of each time slot, by solving to the conflict graph
Maximum independent set obtains link non-conflict scheduling solution, solved under the Lothrus apterus network topology to the greatest extent will likely be more transmission it is important
Task data is transferred to the data transfer mode of earth station, realizes and effectively improves net effect while resource Lothrus apterus calls
Benefit.
4) characteristic of cycle movement can be predicted according to satellite trajectory by the present invention, realize Internet resources point in a period of time
The algorithm matched, by iterating to from initial time slot, end time slot acquires a period of time resource Lothrus apterus allocation plan and data pass
Defeated mode effectively reduces the algorithm complexity of the entire period resource allocation of unified planning and data transfer mode.
Detailed description of the invention
Fig. 1 is realization overall flow figure of the invention；
Fig. 2 is link value calculation process sub-process figure in the present invention；
Fig. 3 is that link conflict graph construction and independent sets choose schematic diagram in the present invention, wherein figure (a) is the network of t time slot
Topological diagram, figure (b) are satellite-ground link conflict graph CGsg(t), figure (c) is satellite-ground link conflict graph CGss(t)；
Fig. 4 is to obtain optimal data transmission process sub-process figure by solving linear programming in the present invention.
Specific embodiment
With reference to the accompanying drawing, the present invention is described in detail.
The spaceborne of moonlet is not fully taken into account for existing in the moonlet network resource regulating method in current forward position
The problems such as storage resource, energy resource, transceiver number factor, the present invention proposes a kind of little Wei based on earth observation task
StarNet's network efficient resource dispatching method.
Embodiment 1
The present invention is a kind of moonlet network efficient resource dispatching method based on earth observation task, referring to Fig.1, this hair
It is bright that the specific implementation steps are as follows:
(1) initialization network parameter, ground control centre determine nodes according to the earth observation scene studied
Type and number, the longitude and latitude difference being presently according to satellite node, ground tiny node and the task observation point in network
Network Satellite node, ground tiny node and task observation point are numbered.
(2) time slot divides, and the time collection Γ that the given network resource scheduling in ground control centre is planned=1,2,
... i...T }, wherein 0 be the 0th time slot, i.e. initial slot, i indicate i-th of time slot, each time slot be it is isometric, Δ t is
Slot length initializes current time slots t=0.
(3) acquisition of topological structure, in current time slots t, ground control centre obtain all satellite nodes battery status,
The mission requirements of storage state, Observation Service data volume and current time, while obtaining the time slot and next time slot network
Topological structure G (E (t), V (t)) and G (E (t+1), V (t+1)), wherein E (t) and V (t) are respectively the link set in time slot t
Conjunction and node set, and the topology of network is kept constant in each time slot.
(4) according to the topological structure G of time slot t (E (t), V (t)) and the energy state of satellite, satellite-ground link set is calculated
Esg(t) value of the link in.
(5) the satellite-ground link set for obtaining non-conflict scheduling, constructs the satellite-ground link scheduling conflict figure CG of time slot tg(Eg
(t),Vg(t)), the wherein link in the node respective links set in conflict graph, so its node value is link set
In link value, by conflict graph node value be compared, so that the maximum independent set in conflict graph is selected, according to section
The corresponding relationship of point and link, obtains the satellite-ground link set E of non-conflict schedulingncsg(t), the present invention passes through in conflict graph
Node set indicates former topological diagram link and completes the construction of line set so that between satellite-ground link according to link conflict relationship
Conflict relationship it is apparent, facilitate the construction of non-conflict scheduling figure.
(5a) constructs the node set in satellite-ground link conflict graph: if Fig. 3 (a) is the network that t time slot initial time obtains
Topological structure characterizes the associated arguments and link that may be present of satellite node and ground tiny node, now by star ground chain therein
Road set Esg(t)={ 1,2,3,4 } correspond to Fig. 3 (b) satellite-ground link conflict graph CGsg(t) the node set V ins(t)=1,
2,3,4}.If Fig. 3 (b) interior joint 1 and 4 corresponds to the satellite-ground link 1 and 4 in Fig. 3 (a), Fig. 3 (b) interior joint 2 and 3 corresponds to
Satellite-ground link 2 and 3 in Fig. 3 (a).
Line set in (5b) construction satellite-ground link conflict graph: judge that certain both links whether there is in satellite-ground link set
Conflict relationship, that is, judge whether a certain satellite can establish satellite-ground link or some ground with other Liang Ge earth stations simultaneously
Face station can establish satellite-ground link with other two satellites simultaneously, and if it exists, then add between node pair corresponding in conflict graph
A line, conversely, side is not present between the node pair, such as Fig. 3 (a) Satellite nodeCan simultaneously and earth stationIt establishes
Link, then it is assumed that there are conflict relationship between satellite-ground link 1 and 2, corresponding in Fig. 3 (b) need to add between node 1 and node 2
One line similarly also needs to connect node 3 and node 4, the final line set E for obtaining conflict graphs(t).As saved in Fig. 3 (b)
Side between point 1 and 2 indicates there is conflict in Fig. 3 (a) between satellite-ground link 1 and 2, the side table between Fig. 3 (b) interior joint 3 and 4
There is conflict in diagram 3 (a) between satellite-ground link 3 and 4.
(5c) is according to the satellite-ground link conflict graph CG of constructiong(Eg(t),Vg(t)), solving has the only of maximum node value
Vertical collection, according to the one-to-one relationship of node collection and link set, obtains the satellite-ground link set E of non-conflict schedulingncsg(t).Fig. 3
(b) non-conflict scheduling link set includes satellite-ground link 2 and 3, i.e. E inncsg(t)={ 2,3 }.
(6) according to the star of the topological structure G of time slot t (E (t), V (t)), the energy state of satellite and non-conflict scheduling
Link set Encsg(t), inter-satellite link set E is calculatedss(t) value of the link in.
(7) the satellite-ground link set for obtaining non-conflict scheduling, constructs the inter-satellite link scheduling conflict figure CG of time slot ts(Es
(t),Vs(t)), wherein the link in the node respective links set in conflict graph, node value are equal to respective links set
In link value, and then solve the conflict graph it is corresponding with maximum node value independent sets, to obtain Lothrus apterus tune
The inter-satellite link set E of degreencss(t)。
(7a) constructs the node set V in inter-satellite link conflict graphs(t): by link set Ess(t) it corresponds in conflict graph
Node set, such as Fig. 3 (a), now by satellite-ground link set E thereinsg(t)={ 5,6,7,8 } correspond to chain between Fig. 3 (c) star
Road conflict graph CGss(t) the node set V ins(t)={ 5,6,7,8 }.As the node 5 and 7 in Fig. 3 (c) corresponds in Fig. 3 (a)
Inter-satellite link 5 and 7, the node 6 and 8 in Fig. 3 (c) corresponds to the inter-satellite link 6 and 8 in Fig. 3 (a).
(7b) constructs the line set E in inter-satellite link conflict graphs(t): judging that certain both links is in inter-satellite link set
No there are conflict relationships, that is, inter-satellite link can be established with other two satellites simultaneously by judging whether there is a certain satellite, if depositing
Then adding a line between node pair corresponding in conflict graph, conversely, side is not present between the node pair, example is referring to Fig. 3
(a) figure SatelliteCan simultaneously and satelliteIt establishes the link, then a company need to be added by corresponding to (c) figure interior joint 5 and node 6
Line indicates that there are conflict relationships between inter-satellite link 5 and 6, gradually obtain the line set of inter-satellite link conflict graph in this manner
Es(t).If the side between Fig. 3 (c) interior joint 5 and 6 indicates there is conflict between Fig. 3 (a) Intersatellite Link 5 and 6, in Fig. 3 (b)
Side between node 6 and 7 indicates there is conflict in Fig. 3 (a) between satellite-ground link 6 and 7, the side between Fig. 3 (c) interior joint 7 and 8
Indicate there is conflict between Fig. 3 (a) Intersatellite Link 7 and 8.
(7c) is according to the inter-satellite link conflict graph CG of constructions(Es(t),Vs(t)), solving has the only of maximum node value
Vertical collection, and then obtain the inter-satellite link set E of non-conflict schedulingncss(t).E in Fig. 3 (c)ncss(t)={ 5,7 }.
(8) according to the satellite-ground link set E of non-conflict schedulingncsg(t) and inter-satellite link set Encss(t) when and current
The energy state and storage state information of gap initial time network Satellite node are solved in current time slots t with maximization network
Income is the linear programming of target, is obtained in the corresponding transmission mode of current time slots business datum.
(9) at the end of time slot t, using the state of satellite battery and storage state as next time slot t+1 initial time
The initial value of satellite battery state and storage state.
(10) t=t+1 is enabled, while judging whether t is equal to T:
If t=T, algorithm has gone to the last one time slot, terminates to the scheduling process of moonlet Internet resources；
If t ≠ T, then follow the steps (3), reacquire network topology structure, carries out new round operation.
The present invention considers actual earth observation task scene, carries out network resource scheduling according to specific mission requirements,
By the reasonable efficient utilization of resources, more vital tasks can be passed back to earth station in a period of time, improve utilization of resources effect
Rate promotes network trap.
Embodiment 2
Moonlet network efficient resource dispatching method based on earth observation task is with embodiment 1, below with reference to specific meter
It calculates again to the detailed description of the invention.Referring to Fig. 1, specific steps include:
Step 1, initialization step, i.e. ground control centre are according to satellite node, ground tiny node and the task in network
The longitude and latitude that observation point is presently in respectively is numbered network Satellite node, ground tiny node and task observation point.
(1a) gives satellite network scene: having N in networksObservation moonlet, NgA earth station, NoA observation point and 1
Ground data center dc, S are observation moonlet set, and G is earth station's set, and O is observation point set.
Geographical location according to locating for moonlet, earth station and observation point in initial network (1b), from 900 east longitude 00 of north latitude
Start, along weft from north to south, warp from east to west, successively gives corresponding node number, then corresponding node set respectively
Are as follows: moonlet set S=1,2 ..., Ns, earth station set G=1,2 ..., NgAnd observation point set O=1,2 ...,
No}。
The time collection Γ of (1c) given network resource scheduling planning=1,2 ... i...T }, wherein 0 is the 0th time slot,
That is initial slot, i indicate i-th of time slot, each time slot be it is isometric, Δ t is slot length, initialize current time slots t=
0。
Step 2, in current time slots t, ground control centre obtains battery status and the current time of all satellite nodes
Mission requirements, while obtaining the network topology G (E (t+ of time slot network topology G (E (t), V (t)) and next time slot
1), V (t+1)), wherein E (t) and V (t) is respectively link set and node set in time slot t, and the topology of network is every
A time slot is kept constant.
The ground control centre (2a) obtains the battery shape of all satellite nodes in network in the initial time of current time slots t
State: EB (t)={ EB1(t),...,EBi(t),...EBNs(t)}。
The topological structure G (E (t), V (t)) and next time slot t+ of the ground control centre (2b) acquisition current time slots t network
The topological structure G (E (t+1), V (t+1)) of 1 network, wherein V (t) ∈ S ∪ G ∪ O, E (t) are the link set in network, work as section
When point is to being in visual range each other, that is, thinks that link exists, just the link is included in set E (t), conversely, the chain
Road is not comprised in set E (t), further, since being wire link between earth station and ground data center, therefore, it is considered that ground
Link between face station and ground data center exists always.
The business demand obtained in current time slots t is carved in the ground control centre (2c), if observation point o ∈ O is in certain observation
Within the scope of the observing capacity of satellite, then it is r (f that the observation satellite obtains task data amount in the time sloto(t)) 0 >, conversely,
In the time slot, there is no the satellites being observed to observation point o ∈ O, i.e., obtain without the task data to observation point o ∈ O
Take process, r (fo(t))=0.
Step 3, according to the topological structure G of time slot t (E (t), V (t)) and the energy state of satellite, satellite-ground link is calculated
Set Esg(t) value of the link in.
Referring to Fig. 2, this step is implemented as follows:
(3a) judges satellite-ground link according to the topological structure G (E (t), V (t)) of time slot tIn satellite node
I whether there is inter-satellite link, and if it exists, the then satellite factor η of satellite-ground linki(t)=1, conversely, ηi(t)=0, example is referring to figure
Satellite-ground link in 3 (a)Satellite nodeThere are inter-satellite link, then η2(t)=1；And satellite-ground linkSatellite node
There is no inter-satellite link, then η1(t)=0.
(3b) calculates satellite i in the initial time energy state factor of time slot t according to the following formula
Wherein EBimaxFor the battery capacity of satellite i,Satellite i is indicated in time slot t-1 finish time, i.e. time slot t's is first
The battery dump energy at moment beginning,Indicate satellite i in the systemic solar energy of time slot t,Indicate solar-electricity
Absorption power of the pond plate in time slot t.
(3c) calculates satellite-ground link set E according to the following formulasg(t) the link value in:
WhereinFor in time slot t, the value of the satellite-ground link of satellite i and earth station j, wg1Indicate satellite i in t time slot
Weight shared by initial time battery status and battery capacity ratio, wg2Indicate that there are the weights shared by the factor for inter-satellite link, and
wg1+wg2=1.Example is referring to Fig. 3 (a), satellite nodeIn t time slot initial time remaining capacity hundred
Point ratio is respectively Work as weight factor
wg1=0.6, wg2When=0.4, the link value that can be calculated satellite-ground link 1 isSimilarly
The link value that remaining satellite-ground link can successively be calculated, by the way that link is corresponded to the node in conflict graph, and then can be rushed
The value of prominent figure interior joint is followed successively by WhereinIndicate node i
Value, marked in Fig. 3 (b).
Real network scene Satellite observation mission and sending and receiving data are required to consumption energy, and when remaining capacity is lower than energy
Satellite cannot work normally when measuring thresholding.The factor that the present invention combines spaceborne energy resource to be limited, rationally carries out the utilization of resources
And task schedule, it has ensured the normal operating conditions of satellite, while improving network trap and resource utilization, has had good
Realistic meaning.
Step 4, the satellite-ground link scheduling conflict figure CG of time slot t is constructedg(Eg(t),Vg(t)), the wherein node in conflict graph
Link in respective links set, node value is equal to the link value in respective links set, and then solves the conflict graph
The corresponding independent sets with maximum node value, to obtain the satellite-ground link set E of non-conflict schedulingncsg(t)。
Referring to Fig. 3, this step is implemented as follows:
(4a) constructs the node set in satellite-ground link conflict graph: by satellite-ground link set Esg(t) it corresponds in conflict graph
Node set.
Line set in (4b) construction satellite-ground link conflict graph: judge that certain both links whether there is in satellite-ground link set
Conflict relationship, when a certain satellite can establish satellite-ground link with other Liang Ge earth stations simultaneously, it is believed that deposited between both links
Conflicting, when corresponding to Fig. 3 (b) satellite-ground link conflict graph, to add one between the node pair corresponding to two satellite-ground links
Side conflicts if it does not exist, then not edged；Similarly, when some earth station can establish satellite-ground link with other two satellites simultaneously
When, it is believed that there is conflict between both links, needs to add a line between the corresponding node pair of Fig. 3 (b), rush if it does not exist
It is prominent, then not edged.
(4c) is according to the satellite-ground link conflict graph CG of constructiong(Eg(t),Vg(t)), solving has the only of maximum node value
Vertical collection, into the satellite-ground link set E to obtain non-conflict schedulingncsg(t), as shown in Fig. 3 (b), from the link of satellite-ground link
The node value being worth in corresponding conflict graphMiddle choose has most
The independent sets { 2,3 } of big node value, while deleting satellite-ground link { 1,4 }.
Step 5, according to the topological structure G of time slot t (E (t), V (t)), the energy state of satellite and non-conflict scheduling
Satellite-ground link set Encsg(t), inter-satellite link set E is calculatedss(t) value of the link in.
Referring to Fig. 2, this step is implemented as follows:
(5a) is according to the satellite-ground link set E of the non-conflict scheduling obtained in step 4ncsg(t), judge inter-satellite linkIn satellite node and earth station between whether there is link, if satellite i there are satellite-ground link,Instead
It,If satellite j there are satellite-ground link,Conversely,Such as Fig. 3 (a) Satellite nodeThere are stars
Ground link, and satellite nodeSatellite-ground link be not present, then token variable
(5b) judges inter-satellite link in time slot t+1 according to the topological structure G (E (t+1), V (t+1)) of time slot t+1In satellite node and earth station between whether there is link, if satellite i there are inter-satellite link,
Conversely,If satellite j there are satellite-ground link,Conversely,
(5c) calculates inter-satellite link set E according to the following formulass(t) the link value in:
WhereinFor in time slot t, the value of the inter-satellite link of satellite i and j, ws1、ws2And ws3Respectively three constraints
The weight factor of variable, and wg1+wg2+ws3=1.WhenAndWhen, indicate that satellite i and satellite j all have star ground chain
Road, at this timeReferring to above formula, at this moment middle entry is 0, but also needs to consider the size of remaining two numerical value,
When total link value is smaller, other links are chosen when constructing non-conflict scheduling figure, conversely, can construct between satellite i and j
Inter-satellite link, this is done to avoid building for inter-satellite link between two satellites as far as possible when constructing non-conflict scheduling figure
It is vertical, enable when carrying out network data transmission more substantially efficiently using its satellite-ground link, to realize the reasonable of spaceborne resource
Scheduling.Example is referring to Fig. 3 (a), satellite nodeIn t time slot initial time residual power percentage
Respectively As weight factor ws1=
0.5, ws2=0.3, ws3When=0.2, then the link value that can be calculated inter-satellite link 5 isIt similarly can successively calculate residue
The link of inter-satellite link is worth, and by the way that link is corresponded to the node in conflict graph, and then the valence of conflict graph interior joint can be obtained
Value is followed successively byWhereinThe value for indicating node i, is shown in Fig. 3
(c) marked in.
Step 6, the inter-satellite link scheduling conflict figure CG of time slot t is constructeds(Es(t),Vs(t)), the wherein node in conflict graph
Link in respective links set, referring to Fig. 3 (a) and Fig. 3 (c), node value is equal to the link valence in respective links set
Value, and then the corresponding independent sets with maximum node value of the conflict graph are solved, to obtain chain between the star of non-conflict scheduling
Road set Encss(t)。
Referring to Fig. 3, this step is implemented as follows:
(6a) constructs the node set V in inter-satellite link conflict graphs(t): by link set Ess(t) it corresponds in conflict graph
Node set.
(6b) constructs the line set E in inter-satellite link conflict graphs(t): judging that certain both links is in inter-satellite link set
No there are conflict relationships, that is, inter-satellite link can be established with other two satellites simultaneously by judging whether there is a certain satellite, if depositing
Then adding a line between node pair corresponding in conflict graph, conversely, side is not present between the node pair.
(6c) is according to the inter-satellite link conflict graph CG of constructions(Es(t),Vs(t)), solving has the only of maximum node value
Vertical collection, and then obtain the inter-satellite link set E of non-conflict schedulingncss(t).As shown in Fig. 3 (c), from the link valence of inter-satellite link
The node value being worth in corresponding conflict graph Middle selection tool
The independent sets { 5,7 } for thering is maximum node to be worth, while deleting inter-satellite link { 6,8 }.
The present invention utilizes the predictability of satellite trajectory, and moonlet earth observation network is characterized using topology diagram
Topology status, by satellite-ground link, inter-satellite link be worth calculating and compare establish the scheduling graph without link conflict, efficiently complete
The terrestrial transmission task of significant data is realized and effectively improves network trap while resource Lothrus apterus calls.
Step 7, according to the satellite-ground link set E of non-conflict schedulingncsg(t) and inter-satellite link set Encss(t) and it is current
The energy state and storage state information of time slot initial time network Satellite node are solved in current time slots t to maximize net
Network income is the linear programming of target, is obtained in the corresponding transmission mode of current time slots business datum.
Referring to Fig. 4, this step is implemented as follows:
(7a) obtains the stream conservation constraints in linear programming according to the topological structure G (E (t), V (t)) of current time slots t:
Wherein, fo(t) the observation mission data flow in time slot t to observation point o ∈ O is indicated,Table
Show task data flow f in time slot to(t) data volume flowed out from node i, r (fo(t)) it obtains and appoints in the time slot for observation satellite
Business data volume, s (fo(t)) task data flow f is indicatedo(t) generation source node satellite,Indicate the knot in time slot t
Beam moment, the task data flow f of node i storageo(k) data volume,Indicate number of tasks in time slot t
According to stream fo(k) data volume of node i is flowed into,Indicate the initial time of time slot t, the data flow f of node i storageo(k)
Data volume.
(7b) obtains the memory capacity constraint of linear programming Satellite and the link capacity of network constrains:
Wherein,Indicate the memory capacity of time slot t interior nodes i, C (it,jt) indicate link (i in time slot tt,jt)∈Encss
(t)∪Encsg(t) link capacity.
The energy constraint of (7c) acquisition linear programming Satellite node:
Wherein,Expression time slot t finish time, the remaining electricity of node i,When expression
The electricity consumed in gap t,
It indicates to send the energy that data consume, P from node i in time slot ts1Indicate the transmission power of inter-satellite link satellite, Ps2With indicating star
The transmission power of link satellite,Indicate that time slot t interior nodes i receives data
The energy of consumption, PrIndicate the reception power of inter-satellite link satellite,Indicate satellite node in time slot t
I observes the energy of observation point o ∈ O consumption, r (i, fo(t)) task of satellite node i observation observation point o ∈ O in time slot t is indicated
Data volume, CicIndicate the capacity observed in a time slot, PmIndicate the power consumption of satellite node i observation movement,Indicate the energy of the quiescent dissipation consumption of satellite node i in time slot t, PoAs quiescent dissipation.
The target of (7d) acquisition linear programming:
If current time slots t=T, target are as follows:
If current time slots t ≠ T, target are as follows:
Wherein, w (fo(k)) task data flow f is indicatedo(k) number priority,Indicate time slot t at the end of
It carves, the task data flow f of node ground data center dc storageo(k) data volume, μ are a very small constant, so as to the greatest extent
Data more than possible are transferred to ground data center by satellite-ground link, and SGV (t+1) expression can be built in time slot t+1 and earth station
The satellite set of vertical communication link.
(7e) solves linear programming using Matlab software, the battery of satellite at the end of acquisition number transmission mode, the time slot
State and storage state.
Step 8, at the end of time slot t, using the state of satellite battery and storage state as next time slot t+1 initial time
Satellite battery state and storage state initial value, that is, be arranged
Step 9, t=t+1 is enabled, while judging whether t is equal to T:
If t=T, the last one time slot is gone to, scheduling process terminates；
If t ≠ T thens follow the steps 2, time slot network topology G (E (t), V (t)) and next time slot are regained
Network topology G (E (t+1), V (t+1)) continues new round calculating, until whole process terminates.
The present invention by from initial time slot iterate to terminate time slot acquire a period of time resource Lothrus apterus allocation plan and
Data transfer mode, the algorithm for effectively reducing the entire period resource allocation of unified planning and data transfer mode are complicated
Degree.
In conclusion a kind of moonlet network efficient resource dispatching party based on earth observation task disclosed by the invention
Method mainly solves in resource-constrained moonlet network earth observation scene due to not fully considering Internet resources in scheduling process
Factor, the problem that caused end-to-end handling capacity is low, efficient network resource usage is low, realize process are as follows: according at the beginning of network
The topology that begins establishes node serial number, while initializing network resource scheduling planning time collection；Ground control centre is according to current network
State and scheduling of resource conflict constraint construction link scheduling conflict graph, and by solving the corresponding maximum independent set of the conflict graph,
Obtain the link set of network non-conflict scheduling；Using the link set of non-conflict scheduling, using the linear gauge of stream conservation constraints
The method of drawing solves the Resource Allocation Formula and data transfer mode of peak optimizating network benefit, until reaching network resource scheduling rule
When the cut-off time slot drawn, scheduling process terminates.The present invention improves the utilization rate of small satellite satellite Internet resources, improves important
The passback efficiency for data of being engaged in is used for earth observation systems data efficient so as to improve the performance of moonlet earth observation network
The scheduling of resource of transmission.
Above description is only specific example of the invention, it is clear that for those skilled in the art, is understanding this
After summary of the invention and principle, all in form and details various may be carried out without departing substantially from the principle of the invention, structure
Modifications and variations, but these modifications and variations based on inventive concept still claims of the invention it
It is interior.
Claims (5)
1. a kind of moonlet network efficient resource dispatching method based on earth observation task, which is characterized in that including walking as follows
It is rapid:
(1) initialization network parameter, ground control centre is according to satellite node, ground tiny node and the task observation point in network
The longitude and latitude being presently in respectively is numbered network Satellite node, ground tiny node and task observation point；
(2) time slot divides, and the time collection Γ that given network resource scheduling is planned=0,1,2 ... i...T }, wherein 0 is the 0th
Time slot, i.e. initial slot, i indicate i-th of time slot, each time slot be it is isometric, Δ t is slot length, when initializing current
Gap t=0；
(3) acquisition of topological structure, in current time slots t, ground control centre obtain all satellite nodes battery status and
The mission requirements at current time, while obtaining the topological structure G (E (t), V (t)) and G (E of the time slot and next time slot network
(t+1), V (t+1)), wherein E (t) and V (t) is respectively link set and node set in time slot t, and the topology of network exists
It is kept constant in each time slot；
(4) according to the topological structure G of time slot t (E (t), V (t)) and the energy state of satellite, satellite-ground link set E is calculatedsg
(t) value of the link in；
(5) the satellite-ground link set for obtaining non-conflict scheduling, constructs the satellite-ground link scheduling conflict figure CG of time slot tg(Eg(t),Vg
(t)), wherein the link in the node respective links set in conflict graph, node value are equal to the chain in respective links set
Road value, and then the corresponding independent sets with maximum node value of the conflict graph are solved, obtain the star ground chain of non-conflict scheduling
Road set Encsg(t)；
(5a) constructs the node set in satellite-ground link conflict graph: by satellite-ground link set Esg(t) section in conflict graph is corresponded to
Point set；
Line set in (5b) construction satellite-ground link conflict graph: judge that certain both links is with the presence or absence of conflict in satellite-ground link set
Relationship, when a certain satellite can simultaneously with other Liang Ge earth stations establish satellite-ground link or some earth station can simultaneously with
When other two satellites establish satellite-ground link, it is believed that conflict exists, and a line is added between node pair corresponding in conflict graph, instead
It, not edged between the node pair；
(5c) is according to the satellite-ground link conflict graph CG of constructiong(Eg(t),Vg(t)) independent sets with maximum node value, are solved,
According to the one-to-one relationship of node collection and link set, the satellite-ground link set E of non-conflict scheduling is obtainedncsg(t)；
(6) according to the satellite-ground link of the topological structure G of time slot t (E (t), V (t)), the energy state of satellite and non-conflict scheduling
Set Encsg(t), inter-satellite link set E is calculatedss(t) value of the link in；
(7) the satellite-ground link set for obtaining non-conflict scheduling, constructs the inter-satellite link scheduling conflict figure CG of time slot ts(Es(t),Vs
(t)), wherein the link in the node respective links set in conflict graph, node value are equal to the chain in respective links set
Road value, and then the corresponding independent sets with maximum node value of the conflict graph are solved, to obtain the star of non-conflict scheduling
Between link set Encss(t)；
(7a) constructs the node set V in inter-satellite link conflict graphs(t): by link set Ess(t) section in conflict graph is corresponded to
Point set；
(7b) constructs the line set E in inter-satellite link conflict graphs(t): judging that certain both links whether there is in inter-satellite link set
Conflict relationship, when a certain satellite can establish inter-satellite link with other two satellites simultaneously, it is believed that conflict exists, in conflict graph
In between corresponding node pair plus a line, conversely, not edged between the node pair；
(7c) is according to the inter-satellite link conflict graph CG of constructions(Es(t),Vs(t)) independent sets with maximum node value, are solved,
And then obtain the inter-satellite link set E of non-conflict schedulingncss(t)；
(8) according to the satellite-ground link set E of non-conflict schedulingncsg(t) and inter-satellite link set Encss(t) and at the beginning of current time slots
The energy state and storage state information of beginning moment network Satellite node, solve in current time slots t with maximization network income
For the linear programming of target, obtain in the corresponding transmission mode of current time slots business datum；
(9) at the end of time slot t, using the state of satellite battery and storage state as the satellite of next time slot t+1 initial time
The initial value of battery status and storage state；
(10) t=t+1 is enabled, while judging whether t is equal to T:
If t=T, algorithm has gone to the last one time slot, terminates to the scheduling process of moonlet Internet resources；
If t ≠ T, (3) are thened follow the steps, continues to obtain topological structure, carries out new round operation.
2. the moonlet network efficient resource dispatching method according to claim 1 based on earth observation task, feature
It is, wherein ground control centre described in step (3) obtains the battery status of all satellite nodes and appointing for current time
Business demand, while obtaining the topological structure G (E (t), V (t)) and G (E (t+1), V (t+ of the time slot and next time slot network
1) it), carries out as follows:
The ground control centre (3a) obtains the battery status of all satellite nodes in network in the initial time of current time slots t:
The topological structure G (E (t), V (t)) and G of the ground control centre (3b) acquisition current time slots t and next time slot t+1 network
(E (t+1), V (t+1)), wherein V (t) ∈ S ∪ G ∪ O, S are observation moonlet set, and O is observation point set, and E (t) is network
In link set, if node is in visual range each other, then it is assumed that link exist, by the link be included in set E (t)
In, conversely, the link is then not included in set E (t), due to being wire link between earth station and ground data center, because
This thinks that the link between earth station and data center exists always；
The ground control centre (3c) obtains the business demand in current time slots t, if observation point o ∈ O is in certain observation satellite
Within the scope of observing capacity, then it is r (fo (t)) > 0 that the observation satellite obtains task data amount in the time slot, conversely, at this
In gap, there is no the satellites being observed to observation point o ∈ O, i.e., without the task data acquisition process to observation point o ∈ O,
R (fo (t))=0.
3. the moonlet network efficient resource dispatching method according to claim 1 based on earth observation task, feature
It is, wherein calculating satellite-ground link set E described in step (4)sg(t) value of the link in carries out as follows:
(4a) judges satellite-ground link according to the topological structure G (E (t), V (t)) of time slot tIn satellite node i be
No there are inter-satellite links, and if it exists, then ηi(t)=1, conversely, ηi(t)=0；
(4b) calculates satellite i in the initial time battery status factor of time slot t according to the following formula
Wherein EBimaxFor the battery capacity of satellite i,Indicate satellite i in time slot t-1 finish time, i.e. time slot t it is initial when
The battery dump energy at quarter,Indicate satellite i in the systemic solar energy of time slot t,Indicate solar panel
Absorption power in time slot t；
(4c) calculates satellite-ground link set E according to the following formulasg(t) the link value in:
WhereinFor in time slot t, the value of the satellite-ground link of satellite i and earth station j, wg1It is satellite i in t time slot initial time
Weight shared by battery status and the ratio of battery capacity, wg2It is inter-satellite link there are the weight shared by the factor, and wg1+wg2=
1。
4. the moonlet network efficient resource dispatching method according to claim 1 based on earth observation task, feature
It is, wherein calculating inter-satellite link set E described in step (6)ss(t) value of the link in carries out as follows:
(6a) is according to the satellite-ground link set E of the non-conflict scheduling obtained in step 5ncsg(t), judge inter-satellite link
In satellite node and earth station between whether there is link, if satellite i there are satellite-ground link,Conversely,
If satellite j there are satellite-ground link,
(6b) judges inter-satellite link in time slot t+1 according to the topological structure G (E (t+1), V (t+1)) of time slot t+1
In satellite node and earth station between whether there is link, if satellite i there are satellite-ground link,Conversely,If satellite j there are satellite-ground link,Conversely,
(6c) calculates inter-satellite link set E according to the following formulass(t) the link value in:
WhereinFor the value of the inter-satellite link of satellite i and j in time slot t, ws1、ws2And ws3Respectively three bound variables
Weight factor, and wg1+wg2+ws3=1；WhenAndWhen, show that satellite i and satellite j all have satellite-ground link, at this timeAvoid the foundation of link between two satellites as far as possible when constructing non-conflict scheduling figure.
5. the moonlet network efficient resource dispatching method according to claim 1 based on earth observation task, wherein walking
Suddenly solution described in (8) carries out as follows in current time slots t using maximization network income as the linear programming of target:
(8a) obtains the stream conservation constraints in linear programming according to the topological structure G (E (t), V (t)) of current time slots t:
Wherein, fo(t) the observation mission data flow in time slot t to observation point o ∈ O is indicated,When expression
Task data flow f in gap to(t) data volume flowed out from node i, r (fo(t)) number of tasks is obtained in the time slot for observation satellite
According to amount, s (fo(t)) task data flow f is indicatedo(t) generation source node satellite,Indicate time slot t at the end of
It carves, the task data flow f of node i storageo(k) data volume,Indicate task data flow in time slot t
fo(k) data volume of node i is flowed into,Indicate the initial time of time slot t, the data flow f of node i storageo(k) number
According to amount；
(8b) obtains the memory capacity constraint of linear programming Satellite and the link capacity of network constrains:
Wherein,Indicate the memory capacity of time slot t interior nodes i, C (it,jt) indicate link (i in time slot tt,jt)∈Encss(t)∪
Encsg(t) link capacity；
The energy constraint of (8c) acquisition linear programming Satellite node:
Wherein,Expression time slot t finish time, the remaining electricity of node i,It indicates in time slot t
The electricity of consumption,It indicates
The energy that data consume, P are sent from node i in time slot ts1Indicate the transmission power of inter-satellite link satellite, Ps2Indicate satellite-ground link
The transmission power of satellite,Indicate that time slot t interior nodes i receives data consumption
Energy, PrIndicate the reception power of inter-satellite link satellite,Indicate that satellite node i is seen in time slot t
Survey the energy of observation point o ∈ O consumption, r (i, fo(t)) task data of satellite node i observation observation point o ∈ O in time slot t is indicated
Amount, CicIndicate the capacity observed in a time slot, PmIndicate the power consumption of satellite node i observation movement,Table
Show the energy of the quiescent dissipation consumption of satellite node i in time slot t, PoAs quiescent dissipation；
The target of (8d) acquisition linear programming:
If current time slots t=T, target are as follows:
If current time slots t ≠ T, target are as follows:
Wherein, w (fo(k)) task data flow f is indicatedo(k) number priority,It indicates in the finish time of time slot t, section
The task data flow f of point ground data center dc storageo(k) data volume, μ is a very small constant, so that as far as possible
More data are transferred to ground data center by satellite-ground link, and SGV (t+1) expression can establish logical in time slot t+1 and earth station
Believe the satellite set of link；
(8e) solves linear programming using Matlab software, the battery status of satellite at the end of acquisition number transmission mode, the time slot
And storage state.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610394928.1A CN106100719B (en) | 2016-06-06 | 2016-06-06 | Moonlet network efficient resource dispatching method based on earth observation task |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610394928.1A CN106100719B (en) | 2016-06-06 | 2016-06-06 | Moonlet network efficient resource dispatching method based on earth observation task |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106100719A CN106100719A (en) | 2016-11-09 |
| CN106100719B true CN106100719B (en) | 2019-01-25 |
Family
ID=57448245
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610394928.1A Active CN106100719B (en) | 2016-06-06 | 2016-06-06 | Moonlet network efficient resource dispatching method based on earth observation task |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106100719B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107493127B (en) * | 2017-07-10 | 2019-08-30 | 中国人民解放军国防科学技术大学 | A kind of two stages planing method for considering full-time number of segment and passing |
| CN107561974B (en) * | 2017-07-28 | 2020-04-21 | 上海卫星工程研究所 | High-orbit satellite remote control priority implementation method |
| CN107864007B (en) * | 2017-11-03 | 2020-09-08 | 西安电子科技大学 | Multi-satellite multi-ground station resource collaborative allocation management method for regional targets |
| CN109495541B (en) * | 2018-10-15 | 2021-04-02 | 上海交通大学 | Cross-data-center-based cloud service workflow scheduling method |
| CN109814999B (en) * | 2019-01-23 | 2020-10-30 | 中国科学院遥感与数字地球研究所 | Ground station resource scheduling method |
| CN111711991B (en) * | 2020-06-08 | 2023-08-08 | 中国科学院上海微系统与信息技术研究所 | Calculation task scheduling method in star-ground fusion network |
| CN111970044B (en) * | 2020-08-15 | 2022-03-08 | 哈尔滨工业大学（威海） | Satellite network time slot allocation and routing planning method based on Lagrange relaxation |
| CN112422171B (en) * | 2020-11-09 | 2021-09-03 | 西安电子科技大学 | Intelligent resource joint scheduling method under uncertain environment remote sensing satellite network |
| CN112600609B (en) * | 2020-11-30 | 2022-07-12 | 中国人民解放军国防科技大学 | Network capacity estimation method of satellite network system |
| CN113067628B (en) * | 2021-03-22 | 2023-03-28 | 天地信息网络有限公司 | Link scheduling method based on non-ideal battery model low-orbit satellite network |
| CN113627823B (en) * | 2021-08-25 | 2023-11-21 | 北京市遥感信息研究所 | Remote sensing satellite data transmission task planning method and device based on observation task priority |
| CN115632701B (en) * | 2022-12-21 | 2023-04-18 | 中南大学 | Low-earth-orbit satellite network data scheduling method, system, equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH09210686A (en) * | 1996-01-30 | 1997-08-12 | Fuji Photo Optical Co Ltd | Observation device |
| CN101738620A (en) * | 2008-11-19 | 2010-06-16 | 中国农业科学院农业资源与农业区划研究所 | Method by utilizing passive microwave remote sensing data AMSR-E (Advanced Microwave Scanning Radiometer-EOS ) to invert surface temperature |
| CN101876699A (en) * | 2009-04-30 | 2010-11-03 | 中国科学院空间科学与应用研究中心 | Control system and control method of satellite-borne microwave radiometer |
| CN102780523A (en) * | 2012-07-31 | 2012-11-14 | 中国电子科技集团公司第五十四研究所 | Multi-satellite cooperative observation business scheduling method |
| KR20130131803A (en) * | 2012-05-24 | 2013-12-04 | 국방과학연구소 | Satellite image reception processing system having an unified test fuction and unified test method of the same |
-
2016
- 2016-06-06 CN CN201610394928.1A patent/CN106100719B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH09210686A (en) * | 1996-01-30 | 1997-08-12 | Fuji Photo Optical Co Ltd | Observation device |
| CN101738620A (en) * | 2008-11-19 | 2010-06-16 | 中国农业科学院农业资源与农业区划研究所 | Method by utilizing passive microwave remote sensing data AMSR-E (Advanced Microwave Scanning Radiometer-EOS ) to invert surface temperature |
| CN101876699A (en) * | 2009-04-30 | 2010-11-03 | 中国科学院空间科学与应用研究中心 | Control system and control method of satellite-borne microwave radiometer |
| KR20130131803A (en) * | 2012-05-24 | 2013-12-04 | 국방과학연구소 | Satellite image reception processing system having an unified test fuction and unified test method of the same |
| CN102780523A (en) * | 2012-07-31 | 2012-11-14 | 中国电子科技集团公司第五十四研究所 | Multi-satellite cooperative observation business scheduling method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106100719A (en) | 2016-11-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106100719B (en) | Moonlet network efficient resource dispatching method based on earth observation task | |
| Jiang et al. | Joint charging tour planning and depot positioning for wireless sensor networks using mobile chargers | |
| Zhou et al. | Machine learning-based resource allocation in satellite networks supporting internet of remote things | |
| Gunduz et al. | Designing intelligent energy harvesting communication systems | |
| Miozzo et al. | Switch-on/off policies for energy harvesting small cells through distributed Q-learning | |
| Chen et al. | A simple asymptotically optimal joint energy allocation and routing scheme in rechargeable sensor networks | |
| Liu et al. | An analytical framework for resource-limited small satellite networks | |
| CN114048689B (en) | Multi-unmanned aerial vehicle aerial charging and task scheduling method based on deep reinforcement learning | |
| Fraire et al. | Battery-aware contact plan design for LEO satellite constellations: The ulloriaq case study | |
| CN109862612B (en) | Data collection and wireless charging method based on dual-function trolley moving path planning | |
| CN104936230A (en) | Wireless sensor network energy balance route optimization method based on cluster head expectation | |
| Chen et al. | Task scheduling method for data relay satellite network considering breakpoint transmission | |
| CN104244356A (en) | Orientation ant colony route optimization method based on evolution graph full route forecasting | |
| CN110381161B (en) | Game theory-based resource scheduling method in power Internet of things system | |
| CN104581817A (en) | Dynamic shortest path weighting routing method in mobile ad-hoc network | |
| Liu et al. | An energy-efficient selection mechanism of relay and edge computing in UAV-assisted cellular networks | |
| Sekander et al. | On the performance of renewable energy-powered UAV-assisted wireless communications | |
| CN104486811A (en) | Deep space optical network routing method based on ant colony algorithm | |
| Gong et al. | Computation offloading and energy harvesting schemes for sum rate maximization in space-air-ground networks | |
| Gambin et al. | Energy cooperation for sustainable base station deployments: Principles and algorithms | |
| Li et al. | Enhanced time-expanded graph for space information network modeling | |
| CN213817780U (en) | Double-layer satellite data relay system | |
| Dai et al. | Heuristic computing methods for contact plan design in the spatial-node-based Internet of Everything | |
| Zhou et al. | Toward high throughput contact plan design in resource-limited small satellite networks | |
| Pang et al. | CCOS: A coded computation offloading strategy for satellite-terrestrial integrated networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20221226 Address after: 710071 Taibai South Road, Yanta District, Xi'an, Shaanxi Province, No. 2 Patentee after: XIDIAN University Patentee after: Xi'an Tongyuan Essen Enterprise Management Consulting Partnership (L.P.) Address before: 710071 No. 2 Taibai South Road, Shaanxi, Xi'an Patentee before: XIDIAN University Effective date of registration: 20221226 Address after: 710077 312-11, Block E, Science Park, Xi'an University of Technology, No. 26, Dengling Road, Zhangba Street Office, High tech Zone, Xi'an City, Shaanxi Province Patentee after: Shaanxi Silk Road Tiantu Satellite Technology Co.,Ltd. Address before: 710071 Taibai South Road, Yanta District, Xi'an, Shaanxi Province, No. 2 Patentee before: XIDIAN University Patentee before: Xi'an Tongyuan Essen Enterprise Management Consulting Partnership (L.P.) |
|
| TR01 | Transfer of patent right |