Minimum Length Scheduling for Discrete-Rate Full-Duplex Wireless Powered Communication Networks
| Autor: | Yalcin Sadi, Sinem Coleri, Muhammad Shahid Iqbal |
|---|---|
| Přispěvatelé: | Ergen, Sinem Çöleri (ORCID 0000-0002-7502-3122 & YÖK ID 7211), Iqbal, Muhammad Shahid, Şadi, Yalçın, Graduate School of Sciences and Engineering, College of Engineering, Department of Electrical and Electronics Engineering |
| Rok vydání: | 2022 |
| Předmět: |
Engineering
electrical and electronic Telecommunications Signal Processing (eess.SP) FOS: Computer and information sciences Optimization problem Optimal scheduling Energy harvesting Batteries Uplink Power control Wireless powered communication networks Full duplex networks Rate adaptation Job shop scheduling business.industry Computer science Computer Science - Information Theory Information Theory (cs.IT) Applied Mathematics Throughput Transmitter power output Computer Science Applications Scheduling (computing) Transmission (telecommunications) FOS: Electrical engineering electronic engineering information engineering Wireless Electrical Engineering and Systems Science - Signal Processing Electrical and Electronic Engineering business 5G Computer network |
| Zdroj: | IEEE Transactions on Wireless Communications |
| ISSN: | 1558-2248 1536-1276 |
| Popis: | Wireless powered communication networks (WPCNs) will act as a major enabler of massive machine type communications (MTCs), which is a major service domain for 5G and beyond systems. The MTC networks will be deployed by using low-power transceivers with finite discrete configurations. This paper considers minimum length scheduling problem for full-duplex WPCNs, where users transmit information to a hybrid access point at a rate chosen from a finite set of discrete-rate levels. The optimization problem considers energy causality, data and maximum transmit power constraints, and is proven to be NP-hard. As a solution strategy, we define the minimum length scheduling (MLS) slot, which is slot of minimum transmission completion time while starting transmission at anytime after the decision time. We solve the problem optimally for a given transmission order based on the optimality analysis of MLS slot. For the general problem, we categorize the problem based on whether the MLS slots of users overlap over time. We propose optimal algorithm for non-overlapping scenario by allocating the MLS slots, and a polynomial-time heuristic algorithm for overlapping scenario by allocating the transmission slot to the user with earliest MLS slot. Through simulations, we demonstrate significant gains of scheduling and discrete rate allocation. Scientific and Technological Research Council of Turkey (TÜBİTAK) |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|