ترغب بنشر مسار تعليمي؟ اضغط هنا

Energy Efficiency and Hover Time Optimization in UAV-based HetNets

239   0   0.0 ( 0 )
 نشر من قبل Sidra Tul Muntaha
 تاريخ النشر 2020
والبحث باللغة English




اسأل ChatGPT حول البحث

In this paper, we investigate the downlink performance of a three-tier heterogeneous network (HetNet). The objective is to enhance the edge capacity of a macro cell by deploying unmanned aerial vehicles (UAVs) as flying base stations and small cells (SCs) for improving the capacity of indoor users in scenarios such as temporary hotspot regions or during disaster situations where the terrestrial network is either insufficient or out of service. UAVs are energy-constrained devices with a limited flight time, therefore, we formulate a two layer optimization scheme, where we first optimize the power consumption of each tier for enhancing the system energy efficiency (EE) under a minimum quality-of-service (QoS) requirement, which is followed by optimizing the average hover time of UAVs. We obtain the solution to these nonlinear constrained optimization problems by first utilizing the Lagrange multipliers method and then implementing a sub-gradient approach for obtaining convergence. The results show that through optimal power allocation, the system EE improves significantly in comparison to when maximum power is allocated to users (ground cellular users or connected vehicles). The hover time optimization results in increased flight time of UAVs thus providing service for longer durations.



قيم البحث

اقرأ أيضاً

As a key technology for future wireless networks, massive multiple-input multiple-output (MIMO) can significantly improve the energy efficiency (EE) and spectral efficiency (SE), and the performance is highly dependant on the degree of the available channel state information (CSI). While most existing works on massive MIMO focused on the case where the instantaneous CSI at the transmitter (CSIT) is available, it is usually not an easy task to obtain precise instantaneous CSIT. In this paper, we investigate EE-SE tradeoff in single-cell massive MIMO downlink transmission with statistical CSIT. To this end, we aim to optimize the system resource efficiency (RE), which is capable of striking an EE-SE balance. We first figure out a closed-form solution for the eigenvectors of the optimal transmit covariance matrices of different user terminals, which indicates that beam domain is in favor of performing RE optimal transmission in massive MIMO downlink. Based on this insight, the RE optimization precoding design is reduced to a real-valued power allocation problem. Exploiting the techniques of sequential optimization and random matrix theory, we further propose a low-complexity suboptimal two-layer water-filling-structured power allocation algorithm. Numerical results illustrate the effectiveness and near-optimal performance of the proposed statistical CSI aided RE optimization approach.
This article proposes a novel framework for unmaned aerial vehicle (UAV) networks with massive access capability supported by non-orthogonal multiple access (NOMA). In order to better understand NOMA enabled UAV networks, three case studies are carri ed out. We first provide performance evaluation of NOMA enabled UAV networks by adopting stochastic geometry to model the positions of UAVs and ground users. Then we investigate the joint trajectory design and power allocation for static NOMA users based on a simplified two-dimensional (2D) model that UAV is flying around at fixed height. As a further advance, we demonstrate the UAV placement issue with the aid of machine learning techniques when the ground users are roaming and the UAVs are capable of adjusting their positions in three-dimensions (3D) accordingly. With these case studies, we can comprehensively understand the UAV systems from fundamental theory to practical implementation.
163 - Jingbo Du , Wei Xu , Chunming Zhao 2019
In this paper, we consider hybrid beamforming designs for multiuser massive multiple-input multiple-output (MIMO)-orthogonal frequency division multiplexing (OFDM) systems. Aiming at maximizing the weighted spectral efficiency, we propose one alterna ting maximization framework where the analog precoding is optimized by Riemannian manifold optimization. If the digital precoding is optimized by a locally optimal algorithm, we obtain a locally optimal alternating maximization algorithm. In contrast, if we use a weighted minimum mean square error (MMSE)-based iterative algorithm for digital precoding, we obtain a suboptimal alternating maximization algorithm with reduced complexity in each iteration. By characterizing the upper bound of the weighted arithmetic and geometric means of mean square errors (MSEs), it is shown that the two alternating maximization algorithms have similar performance when the user specific weights do not have big differences. Verified by numerical results, the performance gap between the two alternating maximization algorithms becomes large when the ratio of the maximal and minimal weights among users is very large. Moreover, we also propose a low-complexity closed-form method without iterations. It employs matrix decomposition for the analog beamforming and weighted MMSE for the digital beamforming. Although it is not supposed to maximize the weighted spectral efficiency, it exhibits small performance deterioration compared to the two iterative alternating maximization algorithms and it qualifies as a good initialization for iterative algorithms, saving thereby iterations.
In the finite blocklength scenario, which is suitable for practical applications, a method of maximizing the average effective secrecy rate (AESR) is proposed for a UAV-enabled secure communication by optimizing the UAVs trajectory and transmit power subject to the UAVs mobility constraints and transmit power constraints. To address the formulated non-convex optimization problem, it is first decomposed into two non-convex subproblems. Then the two subproblems are converted respectively into two convex subproblems via the first-order approximation. Finally, an alternating iteration algorithm is developed by solving the two subproblems iteratively using successive convex approximation (SCA) technique. Numerical results show that our proposed scheme achieves a better AESR performance than both the benchmark schemes.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا