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 175 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 28 tok/s Pro
GPT-4o 67 tok/s Pro
Kimi K2 179 tok/s Pro
GPT OSS 120B 442 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Power Allocation and Scheduling for SWIPT Systems with Non-linear Energy Harvesting Model (1602.00453v1)

Published 1 Feb 2016 in cs.IT and math.IT

Abstract: In this paper, we design a resource allocation algorithm for multiuser simultaneous wireless information and power transfer systems for a realistic non-linear energy harvesting (EH) model. In particular, the algorithm design is formulated as a non-convex optimization problem for the maximization of the long-term average total harvested power at EH receivers subject to quality of service requirements for information decoding receivers. To obtain a tractable solution, we transform the corresponding non-convex sum-of-ratios objective function into an equivalent objective function in parametric subtractive form. This leads to a computationally efficient iterative resource allocation algorithm. Numerical results reveal a significant performance gain that can be achieved if the resource allocation algorithm design is based on the non-linear EH model instead of the traditional linear model.

Citations (67)

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.