Yang Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yang Yang has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Bjorn Ottersten
Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg City, Luxembourg
6 shared publications - Marius Pesavento
Technical University of Darmstadt, Darmstadt, Germany
5 shared publications - Symeon Chatzinotas
Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg City 1855, Luxembourg
5 shared publications - Lei Lei
Xi’an Jiaotong University
2 shared publications - Ying Cui
The Hong Kong University of Science and Technology, Guangzhou, China
2 shared publications - Zhi-Quan Luo
The Chinese University of Hong Kong
2 shared publications
Latest Publications
- 28 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (9) , 13542-13557
Energy Optimization and Lightweight Design for Efficient Federated Learning in Wireless Edge Systems
Energy-efficient federated learning (FL) is important for decentralized learning-based edge computing. The energy consumption of FL is largely affected by the efficiency of local training in edge devices and their communication efficiency to the central server. The majority of studies have focused on improving the latter while continuing to use traditional neural networks for local training. This can be computationally heavy for edge devices, especially given their limited energy supply and computation capabilities. In this paper, we propose a joint lightweight design and energy-saving algorithm (LDES) for efficient FL training and parameter uploading in the wireless edge. In the lightweight design of LDES, we investigate lightweight models in local training by deploying sparse or binary neural networks (SNN or BNN) at the edge, in order to reduce the uploaded data volume and the energy consumption. We develop an enhanced stochastic gradient descent algorithm with guaranteed convergence to handle the issues of non-smoothness and weight constraints (NSC-SGD) in training sparse models. In the energy-optimization part of LDES, we optimize power, bandwidth, and learning parameters to jointly minimize computing, uploading, and broadcasting energy. The numerical results show that LDES can reduce 56.21% energy consumption compared to benchmark FL schemes.
- 28 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (9) , 13542-13557
Energy Optimization and Lightweight Design for Efficient Federated Learning in Wireless Edge Systems
Energy-efficient federated learning (FL) is important for decentralized learning-based edge computing. The energy consumption of FL is largely affected by the efficiency of local training in edge devices and their communication efficiency to the central server. The majority of studies have focused on improving the latter while continuing to use traditional neural networks for local training. This can be computationally heavy for edge devices, especially given their limited energy supply and computation capabilities. In this paper, we propose a joint lightweight design and energy-saving algorithm (LDES) for efficient FL training and parameter uploading in the wireless edge. In the lightweight design of LDES, we investigate lightweight models in local training by deploying sparse or binary neural networks (SNN or BNN) at the edge, in order to reduce the uploaded data volume and the energy consumption. We develop an enhanced stochastic gradient descent algorithm with guaranteed convergence to handle the issues of non-smoothness and weight constraints (NSC-SGD) in training sparse models. In the energy-optimization part of LDES, we optimize power, bandwidth, and learning parameters to jointly minimize computing, uploading, and broadcasting energy. The numerical results show that LDES can reduce 56.21% energy consumption compared to benchmark FL schemes.
- 2 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 70 (1053587X) , 6300-6315
Extended Successive Convex Approximation for Phase Retrieval With Dictionary Learning
Phase retrieval aims at recovering unknown signals from magnitude measurements of linear mixtures. In this paper, we consider the phase retrieval with dictionary learning problem, which includes another prior information that the signal admits a sparse representation over an unknown dictionary. The task is to jointly estimate the dictionary and the sparse representation from magnitude-only measurements. To this end, we study two complementary formulations and develop efficient parallel algorithms by extending the successive convex approximation framework using a smooth majorization. The first algorithm is termed compact-SCAphase and is preferable in the case of moderately diverse mixture models with a low number of mixing components. It adopts a compact formulation that avoids auxiliary variables. The proposed algorithm is highly scalable and has reduced parameter tuning cost. The second algorithm, referred to as SCAphase , uses auxiliary variables and is favorable in the case of highly diverse mixture models. It also renders simple incorporation of additional side constraints. The performance of both methods is evaluated when applied to blind channel estimation from subband magnitude measurements in a multi-antenna random access network. Simulation results show the efficiency of the proposed techniques compared to state-of-the-art methods.
- 2 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 70 (1053587X) , 6300-6315
Extended Successive Convex Approximation for Phase Retrieval With Dictionary Learning
Phase retrieval aims at recovering unknown signals from magnitude measurements of linear mixtures. In this paper, we consider the phase retrieval with dictionary learning problem, which includes another prior information that the signal admits a sparse representation over an unknown dictionary. The task is to jointly estimate the dictionary and the sparse representation from magnitude-only measurements. To this end, we study two complementary formulations and develop efficient parallel algorithms by extending the successive convex approximation framework using a smooth majorization. The first algorithm is termed compact-SCAphase and is preferable in the case of moderately diverse mixture models with a low number of mixing components. It adopts a compact formulation that avoids auxiliary variables. The proposed algorithm is highly scalable and has reduced parameter tuning cost. The second algorithm, referred to as SCAphase , uses auxiliary variables and is favorable in the case of highly diverse mixture models. It also renders simple incorporation of additional side constraints. The performance of both methods is evaluated when applied to blind channel estimation from subband magnitude measurements in a multi-antenna random access network. Simulation results show the efficiency of the proposed techniques compared to state-of-the-art methods.
- Open Access
Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization
In this paper, we propose an inexact block coordinate descent algorithm for large-scale nonsmooth nonconvex optimization problems. At each iteration, a particular block variable is selected and updated by inexactly solving the original optimization problem with respect to that block variable. More precisely, a local approximation of the original optimization problem is solved. The proposed algorithm has several attractive features, namely, i) high flexibility, as the approximation function only needs to be strictly convex and it does not have to be a global upper bound of the original function; ii) fast convergence, as the approximation function can be designed to exploit the problem structure at hand and the stepsize is calculated by the line search; iii) low complexity, as the approximation subproblems are much easier to solve and the line search scheme is carried out over a properly constructed differentiable function; iv) guaranteed convergence of a subsequence to a stationary point, even when the objective function does not have a Lipschitz continuous gradient. Interestingly, when the approximation subproblem is solved by a descent algorithm, convergence of a subsequence to a stationary point is still guaranteed even if the approximation subproblem is solved inexactly by terminating the descent algorithm after a finite number of iterations. These features make the proposed algorithm suitable for large-scale problems where the dimension exceeds the memory and/or the processing capability of the existing hardware. These features are also illustrated by several applications in signal processing and machine learning, for instance, network anomaly detection and phase retrieval.
Open AccessInexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization
In this paper, we propose an inexact block coordinate descent algorithm for large-scale nonsmooth nonconvex optimization problems. At each iteration, a particular block variable is selected and updated by inexactly solving the original optimization problem with respect to that block variable. More precisely, a local approximation of the original optimization problem is solved. The proposed algorithm has several attractive features, namely, i) high flexibility, as the approximation function only needs to be strictly convex and it does not have to be a global upper bound of the original function; ii) fast convergence, as the approximation function can be designed to exploit the problem structure at hand and the stepsize is calculated by the line search; iii) low complexity, as the approximation subproblems are much easier to solve and the line search scheme is carried out over a properly constructed differentiable function; iv) guaranteed convergence of a subsequence to a stationary point, even when the objective function does not have a Lipschitz continuous gradient. Interestingly, when the approximation subproblem is solved by a descent algorithm, convergence of a subsequence to a stationary point is still guaranteed even if the approximation subproblem is solved inexactly by terminating the descent algorithm after a finite number of iterations. These features make the proposed algorithm suitable for large-scale problems where the dimension exceeds the memory and/or the processing capability of the existing hardware. These features are also illustrated by several applications in signal processing and machine learning, for instance, network anomaly detection and phase retrieval.
- 11 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 947-961
Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization
In this paper, we propose an inexact block coordinate descent algorithm for large-scale nonsmooth nonconvex optimization problems. At each iteration, a particular block variable is selected and updated by solving the original optimization problem with respect to that block variable inexactly. More precisely, a local approximation of the original optimization problem is solved. The proposed algorithm has several attractive features, namely, i) high flexibility, as the approximation function only needs to be strictly convex and it does not have to be a global upper bound of the original function; ii) fast convergence, as the approximation function can be designed to exploit the problem structure at hand and the stepsize is calculated by the line search; iii) low complexity, as the approximation subproblems are much easier to solve and the line search scheme is carried out over a properly constructed differentiable function; iv) guaranteed convergence of a subsequence to a stationary point, even when the objective function does not have a Lipschitz continuous gradient. Interestingly, when the approximation subproblem is solved by a descent algorithm, convergence of a subsequence to a stationary point is still guaranteed even if the approximation subproblem is solved inexactly by terminating the descent algorithm after a finite number of iterations. These features make the proposed algorithm suitable for large-scale problems where the dimension exceeds the memory and/or the processing capability of the existing hardware. These features are also illustrated by several applications in signal processing and machine learning, for instance, network anomaly detection and phase retrieval.
- 11 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 947-961
Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization
In this paper, we propose an inexact block coordinate descent algorithm for large-scale nonsmooth nonconvex optimization problems. At each iteration, a particular block variable is selected and updated by solving the original optimization problem with respect to that block variable inexactly. More precisely, a local approximation of the original optimization problem is solved. The proposed algorithm has several attractive features, namely, i) high flexibility, as the approximation function only needs to be strictly convex and it does not have to be a global upper bound of the original function; ii) fast convergence, as the approximation function can be designed to exploit the problem structure at hand and the stepsize is calculated by the line search; iii) low complexity, as the approximation subproblems are much easier to solve and the line search scheme is carried out over a properly constructed differentiable function; iv) guaranteed convergence of a subsequence to a stationary point, even when the objective function does not have a Lipschitz continuous gradient. Interestingly, when the approximation subproblem is solved by a descent algorithm, convergence of a subsequence to a stationary point is still guaranteed even if the approximation subproblem is solved inexactly by terminating the descent algorithm after a finite number of iterations. These features make the proposed algorithm suitable for large-scale problems where the dimension exceeds the memory and/or the processing capability of the existing hardware. These features are also illustrated by several applications in signal processing and machine learning, for instance, network anomaly detection and phase retrieval.
- Open Access
- 25 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 68 (11) , 11323-11337
Load Coupling and Energy Optimization in Multi-Cell and Multi-Carrier NOMA Networks
In this paper, we investigate energy minimization in multi-cell and multi-carrier non-orthogonal multiple access (NOMA) networks. We apply a load-coupling model for NOMA networks to capture the coupling relation of mutual interference among cells. With this analytical tool, we formulate the optimization problem in a NOMA-based load-coupled system, where optimizing load-rate-power allocation, and determining decoding order and user grouping are the key aspects. Theoretically, we prove that the minimum consumed energy can be achieved by using all the time-frequency resources in each cell to deliver users' demand, and allowing all the users to share resource units. From a practical perspective, we consider three types of NOMA grouping schemes, i.e., all-user grouping, partitioned and non-partitioned grouping. We develop tailored solutions for each grouping scheme to enable efficient load-rate-power optimization. These three algorithmic components are embedded into a power-adjustment framework to provide energy-efficient solutions for NOMA networks. Numerical results demonstrate promising energy-saving gains of NOMA over orthogonal multiple access in large-scale cellular networks, in particular for high-demand and resource-limited scenarios. The results also show fast convergence of the proposed algorithms demonstrating the effectiveness of the solutions.
- 25 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 68 (11) , 11323-11337
Open AccessLoad Coupling and Energy Optimization in Multi-Cell and Multi-Carrier NOMA Networks
In this paper, we investigate energy minimization in multi-cell and multi-carrier non-orthogonal multiple access (NOMA) networks. We apply a load-coupling model for NOMA networks to capture the coupling relation of mutual interference among cells. With this analytical tool, we formulate the optimization problem in a NOMA-based load-coupled system, where optimizing load-rate-power allocation, and determining decoding order and user grouping are the key aspects. Theoretically, we prove that the minimum consumed energy can be achieved by using all the time-frequency resources in each cell to deliver users' demand, and allowing all the users to share resource units. From a practical perspective, we consider three types of NOMA grouping schemes, i.e., all-user grouping, partitioned and non-partitioned grouping. We develop tailored solutions for each grouping scheme to enable efficient load-rate-power optimization. These three algorithmic components are embedded into a power-adjustment framework to provide energy-efficient solutions for NOMA networks. Numerical results demonstrate promising energy-saving gains of NOMA over orthogonal multiple access in large-scale cellular networks, in particular for high-demand and resource-limited scenarios. The results also show fast convergence of the proposed algorithms demonstrating the effectiveness of the solutions.
- Open Access
- 14 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 67 (15) , 4107-4121
Energy Efficiency Optimization in MIMO Interference Channels: A Successive Pseudoconvex Approximation Approach
In this paper, we consider the (global and sum) energy efficiency optimization problem in downlink multi-input multi-output multi-cell systems, where all users suffer from multi-user interference. This is a challenging problem due to several reasons: 1) it is a nonconvex fractional programming problem; 2) the transmission rate functions are characterized by (complex-valued) transmit covariance matrices; and 3) the processing-related power consumption may depend on the transmission rate. We tackle this problem by the successive pseudoconvex approximation approach, and we argue that pseudoconvex optimization plays a fundamental role in designing novel iterative algorithms, not only because every locally optimal point of a pseudoconvex optimization problem is also globally optimal, but also because a descent direction is easily obtained from every optimal point of a pseudoconvex optimization problem. The proposed algorithms have the following advantages: 1) fast convergence as the structure of the original optimization problem is preserved as much as possible in the approximate problem solved in each iteration, 2) easy implementation as each approximate problem is suitable for parallel computation and its solution has a closed-form expression, and 3) guaranteed convergence to a stationary point or a Karush-Kuhn-Tucker point. The advantages of the proposed algorithm are also illustrated numerically.
- 14 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 67 (15) , 4107-4121
Open AccessEnergy Efficiency Optimization in MIMO Interference Channels: A Successive Pseudoconvex Approximation Approach
In this paper, we consider the (global and sum) energy efficiency optimization problem in downlink multi-input multi-output multi-cell systems, where all users suffer from multi-user interference. This is a challenging problem due to several reasons: 1) it is a nonconvex fractional programming problem; 2) the transmission rate functions are characterized by (complex-valued) transmit covariance matrices; and 3) the processing-related power consumption may depend on the transmission rate. We tackle this problem by the successive pseudoconvex approximation approach, and we argue that pseudoconvex optimization plays a fundamental role in designing novel iterative algorithms, not only because every locally optimal point of a pseudoconvex optimization problem is also globally optimal, but also because a descent direction is easily obtained from every optimal point of a pseudoconvex optimization problem. The proposed algorithms have the following advantages: 1) fast convergence as the structure of the original optimization problem is preserved as much as possible in the approximate problem solved in each iteration, 2) easy implementation as each approximate problem is suitable for parallel computation and its solution has a closed-form expression, and 3) guaranteed convergence to a stationary point or a Karush-Kuhn-Tucker point. The advantages of the proposed algorithm are also illustrated numerically.
- 29 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 67 (9) , 6612-6625
Optimal Caching Designs for Perfect, Imperfect, and Unknown File Popularity Distributions in Large-Scale Multi-Tier Wireless Networks
Most 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 to an equivalent complementary geometric programming (CGP), and propose an efficient iterative algorithm to obtain a stationary point based on 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.
- 29 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 67 (9) , 6612-6625
Optimal Caching Designs for Perfect, Imperfect, and Unknown File Popularity Distributions in Large-Scale Multi-Tier Wireless Networks
Most 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 to an equivalent complementary geometric programming (CGP), and propose an efficient iterative algorithm to obtain a stationary point based on 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.
- Open Access
- 23 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 12 (6) , 1286-1302
Successive Convex Approximation Algorithms for Sparse Signal Estimation With Nonconvex Regularizations
In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is nonconvex and it can be written as the difference of two convex functions. The proposed framework is based on a nontrivial combination of the majorization–minimization framework and the successive convex approximation framework proposed in literature for a convex regularization function. The proposed framework has several attractive features, namely, first, flexibility, as different choices of the approximate function lead to different types of algorithms; second, fast convergence, as the problem structure can be better exploited by a proper choice of the approximate function and the stepsize is calculated by the line search; third, low complexity, as the approximate function is convex and the line search scheme is carried out over a differentiable function; fourth, guaranteed convergence to a stationary point. We demonstrate these features by two example applications in subspace learning, namely the network anomaly detection problem and the sparse subspace clustering problem. Customizing the proposed framework by adopting the best-response type approximation, we obtain soft-thresholding with exact line search algorithms for which all elements of the unknown parameter are updated in parallel according to closed-form expressions. The attractive features of the proposed algorithms are illustrated numerically.
- 23 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 12 (6) , 1286-1302
Open AccessSuccessive Convex Approximation Algorithms for Sparse Signal Estimation With Nonconvex Regularizations
In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is nonconvex and it can be written as the difference of two convex functions. The proposed framework is based on a nontrivial combination of the majorization–minimization framework and the successive convex approximation framework proposed in literature for a convex regularization function. The proposed framework has several attractive features, namely, first, flexibility, as different choices of the approximate function lead to different types of algorithms; second, fast convergence, as the problem structure can be better exploited by a proper choice of the approximate function and the stepsize is calculated by the line search; third, low complexity, as the approximate function is convex and the line search scheme is carried out over a differentiable function; fourth, guaranteed convergence to a stationary point. We demonstrate these features by two example applications in subspace learning, namely the network anomaly detection problem and the sparse subspace clustering problem. Customizing the proposed framework by adopting the best-response type approximation, we obtain soft-thresholding with exact line search algorithms for which all elements of the unknown parameter are updated in parallel according to closed-form expressions. The attractive features of the proposed algorithms are illustrated numerically.
- Open Access
Optimization of Weighted Individual Energy Efficiencies in Interference Network
This paper studies the maximization of the weighted sum energy efficiency (WSEE). We derive a first-order optimal algorithm applicable to a wide class of communication scenarios exhibiting very fast convergence. We also discuss how to leverage monotonic optimization and fractional programming to obtain a global optimal solution at the cost of higher computational complexity. The WSEE of interference networks is studied in detail with an application to relay-assisted multi-cell communication. This scenario is modeled as a non-regenerative multi-way relay channel and the achievable rate region is derived. We apply the proposed algorithm to this scenario and compare its performance to the global optimal algorithm. The results indicate that the proposed algorithm often achieves the global optimal solution and is close to it otherwise. Convergence is achieved within 10 iterations, while the global optimal solution may require more than $10^6$ iterations.Open AccessOptimization of Weighted Individual Energy Efficiencies in Interference Network
This paper studies the maximization of the weighted sum energy efficiency (WSEE). We derive a first-order optimal algorithm applicable to a wide class of communication scenarios exhibiting very fast convergence. We also discuss how to leverage monotonic optimization and fractional programming to obtain a global optimal solution at the cost of higher computational complexity. The WSEE of interference networks is studied in detail with an application to relay-assisted multi-cell communication. This scenario is modeled as a non-regenerative multi-way relay channel and the achievable rate region is derived. We apply the proposed algorithm to this scenario and compare its performance to the global optimal algorithm. The results indicate that the proposed algorithm often achieves the global optimal solution and is close to it otherwise. Convergence is achieved within 10 iterations, while the global optimal solution may require more than $10^6$ iterations. - Open Access
- 19 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 66 (7) , 3108-3121
Joint and Competitive Caching Designs in Large-Scale Multi-Tier Wireless Multicasting Networks
Caching and multicasting are two promising methods to support massive content delivery in multi-tier wireless networks. In this paper, we consider a random caching and multicasting scheme with caching distributions in the two tiers as design parameters, to achieve efficient content dissemination in a two-tier large-scale cache-enabled wireless multicasting network. First, we derive tractable expressions for the successful transmission probabilities in the general region as well as the high signal-to-noise ratio (SNR) and high user density region, respectively, utilizing tools from stochastic geometry. Then, for the case of a single operator for the two tiers, we formulate the optimal joint caching design problem to maximize the successful transmission probability in the asymptotic region, which is nonconvex in general. By using the block successive approximate optimization technique, we develop an iterative algorithm, which is shown to converge to a stationary point. Next, for the case of two different operators, one for each tier, we formulate the competitive caching design game where each tier maximizes its successful transmission probability in the asymptotic region. We show that the game has a unique Nash equilibrium (NE) and adopt an iterative algorithm, which is shown to converge to the NE under a mild condition. Finally, by numerical simulations, we show that the proposed designs achieve significant gains over existing schemes.
- 19 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 66 (7) , 3108-3121
Open AccessJoint and Competitive Caching Designs in Large-Scale Multi-Tier Wireless Multicasting Networks
Caching and multicasting are two promising methods to support massive content delivery in multi-tier wireless networks. In this paper, we consider a random caching and multicasting scheme with caching distributions in the two tiers as design parameters, to achieve efficient content dissemination in a two-tier large-scale cache-enabled wireless multicasting network. First, we derive tractable expressions for the successful transmission probabilities in the general region as well as the high signal-to-noise ratio (SNR) and high user density region, respectively, utilizing tools from stochastic geometry. Then, for the case of a single operator for the two tiers, we formulate the optimal joint caching design problem to maximize the successful transmission probability in the asymptotic region, which is nonconvex in general. By using the block successive approximate optimization technique, we develop an iterative algorithm, which is shown to converge to a stationary point. Next, for the case of two different operators, one for each tier, we formulate the competitive caching design game where each tier maximizes its successful transmission probability in the asymptotic region. We show that the game has a unique Nash equilibrium (NE) and adopt an iterative algorithm, which is shown to converge to the NE under a mild condition. Finally, by numerical simulations, we show that the proposed designs achieve significant gains over existing schemes.