File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

이훈

Lee, Hoon
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Minimum Rate Maximization for Wireless Powered Cloud Radio Access Networks

Author(s)
Kim, JaeinLee, HoonPark, Seok-HwanLee, Inkyu
Issued Date
2019-01
DOI
10.1109/TVT.2018.2881969
URI
https://scholarworks.unist.ac.kr/handle/201301/65471
Fulltext
https://ieeexplore.ieee.org/document/8540005/
Citation
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, v.68, no.1, pp.1045 - 1049
Abstract
This paper studies the optimization of signal processing strategies for downlink and uplink of a cloud radio access network (C-RAN) that serves wireless powered users with non-linear energy harvesting (EH) circuits. On the downlink, a baseband processing unit (BBU) sends radio frequency signals to the users through a set of remote radio heads (RRHs), which is centrally managed by the BBU via finite-fronthaul links. Then, each user splits the received signal for information decoding and EH by utilizing the power splitting circuit. By using the harvested energy, each user communicates with the BBU via the RRHs on the uplink. In this paper, we tackle a problem of maximizing the minimum uplink rate of the users subject to the minimum downlink rate constraint as well as the per-node transmit power and fronthaul capacity constraints. To overcome the non-convexity of the problem, we propose an iterative algorithm based on a successive convex approximation method, which obtains a locally optimal solution. Numerical results confirm the effectiveness of the proposed techniques for C-RAN systems with battery-limited users.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
ISSN
0018-9545
Keyword (Author)
C-RANmultiple antenna techniqueswireless power transfer
Keyword
RESOURCE-ALLOCATIONINFORMATIONCOMMUNICATION

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.