Non-orthogonal multiple access (NOMA) has potentials to improve the performance of multi-beam satellite systems. The performance optimization in satellite-NOMA systems could be different from that in terrestrial-NOMA systems, e.g., considering distinctive channel models, performance metrics, power constraints, and limited flexibility in resource management. In this paper, we adopt a metric, offered capacity to requested traffic ratio (OCTR), to measure the requested-offered data rate mismatch in multi-beam satellite systems. In the considered system, NOMA is applied to mitigate intra-beam interference while precoding is implemented to reduce inter-beam interference. We jointly optimize power, decoding orders, and terminal-timeslot assignment to improve the max-min fairness of OCTR. The problem is inherently difficult due to the presence of combinatorial and non-convex aspects. We first fix the terminal-timeslot assignment, and develop an optimal fast-convergence algorithmic framework based on Perron-Frobenius theory (PF) for the remaining joint power-allocation and decoding-order optimization problem. Under this framework, we propose a heuristic algorithm for the original problem, which iteratively updates the terminal-timeslot assignment and improves the overall OCTR performance. Numerical results show that the proposed algorithm improves the max-min OCTR by 40.2% over orthogonal multiple access (OMA) in average.Index Terms-Max-min fairness, multi-beam satellite systems, non -orthogonal multiple access (NOMA), offered capacity to requested traffic ratio (OCTR), resource optimization. I. INTRODUCTIONA MULTI-BEAM satellite system provides wireless services to wide-range areas. On the one hand, traffic distribution is typically asymmetric among beams [1]. On the other hand,
Cache-enabled heterogeneous networks (HetNets) have recently emerged as an attractive solution to meet the exponentially increasing demand on mobile data traffic. However, the power consumption and the backhaul limitation of small base stations (SBSs) have become bottlenecks to deploy HetNets. How to relieve the burden of backhauls via wireless caching and enable the HetNets to operate in an energy-efficient way are still open issues. Aiming to minimize the power consumption while guaranteeing QoS requirements of users, in this paper, we address the problem of joint user association (UA) and resource allocation (RA) for coded cache-enabled HetNets. First, based on the many-to-many matching game between the virtual SBSs and users (VSU), we propose a low-complexity joint UA and power allocation (PA) algorithm (JUPVA). Then, considering the unequal BA, we design a three-phase optimization algorithm (JURVA), which makes a joint decision on UA, PA, and BA iteratively. The simulation results demonstrate that the proposed algorithms yield significant performance improvement in terms of power consumption.
In this paper, we investigate potential synergies of non-orthogonal multiple access (NOMA) and beam hopping (BH) for multi-beam satellite systems. The coexistence of BH and NOMA provides time-power-domain flexibilities in mitigating a practical mismatch effect between offered capacity and requested traffic per beam. We formulate the joint BH scheduling and NOMA-based power allocation problem as mixed-integer nonconvex programming. We reveal the exponential-conic structure for the original problem, and reformulate the problem to the format of mixed-integer conic programming (MICP), where the optimum can be obtained by exponential-complexity algorithms. A greedy scheme is proposed to solve the problem on a timeslotby-timeslot basis with polynomial-time complexity. Numerical results show the effectiveness of the proposed efficient suboptimal algorithm in reducing the matching error by 62.57% in average over the OMA scheme and achieving a good trade-off between computational complexity and performance compared to the optimal solution.
In a multi-beam satellite communication system, traffic requests are typically asymmetric across beams and highly heterogeneous among terminals. In practical operations, it is important to achieve a good match between the offered and requested traffic, i.e., to improve the performance of Offered Capacity to requested Traffic Ratio (OCTR). Due to satellites' payload constraints and limited flexibilities, it is a challenging task for resource optimization. In this paper, we tackle this issue by formulating a maxmin resource allocation problem, taking fairness into account such that the lowest OCTR can be maximized. To exploit the potential synergies, we introduce Non-Orthogonal Multiple Access (NOMA) to enable aggressive frequency reuse and mitigate intra-beam interference. Although NOMA has proven its capabilities in improving throughput and fairness in 5G terrestrial networks, for multi-beam satellite systems it is unclear if NOMA can help to enhance the OCTR performance, and hence is worth quantifying how much gain it can bring. To solve the problem, we design a suboptimal algorithm to firstly decompose the original problem into multiple convex subproblems by fixing power allocation for each beam, and secondly adjust beam power to improve the minimum OCTR in iterations. Numerical results show the convergence of the proposed algorithm and the superiority of the proposed NOMA scheme in max-min OCTR.
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.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.