Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 75 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 20 tok/s Pro
GPT-5 High 18 tok/s Pro
GPT-4o 95 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 467 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Energy Efficient RAN Slicing and Beams Selection for Multiplexing of Heterogeneous Services in 5G mmWave Networks (2306.07518v1)

Published 13 Jun 2023 in cs.IT, eess.SP, and math.IT

Abstract: In this paper, we study a RAN resource-slicing problem for energy-efficient communication in an orthogonal frequency division multiple access (OFDMA) based millimeter-wave (mmWave) downlink (DL) network consisting of enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC) services. Specifically, assuming a fixed set of predefined beams, we address an energy efficiency (EE) maximization problem to obtain the optimal beam selection, Resource Block (RB), and transmit power allocation policy to serve URLLC and eMBB users on the same physical radio resources. The problem is formulated as a mixed-integer non-linear fractional programming (MINLFP) problem considering minimum data rate and latency in packet delivery constraints. By leveraging the properties of fractional programming theory, we first transform the formulated non-convex optimization problem in fractional form into a tractable subtractive form. Subsequently, we solve the transformed problem using a two-loop iterative algorithm. The main resource-slicing problem is solved in the inner loop utilizing the difference of convex (DC) programming and successive convex approximation (SCA) techniques. Subsequently, the outer loop is solved using the Dinkelbach method to acquire an improved solution in every iteration until it converges. Our simulation results illustrate the performance gains of the proposed methodology with respect to baseline algorithms with the fixed and mixed resource grid models.

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.