Throughput Maximization in Bidirectional WPCN with Relay 


Vol. 45,  No. 3, pp. 467-473, Mar.  2020
10.7840/kics.2020.45.3.467


PDF
  Abstract

A wireless powered communication networks (WPCNs) is a network model that transmits a power tranfer signal on a downlink and transmits an information signal on an uplink based on harvested energy through the received signal. In this paper, we assume a WPCN with one hybrid relay and multi-user pairs, and maximize the throughput of users in the network. We apply the harvest then transmit protocol, which is mainly used in the WPCN. We calculate rates of users and formulate sum rate problem. The convex optimization technique proves that the optimal value of the proposed problem can be obtained. Simulation results show that the sum rate through the proposed optimization problem achieves higher performance than the conventional scheme with equal time allocation.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

Y. Ko, S. Kim, J. No, "Throughput Maximization in Bidirectional WPCN with Relay," The Journal of Korean Institute of Communications and Information Sciences, vol. 45, no. 3, pp. 467-473, 2020. DOI: 10.7840/kics.2020.45.3.467.

[ACM Style]

Yeongwoo Ko, Sang-Hyo Kim, and Jong-Seon No. 2020. Throughput Maximization in Bidirectional WPCN with Relay. The Journal of Korean Institute of Communications and Information Sciences, 45, 3, (2020), 467-473. DOI: 10.7840/kics.2020.45.3.467.

[KICS Style]

Yeongwoo Ko, Sang-Hyo Kim, Jong-Seon No, "Throughput Maximization in Bidirectional WPCN with Relay," The Journal of Korean Institute of Communications and Information Sciences, vol. 45, no. 3, pp. 467-473, 3. 2020. (https://doi.org/10.7840/kics.2020.45.3.467)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880