اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEfficiency Maximization for UAV-Enabled Mobile Relaying Systems with Laser Charging
324
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This work studies the joint problem of power and trajectory optimization in an unmanned aerial vehicle (UAV)-enabled mobile relaying system. In the considered system, in order to provide convenient and sustainable energy supply to the UAV relay, we consider the deployment of a power beacon (PB) which can wirelessly charge the UAV and it is realized by a properly designed laser charging system. To this end, we propose an efficiency (the weighted sum of the energy efficiency during information transmission and wireless power transmission efficiency) maximization problem by optimizing the source/UAV/PB transmit powers along with the UAVs trajectory. This optimization problem is also subject to practical mobility constraints, as well as the information-causality constraint and energy-causality constraint at the UAV. Different from the commonly used alternating optimization (AO) algorithm, two joint design algorithms, namely: the concave-convex procedure (CCCP) and penalty dual decomposition (PDD)-based algorithms, are presented to address the resulting non-convex problem, which features complex objective function with multiple-ratio terms and coupling constraints. These two very different algorithms are both able to achieve a stationary solution of the original efficiency maximization problem. Simulation results validate the effectiveness of the proposed algorithms.
قيم البحث
اقرأ أيضاً
This paper focuses on the design of an optimal resource allocation scheme to maximize the energy efficiency (EE) in a simultaneous wireless information and power transfer (SWIPT) enabled two-way decode-and-forward (DF) relay network under a non-linea
r energy harvesting model. In particular, we formulate an optimization problem by jointly optimizing the transmit powers of two source nodes, the power-splitting (PS) ratios of the relay, and the time for the source-relay transmission, under multiple constraints including the transmit power constraints at sources and the minimum rate requirement. Although the formulated problem is non-convex, an iterative algorithm is developed to obtain the optimal resource allocation. Simulation results verify the proposed algorithm and show that the designed resource allocation scheme is superior to other benchmark schemes in terms of EE.
This paper considers an energy harvesting (EH) based multiuser mobile edge computing (MEC) system, where each user utilizes the harvested energy from renewable energy sources to execute its computation tasks via computation offloading and local compu
ting. Towards maximizing the systems weighted computation rate (i.e., the number of weighted users computing bits within a finite time horizon) subject to the users energy causality constraints due to dynamic energy arrivals, the decision for joint computation offloading and local computing over time is optimized {em over time}. Assuming that the profile of channel state information and dynamic task arrivals at the users is known in advance, the weighted computation rate maximization problem becomes a convex optimization problem. Building on the Lagrange duality method, the well-structured optimal solution is analytically obtained. Both the users local computing and offloading rates are shown to have a monotonically increasing structure. Numerical results show that the proposed design scheme can achieve a significant performance gain over the alternative benchmark schemes.
This paper considers an unmanned aerial vehicle enabled-up link non-orthogonal multiple-access system, where multiple mobile users on the ground send independent messages to a unmanned aerial vehicle in the sky via non-orthogonal multiple-access tran
smission. Our objective is to design the unmanned aerial vehicle dynamic maneuver for maximizing the sum-rate throughput of all mobile ground users over a finite time horizon.
In this letter, we study an unmanned aerial vehicle (UAV)-mounted mobile edge computing network, where the UAV executes computational tasks offloaded from mobile terminal users (TUs) and the motion of each TU follows a Gauss-Markov random model. To e
nsure the quality-of-service (QoS) of each TU, the UAV with limited energy dynamically plans its trajectory according to the locations of mobile TUs. Towards this end, we formulate the problem as a Markov decision process, wherein the UAV trajectory and UAV-TU association are modeled as the parameters to be optimized. To maximize the system reward and meet the QoS constraint, we develop a QoS-based action selection policy in the proposed algorithm based on double deep Q-network. Simulations show that the proposed algorithm converges more quickly and achieves a higher sum throughput than conventional algorithms.
Mobile edge computing (MEC) provides computational services at the edge of networks by offloading tasks from user equipments (UEs). This letter employs an unmanned aerial vehicle (UAV) as the edge computing server to execute offloaded tasks from the
ground UEs. We jointly optimize user association, UAV trajectory, and uploading power of each UE to maximize sum bits offloaded from all UEs to the UAV, subject to energy constraint of the UAV and quality of service (QoS) of each UE. To address the non-convex optimization problem, we first decompose it into three subproblems that are solved with integer programming and successive convex optimization methods respectively. Then, we tackle the overall problem by the multi-variable iterative optimization algorithm. Simulations show that the proposed algorithm can achieve a better performance than other baseline schemes.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
