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 160 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 31 tok/s Pro
GPT-5 High 33 tok/s Pro
GPT-4o 108 tok/s Pro
Kimi K2 184 tok/s Pro
GPT OSS 120B 434 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Resource Allocation for Selection-Based Cooperative OFDM Networks (1104.5553v3)

Published 29 Apr 2011 in cs.IT and math.IT

Abstract: This paper considers resource allocation to achieve max-min fairness in a selection-based orthogonal frequency division multiplexing network wherein source nodes are assisted by fixed decode-and-forward relays. The joint problem of transmission strategy selection, relay assignment, and power allocation is a combinatorial problem with exponential complexity. To develop effective solutions to these questions, we approach these problems in two stages. The first set of problems assume ideal source-relay channels; this simplification helps illustrate our general methodology and also why our solutions provide tight bounds. We then formulate the general problem of transmission strategy selection, relay assignment, and power allocation at the sources and relays considering all communication channels, i.e., finite power source-relay channels. In both sets of problems mentioned so far, transmissions over subcarriers are assumed to be independent. However, given the attendant problems of synchronization and the implementation using a FFT/IFFT pair, resource allocation at the subcarrier level appears impractical. We, therefore, consider resource allocation at the level of an entire OFDM block. While optimal resource management requires an exhaustive search, we develop tight bounds with lower complexity. Finally, we propose a decentralized block-based relaying scheme. Simulation results using the COST-231 channel model show that this scheme yields close-to-optimal performance while offering many computational benefits.

Citations (1)

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.