Minimum Length Scheduling for Discrete Rate Based Full Duplex Wireless Powered Communication Networks
Loading...

Date
2019
Authors
Iqbal, Muhammad Shahid
Şadı, Yalçın
Ergen, Sinem Coleri
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Open Access Color
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
In this study, we consider a wireless powered communication network where multiple users with radio frequency energy harvesting capabilities communicate to a hybrid energy and information access point in full duplex mode. We characterize an optimization framework for minimum length scheduling to determine the optimal rate adaptation and transmission scheduling subject to energy causality and traffic demand constraints of the users considering discrete-rate transmission model. 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, based on an analysis on the characteristics of the optimal solution, we derive optimality conditions for rate adaptation and scheduling using which we propose a fast polynomial-time complexity heuristic algorithm. We illustrate through numerical analysis that the proposed algorithm performs very close to optimal for various network scenarios.
Description
Keywords
Energy harvesting, Wireless powered communication networks, Rate adaptation, Scheduling, Optimization, Wireless powered communication networks, Optimization, Energy transfer; Powered communication, Energy harvesting, Scheduling, Energy harvesting; Optimization; Rate adaptation; Scheduling; Wireless powered communication networks, Rate adaptation
Fields of Science
0508 media and communications, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
WoS Q
Scopus Q
Q3

OpenCitations Citation Count
8
Source
Volume
11803
Issue
Start Page
343
End Page
354
PlumX Metrics
Citations
CrossRef : 5
Scopus : 8
Captures
Mendeley Readers : 3
Google Scholar™


