In this paper, we investigate unconstrained and constrained sample-based federated optimization, respectively. For each problem, we propose a privacy preserving algorithm using stochastic successive convex approximation (SSCA) techniques, and show that it can converge to a Karush-Kuhn-Tucker (KKT) point. To the best of our knowledge, SSCA has not been used for solving federated optimization, and federated optimization with nonconvex constraints has not been investigated. Next, we customize the two proposed SSCA-based algorithms to two application examples, and provide closed-form solutions for the respective approximate convex problems at each iteration of SSCA. Finally, numerical experiments demonstrate inherent advantages of the proposed algorithms in terms of convergence speed, communication cost and model specification.

In this paper, we would like to investigate the optimal wireless streaming of a multi-quality tiled 360 virtual reality (VR) video from a server to multiple users. To this end, we propose to maximally exploit potential multicast opportunities by effectively utilizing characteristics of multi-quality tiled 360 VR videos and computation resources at the users' side. In particular, we consider two requirements for quality variation in one field-of-view (FoV), i.e., the absolute smoothness requirement and the relative smoothness requirement, and two video playback modes, i.e., the direct-playback mode (without user transcoding) and transcode-playback mode (with user transcoding). Besides natural multicast opportunities, we introduce two new types of multicast opportunities, namely, relative smoothness-enabled multicast opportunities, which allow a flexible tradeoff between viewing quality and communications resource consumption, and transcoding-enabled multicast opportunities, which allow a flexible tradeoff between computation and communications resource consumptions. Then, we establish a novel mathematical model that reflects the impacts of natural, relative smoothness-enabled, and transcoding-enabled multicast opportunities on the average transmission energy and transcoding energy. Based on this model, we optimize the transmission resource allocation, playback quality level selection, and transmission quality level selection to minimize the energy consumption in the four cases with different requirements for quality variation and video playback modes. By comparing the optimal values in the four cases, we prove that the energy consumption reduces when more multicast opportunities can be utilized. Finally, numerical results show substantial gains of the proposed solutions over existing schemes, and demonstrate the importance of exploiting of the three types of multicast opportunities.

In this paper, we study an intelligent reflecting surface (IRS)-assisted system where a multi-antenna base station (BS) serves a single-antenna user with the help of a multi-element IRS in the presence of interference generated by a multi-antenna BS serving its own single-antenna user. The signal and interference links via the IRS are modeled with Rician fading. To reduce phase adjustment cost, we adopt quasi-static phase shift design where the phase shifts do not change with the instantaneous channel state information (CSI). Maximum Ratio Transmission (MRT) is adopted at the two BSs to enhance the receive signals at their own users. First, we obtain a tractable expression of the ergodic rate. Then, we maximize the ergodic rate with respect to the phase shifts, corresponding to a non-convex optimization problem. We obtain a globally optimal solution under certain system parameters, and propose an iterative algorithm based on parallel coordinate descent (PCD), to obtain a stationary point under arbitrary system parameters. Finally, we numerically verify the analytical results and demonstrate the notable gains of the proposed solutions. To the best of our knowledge, this is the first work that studies the analysis and optimization of the ergodic rate of an IRS-assisted system in the presence of interference.

Rate splitting (RS) is a potentially powerful and flexible technique for multi-antenna downlink transmission. In this paper, we address several technical challenges towards its practical implementation for beyond 5G systems. To this end, we focus on a single-cell system with a multi-antenna base station (BS) and K single-antenna receivers. We consider RS in its most general form with 2K-1 streams, and joint decoding to fully exploit the potential of RS. First, we investigate the achievable rates under joint decoding and formulate the precoder design problems to maximize a general utility function, or to minimize the transmit power under pre-defined rate targets. Building upon the concave-convex procedure (CCCP), we propose precoder design algorithms for an arbitrary number of users. Our proposed algorithms approximate the intractable non-convex problems with a number of successively refined convex problems, and provably converge to stationary points of the original problems. Then, to reduce the decoding complexity, we consider the optimization of the precoder and the decoding order under successive decoding. Further, we propose a stream selection algorithm to reduce the number of precoded signals. With a reduced number of streams and successive decoding at the receivers, our proposed algorithm can even be implemented when the number of users is relatively large, whereas the complexity was previously considered as prohibitively high in the same setting. Finally, we propose a simple adaptation of our algorithms to account for the imperfection of the channel state information at the transmitter. Numerical results demonstrate that the general RS scheme provides a substantial performance gain as compared to state-of-the-art linear precoding schemes, especially with a moderately large number of users.

In this article, we study an intelligent reflecting surface (IRS)-assisted system where a multi-antenna base station (BS) serves a single-antenna user with the help of a multi-element IRS in the presence of interference generated by a multi-antenna BS serving its own single-antenna user. The signal and interference links via the IRS are modeled with Rician fading. To reduce phase adjustment cost, we adopt quasi-static phase shift design where the phase shifts do not change with the instantaneous channel state information (CSI). We investigate two cases of CSI at the BSs, namely, the instantaneous CSI case and the statistical CSI case, and apply Maximum Ratio Transmission (MRT) based on the complete CSI and the CSI of the Line-of-sight (LoS) components, respectively. Different costs on channel estimation and beamforming adjustment are incurred in the two CSI cases. First, we obtain a tractable expression of the average rate in the instantaneous CSI case and a tractable expression of the ergodic rate in the statistical CSI case. We also provide sufficient conditions for the average rate in the instantaneous CSI case to surpass the ergodic rate in the statistical CSI case, at any phase shifts. Then, we maximize the average rate and ergodic rate, both with respect to the phase shifts, leading to two non-convex optimization problems. For each problem, we obtain a globally optimal solution under certain system parameters, and propose an iterative algorithm based on parallel coordinate descent (PCD) to obtain a stationary point under arbitrary system parameters. Next, in each CSI case, we provide sufficient conditions under which the optimal quasi-static phase shift design is beneficial, compared to the system without IRS. Finally, we numerically verify the analytical results and demonstrate notable gains of the proposal solutions over existing ones. To the best of our knowledge, this is the first work that considers optimal quasi-static phase shift design for an IRS-assisted system in the presence of interference.

In this paper, we would like to investigate fundamental impacts of multicast opportunities on efficient transmission of a 360 VR video to multiple users in the cases with and without transcoding at each user. We establish a novel mathematical model that reflects the impacts of multicast opportunities on the average transmission energy in both cases and the transcoding energy in the case with user transcoding, and facilitates the optimal exploitation of transcoding-enabled multicast opportunities. In the case without user transcoding, we optimize the transmission resource allocation to minimize the average transmission energy by exploiting natural multicast opportunities. The problem is nonconvex. We transform it to an equivalent convex problem and obtain an optimal solution using standard convex optimization techniques. In the case with user transcoding, we optimize the transmission resource allocation and the transmission quality level selection to minimize the weighted sum of the average transmission energy and the transcoding energy by exploiting both natural and transcoding- enabled multicast opportunities. The problem is a challenging mixed discrete-continuous optimization problem. We transform it to a Difference of Convex (DC) programming problem and obtain a suboptimal solution using a DC algorithm. Finally, numerical results demonstrate the importance of effective exploitation of transcoding-enabled multicast opportunities in the case with user transcoding.

Most of the existing caching solutions for wireless networks rest on the ideal assumption that the file popularity distribution is perfectly known. In this paper, we consider optimal random caching designs for perfect, imperfect, and unknown file popularity distributions in a large-scale multi-tier wireless network. First, in the case of perfect file popularity distribution, we formulate the successful transmission probability (STP) optimization problem, which is nonconvex. We propose an efficient parallel iterative algorithm to obtain a stationary point based on parallel successive convex approximation (SCA). Then, in the case of imperfect file popularity distribution, we formulate the worst-case STP maximization problem. To solve this challenging robust optimization problem, we transform it into an equivalent complementary geometric programming (CGP) and propose an efficient iterative algorithm to obtain a stationary point based on the SCA. To the best of our knowledge, this is the first work explicitly considering the estimation error of file popularity distribution in the optimization of caching design. Next, in the case of unknown file popularity distribution, we formulate the stochastic STP (i.e., the STP in the stochastic form) maximization problem. This is a challenging nonconvex stochastic optimization problem, and we propose an efficient iterative algorithm to obtain a stationary point based on stochastic parallel SCA. As far as we know, this is the first work considering stochastic optimization in a large-scale wireless network. Finally, by numerical results, we show that the proposed solutions achieve notable gains over existing schemes in all three cases and reveal the values of the robust caching optimization and stochastic caching optimization in the cases of imperfect file popularity distribution and unknown file popularity distribution, respectively.

A 360 virtual reality (VR) video, recording a scene of interest in every direction, provides VR users with immersive viewing experience. However, transmission of a 360 VR video which is of a much larger size than a traditional video to mobile users brings a heavy burden to a wireless network. In this paper, we consider multi-quality multicast of a 360 VR video from a single server to multiple users using time division multiple access (TDMA). To improve transmission efficiency, tiling is adopted, and each tile is pre-encoded into multiple representations with different qualities. We optimize the quality level selection, transmission time allocation and transmission power allocation to maximize the total utility of all users under the transmission time and power allocation constraints as well as the quality smoothness constraints for mixed-quality tiles. The problem is a challenging mixed discrete-continuous optimization problem. We propose two low-complexity algorithms to obtain two suboptimal solutions, using continuous relaxation and DC programming, respectively. Finally, numerical results demonstrate the advantage of the proposed solutions.