TY - GEN
T1 - Sum-throughput maximization for NOMA-Based WPCN with signal alignment
AU - Song, Dongyeong
AU - Shin, Wonjae
AU - Lee, Jungwoo
AU - Vincent Poor, H.
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/6
Y1 - 2020/6
N2 - In this paper, we consider wireless powered communication networks (WPCNs) consisting of a power beacon (PB) with a single antenna, a base station (BS) with M antennas, and 2M energy harvesting users with N antennas, where N > M/2. A PB transfers energy to the users during downlink and the users transmit information using the harvested energy during uplink, where non-orthogonal multiple access (NOMA) is adopted. For NOMA, signal alignment is exploited to reduce the number of messages decoded by successive interference cancellation (SIC). The transmit/receive beamforming matrices can be further optimized in order to maximize the signal to noise ratios (SNRs) of the aligned signals. A sum-throughput maximization problem for the considered network is formulated, and is then transformed into an equivalent problem which is convex with respect to the time and energy resources. A novel algorithm to maximize the sum-throughput as well as to determine the beamforming matrices is presented.
AB - In this paper, we consider wireless powered communication networks (WPCNs) consisting of a power beacon (PB) with a single antenna, a base station (BS) with M antennas, and 2M energy harvesting users with N antennas, where N > M/2. A PB transfers energy to the users during downlink and the users transmit information using the harvested energy during uplink, where non-orthogonal multiple access (NOMA) is adopted. For NOMA, signal alignment is exploited to reduce the number of messages decoded by successive interference cancellation (SIC). The transmit/receive beamforming matrices can be further optimized in order to maximize the signal to noise ratios (SNRs) of the aligned signals. A sum-throughput maximization problem for the considered network is formulated, and is then transformed into an equivalent problem which is convex with respect to the time and energy resources. A novel algorithm to maximize the sum-throughput as well as to determine the beamforming matrices is presented.
UR - http://www.scopus.com/inward/record.url?scp=85090282572&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85090282572&partnerID=8YFLogxK
U2 - 10.1109/ICCWorkshops49005.2020.9145160
DO - 10.1109/ICCWorkshops49005.2020.9145160
M3 - Conference contribution
AN - SCOPUS:85090282572
T3 - 2020 IEEE International Conference on Communications Workshops, ICC Workshops 2020 - Proceedings
BT - 2020 IEEE International Conference on Communications Workshops, ICC Workshops 2020 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2020 IEEE International Conference on Communications Workshops, ICC Workshops 2020
Y2 - 7 June 2020 through 11 June 2020
ER -