Robust AN-Aided Beamforming Design for Secure MISO Cognitive Radio Based on a Practical Nonlinear EH Model

Energy harvesting techniques are promising in next generation wireless communication systems. However, most of the existing works are based on an ideal linear energy harvesting model. In this paper, a multiple-input single-output cognitive radio network is studies under a practical non-linear energy harvesting model. In order to improve the security of both the primary network and the secondary network, a cooperative jamming scheme is proposed. A robust artificial noise aided beamforming design problem is formulated under the bounded channel state information error model. The formulated problem is non-convex and challenging to be solved. Using S-procedure and the semidefinite relaxation method, a suboptimal beamforming can be obtained. Simulation results show that the performance achieved under the non-linear energy harvesting model may be better than that obtained under the linear energy harvesting model. It is also shown that the cooperation betwen the primary network and the secondary network can obtain a performance gain compared with that without this cooperation

Hierarchical Deep Reinforcement Learning for Age-of-Information Minimization in IRS-aided and Wireless-powered Wireless Networks

In this paper, we focus on a wireless-powered sensor network coordinated by a multi-antenna access point (AP). Each node can generate sensing information and report the latest information to the AP using the energy harvested from the AP's signal beamforming. We aim to minimize the average age-of-information (AoI) by adapting the nodes' transmission scheduling and the transmission control strategies jointly. To reduce the transmission delay, an intelligent reflecting surface (IRS) is used to enhance the channel conditions by controlling the AP's beamforming vector and the IRS's phase shifting matrix. Considering dynamic data arrivals at different sensing nodes, we propose a hierarchical deep reinforcement learning (DRL) framework to for AoI minimization in two steps. The users' transmission scheduling is firstly determined by the outer-loop DRL approach, e.g. the DQN or PPO algorithm, and then the inner-loop optimization is used to adapt either the uplink information transmission or downlink energy transfer to all nodes. A simple and efficient approximation is also proposed to reduce the inner-loop rum time overhead. Numerical results verify that the hierarchical learning framework outperforms typical baselines in terms of the average AoI and proportional fairness among different nodes.Comment: 31 pages, 6 figures, 2 tables, 3 algorithm

Optimizing Information Freshness in a Multiple Access Channel with Heterogeneous Devices

In this work, we study age-optimal scheduling with stability constraints in a multiple access channel with two heterogeneous source nodes transmitting to a common destination. The first node is connected to a power grid and it has randomly arriving data packets. Another energy harvesting (EH) sensor monitors a stochastic process and sends status updates to the destination. We formulate an optimization problem that aims at minimizing the average age of information (AoI) of the EH node subject to the queue stability condition of the grid-connected node. First, we consider a Probabilistic Random Access (PRA) policy where both nodes make independent transmission decisions based on some fixed probability distributions. We show that with this policy, the average AoI is equal to the average peak AoI, if the EH node only sends freshly generated samples. In addition, we derive the optimal solution in closed form, which reveals some interesting properties of the considered system. Furthermore, we consider a Drift-Plus-Penalty (DPP) policy and develop AoI-optimal and peak-AoI-optimal scheduling algorithms using the Lyapunov optimization theory. Simulation results show that the DPP policy outperforms the PRA policy in various scenarios, especially when the destination node has low multi-packet reception capabilities.Comment: 13 pages, 8 figures, accepted for publication in IEEE Open Journal of the Communications Societ