اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدJoint Power and Trajectory Design for Physical-Layer Secrecy in the UAV-Aided Mobile Relaying System
53
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Mobile relaying is emerged as a promising technique to assist wireless communication, driven by the rapid development of unmanned aerial vehicles (UAVs). In this paper, we study secure transmission in a four-node (source, destination, mobile relay, and eavesdropper) system, wherein we focus on maximizing the secrecy rate via jointly optimizing the relay trajectory and the source/relay transmit power. Nevertheless, due to the coupling of the trajectory designing and the power allocating, the secrecy rate maximization (SRM) problem is intractable to solve. Accordingly, we propose an alternating optimization (AO) approach, wherein the trajectory designing and the power allocating are tackled in an alternating manner. Unfortunately, the trajectory designing is a nonconvex problem, and thus is still hard to solve. To circumvent the nonconvexity, we exploit sequential convex programming (SCP) to derive an iterative algorithm, which is proven to converge to a Karush-Kuhn-Tucker (KKT) point of the trajectory design problem. The simulation results demonstrate the efficacy of the joint power and trajectory design in improving the secrecy throughput.
قيم البحث
اقرأ أيضاً
Intelligent reflecting surface (IRS) has emerged as an appealing solution to enhance the wireless communication performance by reconfiguring the wireless propagation environment. In this paper, we propose to apply IRS to the physical-layer service in
tegration (PHY-SI) system, where a single-antenna access point (AP) integrates two sorts of service messages, i.e., multicast message and confidential message, via superposition coding to serve multiple single-antenna users. Our goal is to optimize the power allocation (for transmitting different messages) at the AP and the passive beamforming at the IRS to maximize the achievable secrecy rate region. To this end, we formulate this problem as a bi-objective optimization problem, which is shown equivalent to a secrecy rate maximization problem subject to the constraints on the quality of multicast service. Due to the non-convexity of this problem, we propose two customized algorithms to obtain its high-quality suboptimal solutions, thereby approximately characterizing the secrecy rate region. The resulting performance gap with the globally optimal solution is analyzed. Furthermore, we provide theoretical analysis to unveil the impact of IRS beamforming on the performance of PHY-SI. Numerical results demonstrate the advantages of leveraging IRS in improving the performance of PHY-SI and also validate our theoretical analysis.
Thanks to the line-of-sight (LoS) transmission and flexibility, unmanned aerial vehicles (UAVs) effectively improve the throughput of wireless networks. Nevertheless, the LoS links are prone to severe deterioration by complex propagation environments
, especially in urban areas. Reconfigurable intelligent surfaces (RISs), as a promising technique, can significantly improve the propagation environment and enhance communication quality by intelligently reflecting the received signals. Motivated by this, the joint UAV trajectory and RISs passive beamforming design for a novel RIS-assisted UAV communication system is investigated to maximize the average achievable rate in this letter. To tackle the formulated non-convex problem, we divide it into two subproblems, namely, passive beamforming and trajectory optimization. We first derive a closed-form phase-shift solution for any given UAV trajectory to achieve the phase alignment of the received signals from different transmission paths. Then, with the optimal phase-shift solution, we obtain a suboptimal trajectory solution by using the successive convex approximation (SCA) method. Numerical results demonstrate that the proposed algorithm can considerably improve the average achievable rate of the system.
In this paper, an unmanned aerial vehicle (UAV)-assisted wireless network is considered in which a battery-constrained UAV is assumed to move towards energy-constrained ground nodes to receive status updates about their observed processes. The UAVs f
light trajectory and scheduling of status updates are jointly optimized with the objective of minimizing the normalized weighted sum of Age of Information (NWAoI) values for different physical processes at the UAV. The problem is first formulated as a mixed-integer program. Then, for a given scheduling policy, a convex optimization-based solution is proposed to derive the UAVs optimal flight trajectory and time instants on updates. However, finding the optimal scheduling policy is challenging due to the combinatorial nature of the formulated problem. Therefore, to complement the proposed convex optimization-based solution, a finite-horizon Markov decision process (MDP) is used to find the optimal scheduling policy. Since the state space of the MDP is extremely large, a novel neural combinatorial-based deep reinforcement learning (NCRL) algorithm using deep Q-network (DQN) is proposed to obtain the optimal policy. However, for large-scale scenarios with numerous nodes, the DQN architecture cannot efficiently learn the optimal scheduling policy anymore. Motivated by this, a long short-term memory (LSTM)-based autoencoder is proposed to map the state space to a fixed-size vector representation in such large-scale scenarios. A lower bound on the minimum NWAoI is analytically derived which provides system design guidelines on the appropriate choice of importance weights for different nodes. The numerical results also demonstrate that the proposed NCRL approach can significantly improve the achievable NWAoI per process compared to the baseline policies, such as weight-based and discretized state DQN policies.
In this paper, the problem of unmanned aerial vehicle (UAV) deployment, power allocation, and bandwidth allocation is investigated for a UAV-assisted wireless system operating at terahertz (THz) frequencies. In the studied model, one UAV can service
ground users using the THz frequency band. However, the highly uncertain THz channel will introduce new challenges to the UAV location, user power, and bandwidth allocation optimization problems. Therefore, it is necessary to design a novel framework to deploy UAVs in the THz wireless systems. This problem is formally posed as an optimization problem whose goal is to minimize the total delays of the uplink and downlink transmissions between the UAV and the ground users by jointly optimizing the deployment of the UAV, the transmit power and the bandwidth of each user. The communication delay is crucial for emergency communications. To tackle this nonconvex delay minimization problem, an alternating algorithm is proposed while iteratively solving three subproblems: location optimization subproblem, power control subproblem, and bandwidth allocation subproblem. Simulation results show that the proposed algorithm can reduce the transmission delay by up to $59.3%$, $49.8%$ and $75.5%$ respectively compared to baseline algorithms that optimize only UAV location, bandwidth allocation or transmit power control.
Energy harvesting (EH) nodes can play an important role in cooperative communication systems which do not have a continuous power supply. In this paper, we consider the optimization of conventional and buffer-aided link adaptive EH relaying systems,
where an EH source communicates with the destination via an EH decode-and-forward relay. In conventional relaying, source and relay transmit signals in consecutive time slots whereas in buffer-aided link adaptive relaying, the state of the source-relay and relay-destination channels determines whether the source or the relay is selected for transmission. Our objective is to maximize the system throughput over a finite number of transmission time slots for both relaying protocols. In case of conventional relaying, we propose an offline and several online joint source and relay transmit power allocation schemes. For offline power allocation, we formulate an optimization problem which can be solved optimally. For the online case, we propose a dynamic programming (DP) approach to compute the optimal online transmit power. To alleviate the complexity inherent to DP, we also propose several suboptimal online power allocation schemes. For buffer-aided link adaptive relaying, we show that the joint offline optimization of the source and relay transmit powers along with the link selection results in a mixed integer non-linear program which we solve optimally using the spatial branch-and-bound method. We also propose an efficient online power allocation scheme and a naive online power allocation scheme for buffer-aided link adaptive relaying. Our results show that link adaptive relaying provides performance improvement over conventional relaying at the expense of a higher computational complexity.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
