In this paper, we concentrate on the robust multiobjective optimization (MOO) for the tradeoff between energy efficiency (EE) and spectral efficiency (SE) in device-to-device (D2D) communications underlaying heterogeneous networks (HetNets). Different from traditional resource optimization, we focus on finding robust Pareto optimal solutions for spectrum allocation and power coordination in D2D communications underlaying HetNets with the consideration of interference channel uncertainties. The problem is formulated as an uncertain MOO problem to maximize EE and SE of cellular users (CUs) simultaneously while guaranteeing the minimum rate requirements of both CUs and D2D pairs. With the aid of ε-constraint method and strict robustness, we propose a general framework to transform the uncertain MOO problem into a deterministic single-objective optimization problem. As exponential computational complexity is required to solve this highly non-convex problem, the power coordination and the spectrum allocation problems are solved separately, and an effective two-stage iterative algorithm is developed. Finally, simulation results validate that our proposed robust scheme converges fast and significantly outperforms the non-robust scheme in terms of the effective EE-SE tradeoff and the quality of service satisfying probability of D2D pairs.
In this paper, we propose a general framework to study the tradeoff between energy efficiency (EE) and spectral efficiency (SE) in massive MIMO enabled HetNets while ensuring proportional rate fairness among users and taking into account the backhaul capacity constraint. We aim at jointly optimizing user association, spectrum allocation, power coordination, and the number of activated antennas, which is formulated as a multi-objective optimization problem maximizing EE and SE simultaneously. With the help of weighted Tchebycheff method, it is then transformed into a single-objective optimization problem, which is a mixed-integer non-convex problem and requires unaffordable computational complexity to find the optimum. Hence, a low-complexity effective algorithm is developed based on primal decomposition, where we solve the power coordination and number of antenna optimization problem and the user association and spectrum allocation problem separately. Both theoretical analysis and numerical results demonstrate that our proposed algorithm can fast converge within several iterations and significantly improve both the EE-SE tradeoff performance and rate fairness among users compared to other algorithms.
In this paper, we investigate the energy-efficient multiuser mobile-edge computing offloading problem in massive MIMO enabled HetNets, where the CPU-cycle frequency of mobile devices, uplink power control, computational task offloading ratio and uplink transmission duration are jointly optimized. The problem is formulated as minimizing the energy consumption of all mobile devices while satisfying the maximum latency requirement. Specifically, to address this non-convex problem, a low-complexity algorithm is proposed relied on alternating optimization, where we address the joint computational task offloading ratio and uplink transmission duration optimization problem and the uplink power control problem iteratively. Besides, the effectiveness and convergence of the proposed iterative algorithm are analytically studied. Numerical results demonstrate that our proposed algorithm consumes less energy compared to local computing and full uploading schemes, and the application of massive MIMO in HetNets helps to reduce energy consumption of mobile devices.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.