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

A Model-Driven Deep Reinforcement Learning Heuristic Algorithm for Resource Allocation in Ultra-Dense Cellular Networks

Abstract: A model-driven deep reinforcement learning heuristic algorithm for resource allocation in ultra-dense cellular networks. IEEE Transactions on Vehicular Technology, 69(1), pp. 983-997.There may be differences between this version and the published version. You are advised to consult the publisher's version if you wish to cite from it.Abstract-Resource allocation in ultra dense network (UDN) is an multi-objective optimization problem since it has to consider the tradeoff among spectrum efficiency (SE), energy ef… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 52 publications
(20 citation statements)
references
References 39 publications
0
20
0
Order By: Relevance
“…In another interesting work in [162], the authors propose a model-driven multi-agent Double DQN-based framework for resource allocation in UDNs. In particular, They first develop a DNN-based optimization framework comprised of a series of ADMM iterative procedures that uses the CSI as the learned weights.…”
Section: ) In Cellular and Homnetsmentioning
confidence: 99%
“…In another interesting work in [162], the authors propose a model-driven multi-agent Double DQN-based framework for resource allocation in UDNs. In particular, They first develop a DNN-based optimization framework comprised of a series of ADMM iterative procedures that uses the CSI as the learned weights.…”
Section: ) In Cellular and Homnetsmentioning
confidence: 99%
“…Compared with benchmark routing strategy, the proposed system outperforms in terms of signaling overhead, throughput, and delay. In [20], a DRL assisted resource allocation method is designed for ultra dense networks. The original multi-objective problem is decoupled into two parts based on the general theory of DRL.…”
Section: A Related Workmentioning
confidence: 99%
“…Based on the concept of opportunistically minimizing an expectation, the policy that minimizes E {P (t)|Q(t)} is the one that minimizes P (t) with the observation of Q(t) during each slot. Since neither Q i (t)A i (t) nor B in (20) will be affected by the policy at slot t, the upper bound minimization for the drift-plus-penalty can be accomplished by solving the following deterministic problem at slot t:…”
Section: B General Lyapunov Optimizationmentioning
confidence: 99%
“…is the value of r p k in the m th iteration of solving (23). We successively solve (23) with Algorithm 2 and update r m until r m converges.…”
Section: )mentioning
confidence: 99%