Full-Duplex Wireless Powered Communication Networks Research Articles

Fairness-Aware Transmitter Design for OFDMA-Based Full-Duplex Wireless Powered Communication Networks

Fairness-Aware Transmitter Design for OFDMA-Based Full-Duplex Wireless Powered Communication Networks

Sum rate maximization for multiuser full-duplex wireless powered communication networks

Sum rate maximization for multiuser full-duplex wireless powered communication networks

Exploiting Intelligent Reflecting Surface for Enhancing Full-Duplex Wireless-Powered Communication Networks

Exploiting Intelligent Reflecting Surface for Enhancing Full-Duplex Wireless-Powered Communication Networks

Resource Scheduling for Intelligent Reflecting Surface-Assisted Full-Duplex Wireless-Powered Communication Networks With Phase Errors

Intelligent reflecting surface (IRS) is envisioned as a promising technique to improve the performance of full-duplex wireless powered communication networks (FD-WPCNs). This paper investigates the joint phase beamforming design and resource management for IRS-assisted FD-WPCNs, where multiple wireless devices (WDs) can harvest downlink radio-frequency energy and transmit uplink information to the hybrid access point (HAP) over the same band with the aid of IRS. We first formulate a total transmission time minimization problem subject to the minimum transmit rate and energy causality constraints of WDs. In particular, the random phase error of IRS is integrated into our optimization model. Furthermore, we develop an alternating optimization method to obtain the optimal solution of formulated non-convex problem by iteratively solving two subproblems. For the phase beamforming optimization subproblem, we first convert the random phase errors to a deterministic expression, and then utilize the successive convex approximation method to solve the phase beamforming optimization problem. For the transmit power and time-slot allocation subproblem, the optimal transmit power of WDs is derived in closed-form expressions, and the approximation method and variable substitution technique are adopted to obtain the optimal time-slot allocation and transmit power of HAP. Finally, numerical results are provided to evaluate the performance of our proposed method, and reveal the benefits introduced by the IRS technique as compared to benchmark methods.

Joint Dynamic Passive Beamforming and Resource Allocation for IRS-Aided Full-Duplex WPCN

This paper studies intelligent reflecting surface (IRS)-aided full-duplex (FD) wireless-powered communication network (WPCN), where a hybrid access point (HAP) broadcasts energy signals to multiple devices for their energy harvesting in the downlink (DL) and meanwhile receives information signals in the uplink (UL) with the help of IRS. Particularly, we propose three types of IRS beamforming configurations to strike a balance between the system performance and signaling overhead as well as implementation complexity. We first propose the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">fully dynamic IRS beamforming</i> , where the IRS phase-shift vectors vary with each time slot for both DL wireless energy transfer (WET) and UL wireless information transmission (WIT). To further reduce signaling overhead and implementation complexity, we then study two special cases, namely, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">partially dynamic IRS beamforming</i> and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">static IRS beamforming</i> . For the former case, two different phase-shift vectors can be exploited for the DL WET and the UL WIT, respectively, whereas for the latter case, the same phase-shift vector needs to be applied for both DL and UL transmissions. We aim to maximize the system throughput by jointly optimizing the time allocation, HAP transmit power, and IRS phase shifts for the above three cases. Two efficient algorithms based on alternating optimization and penalty-based algorithms are respectively proposed for both perfect self-interference cancellation (SIC) case and imperfect SIC case by applying successive convex approximation and difference-of-convex optimization techniques. Simulation results demonstrate the benefits of IRS for enhancing the performance of FD-WPCN, especially with fully dynamic IRS beamforming, and also show that the IRS-aided FD-WPCN is able to achieve significantly performance gain compared to its counterpart with half-duplex when the self-interference (SI) is properly suppressed.

Minimum Length Scheduling for Discrete-Rate Full-Duplex Wireless Powered Communication Networks

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.

Minimum Length Scheduling for Multi-Cell Full Duplex Wireless Powered Communication Networks.

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.

Resources optimization for secure transmission in wireless powered communication networks

This paper studies the secrecy communication on wireless powered communication network (WPCN) in an orthogonal frequency division multiplexing (OFDM) system, where an energy harvest (EH) user sends confidential information to the hybrid access point (HAP) in the presence of a potential eavesdropper. We introduce a wireless powered cooperative jammer to improve the secrecy performance of this system. For the user and the jammer, we both consider the linear energy harvesting model and the nonlinear energy harvesting model. More specifically, the half-duplex WPCN is considered first. We study secrecy rate maximization problem by jointly optimizing the time allocation and the transmit power allocation for the HAP, the jammer and the user over sub-carriers. The nested form algorithm is proposed to solve the original non-convex problem, where one-dimension search method is used at the outer layer and a convex approximation algorithm by leveraging DC-based optimization is adopted at the inner layer. Then, the full-duplex WPCN is considered. We formulated the secrecy rate maximization problem and optimized the transmit power by using the DC algorithm and convex optimization. Simulation results demonstrate that the proposed scheme dramatically enhances the secrecy rate compared to the benchmark schemes.

Minimum Length Scheduling for Full Duplex Time-Critical Wireless Powered Communication Networks

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.

Robust Beamforming and Time Allocation for Full-Duplex Wireless-Powered Communication Networks

We propose a joint optimization of beamforming and time allocation for full-duplex (FD) wireless-powered communication networks (WPCNs). In FD-WPCNs, an FD-enabled hybrid access point (HAP) having multiple antennas broadcasts radio frequency (RF) energy to users, and concurrently each user transmits its own information to the HAP. Due to a lack of fixed power supplies at the users, it is difficult for the HAP to have accurate channel state information (CSI) of all links. Therefore, in this letter, a robust algorithm is proposed to maximize the weighted sum rate of the users against the uncertainty of the CSI using the relationship between the weighted sum rate and the weighted sum of mean-square error. Numerical results demonstrate that the proposed algorithm provides robustness against imperfect channel knowledge and benefits of utilizing multiple antennas in the FD-WPCNs.

Secrecy Throughput Maximization for Full-Duplex Wireless Powered IoT Networks Under Fairness Constraints

In this paper, we study the secrecy throughput of a full-duplex wireless powered communication network (WPCN) for Internet of Things (IoT). The WPCN consists of a full-duplex multiantenna base station (BS) and a number of sensor nodes. The BS transmits energy all the time, and each node harvests energy prior to its transmission time slot. The nodes sequentially transmit their confidential information to the BS, and the other nodes are considered as potential eavesdroppers. We first aim to optimize the sum secrecy throughput of the nodes. The optimization variables are the duration of the time slots and the BS beamforming vectors in different time slots. The optimization problem is shown to be nonconvex. To tackle the problem, we propose a suboptimal two stage approach, referred to as sum secrecy throughput maximization (SSTM). In the first stage, the BS focuses its beamforming to blind the potential eavesdroppers (other nodes) during information transmission time slots. Then, the optimal beamforming vector in the initial noninformation transmission time slot and the optimal time slots are derived. We then consider secrecy throughput fairness among the nodes and propose max–min fair (MMF) and proportional fair (PF) algorithms. The MMF algorithm maximizes the minimum secrecy throughput of the nodes, while the PF achieves a good tradeoff between the sum secrecy throughput and fairness among the nodes. Through the numerical simulations, we first demonstrate the superior performance of the SSTM to uniform time slotting and beamforming in different settings. Then, we show the effectiveness of MMF and PF algorithms.

Energy Provision Minimization in Wireless Powered Communication Networks With Node Throughput Requirement

Radio-frequency (RF) energy harvesting is one of the promising technologies in wireless networks. This paper considers wireless powered communication networks (WPCNs) where one hybrid access point (H-AP) coordinates RF energy/information transmissions to/from a set of nodes. For the important type of WPCNs where the nodes have throughput requirement, we aim to minimize H-AP's energy provision (EP) via jointly optimizing the time allocation of energy/information transmissions and H-AP's transmission power while satisfying node throughput requirement. More specifically, the half-duplex WPCN is considered first. We prove that H-AP's energy transmission power must be the maximum allowed value to achieve the minimal EP, then show that the problem is convex under this condition and finally design an algorithm applying golden section search and bisection search jointly to efficiently obtain the optimal time allocation. Second, the full-duplex WPCN is considered. Its EP minimization problem is proved convex. However, due to the hardness of solving it directly, we turn to solve the feasibility problem (FP) for a given EP per unit time. We construct a convex optimization problem based on this FP and design a dual subgradient algorithm for finding its optimal solution, which indicates whether this FP is feasible. The minimal EP per unit time and its corresponding optimal solution are found by using the bisection search method. Simulation results show that, the EP-minimized schemes are able to greatly reduce H-AP's EP as compared to the baseline schemes.

Harvest-Then-Transceive: Throughput Maximization in Full-Duplex Wireless-Powered Communication Networks

Harvest-Then-Transceive: Throughput Maximization in Full-Duplex Wireless-Powered Communication Networks

Energy beamforming for full-duplex wireless-powered communication networks

In this paper, we consider a full-duplex (FD) wireless-powered communication network (WPCN), where one FD hybrid access point (HAP) equipped with multiple antennas simultaneously transmits energy to and receives information from multiple users. Firstly, we propose a space division wireless energy allocation scheme and calculate the harvested energy in downlink wireless energy transfer (WET) for each user. Secondly, we derive an approximate closed-form expression of user’s achievable ergodic rate in uplink wireless information transfer (WIT). Thirdly, the energy allocation for different users is optimized under the max–min user fairness constraint, and a closed-form solution is obtained. Numerical results show that the simulation and the approximation of achievable rates are well matched, and energy beamforming can effectively suppress self-interference (SI), and improve rates as well as fairness among users. Moreover, FD-WPCNs are shown to outperform half-duplex (HD) WPCNs in rates with same number of antennas.

Resource Allocation for a Full-Duplex Wireless-Powered Communication Network With Imperfect Self-Interference Cancelation

We consider a full-duplex wireless powered communication network, supporting wireless power transfer of a hybrid access point in the downlink and time-division multiple-access devices in the uplink simultaneously. By considering the residual self-interference (SI), we formulate the problems of power allocation (PA) and time allocation (TA) to maximize the sum rate of the uplink subject to the energy causality as well as the peak and average power constraints. The non-convex optimization problems of the joint PA-TA and the PA are approximated as second-order cone programs to be solved with successive convex approximation. The results show that the proposed PA-TA (PA) algorithm outperforms the conventional PA-TA when the SI exists at any (severe) level.

Joint Power and Time Allocation in Full-Duplex Wireless Powered Communication Networks

We consider a full-duplex wireless powered communication network (WPCN) with one hybrid access point (H-AP) and a set of distributed users, where downlink wireless energy broadcasting is employed at H-AP and at the same time, uplink wireless information transmission takes place at users in a time-division multiple access manner. We extend proportional fair scheduler to this category of network when dealing with "doubly near-far problem," where users far away from H-AP achieve low throughput but suffer from both low harvested energy and high data transmission power consumption. We jointly optimize power and time allocation for each user to achieve proportional fairness while controlling the energy consumption offset for network to a low level. By using optimization techniques, the optimal transmit power and transmission time for users are obtained via proposed algorithm. Simulation results confirm the positive effect on improving the fairness metric and reducing energy consumption offset for network.

WIRELESS INFORMATION AND ENERGY TRANSFER: TRADEOFF FOR FAIR RESOURCE ALLOCATION

In this paper, we study two schemes for the fair resource allocation in wireless powered communication networks (WPCNs): a non-orthogonal multiple access (NOMA) scheme, and a proportional fair (PF) scheduling scheme. The considered WPCN consists of a base station (BS) that broadcast radio frequency (RF) energy over the downlink, and N energy harvesting users (EHUs). If NOMA is employed, all EHUs concurrently transmit information over the uplink with successive interference cancellation employed at the BS. If PF scheduling is employed, a single EHU is selected for uplink transmission in each frame. For both schemes, we arrive at optimal allocations for the BS transmit power and the time sharing between uplink and downlink transmissions that maximize the uplink sum-rate, while maintaining high level of system fairness. For the PF scheme, we also derive the optimal scheduling policy. Compared to the state-of-the art schemes based upon time division multiple access (TDMA), both schemes significantly improve the system fairness at the expense of minor (or nonexistent) rate degradation. Key words: energy harvesting; wireless powered communication networks; non-orthogonal multiple access; successive interference cancelation; proportional fair scheduling REFERENCES: [1] P. Grover, A. Sahai: Shannon meets Tesla: wireless information and power transfer, Proc. IEEE ISIT 2010, pp. 2363–2367, Austin, USA, June 2010. [2] D. Gunduz, K. Stamatiou, N. Michelusi, M. Zorzi: Designing intelligent energy harvesting communication systems, IEEE Commun. Magazine, 52, 1, 210–216 (Jan.2014). [3] C. K. Ho, R. Zhang: Optimal energy allocation for wireless communications with energy harvesting constraints, IEEE Trans. Signal Proccessing, 60, 9, 4808–4818 (May 2012). [4] H. Ju, R. Zhang: Throughput maximization in wireless powered communication networks, IEEE Trans. Wireless Commun., 13, 1, 418–428 (Jan. 2014). [5] X. Kang, C. Ho Keong, S. Sun: Optimal time allocation for dynamic-TDMA-based wireless powered communication networks, Proc. IEEE Globecom 2014, Austin, USA, Dec. 2014. [6] H. Ju, R. Zhang: Optimal resource allocation in full-duplex wireless-powered communication network, IEEE Trans. on Commun., 62, 10, 3528–3540 (Oct. 2014). [7] T. Takeda, K. Higuchi: Enhanced user fairness using non-orthogonal access with SIC in cellular uplink, VTC 2011, San Francisco, USA, pp. 1–5, 2011. [8] Z. Ding, Z. Yang, P. Fan, H. V. Poor: On the performance of non-orthogonal multiple access in 5G systems with randomly deployed users, IEEE Signal Process. Lett., 21, 12, 1501–1505 (2014). [9] S. Timotheou, I. Krikidis: Fairness for non-orthogonal multiple access in 5G systems, IEEE Signal Process. Lett., 22, 10, 1462–1465 (2015). [10] H. Chingoska, Z. Hadzi-Velkov, I. Nikoloska, N. Zlatanov: Resource Allocation in Wireless Powered Communication Networks with Non-Orthogonal Multiple Access, IEEE Wireless Communications Letters, 5 (6), 684–687 (2016). [11] P. Viswanath, D. N. Tse, R. Laroia: Opportunistic beamforming using dumb antennas, IEEE Trans. Information Theory, 46, 6, 1277–1294 (June 2002). [12] N. Tekbiyik, T. Girici, E. Uysal-Biyikoglu, K. Leblebicioglu: Proportional fair resource allocation on an energy harvesting downlink, IEEE Trans. Wireless Communications, 12, 4, 1699–1711 (April 2013). [13] H. Chingoska, I. Nikoloska, Z. Hadzi-Velkov, N. Zlatanov: Proportional fair scheduling in wireless powered communication networks, 23rd International Conference on Telecommunications (ICT), May 2013. [14] Z. Hadzi-Velkov, I. Nikoloska, H. Chingoska, N. Zlatanov, Proportional fair scheduling in wireless networks with RF energy harvesting and processing cost, IEEE Comm. Letters, 20, 10, 2107–2110 (2016). [15] T.-D. Nguyen, Y. Han: A Proportional Fairness Algorithm with QoS Provision in Downlink OFDMA Systems, IEEE Comm. Letters, 10, 11 (Nov. 2006). [16] Z. Hadzi-Velkov, I. Nikoloska, G. K. Karagiannidis, T. Q. Duong: Wireless networks with energy harvesting and power transfer: joint power and time allocation, IEEE Signal Process. Letters, 23, 1, 50–54 (Jan. 2016). [17] R. Jain, D. Chiu, W. Hawe: A Quantitative measure of fairness and discrimination for resource allocation in shared computer systems, Tech. Rep. TR-301, DEC, September 1984. [18] W. Yu, R. Lui: Dual methods for nonconvex spectrum optimization of multicarrier systems, IEEE Trans. Commun., 54, 7, 1310–1322 (Jul. 2006). [19] L. Liu, R. Zhang, K.-C. Chua: Wireless information transfer with opportunistic energy harvesting, IEEE Trans. Wireless. Commun., 12, 1, 288–300 (Jan. 2013).

Full-Duplex Wireless-Powered Communication Network With Energy Causality

In this paper, we consider a wireless communication network with a full-duplex hybrid energy and information access point and a set of wireless users with energy harvesting capabilities. The hybrid access point (HAP) implements full-duplex through two antennas: one for broadcasting wireless energy to users in the downlink and the other for simultaneously receiving information from the users via time division multiple access (TDMA) in the uplink. Each user can continuously harvest wireless power from the HAP until it transmits, i.e., the energy causality constraint is modeled by assuming that energy harvested in the future cannot be used for the current transmission. This leads to the causal dependence of each user's harvesting time on the transmission time of earlier users, e.g., the second user scheduled to transmit can harvest more energy if the first user has longer transmission time. Under this setup, we investigate the sum-throughput maximization (STM) problem and the total-time minimization (TTM) problem for the proposed full-duplex wireless-powered communication network. For the STM problem, the optimal solution is obtained as a closed-form expression, which can be computed with linear complexity. For the TTM problem, by exploiting the properties of the coupled constraints, we propose a two-step algorithm to obtain an optimal solution. Then, low-complexity suboptimal solutions are proposed for each problem by exploiting the characteristics of the optimal solutions. Finally, simulation studies on the effect of user scheduling show that different scheduling strategies should be adopted for STM and TTM.

Optimal Resource Allocation in Full-Duplex Wireless-Powered Communication Network

This paper studies optimal resource allocation in the wireless-powered communication network (WPCN), where one hybrid access point (H-AP) operating in full duplex (FD) broadcasts wireless energy to a set of distributed users in the downlink (DL) and, at the same time, receives independent information from the users via time-division multiple access in the uplink (UL). We design an efficient protocol to support simultaneous wireless energy transfer (WET) in the DL and wireless information transmission (WIT) in the UL for the proposed FD-WPCN. We jointly optimize the time allocations to the H-AP for DL WET and different users for UL WIT and the transmit power allocations over time at the H-AP to maximize the users' weighted sum rate of UL information transmission with harvested energy. We consider both the cases with perfect and imperfect self-interference cancellation (SIC) at the H-AP, for which we obtain optimal and suboptimal time and power allocation solutions, respectively. Furthermore, we consider the half-duplex (HD) WPCN as a baseline scheme and derive its optimal resource allocation solution. Simulation results show that the FD-WPCN outperforms the HD-WPCN when effective SIC can be implemented and more stringent peak power constraint is applied at the H-AP.