Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and 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 171 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 30 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 118 tok/s Pro
Kimi K2 204 tok/s Pro
GPT OSS 120B 431 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Resource Allocation for Downlink Cellular OFDMA Systems: Part II - Practical Algorithms and Optimal Reuse Factor (0811.1112v3)

Published 7 Nov 2008 in cs.IT and math.IT

Abstract: In a companion paper, we characterized the optimal resource allocation in terms of power control and subcarrier assignment, for a downlink sectorized OFDMA system. In our model, the network is assumed to be one dimensional for the sake of analysis. We also assume that a certain part of the available bandwidth is likely to be reused by different base stations while that the other part of the bandwidth is shared in an orthogonal way between these base stations. The optimal resource allocation characterized in Part I is obtained by minimizing the total power spent by the network under the constraint that all users rate requirements are satisfied. When optimal resource allocation is used, any user receives data either in the reused bandwidth or in the protected bandwidth, but not in both (except for at most one pivot-user in each cell). We also proposed an algorithm that determines the optimal values of users resource allocation parameters. The optimal allocation algorithm proposed in Part I requires a large number of operations. In the present paper, we propose a distributed practical resource allocation algorithm with low complexity. We study the asymptotic behavior of both this simplified resource allocation algorithm and the optimal resource allocation algorithm of Part I as the number of users in each cell tends to infinity. Our analysis allows to prove that the proposed simplified algorithm is asymptotically optimal. As a byproduct of our analysis, we characterize the optimal value of the frequency reuse factor.

Citations (49)

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions 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.