CN116321294A - Task unloading and resource allocation method based on hybrid star-network cooperation - Google Patents

Task unloading and resource allocation method based on hybrid star-network cooperation Download PDF

Info

Publication number
CN116321294A
CN116321294A CN202310139909.4A CN202310139909A CN116321294A CN 116321294 A CN116321294 A CN 116321294A CN 202310139909 A CN202310139909 A CN 202310139909A CN 116321294 A CN116321294 A CN 116321294A
Authority
CN
China
Prior art keywords
user
satellite
ground
task
base station
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.)
Pending
Application number
CN202310139909.4A
Other languages
Chinese (zh)
Inventor
鲍宁海
甘秋蓉
陈奎
张浩波
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN202310139909.4A priority Critical patent/CN116321294A/en
Publication of CN116321294A publication Critical patent/CN116321294A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • H04W28/09—Management thereof
    • H04W28/0925—Management thereof using policies
    • 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
    • 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/1853—Satellite systems for providing telephony service to a mobile station, i.e. mobile satellite service
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • H04W28/09—Management thereof
    • H04W28/0958—Management thereof based on metrics or performance parameters
    • H04W28/0967—Quality of Service [QoS] parameters
    • H04W28/0975—Quality of Service [QoS] parameters for reducing delays
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/04—Large scale networks; Deep hierarchical networks
    • H04W84/06—Airborne or Satellite Networks
    • 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)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Astronomy & Astrophysics (AREA)
  • General Physics & Mathematics (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Radio Relay Systems (AREA)

Abstract

The invention discloses a task unloading and resource allocation method based on hybrid star-network cooperation, and belongs to the technical field of communication. The limitations of high-speed time variability of low-orbit satellites and coverage of ground base stations in a hybrid satellite-ground network may cause problems of low network resource utilization, difficult task scheduling for offloading, and poor user service experience. Aiming at the problem, a task unloading and resource allocation method based on hybrid star-network cooperation is provided. According to the method, the task unloading mode is reasonably selected according to the real-time position of the ground user in the satellite-to-ground network and the dynamic distribution of satellite-to-ground resources, and the task scheduling and resource allocation strategy is optimized, so that the resource utilization rate of the satellite-to-ground network is effectively improved, and the average task unloading time delay of the user is reduced.

Description

Task unloading and resource allocation method based on hybrid star-network cooperation
Technical Field
The invention belongs to the technical field of communication, and particularly relates to a task unloading and resource allocation method based on hybrid star-network cooperation.
Background
With the continuous development of the internet of things, the low-orbit satellite network can provide good supplement for the ground network and becomes an important component of the next generation network. The high-speed time variability of the low-orbit satellite in the hybrid satellite-ground network and the limitation of coverage of the ground base station can cause the problems of low network resource utilization rate, difficult task scheduling for unloading and poor user service experience, and the user task unloading time delay can be effectively reduced by considering the mutual cooperation of the low-orbit satellite network and the ground network.
The existing research on the hybrid satellite-ground network mainly utilizes satellite resources as the supplement of ground network resources to provide unloading service for ground users, however, in the hybrid satellite-ground network, the high-speed time variability of low-orbit satellites and the limitation of ground base station coverage may cause the problems of low network resource utilization rate, difficult scheduling of unloading tasks and poor user service experience. Aiming at the problem, a task unloading and resource allocation method based on hybrid star-network cooperation is provided. According to the method, the task unloading mode is reasonably selected according to the real-time position of the ground user in the satellite-to-ground network and the dynamic distribution of satellite-to-ground resources, and the task scheduling and resource allocation strategy is optimized, so that the resource utilization rate of the satellite-to-ground network is effectively improved, and the average task unloading time delay of the user is reduced.
Disclosure of Invention
The present invention is directed to solving the above problems of the prior art. A task unloading and resource allocation method based on hybrid star-network collaboration is provided. The technical scheme of the invention is as follows:
the utility model provides a task uninstallation and resource allocation method based on cooperation of a hybrid satellite-ground network, the hybrid satellite-ground network comprises a plurality of low orbit satellites, a ground base station and a plurality of ground users, the set of satellites S is S (S epsilon S), the ground base station is o, the set of ground users I is I (I epsilon I), each user I continuously generates task uninstallation requests in a system period T, the hybrid satellite-ground network provides task uninstallation services for users in I, the method comprises the following steps:
101. acquiring the resource distribution and state of the current hybrid star network, and acquiring the task quantity D according to the task request of each ground user i i And delay constraints
Figure BDA0004087201550000021
Let t=k·Δt, where Δt is an equal-length time slot, K is the total number of time slots, the set of available satellites in the kth time slot is S', and the number of initialized time slots k=0;
102. let k=k+1, if K is less than or equal to K, update the set of available satellites S', jump to step 103, otherwise jump to step 105;
103. according to the real-time position of the ground user in the mixed satellite-ground network, the sub-algorithm 1 is called to classify the users in the set I, and the classification label G of each user I is updated i And updates the available candidate satellite set S of each user i and ground base station o i and So ；
104. According to G i ，S i ，S o And the satellite-to-ground resource distribution state, invoking the sub-algorithm 2 to select the optimal unloading mode for the users in the set I, obtaining the optimal task scheduling and resource allocation strategy, and jumping to the step 102;
105. the algorithm ends.
Further, the sub-algorithm 1 in step 103 includes the following steps:
1) Let I ' be the temporary set I ' =i, let I ' be the classification label G of each user I i =0, candidate satellite set
Figure BDA0004087201550000022
Candidate satellite set of ground base station o>
Figure BDA0004087201550000023
2) According to k time slot low orbit satellite and ground user and groundThe position relation of the base station adds satellites meeting the communication condition in the available satellite set S' into the set S respectively i Sum set S o ；
3) If set
Figure BDA0004087201550000024
Taking out one user I in the I', jumping to the step 4), otherwise jumping to the step 8);
4) Calculating the horizontal distance between the user i and the ground base station o
Figure BDA0004087201550000025
If->
Figure BDA0004087201550000026
wherein Ro Jumping to step 5) for the effective coverage radius of the ground base station, otherwise jumping to step 6);
5) If set
Figure BDA0004087201550000027
Let G i =1 means that user i has the condition of communicating with both low-orbit satellite and terrestrial base station, jump to step 3), otherwise let G i =2, indicating that user i has a condition to communicate with the ground base station, and step 3 is skipped;
6) If set
Figure BDA0004087201550000028
Let G i =3 indicates that user i does not have conditions to communicate with low-orbit satellites and ground base stations, and jumps to step 3), otherwise, jumps to step 7);
7) If set
Figure BDA0004087201550000031
Let G i =1, jump to step 3), otherwise, let G i =4 indicates that user i has only the condition of communicating with satellite, and step 3) is skipped;
8) The algorithm ends.
Further, the step 2) is to collect the available satellites S'Satellites meeting communication conditions are respectively added into the set S i Sum set S o The method of (1) specifically comprises the following steps:
assuming that the ground user i or the ground base station o is a ground node u in the system, the elevation angle of the ground node u to the satellite S in S' is
Figure BDA0004087201550000032
The remaining service time of satellite s to ground node u is +.>
Figure BDA0004087201550000033
Will meet->
Figure BDA0004087201550000034
and />
Figure BDA0004087201550000035
Respectively adding the satellite S of (2) into the set S i and So, wherein ,εmin Let Δt denote minimum elevation and slot length, respectively, ">
Figure BDA0004087201550000036
and />
Figure BDA0004087201550000037
The calculation method of (1) is as shown in formulas (1) - (5):
in time slot k, elevation angle of ground node u with satellite s
Figure BDA0004087201550000038
The calculation is shown in formula (1):
Figure BDA0004087201550000039
wherein ,
Figure BDA00040872015500000310
and />
Figure BDA00040872015500000311
Representing the longitude and latitude of the ground node u in k time slots, respectively,/->
Figure BDA00040872015500000312
and />
Figure BDA00040872015500000313
Respectively representing the longitude and latitude of the low orbit satellite s in k time slots, R e Representing the equivalent earth radius, H representing the orbital altitude of the satellite relative to the ground;
in time slot k, ground node u is at a point angle from satellite s
Figure BDA00040872015500000314
The calculation is shown in formula (2):
Figure BDA00040872015500000315
in time slot k, ground node u is at the geocentric angle with satellite s
Figure BDA00040872015500000316
The calculation of (2) is shown in the formula (3):
Figure BDA00040872015500000317
wherein ,
Figure BDA00040872015500000318
in time slot k, ground node u communicates arc length corresponding to the geocentric angle of satellite s
Figure BDA0004087201550000041
The calculation of (2) is shown in formula (4):
Figure BDA0004087201550000042
at time of dayWithin slot k, the remaining communication time between ground node u and satellite s is
Figure BDA0004087201550000043
The calculation of (2) is shown in formula (5):
Figure BDA0004087201550000044
wherein ,
Figure BDA0004087201550000045
indicating the remaining communication time of satellite s in time slot k, < >>
Figure BDA0004087201550000046
Representing the total service time of satellite s to the ground target area.
Further, in the step 4), the distance between the user i and the ground base station o
Figure BDA0004087201550000047
The calculation of (2) is shown in formula (6):
Figure BDA0004087201550000048
wherein ,(xi ,y i ) Representing the location of user i, (x) o ,y o ) Indicating the location of the ground base station o.
Further, the sub-algorithm 2 in the step 104 includes the following steps:
11 Let I "=i, calculate the average unit task unloading delay during each user I in I" from slot 1 to slot k
Figure BDA0004087201550000049
And according to->
Figure BDA00040872015500000410
The value pairs I' of the user are arranged in descending order, and the local task load unloading of the user I in k time slots is initialized
Figure BDA00040872015500000411
Task amount offloaded to ground base station o>
Figure BDA00040872015500000412
Task amount offloaded to satellite s>
Figure BDA00040872015500000413
12 If set
Figure BDA00040872015500000414
Taking the first user I out of I ", jumping to step 13), otherwise jumping to step 20);
13 If G) i =1, invoking sub-algorithm 3 to select communication satellite s for user i, calculating the task amounts of user i to unload to local, ground base station o and satellite s, respectively
Figure BDA00040872015500000415
and />
Figure BDA00040872015500000416
Jump to step 17), otherwise jump to step 14);
14 If G) i =2, respectively calculating task quantity of user i local and ground base station o
Figure BDA0004087201550000051
and />
Figure BDA0004087201550000052
Jump to step 17), otherwise jump to step 15);
15 If G) i =3, let
Figure BDA0004087201550000053
Calculating the task load of user i offloaded to the local in k slots +.>
Figure BDA0004087201550000054
Jump to step 17), otherwise jump to step 16);
16 A sub-algorithm 3 is called to select a communication satellite s for the user i, and the task quantity of the user i for unloading to the local satellite s in k time slots is calculated respectively
Figure BDA0004087201550000055
and />
Figure BDA0004087201550000056
Jump to step 17);
17 Instruction) command
Figure BDA0004087201550000057
If->
Figure BDA0004087201550000058
Let binary variable +.>
Figure BDA0004087201550000059
Task volume->
Figure BDA00040872015500000510
Uninstall to local process, jump to step 12), otherwise jump to step 18);
18 If (1)
Figure BDA00040872015500000511
Let binary variable +.>
Figure BDA00040872015500000512
Task volume->
Figure BDA00040872015500000513
Unloading to ground base station o for processing, skipping to step 12), otherwise, skipping to step 19);
19 Make binary variable
Figure BDA00040872015500000514
Task volume->
Figure BDA00040872015500000515
Unloading to satellite s for processing, and jumping to step 12); 20 The algorithm ends.
Further, the average unit task offloading delay of the user i in the step 11)
Figure BDA00040872015500000516
The calculation method of (2) is shown in the formula (7):
Figure BDA00040872015500000517
wherein ,
Figure BDA00040872015500000518
and />
Figure BDA00040872015500000519
Binary offload decision variables representing respectively user i in time slot k, if user i offload tasks to local processing in time slot k,/>
Figure BDA00040872015500000520
Otherwise, go (L)>
Figure BDA00040872015500000521
If user i is offloading tasks to ground base station o for slot k, processing +.>
Figure BDA00040872015500000522
Otherwise, go (L)>
Figure BDA00040872015500000523
If user i is offloading tasks to satellite s process at time slot k,/>
Figure BDA00040872015500000524
Otherwise the first set of parameters is selected,
Figure BDA00040872015500000525
and->
Figure BDA00040872015500000526
Further, in the step 13), the method for selecting a satellite for the user i in the time slot k by the sub-algorithm 3 specifically includes:
21 If (1)
Figure BDA0004087201550000061
Jump to step 22), otherwise jump to step 25);
22 Calculating user i and set S at time slot k i Distance of each satellite in (a)
Figure BDA0004087201550000062
Calculating the maximum remaining available computing resources of satellite s based on the computing resources and task properties required by user i>
Figure BDA0004087201550000063
And the amount of allocatable computing resources to user i +.>
Figure BDA0004087201550000064
23 Instruction) command
Figure BDA0004087201550000065
Establish temporary set->
Figure BDA0004087201550000066
For S i Every satellite in (a) will +.>
Figure BDA0004087201550000067
Satellite s put in->
Figure BDA0004087201550000068
If->
Figure BDA0004087201550000069
Jump to step 24), otherwise, select +.>
Figure BDA00040872015500000610
Is serving user i, jumping to step 29);
24 Instruction) command
Figure BDA00040872015500000611
Establish temporary set->
Figure BDA00040872015500000612
For->
Figure BDA00040872015500000613
Every satellite in (a) will +.>
Figure BDA00040872015500000614
Satellite s put in->
Figure BDA00040872015500000615
If->
Figure BDA00040872015500000616
Let->
Figure BDA00040872015500000617
Select->
Figure BDA00040872015500000618
Is serving user i, jumps to step 29), otherwise, selects +.>
Figure BDA00040872015500000619
Is serving user i, jumping to step 29);
25 If (1)
Figure BDA00040872015500000620
Jump to step 23), otherwise jump to step 26);
26 Computing the ground user i and set at time slot k (S) i ∩S o ) Distance of each satellite in (a)
Figure BDA00040872015500000621
and />
Figure BDA00040872015500000622
Maximum remaining available computing resources of satellite s +.>
Figure BDA00040872015500000623
And the amount of allocatable computing resources to user i +.>
Figure BDA00040872015500000624
27 Instruction) command
Figure BDA00040872015500000625
Establish temporary set->
Figure BDA00040872015500000626
Couple (S) i ∩S o ) If per satellite in (a)
Figure BDA00040872015500000627
Put satellite s in->
Figure BDA00040872015500000628
Jump to step 28), otherwise, select +.>
Figure BDA00040872015500000629
Is serving user i, jumping to step 29);
28 Instruction) command
Figure BDA00040872015500000630
Establish temporary set->
Figure BDA00040872015500000631
For->
Figure BDA00040872015500000632
Every satellite in (a) will +.>
Figure BDA00040872015500000633
Satellite s put in->
Figure BDA00040872015500000634
If->
Figure BDA00040872015500000635
Let->
Figure BDA00040872015500000636
Figure BDA00040872015500000637
Selection of
Figure BDA00040872015500000638
Is serving user i, jumps to step 29), otherwise, selects +.>
Figure BDA0004087201550000071
Is serving user i, jumping to step 29);
29 The algorithm ends.
Further, the maximum remaining available computing resources of time slot k satellite s in step 22)
Figure BDA0004087201550000072
The calculation method of (2) is as shown in formula (8), the amount of assignable calculation resource for user i +.>
Figure BDA0004087201550000073
The calculation method of (2) is shown in the formula (9):
Figure BDA0004087201550000074
Figure BDA0004087201550000075
in the formula (8), F s Representing satellite s total calculationResources, I', represent any user in the set { I-I } except user I; in the formula (9), C i Representing the computational complexity of user i, U representing the amount of task unit data, c representing the speed of light,
Figure BDA0004087201550000076
representing the number of task units to be processed for user i in time slot k, as shown in equation (10), +.>
Figure BDA0004087201550000077
The transmission rate of user i and satellite s in time slot k is represented as shown in equation (11):
Figure BDA0004087201550000078
Figure BDA0004087201550000079
in formula (10), τ i Indicating that the unit task of user i is tolerant of delay,
Figure BDA00040872015500000710
the task number unloaded by the user i in the time slot k is represented; in the formula (11), B i,s Representing the communication bandwidth of user i with satellite s, P i Representing the transmit power of user i>
Figure BDA00040872015500000711
Transmit antenna gain for user i, +.>
Figure BDA00040872015500000712
Receiving antenna gain representing satellite s, +.>
Figure BDA00040872015500000713
Indicating rain fall, < >>
Figure BDA00040872015500000714
Representing the chain between time slot k user i and satellite sFree space loss of road, sigma i,s 2 Is the noise variance of additive white gaussian noise.
Further, in the steps 23), 24), 25), 26), the user i locally offloads the task amount in the time slot k
Figure BDA0004087201550000081
As shown in formula (12), user i is offloaded to base station o at time slot k by +.>
Figure BDA0004087201550000082
The calculation method of (2) is shown in formula (13), and the task amount of unloading the user i to the satellite s in the time slot k is shown in formula (14):
Figure BDA0004087201550000083
Figure BDA0004087201550000084
Figure BDA0004087201550000085
wherein f in formula (12) i,l Representing available computing resources for user i to locally offload tasks; in the formula (13) of the present invention,
Figure BDA0004087201550000086
respectively representing the transmission distance between the k time slot user i and the satellite s, the transmission distance between the satellite s and the ground base station o,/>
Figure BDA0004087201550000087
Representing the transmission rate between k-slot user i and ground base station o as shown in equation (15),/>
Figure BDA0004087201550000088
Representing the amount of computing resources allocated by k-slot base station o for user i, as shown in equation (16)>
Figure BDA0004087201550000089
Representing the transmission rate between the k-slot satellite s and the ground base station o as shown in equation (17),/>
Figure BDA00040872015500000810
The transmission rate between k-slot user i and ground base station o is expressed as shown in equation (18):
Figure BDA00040872015500000811
Figure BDA00040872015500000812
Figure BDA00040872015500000813
Figure BDA00040872015500000814
Figure BDA0004087201550000091
in the formula (15), B i,o Representing the channel bandwidth of user i communicating with the ground base station o,
Figure BDA0004087201550000092
channel gain, sigma, representing communication of k-slot user i with ground base station o i,o 2 A noise variance representing additive gaussian white noise; in the formula (16), F o Represents the total computation resources of the ground base station o, +.>
Figure BDA0004087201550000093
Representing the computational resource requirements of user i on ground base station o at time slot k, as shown in equation (19) Shown; b in formula (17) s,o Representing the channel bandwidth, P, of satellite s communicating with ground base station o s Representing the transmit power of satellite s, < >>
Figure BDA0004087201550000094
Transmit antenna gain for satellite s, +.>
Figure BDA0004087201550000095
Indicating the gain of the receiving antenna of the ground base station o +.>
Figure BDA0004087201550000096
Representing the free space loss of the link between the k-slot low-orbit satellite s and the ground base station o, sigma s,o 2 Is the noise variance of additive white gaussian noise.
The invention has the advantages and beneficial effects as follows:
the invention provides a task unloading and resource allocation method based on hybrid star-network cooperation. The existing research on the task offloading of the hybrid satellite network mainly utilizes satellite resources as the supplement of ground network resources, and less consideration is given to the cooperation between a ground base station and a low-orbit satellite. However, in a hybrid satellite-to-ground network, the high-speed time-variability of the low-orbit satellites and the limitation of ground base station coverage may cause problems of low network resource utilization, difficult task scheduling for offloading, and poor user service experience. Aiming at the problem, a task unloading and resource allocation method based on hybrid star-network cooperation is provided. According to the method, a reasonable task unloading mode is selected through satellite-to-ground cooperation according to the real-time position of the ground user in the satellite-to-ground network and the dynamic distribution of satellite-to-ground resources, and the task scheduling and resource allocation strategy is optimized, so that the resource utilization rate of the satellite-to-ground network is effectively improved, and the average task unloading time delay of the user is reduced.
Drawings
Fig. 1 is a flowchart of a task offloading and resource allocation method based on hybrid star network collaboration according to a preferred embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and specifically described below with reference to the drawings in the embodiments of the present invention. The described embodiments are only a few embodiments of the present invention.
The technical scheme for solving the technical problems is as follows:
the concepts and models to which this disclosure relates are as follows.
1. Network model
The mixed star network scene is researched and consists of ground users, ground base stations, low-orbit satellite constellations and an edge server. An edge server with limited computing resources is deployed on the base station and the low-orbit satellite, and the ground base station and the low-orbit satellite cooperate to provide unloading service for all users in a ground target area. The ground users may process tasks locally or offload to a communicable ground base station, an edge server process of a low orbit satellite.
2. Other symbols related to the present invention are described below.
i: user i
o: base station o
u: ground node u epsilon { i, o }
k: time slot k
Δt: time slot length
U: amount of unit task data
C i : user i task computational complexity
Figure BDA0004087201550000101
User i task tolerant delay
Figure BDA0004087201550000102
Elevation angle of ground node u and satellite s in time slot k
Figure BDA0004087201550000103
Remaining communication time of ground node u with satellite s in time slot k
Figure BDA0004087201550000104
User i offloaded to locally calculated unit task number in slot k
Figure BDA0004087201550000105
Number of unit tasks offloaded by user i to ground base station o during time slot k
Figure BDA0004087201550000106
Number of unit tasks offloaded by user i to satellite s during time slot k
f i,l : computing power of user i
Figure BDA0004087201550000111
Computing power allocated by ground base station o to user i during time slot k
Figure BDA0004087201550000112
Computing power allocated by satellites s for user i in time slot k
Figure BDA0004087201550000113
Computing resource requirements of user i on ground base station o edge server in time slot k
Figure BDA0004087201550000114
Maximum remaining available computing resources for satellites s in time slot k
Figure BDA0004087201550000115
Transmission rate between user i and ground base station o in time slot k
Figure BDA0004087201550000116
Users in time slot kTransmission rate between i and satellite s
Figure BDA0004087201550000117
Transmission rate between satellites s and ground base station o in time slot k
Figure BDA0004087201550000118
Flag of whether user i handles locally in time slot k
Figure BDA0004087201550000119
Flag of whether user i is offloaded to ground base station o in time slot k
Figure BDA00040872015500001110
Flag of whether user i is offloaded to satellite s in slot k
Figure BDA00040872015500001111
Average unit task delay for user i in slot k
The technical scheme of the invention is described as follows.
1. Elevation angle of ground node u and satellite s
Figure BDA00040872015500001112
The calculation method is shown in the formula (1):
Figure BDA00040872015500001113
2. satellite under-satellite point angle of ground node u and satellite s
Figure BDA00040872015500001114
The calculation is shown in formula (2):
Figure BDA00040872015500001115
3. ground node u and the geocentric angle of satellite s
Figure BDA0004087201550000121
The calculation is shown in formula (3):
Figure BDA0004087201550000122
4. communication arc length of ground node u corresponding to earth center angle of satellite s
Figure BDA0004087201550000123
The calculation is shown in formula (4):
Figure BDA0004087201550000124
5. remaining communication time of ground node u with satellite s
Figure BDA0004087201550000125
The calculation formula is shown as (5):
Figure BDA0004087201550000126
6. distance between user i and ground base station o
Figure BDA0004087201550000127
The calculation is shown in formula (6):
Figure BDA0004087201550000128
wherein ,(xi ,y i ) Representing the location of user i, (x) o ,y o ) Indicating the location of the ground base station o.
7. Average unit task delay for time slot 1 to time slot k user i
Figure BDA0004087201550000129
The calculation formula is shown as (7):
Figure BDA00040872015500001210
wherein ,
Figure BDA00040872015500001211
and />
Figure BDA00040872015500001212
Binary offload decision variables representing respectively user i in time slot k, if user i offload tasks to local processing in time slot k,/>
Figure BDA00040872015500001213
Otherwise, go (L)>
Figure BDA00040872015500001214
If user i is offloading tasks to ground base station o for slot k, processing +.>
Figure BDA0004087201550000131
Otherwise, go (L)>
Figure BDA0004087201550000132
If user i is offloading tasks to satellite s process at time slot k,/>
Figure BDA0004087201550000133
Otherwise the first set of parameters is selected,
Figure BDA0004087201550000134
and->
Figure BDA0004087201550000135
8. Maximum remaining available computing resources for time slot k satellite s
Figure BDA0004087201550000136
The calculation method is shown in the formula (8):
Figure BDA0004087201550000137
wherein ,Fs Representing the total computing resources of satellite s, I' represents any user in the set { I-I } divided by user I.
9. Computing resources allocated by time slot k satellite s for user i
Figure BDA0004087201550000138
The calculation method is shown in the formula (9):
Figure BDA0004087201550000139
wherein ,Ci Representing the computational complexity of user i, U representing the amount of task unit data, c representing the speed of light,
Figure BDA00040872015500001310
representing the number of task units to be processed for user i in time slot k, as shown in equation (10), +.>
Figure BDA00040872015500001311
The transmission rate of user i and satellite s in time slot k is represented as shown in equation (11):
Figure BDA00040872015500001312
Figure BDA00040872015500001313
in formula (10), τ i Indicating that the unit task of user i is tolerant of delay,
Figure BDA00040872015500001314
the task number unloaded by the user i in the time slot k is represented; in the formula (11), B i,s Representing the communication bandwidth of user i with satellite s, P i Representing the transmit power of user i>
Figure BDA00040872015500001315
Transmit antenna gain for user i, +.>
Figure BDA00040872015500001316
Receiving antenna gain representing satellite s, +.>
Figure BDA00040872015500001317
Indicating rain fall, < >>
Figure BDA00040872015500001318
Representing free space loss, sigma, of the link between time slot k user i and satellite s i,s 2 Is the noise variance of additive white gaussian noise.
10. User i locally offloads the amount of tasks in slot k
Figure BDA0004087201550000141
The calculation method is shown in the formula (12):
Figure BDA0004087201550000142
wherein ,fi,l Representing available computing resources for user i to offload tasks locally.
11. Task amount offloaded to base station o by user i in time slot k
Figure BDA0004087201550000143
The calculation method is shown in the formula (13):
Figure BDA0004087201550000144
wherein ,
Figure BDA0004087201550000145
respectively representing the transmission distance between the k time slot user i and the satellite s, the transmission distance between the satellite s and the ground base station o,/>
Figure BDA0004087201550000146
Representing the transmission rate between k-slot user i and ground base station o as shown in equation (14),/>
Figure BDA0004087201550000147
Representing the amount of computing resources allocated by k-slot base station o for user i, as shown in equation (15)>
Figure BDA0004087201550000148
Representing the transmission rate between the k-slot satellite s and the ground base station o as shown in equation (17):
Figure BDA0004087201550000149
wherein ,Bi,o Representing the channel bandwidth of user i communicating with the ground base station o,
Figure BDA00040872015500001410
channel gain, sigma, representing communication of k-slot user i with ground base station o i,o 2 A noise variance representing additive gaussian white noise;
Figure BDA00040872015500001411
wherein ,Fo Representing the total aggregate resources of the ground base stations o,
Figure BDA00040872015500001412
representing the computational resource requirement of user i on ground base station o at time slot k, as shown in equation (16);
Figure BDA0004087201550000151
wherein ,Bs,o Representing the channel bandwidth, P, of satellite s communicating with ground base station o s Representing the transmitted power of the satellite s,
Figure BDA0004087201550000152
transmit antenna gain for satellite s, +.>
Figure BDA0004087201550000153
Indicating the gain of the receiving antenna of the ground base station o +.>
Figure BDA0004087201550000154
Representing the free space loss of the link between the k-slot low-orbit satellite s and the ground base station o, sigma s,o 2 Noise variance, which is additive white gaussian noise;
Figure BDA0004087201550000155
12. task amount offloaded to satellite s by user i in slot k
Figure BDA0004087201550000156
The calculation method is shown in the formula (18):
Figure BDA0004087201550000157
13. sub-algorithm 1 user classification method
1) Let I ' be the temporary set I ' =i, let I ' be the classification label G of each user I i =0, candidate satellite set
Figure BDA0004087201550000158
Candidate satellite set of ground base station o>
Figure BDA0004087201550000159
2) According to the position relation between the k time slot low orbit satellite and the ground user and the ground base station, adding the satellites meeting the communication conditions in the available satellite set S' into the set S respectively i Sum set S o ；
3) If set
Figure BDA00040872015500001510
Taking out one user I in the I', jumping to the step 4), otherwise jumping to the step 8);
4) Calculating the horizontal distance between the user i and the ground base station o
Figure BDA00040872015500001511
If->
Figure BDA00040872015500001512
wherein Ro Jumping to step 5) for the effective coverage radius of the ground base station, otherwise jumping to step 6); />
5) If set
Figure BDA00040872015500001513
Let G i =1 means that user i has the condition of communicating with both low-orbit satellite and terrestrial base station, jump to step 3), otherwise let G i =2, indicating that user i has a condition to communicate with the ground base station, and step 3 is skipped;
6) If set
Figure BDA0004087201550000161
Let G i =3 indicates that user i does not have conditions to communicate with low-orbit satellites and ground base stations, and jumps to step 3), otherwise, jumps to step 7);
7) If setClosing device
Figure BDA0004087201550000162
Let G i =1, jump to step 3), otherwise, let G i =4 indicates that user i has only the condition of communicating with satellite, and step 3) is skipped;
8) The algorithm ends.
14. Sub-algorithm 2
11 Let I "=i, calculate the average unit task unloading delay during each user I in I" from slot 1 to slot k
Figure BDA0004087201550000163
And according to->
Figure BDA0004087201550000164
The value pairs I' of the user are arranged in descending order, and the local task load unloading of the user I in k time slots is initialized
Figure BDA0004087201550000165
Task amount offloaded to ground base station o>
Figure BDA0004087201550000166
Task amount offloaded to satellite s>
Figure BDA0004087201550000167
12 If set
Figure BDA0004087201550000168
Taking the first user I out of I ", jumping to step 13), otherwise jumping to step 20);
13 If G) i =1, invoking sub-algorithm 3 to select communication satellite s for user i, calculating the task amounts of user i to unload to local, ground base station o and satellite s, respectively
Figure BDA0004087201550000169
and />
Figure BDA00040872015500001610
Jump to step 17), otherwise jump to step 14);
14 If G) i =2, respectively calculating task quantity of user i local and ground base station o
Figure BDA00040872015500001611
and />
Figure BDA00040872015500001612
Jump to step 17), otherwise jump to step 15);
15 If G) i =3, let
Figure BDA00040872015500001613
Calculating the task load of user i offloaded to the local in k slots +.>
Figure BDA00040872015500001614
Jump to step 17), otherwise jump to step 16);
16 A sub-algorithm 3 is called to select a communication satellite s for the user i, and the task quantity of the user i for unloading to the local satellite s in k time slots is calculated respectively
Figure BDA00040872015500001615
and />
Figure BDA00040872015500001616
Jump to step 17);
17 Instruction) command
Figure BDA00040872015500001617
If->
Figure BDA00040872015500001618
Let binary variable +.>
Figure BDA00040872015500001619
Task volume->
Figure BDA0004087201550000171
UnloadingTo local processing, jump to step 12), otherwise jump to step 18);
18 If (1)
Figure BDA0004087201550000172
Let binary variable +.>
Figure BDA0004087201550000173
Task volume->
Figure BDA0004087201550000174
Unloading to ground base station o for processing, skipping to step 12), otherwise, skipping to step 19);
19 Make binary variable
Figure BDA0004087201550000175
Task volume->
Figure BDA0004087201550000176
Unloading to satellite s for processing, and jumping to step 12);
20 The algorithm ends.
15. Sub-algorithm 3
21 If (1)
Figure BDA0004087201550000177
Jump to step 22), otherwise jump to step 25);
22 Calculating user i and set S at time slot k i Distance of each satellite in (a)
Figure BDA0004087201550000178
Calculating the maximum remaining available computing resources of satellite s based on the computing resources and task properties required by user i>
Figure BDA0004087201550000179
And the amount of allocatable computing resources to user i +.>
Figure BDA00040872015500001710
23 Instruction) command
Figure BDA00040872015500001711
Establish temporary set->
Figure BDA00040872015500001712
For S i Every satellite in (a) will +.>
Figure BDA00040872015500001713
Satellite s put in->
Figure BDA00040872015500001714
If->
Figure BDA00040872015500001715
Jump to step 24), otherwise, select +.>
Figure BDA00040872015500001716
Is serving user i, jumping to step 29); />
24 Instruction) command
Figure BDA00040872015500001717
Establish temporary set->
Figure BDA00040872015500001718
For->
Figure BDA00040872015500001719
Every satellite in (a) will +.>
Figure BDA00040872015500001720
Satellite s put in->
Figure BDA00040872015500001721
If->
Figure BDA00040872015500001722
Let->
Figure BDA00040872015500001723
Select->
Figure BDA00040872015500001724
Is serving user i, jumps to step 29), otherwise, selects +.>
Figure BDA00040872015500001725
Is serving user i, jumping to step 29);
25 If (1)
Figure BDA00040872015500001726
Jump to step 23), otherwise jump to step 26);
26 Computing the ground user i and set at time slot k (S) i ∩S o ) Distance of each satellite in (a)
Figure BDA00040872015500001727
and />
Figure BDA00040872015500001728
Maximum remaining available computing resources of satellite s +.>
Figure BDA00040872015500001729
And the amount of allocatable computing resources to user i +.>
Figure BDA00040872015500001730
27 Instruction) command
Figure BDA00040872015500001731
Establish temporary set->
Figure BDA00040872015500001732
Couple (S) i ∩S o ) If per satellite in (a)
Figure BDA0004087201550000181
Put satellite s in->
Figure BDA0004087201550000182
Jump to step 28), otherwise, select +.>
Figure BDA0004087201550000183
Is serving user i, jumping to step 29);
28 Instruction) command
Figure BDA0004087201550000184
Establish temporary set->
Figure BDA0004087201550000185
For->
Figure BDA0004087201550000186
Every satellite in (a) will +.>
Figure BDA0004087201550000187
Satellite s put in->
Figure BDA0004087201550000188
If->
Figure BDA0004087201550000189
Let->
Figure BDA00040872015500001810
Figure BDA00040872015500001811
Selection of
Figure BDA00040872015500001812
Is serving user i, jumps to step 29), otherwise, selects +.>
Figure BDA00040872015500001813
Is serving user i, jumping to step 29);
29 The algorithm ends.
A mobile edge computing task unloading method under a hybrid star-ground cooperative network architecture comprises the following steps:
step 1: let t=k·Δt, where Δt is an equal-length time slot, K is the total number of time slots, the set of available satellites in the kth time slot is S', and the number of initialized time slots k=0;
step 2: let k=k+1, if K is less than or equal to K, update the set of available satellites S', jump to step 103, otherwise jump to step 105;
step 3: according to the real-time position of the ground user in the mixed satellite-ground network, the sub-algorithm 1 is called to classify the users in the set I, and the classification label G of each user I is updated i And updates the available candidate satellite set S of each user i and ground base station o i and So ；
Step 4: according to G i ，S i ，S o And the satellite-to-ground resource distribution state, invoking the sub-algorithm 2 to select the optimal unloading mode for the users in the set I, obtaining the optimal task scheduling and resource allocation strategy, and jumping to the step 102;
step 5: the algorithm ends.
The system, apparatus, module or unit set forth in the above embodiments may be implemented in particular by a computer chip or entity, or by a product having a certain function.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
The above examples should be understood as illustrative only and not limiting the scope of the invention. Various changes and modifications to the present invention may be made by one skilled in the art after reading the teachings herein, and such equivalent changes and modifications are intended to fall within the scope of the invention as defined in the appended claims.

Claims (9)

1. The utility model provides a task uninstallation and resource allocation method based on cooperation of a hybrid satellite-ground network, the hybrid satellite-ground network comprises a plurality of low orbit satellites, a ground base station and a plurality of ground users, the set of satellites S is S (S epsilon S), the ground base station is o, the set of ground users I is I (I epsilon I), each user I continuously generates task uninstallation requests in a system period T, the hybrid satellite-ground network provides task uninstallation services for users in I, the method is characterized by comprising the following steps:
101. acquiring the resource distribution and state of the current hybrid star network, and acquiring the task quantity D according to the task request of each ground user i i And time delay constraint T i max Let t=k·Δt, where Δt is an equal-length time slot, K is the total number of time slots, the set of available satellites in the kth time slot is S', and the number of initialized time slots k=0;
102. let k=k+1, if K is less than or equal to K, update the set of available satellites S', jump to step 103, otherwise jump to step 105;
103. according to the real-time position of the ground user in the mixed satellite-ground network, the sub-algorithm 1 is called to classify the users in the set I, and the classification label G of each user I is updated i And updates the available candidate satellite set S of each user i and ground base station o i and So ；
104. According to G i ，S i ，S o And the satellite-to-ground resource distribution state, invoking the sub-algorithm 2 to select the optimal unloading mode for the users in the set I, obtaining the optimal task scheduling and resource allocation strategy, and jumping to the step 102;
105. the algorithm ends.
2. The method for task offloading and resource allocation of claim 1, wherein the sub-algorithm 1 in step 103 comprises the following steps:
1) Let I ' be the temporary set I ' =i, let I ' be the classification label G of each user I i =0, candidate satellite set
Figure FDA0004087201540000011
Candidate satellite set of ground base station o>
Figure FDA0004087201540000012
2) According to the position relation between the k time slot low orbit satellite and the ground user and the ground base station, adding the satellites meeting the communication conditions in the available satellite set S' into the set S respectively i Sum set S o ；
3) If set
Figure FDA0004087201540000013
Taking out one user I in the I', jumping to the step 4), otherwise jumping to the step 8);
4) Calculating the horizontal distance between the user i and the ground base station o
Figure FDA0004087201540000014
If->
Figure FDA0004087201540000015
wherein Ro Jumping to step 5) for the effective coverage radius of the ground base station, otherwise jumping to step 6);
5) If set
Figure FDA0004087201540000021
Let G i =1 means that user i has the condition of communicating with both low-orbit satellite and terrestrial base station, jump to step 3), otherwise let G i =2, indicating that user i has a condition to communicate with the ground base station, and step 3 is skipped;
6) If set
Figure FDA0004087201540000022
Let G i =3 indicates that user i does not have a condition to communicate with the low-orbit satellite and the terrestrial base station, and jumps to stepStep 3), otherwise, jumping to step 7);
7) If set
Figure FDA0004087201540000023
Let G i =1, jump to step 3), otherwise, let G i =4 indicates that user i has only the condition of communicating with satellite, and step 3) is skipped;
8) The algorithm ends.
3. The method for task offloading and resource allocation according to claim 2, wherein in said step 2), satellites satisfying the communication condition in the set of available satellites S' are added to the set S respectively i Sum set S o The method of (1) specifically comprises the following steps:
assuming that the ground user i or the ground base station o is a ground node u in the system, the elevation angle of the ground node u to the satellite S in S' is
Figure FDA0004087201540000024
The remaining service time of satellite s to ground node u is +.>
Figure FDA0004087201540000025
Will meet->
Figure FDA0004087201540000026
and />
Figure FDA0004087201540000027
Respectively adding the satellite S of (2) into the set S i and So, wherein ,εmin Let Δt denote minimum elevation and slot length, respectively, ">
Figure FDA0004087201540000028
and />
Figure FDA0004087201540000029
The calculation method of (1) is as shown in formula (1)) - (5) as follows:
in time slot k, elevation angle of ground node u with satellite s
Figure FDA00040872015400000210
The calculation is shown in formula (1):
Figure FDA00040872015400000211
wherein ,
Figure FDA00040872015400000212
Figure FDA00040872015400000213
and />
Figure FDA00040872015400000214
Representing the longitude and latitude of the ground node u in k time slots, respectively,/->
Figure FDA00040872015400000215
and />
Figure FDA00040872015400000216
Respectively representing the longitude and latitude of the low orbit satellite s in k time slots, R e Representing the equivalent earth radius, H representing the orbital altitude of the satellite relative to the ground;
in time slot k, ground node u is at a point angle from satellite s
Figure FDA00040872015400000217
The calculation is shown in formula (2):
Figure FDA0004087201540000031
in time slot k, ground node u is at the geocentric angle with satellite s
Figure FDA0004087201540000032
The calculation of (2) is shown in the formula (3):
Figure FDA0004087201540000033
wherein ,
Figure FDA0004087201540000034
in time slot k, ground node u communicates arc length corresponding to the geocentric angle of satellite s
Figure FDA0004087201540000035
The calculation of (2) is shown in formula (4):
Figure FDA0004087201540000036
in time slot k, the remaining communication time between ground node u and satellite s is
Figure FDA0004087201540000037
The calculation of (2) is shown in formula (5):
Figure FDA0004087201540000038
wherein ,Ts k Representing the remaining communication time of satellite s in time slot k, T s all Representing the total service time of satellite s to the ground target area.
4. The method for task offloading and resource allocation according to claim 2, wherein in said step 4), the distance between the user i and the ground base station o is
Figure FDA0004087201540000039
The calculation of (2) is shown in formula (6):
Figure FDA00040872015400000310
wherein ,(xi ,y i ) Representing the location of user i, (x) o ,y o ) Indicating the location of the ground base station o.
5. The method for task offloading and resource allocation of claim 1, wherein the sub-algorithm 2 in step 104 comprises the steps of:
11 Let I "=i, calculate the average unit task unloading delay during each user I in I" from slot 1 to slot k
Figure FDA0004087201540000041
And according to->
Figure FDA0004087201540000042
The value pairs I' of the user are arranged in descending order, and the local task load unloading of the user I in k time slots is initialized
Figure FDA0004087201540000043
Task amount offloaded to ground base station o>
Figure FDA0004087201540000044
Task amount offloaded to satellite s>
Figure FDA0004087201540000045
12 If set
Figure FDA0004087201540000046
Taking the first user I out of I ", jumping to step 13), otherwise jumping to step 20);
13 If G) i =1, invoking sub-algorithm 3 to select communication satellite s for user i, calculating the task amounts of user i to unload to local, ground base station o and satellite s, respectively
Figure FDA0004087201540000047
and />
Figure FDA0004087201540000048
Jump to step 17), otherwise jump to step 14);
14 If G) i =2, respectively calculating task quantity of user i local and ground base station o
Figure FDA0004087201540000049
and />
Figure FDA00040872015400000410
Jump to step 17), otherwise jump to step 15);
15 If G) i =3, let
Figure FDA00040872015400000411
Calculating the task load of user i offloaded to the local in k slots +.>
Figure FDA00040872015400000412
Jump to step 17), otherwise jump to step 16);
16 A sub-algorithm 3 is called to select a communication satellite s for the user i, and the task quantity of the user i for unloading to the local satellite s in k time slots is calculated respectively
Figure FDA00040872015400000413
and />
Figure FDA00040872015400000414
Jump to step 17);
17 Instruction) command
Figure FDA00040872015400000415
If->
Figure FDA00040872015400000416
Let binary variable +.>
Figure FDA00040872015400000417
Task volume->
Figure FDA00040872015400000418
Uninstall to local process, jump to step 12), otherwise jump to step 18);
18 If (1)
Figure FDA00040872015400000419
Let binary variable +.>
Figure FDA00040872015400000420
Task volume->
Figure FDA00040872015400000421
Unloading to ground base station o for processing, skipping to step 12), otherwise, skipping to step 19);
19 Make binary variable
Figure FDA00040872015400000422
Task volume->
Figure FDA00040872015400000423
Unloading to satellite s for processing, and jumping to step 12);
20 The algorithm ends.
6. The method for task offloading and resource allocation of claim 5, wherein in step 11), the average unit task offloading delay of user i is
Figure FDA00040872015400000424
The calculation method of (2) is shown in the formula (7):
Figure FDA0004087201540000051
wherein ,
Figure FDA0004087201540000052
and />
Figure FDA0004087201540000053
Binary offload decision variables representing respectively user i in time slot k, if user i offload tasks to local processing in time slot k,/>
Figure FDA0004087201540000054
Otherwise, go (L)>
Figure FDA0004087201540000055
If user i is offloading tasks to ground base station o for slot k, processing +.>
Figure FDA0004087201540000056
Otherwise, go (L)>
Figure FDA0004087201540000057
If user i is offloading tasks to satellite s process at time slot k,/>
Figure FDA0004087201540000058
Otherwise, go (L)>
Figure FDA0004087201540000059
And is also provided with
Figure FDA00040872015400000510
7. The method for task offloading and resource allocation according to claim 5, wherein the sub-algorithm 3 in step 13) selects a satellite for the user i of the time slot k, and the method specifically comprises:
21 If (1)
Figure FDA00040872015400000511
Jump to step 22), otherwise jump to step 25);
22 Calculating user i and set S at time slot k i Distance of each satellite in (a)
Figure FDA00040872015400000512
Calculating the maximum remaining available computing resources of satellite s based on the computing resources and task properties required by user i>
Figure FDA00040872015400000513
And the amount of allocatable computing resources to user i +.>
Figure FDA00040872015400000514
23 Instruction) command
Figure FDA00040872015400000515
Establish temporary set->
Figure FDA00040872015400000516
For S i Every satellite in (a) will +.>
Figure FDA00040872015400000517
Satellite s put in->
Figure FDA00040872015400000518
If->
Figure FDA00040872015400000519
Jump to step 24), otherwise, select +.>
Figure FDA00040872015400000520
Is serving user i, jumping to step 29);
24 Instruction) command
Figure FDA00040872015400000521
Establish temporary set->
Figure FDA00040872015400000522
For->
Figure FDA00040872015400000523
Every satellite in (a) will +.>
Figure FDA00040872015400000524
Satellite s put in->
Figure FDA00040872015400000525
If->
Figure FDA00040872015400000526
Let->
Figure FDA00040872015400000527
Select->
Figure FDA00040872015400000528
Is serving user i, jumps to step 29), otherwise, selects +.>
Figure FDA00040872015400000529
Is serving user i, jumping to step 29);
25 If (1)
Figure FDA00040872015400000530
Jump to step 23), otherwise jump to step 26);
26 Computing the ground user i and set at time slot k (S) i ∩S o ) Distance of each satellite in (a)
Figure FDA00040872015400000531
and />
Figure FDA00040872015400000532
Maximum remaining available computing resources of satellite s +.>
Figure FDA0004087201540000061
And the amount of allocatable computing resources to user i +.>
Figure FDA0004087201540000062
27 Instruction) command
Figure FDA0004087201540000063
Establish temporary set->
Figure FDA0004087201540000064
Couple (S) i ∩S o ) If +.>
Figure FDA0004087201540000065
Put satellite s in->
Figure FDA0004087201540000066
Jump to step 28), otherwise, select +.>
Figure FDA0004087201540000067
Is serving user i, jumping to step 29);
28 Instruction) command
Figure FDA0004087201540000068
Establish temporary set->
Figure FDA0004087201540000069
For->
Figure FDA00040872015400000610
Every satellite in (a) will +.>
Figure FDA00040872015400000611
Satellite s put in->
Figure FDA00040872015400000612
If->
Figure FDA00040872015400000613
Let->
Figure FDA00040872015400000614
Figure FDA00040872015400000615
Select->
Figure FDA00040872015400000616
Is serving user i, jumps to step 29), otherwise, selects +.>
Figure FDA00040872015400000617
Is serving user i, jumping to step 29);
29 The algorithm ends.
8. The method for task offloading and resource allocation of claim 7, wherein the maximum remaining available computing resources of time slot k satellite s in step 22)
Figure FDA00040872015400000618
The calculation method of (2) is as shown in formula (8), the amount of assignable calculation resource for user i +.>
Figure FDA00040872015400000619
The calculation method of (2) is shown in the formula (9):
Figure FDA00040872015400000620
Figure FDA00040872015400000621
in the formula (8), F s Representing the total computing resources of satellite s, I' representing any user in the set { I-I } divided by user I; in the formula (9), C i Representing the computational complexity of user i, U representing the amount of task unit data, c representing the speed of light,
Figure FDA00040872015400000622
representing the number of task units to be processed for user i in time slot k, as shown in equation (10), +.>
Figure FDA00040872015400000623
The transmission rate of user i and satellite s in time slot k is represented as shown in equation (11):
Figure FDA0004087201540000071
Figure FDA0004087201540000072
in formula (10), τ i Indicating that the unit task of user i is tolerant of delay,
Figure FDA0004087201540000073
the task number unloaded by the user i in the time slot k is represented; in the formula (11), B i,s Representing the communication bandwidth of user i with satellite s，P i Representing the transmit power of user i>
Figure FDA0004087201540000074
Transmit antenna gain for user i, +.>
Figure FDA0004087201540000075
Receiving antenna gain representing satellite s, +.>
Figure FDA0004087201540000076
Indicating rain fall, < >>
Figure FDA0004087201540000077
Representing free space loss, sigma, of the link between time slot k user i and satellite s i,s 2 Is the noise variance of additive white gaussian noise.
9. The method for task offloading and resource allocation according to claim 7, wherein in steps 23), 24), 25), 26), user i offloads the task amount locally in time slot k
Figure FDA0004087201540000078
As shown in formula (12), user i is offloaded to base station o at time slot k by +.>
Figure FDA0004087201540000079
The calculation method of (2) is shown in formula (13), and the task amount of unloading the user i to the satellite s in the time slot k is shown in formula (14):
Figure FDA00040872015400000710
Figure FDA00040872015400000711
Figure FDA00040872015400000712
wherein f in formula (12) i,l Representing available computing resources for user i to locally offload tasks; in the formula (13) of the present invention,
Figure FDA00040872015400000713
respectively representing the transmission distance between the k time slot user i and the satellite s, the transmission distance between the satellite s and the ground base station o,/>
Figure FDA00040872015400000714
Representing the transmission rate between k-slot user i and ground base station o as shown in equation (15),/>
Figure FDA0004087201540000081
Representing the amount of computing resources allocated by k-slot base station o for user i, as shown in equation (16)>
Figure FDA0004087201540000082
Representing the transmission rate between the k-slot satellite s and the ground base station o as shown in equation (17),/>
Figure FDA0004087201540000083
The transmission rate between k-slot user i and ground base station o is expressed as shown in equation (18):
Figure FDA0004087201540000084
Figure FDA0004087201540000085
Figure FDA0004087201540000086
Figure FDA0004087201540000087
Figure FDA0004087201540000088
in the formula (15), B i,o Representing the channel bandwidth of user i communicating with the ground base station o,
Figure FDA0004087201540000089
channel gain, sigma, representing communication of k-slot user i with ground base station o i,o 2 A noise variance representing additive gaussian white noise; in the formula (16), F o Representing the total computing resources of the ground base station o, f i k Representing the computational resource requirement of user i on ground base station o at time slot k, as shown in equation (19); b in formula (17) s,o Representing the channel bandwidth, P, of satellite s communicating with ground base station o s Representing the transmit power of satellite s, < >>
Figure FDA00040872015400000810
Transmit antenna gain for satellite s, +.>
Figure FDA00040872015400000811
Indicating the gain of the receiving antenna of the ground base station o +.>
Figure FDA00040872015400000812
Representing the free space loss of the link between the k-slot low-orbit satellite s and the ground base station o, sigma s,o 2 Is the noise variance of additive white gaussian noise.
CN202310139909.4A 2023-02-20 2023-02-20 Task unloading and resource allocation method based on hybrid star-network cooperation Pending CN116321294A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310139909.4A CN116321294A (en) 2023-02-20 2023-02-20 Task unloading and resource allocation method based on hybrid star-network cooperation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310139909.4A CN116321294A (en) 2023-02-20 2023-02-20 Task unloading and resource allocation method based on hybrid star-network cooperation

Publications (1)

Publication Number Publication Date
CN116321294A true CN116321294A (en) 2023-06-23

Family

ID=86791609

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310139909.4A Pending CN116321294A (en) 2023-02-20 2023-02-20 Task unloading and resource allocation method based on hybrid star-network cooperation

Country Status (1)

Country Link
CN (1) CN116321294A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117200873A (en) * 2023-11-07 2023-12-08 南京邮电大学 Calculation unloading method considering satellite mobility in satellite edge calculation network

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117200873A (en) * 2023-11-07 2023-12-08 南京邮电大学 Calculation unloading method considering satellite mobility in satellite edge calculation network
CN117200873B (en) * 2023-11-07 2024-05-31 南京邮电大学 Calculation unloading method considering satellite mobility in satellite edge calculation network

Similar Documents

Publication Publication Date Title
CN111132077B (en) Multi-access edge computing task unloading method based on D2D in Internet of vehicles environment
CN109951869B (en) Internet of vehicles resource allocation method based on cloud and mist mixed calculation
Zhang et al. Joint computing and communication resource allocation for satellite communication networks with edge computing
CN114051254B (en) Green cloud edge collaborative computing unloading method based on star-ground fusion network
CN113904947A (en) Vehicle-road cooperative distributed edge computing task unloading and resource allocation method and system
CN111885147A (en) Dynamic resource pricing method in edge calculation
Wang et al. Dynamic uplink transmission scheduling for satellite Internet of Things applications
CN116321294A (en) Task unloading and resource allocation method based on hybrid star-network cooperation
CN112887905B (en) Task unloading method based on periodic resource scheduling in Internet of vehicles
CN112988347B (en) Edge computing unloading method and system for reducing energy consumption and cost sum of system
CN114650567A (en) Unmanned aerial vehicle-assisted V2I network task unloading method
CN114153515B (en) Highway internet of vehicles task unloading algorithm based on 5G millimeter wave communication
CN114363803A (en) Energy-saving multi-task allocation method and system for mobile edge computing network
CN114866979A (en) Unmanned aerial vehicle-assisted edge calculation time delay minimization method
CN116546559B (en) Distributed multi-target space-ground combined track planning and unloading scheduling method and system
CN117425179A (en) Space-space cooperative scheduling method for guaranteeing task priority and system throughput
CN116820603A (en) Intelligent factory redundancy unloading method based on deep reinforcement learning
CN114531718B (en) NOMA-MEC system energy consumption optimization method under imperfect CSI
CN116192228A (en) Task unloading method and system based on game theory under space-sky-ground integrated network
CN114268966B (en) Unmanned aerial vehicle auxiliary MEC network low-delay multi-task allocation method and system
Zhang et al. Federated deep actor-critic-based task offloading in air-ground electricity iot
CN115955711A (en) Air-ground 6G network resource allocation method oriented to optimal energy efficiency
CN115801820A (en) Delay-energy consumption perception vehicle networking task unloading method based on reinforcement learning
Hassan et al. Seamless and Efficient Resources Allocation in 6G Satellite Networks Servicing Remote User Equipments
Zheng et al. Efficient pruning-split LSTM machine learning algorithm for terrestrial-satellite edge network

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