Throughput Maximization in Discrete Rate Based Full Duplex Wireless Powered Communication Networks
Loading...
Date
2020
Journal Title
Journal ISSN
Volume Title
Publisher
John Wıley & Sons Ltd
Open Access Color
BRONZE
Green Open Access
Yes
OpenAIRE Downloads
19
OpenAIRE Views
7
Publicly Funded
No
Abstract
In this study, we consider a discrete rate full-duplex wireless powered communication network. We characterize a novel optimization framework for sum throughput maximization to determine the rate adaptation and transmission schedule subject to energy causality and user transmit power. We first formulate the problem as a mixed integer nonlinear programming problem, which is hard to solve for a global optimum in polynomial-time. Then, we investigate the characteristics of the solution and propose a polynomial time heuristic algorithm for rate adaptation and scheduling problem. Through numerical analysis, we illustrate that the proposed scheduling algorithm outperforms the conventional schemes such as equal time allocation half-duplex and on-off transmission schemes for different initial battery levels, hybrid access point transmit power and network densities.
Description
Keywords
Rate adaptation, Scheduling, Throughput maximization, Wireless powered communication networks, Wireless powered communication networks, Throughput maximization, Rate adaptation; Scheduling; Throughput maximization; Wireless powered communication networks, Scheduling, Telecommunications, Rate adaptation
Turkish CoHE Thesis Center URL
Fields of Science
0508 media and communications, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
WoS Q
Q4
Scopus Q
Q2

OpenCitations Citation Count
3
Source
Internet Technology Letters
Volume
4
Issue
Start Page
End Page
PlumX Metrics
Citations
CrossRef : 2
Scopus : 2
SCOPUS™ Citations
2
checked on Feb 03, 2026
Web of Science™ Citations
13
checked on Feb 03, 2026
Page Views
6
checked on Feb 03, 2026
Downloads
222
checked on Feb 03, 2026
Google Scholar™


