Search

This paper studies the high-speed railway mobile networks (HSRMN), where multiple railway-side sensors (RSs) are deployed along the track to sense environmental data, and multiple train-mounted sensors (TSs) are deployed on the train to collect train data. Both RSs and TSs are scheduled to transmit their sensed data respectively to the ground base station (BS) in a time division multiple access (TDMA) mode. To keep the data received at the BS from the RSs as fresh as possible and also ensure that the TSs complete the given uploading tasks, an optimization problem is established to minimize the average age of information (AoI) of the data gathered from RSs by jointly optimizing sensors’ scheduling and transmission power control constrained by the maximum transmission power budget of RSs and TSs. Since the problem is non-convex and lacks an explicit expression of the objective function and the prior information about future channel state, we present a deep Q-learning network (DQN)-based method to solve it. Particularly, the BS is viewed as the agent, and the action space is constructed by scheduling policy and power control. To further accelerate the convergence speed of the presented DQN-based solution framework, an action space-reduced (ASR) version of the DQN-based method, i.e., the ASR-DQN-based method, is designed by deriving a closed-form solution to the optimal transmission power for a given sensors’ scheduling policy. Numerical simulations show that, compared to the DQN-based method, the ASR-DQN-based method decreases the number of episodes required for convergence by about 23% and reduces the running time by about 41%. Moreover, compared with three baselines, i.e., the random method, the round-robin method, and the deep-Sarsa method, our presented ASR-DQN-based method achieves the lowest average AoI and has the best robustness among these compared methods.

This letter investigates a reconfigurable intelligent surface (RIS)-aided multiple-input single-output (MISO) network with rate splitting multiple access (RSMA), where some specific applications serve paying users (PUs) while non-paying users (NUs) are regarded as potential eavesdroppers. An optimization problem is formulated to maximize the system’s secrecy energy efficiency (SEE), subject to the constraints on the achievable secrecy rate requirement of PUs, the system power budget and the secrecy decoding rate of the common stream, where the beamforming vectors, the artificial noise (AN) vectors, the secrecy common message rates, and the discrete phase shifts are jointly optimized. Due to the non-convexity of the problem with mixed continuous and discrete variables, a method called proximal policy optimization with smooth clipping function (PPO-SCF) is proposed, where a zero-penalty term is presented and integrated into the reward function to ensure the constraints are satisfied. Simulation results show that the proposed PPO-SCF outperforms the baselines in terms of SEE. Furthermore, the impact of numbers of RIS phase-shift elements and the spatial distribution of RIS coordinates on the SEE performance are also discussed.

This letter studies the joint active and passive beamforming in intelligent reflecting surface (IRS)-enhanced wireless powered mobile edge computing (MEC) networks, in which a hybrid access point (HAP) is deployed to charge multiple wireless devices (WDs) and assist in computation of the offloaded tasks from the WDs. An IRS is deployed to enhance the downlink wireless power transfer (WPT) and the uplink tasks offloading (TO). To maximize the systems’ sum computation rate, an optimization problem is formulated by jointly optimizing the time assignment of WPT and TO, the active beamforming at the HAP, the transmit power and computing frequency of the WDs, and the passive beamforming at the IRS. To tackle the non-convex problem, we present an efficient algorithm by utilizing the alternating optimization (AO) and semidefinite relaxation (SDR) techniques. Simulation results show that by deploying IRS in the system, a significant computation rate gain can be achieved. Especially, when the IRS is closer to the WDs or the HAP, the much higher computation rate can be reached.

In this work, a multiple-input multiple-output (MIMO) broadcast channel under the energy harvesting (EH) constraint and the peak power constraint is investigated. The transmitter is equipped with a hybrid energy storage system consisting of a perfect super capacitor (SC) and an inefficient battery, where both elements are with limited energy storage capacities. In addition, the effect of data processing circuit power consumption is also addressed. To be specific, two extreme cases are studied here, where the first assumes ideal/zero circuit power consumption and the second considers a positive constant circuit power consumption where the circuit is always operating at its highest power level. The performance of these two extreme cases hence serve as the upper bound and the lower bound of the system performance in practice, respectively. In this setting, the offline scheduling with ideal and maximum circuit power consumption models are investigated. Their corresponding optimization problems are formulated and solved in terms of weighted sum-throughput. Further, we extend to a general circuit power consumption model. To complement this work, some intuitive online policies are presented for all cases. Interestingly, for the case with maximum circuit power consumption, a close-to-optimal online policy is presented and its performance is shown to be comparable to its offline counterpart in the numerical results.

A modified belief-propagation algorithm is proposed for decoding of irregular low-density parity-check codes. This algorithm effectively reduces the decoding complexity while achieving a BER performance near to or even better than that of the standard belief-propagation algorithm.