2022
DOI: 10.1109/tvt.2022.3141799
|View full text |Cite
|
Sign up to set email alerts
|

Deep Reinforcement Learning Based Latency Minimization for Mobile Edge Computing With Virtualization in Maritime UAV Communication Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 92 publications
(19 citation statements)
references
References 40 publications
0
11
0
Order By: Relevance
“…In [105], a two-layer UAV-enabled MEC maritime communication network has been investigated, in which parallel computation of tasks offloading with different amount of data in different virtual machines has been studied. In this framework, a latency minimization problem has been formulated, which takes into account both communication and computation aspects.…”
Section: A Mobile Edge Computingmentioning
confidence: 99%
“…In [105], a two-layer UAV-enabled MEC maritime communication network has been investigated, in which parallel computation of tasks offloading with different amount of data in different virtual machines has been studied. In this framework, a latency minimization problem has been formulated, which takes into account both communication and computation aspects.…”
Section: A Mobile Edge Computingmentioning
confidence: 99%
“…Recently, [14] proposed an energy-efficient fair communication through trajectory design and band allocation (EEFC-TDBA) which allows an unmanned aerial vehicle (UAV) to adjust the flight speed and direction to enhance energy efficiency and allocate a frequency band to achieve fair communication service. The DRL algorithm for solving the latency minimization problem for both communication and computation in a maritime UAV swarm mobile edge computing network was suggested and analyzed in [15].…”
Section: A Related Workmentioning
confidence: 99%
“…The DNNs have one input layer, one output layer, and several hidden layers, which are fully connected. Accordingly, the computation complexity analysis is mainly based on the DNN model [39].…”
Section: Complexity Analysismentioning
confidence: 99%
“…Let N a L and N c L denote the numbers of hidden layers of the actor and critic networks, respectively, and the numbers of neurons in the mth hidden layer of the actor and critic networks are denoted by n a m and n c m , respectively. In addition, we denote the dimensions of the state and action spaces by |S 1 | and |A 1 |, respectively, which can be obtained based on (38) and (39), and assume that the parameters of the DNNs will converge after F conv 1 episodes and N conv 1 time slots. Accordingly, the complexity of the DDPG-based algorithm is expressed as…”
Section: Complexity Analysismentioning
confidence: 99%