Browsing by Author "Iqbal, Muhammad Shahid"

Now showing 1 - 8 of 8

Citation Count: 7
Minimum Length Scheduling for Discrete Rate Based Full Duplex Wireless Powered Communication Networks
(Springer, 2019) Iqbal, Muhammad Shahid; Şadı, Yalçın; Ergen, Sinem Coleri
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.
Citation Count: 6
Minimum Length Scheduling for Discrete-Rate Full-Duplex Wireless Powered Communication Networks
(IEEE-Inst Electrical Electronics Engineers Inc, 2022) Iqbal, Muhammad Shahid; Sadi, Yalcin; Coleri, Sinem
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.
Citation Count: 13
Minimum Length Scheduling for Full Duplex Time-Critical Wireless Powered Communication Networks
(IEEE, 2020) Iqbal, Muhammad Shahid; Şadi, Yalçın; Coleri, Sinem
Radio frequency (RF) energy harvesting is key in attaining perpetual lifetime for time-critical wireless powered communication networks (WPCNs) due to full control on energy transfer, far field region, small and low-cost circuitry. In this paper, we propose a novel minimum length scheduling problem to determine the optimal power control, time allocation and schedule subject to data, energy causality and maximum transmit power constraints in a full-duplex WPCN. We first formulate the problem as a mixed integer non-linear programming problem and conjecture that the problem is NP-hard. As a solution strategy, we demonstrate that the power control and time allocation, and the scheduling problems can be solved separately in the optimal solution. For the power control and time allocation problem, we derive the optimal solution by evaluating Karush-Kuhn-Tucker conditions. For the scheduling, we introduce a penalty function allowing reformulation of the problem as a sum penalty minimization problem. Upon derivation of the optimality conditions based on the characteristics of the penalty function, we propose two polynomial-time heuristic algorithms and a reduced-complexity exact algorithm employing smart pruning techniques. Via extensive simulations, we illustrate that the proposed heuristic schemes outperform the schemes for predetermined transmission order of users and achieve close-to-optimal solutions.
Citation Count: 2
Minimum Length Scheduling for Multi-Cell Full Duplex Wireless Powered Communication Networks
(Mdpi, 2021) Iqbal, Muhammad Shahid; Sadi, Yalcin; Coleri, Sinem
Wireless powered communication networks (WPCNs) will be a major enabler of massive machine type communications (MTCs), which is a major service domain for 5G and beyond systems. These MTC networks will be deployed by using low-power transceivers and a very limited set of transmission configurations. We investigate a novel minimum length scheduling problem for multi-cell full-duplex wireless powered communication networks to determine the optimal power control and scheduling for constant rate transmission model. The formulated optimization problem is combinatorial in nature and, thus, difficult to solve for the global optimum. As a solution strategy, first, we decompose the problem into the power control problem (PCP) and scheduling problem. For the PCP, we propose the optimal polynomial time algorithm based on the evaluation of Perron-Frobenius conditions. For the scheduling problem, we propose a heuristic algorithm that aims to maximize the number of concurrently transmitting users by maximizing the allowable interference on each user without violating the signal-to-noise-ratio (SNR) requirements. Through extensive simulations, we demonstrate a 50% reduction in the schedule length by using the proposed algorithm in comparison to unscheduled concurrent transmissions.
Citation Count: 0
Optimal On-Off Transmission Schemes for Full Duplex Wireless Powered Communication Networks
(IEEE, 2020) Iqbal, Muhammad Shahid; Şadi, Yalçın; Coleri, Sinem
In this paper, we consider a full duplex wireless powered communication network where multiple users with radio frequency energy harvesting capability communicate to an energy broadcasting hybrid access point. We investigate the minimum length scheduling and sum throughput maximization problems considering on-off transmission scheme in which users either transmit at a constant power or remain silent. For minimum length scheduling problem, we propose a polynomial-time optimal scheduling algorithm. For sum throughput maximization, we first derive the characteristics of an optimal schedule and then to avoid intractable complexity. We propose a polynomial-time heuristic algorithm which is illustrated to perform nearly optimal through numerical analysis.
Citation Count: 3
Scheduling and Relay Selection for Full-Duplex Wireless Powered Cooperative Communication Networks
(Institute of Electrical and Electronics Engineers Inc., 2020) Iqbal, Muhammad Shahid; Syed, Kazmi Abbas Adil; Coleri, Sinem; Sadi, Yalçın
In this manuscript, we consider a full-duplex wireless powered cooperative communication system where the users communicate with a hybrid access point through relays. We formulate an optimization problem with the objective to minimize the total transmission time through user scheduling and relay selection while considering the traffic demand, energy causality and initial battery levels of the users. The formulated optimization problem is a mixed integer non-linear programming problem, hence difficult to solve for the global optimal solution. As a solution strategy, we decompose the problem into sub problems: time allocation, scheduling and relay selection. In the time allocation problem; the schedule and relays are assumed to be pre-known, we derive the optimal solution by using the optimality analysis. For the scheduling problem; we assume that users know their relays, we determine the optimal schedule. For the relay selection problem; users transmit their information in a pre-determined order, we determine the optimal relays for each user. For the overall scheduling and relay selection problem, we propose a heuristic algorithm which iteratively determines the scheduling and relay selection in polynomial time by using the optimal solutions of the individual relay selection and scheduling problems. Through simulations, we demonstrate that the scheduling length can be significantly reduced through proper scheduling and relay selection. The proposed algorithm performs very close to the optimal solution for different maximum user transmit power, network densities, initial battery levels and hybrid access point power levels. © 2020 IEEE.
Citation Count: 1
Throughput Maximization for Full Duplex Wireless Powered Communication Networks
(Institute of Electrical and Electronics Engineers Inc., 2020) Iqbal, Muhammad Shahid; Çöleri, Sinem; Şadi, Yalçın
In this paper, we consider a full duplex wireless powered communication network where multiple users with RF energy harvesting capabilities communicate to a hybrid energy and information access point. An optimization framework is proposed with the objective of maximizing the sum throughput of the users subject to energy causality and maximum transmit power constraints considering a realistic energy harvesting model incorporating initial battery levels of the users. The joint optimization of power control, time allocation and scheduling is mathematically formulated as a mixed integer non linear programming problem which is hard to solve for a global optimum. The optimal power and time allocation and scheduling decisions are investigated separately based on the optimality analysis on the optimization variables. Optimal power and time allocation problem is proven to be convex for a given transmission order. Based on the derived optimality conditions, we propose a fast polynomial-time complexity heuristic algorithm. We illustrate that the proposed algorithm performs very close-to-optimal while significantly outperforming an equal time allocation based scheduling scheme.
Citation Count: 8
Throughput Maximization in Discrete Rate Based Full Duplex Wireless Powered Communication Networks
(John Wıley & Sons Ltd, 2020) Iqbal, Muhammad Shahid; Şadi, Yalçın; Coleri, Sinem
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.