Search

Drones and drone swarms, characterized by their low price and ease of deployment, are being utilized to launch assaults, and presenting a great threat to the public and homeland security in recent years. Countering drones or drone swarms is thus of great significance. Some effective counter approaches for a small group of drones have been studied. However, these approaches may be insufficient to counter a large-scale drone swarm due to the lack of efficient time-saving detecting technologies. Towards this end, this paper proposes a fast counter approach to deprive the drone swarm of its coordination and clustering capabilities in a short time by splitting the drone swarm into several unconnected components. To achieve efficient splitting, two efficient algorithms for searching critical nodes are proposed, namely, the genetic algorithm and the particle swarm optimization algorithm. Extensive simulation results are presented to validate the superior performances of the proposed two algorithms for splitting the drone swarms in different formations. The results show that the drone swarms lose their coordination ability as they are forced to split into multiple components with a constraint of group size. The high accuracy and efficiency of the proposed algorithms are also verified by a series of comparative experiments. [ABSTRACT FROM AUTHOR]

The air-ground cooperative emergency networks can assist with the rapid reconstruction of communication in the disaster area, where unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs) are deployed as base stations. The trajectory optimization of emergency base stations is of vital importance to the communication performance, which is related to the timeliness and effectiveness of rescue. In this paper, federated multi-agent deep deterministic policy gradient (F-MADDPG) based trajectory optimization algorithm is proposed to maximize the average spectrum efficiency. Specifically, the property of MADDPG is inherited to jointly control of multiple vehicles and federated averaging (FA) is utilized to eliminate the isolation of data to accelerate the convergence. Distributed F-MADDPG (DF-MADDPG) is further designed to reduce the communication overhead with a distributed architecture. The simulation results indicate that the proposed F-MADDPG and DF-MADDPG based algorithms significantly outperform the existing trajectory optimization algorithms, in terms of the average spectrum efficiency and the speed of convergence. [ABSTRACT FROM AUTHOR]

In this paper, we consider an underwater linear network, where an autonomous underwater vehicle (AUV) gathers data from a set of underwater devices. The AUV monitors a set of physical processes, where the status of each process can be sensed by one or more devices and each device is capable of sensing one or more processes. The AUV needs to maintain freshness of its information status about the monitored processes. To quantify the freshness of the information at the AUV, we consider the concept of the age of information (AoI), which represents the amount of time elapsed since the most recently delivered update information was generated. A framework is proposed to optimize the AUV's linear movement trajectory and scheduling of process status updates with the objective of minimizing the normalized weighted sum of the average AoI of the monitored physical processes. The formulated optimization problem is a non-convex mixed integer problem, which cannot be solved by the standard optimization techniques. We develop a solution approach based on the technique of deep reinforcement learning (DRL). Specifically, we leverage an actor-critic DRL approach to find the optimum locations and stopping time of the data gathering points. Simulation results illustrate that the proposed framework maintains robustness under different scenarios and provides better performance when compared with baseline and $K$ -means clustering approaches. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a fifth generation cellular vehicle-to-everything based platoon system and propose low-complexity dynamic manager selection and resource allocation algorithms in the finite block length regime, to meet the ultra reliable and low latency communication requirements of intra-platoon safety-related data transmission. A closed-form expression for the platoon manager index is derived, based on which a low-complexity dynamic platoon manager selection algorithm is proposed, enabling a significant communication performance enhancement over the conventional head vehicle platoon manager algorithm. This is also the first work to investigate the impact of finite block length on platoon communication. The optimal finite block length coding rate under automatic repeat request retransmission is obtained. A subchannel multiplexing criterion is proposed and closed-form expressions for the optimal transmission powers of the platoon manager and its subchannel multiplexing partner are derived. Based on the theoretical findings, a joint resource allocation and coding rate optimization algorithm is proposed, achieving a near-optimal performance in terms of groupcast latency with a significant complexity reduction over exhaustive search. [ABSTRACT FROM AUTHOR]

Machine-type communications (MTC) is a key technology for Internet-of-Things (IoT) services in 5G mobile communications and beyond. An essential design problem for an MTC network is the efficient and scalable data collection from low-power machine-type communication devices (MTCDs). This paper uses unmanned aerial vehicles (UAVs) to facilitate data collection from a clustered MTC network on the ground. The notion of artificial energy map (AEM) is introduced as a novel modeling technique for energy efficiency analysis, which is critical to the subject of investigation here considering the limited energy of battery-powered MTCDs and UAVs. The proposed design framework first determines the number of MTCD clusters $L_\mathrm{{opt}}$ according to a certain criterion. A greedy learning clustering (GLC) algorithm is then employed to divide the MTCDs into $L_\mathrm{{opt}}$ clusters. For each MTCD cluster, an AEM is constructed, and the optimal UAV hovering strategy within the cluster can be obtained accordingly. Finally, the UAV stations travel across the clusters and collect data from each cluster while hovering above it. This AEM-based modeling technique leads to a solution that can effectively improve the energy efficiency (EE) of UAV-enabled data collection. However, the MTCD clustering strategy, UAV hovering strategy, and UAV flying strategy all have impacts on the overall energy efficiency, which results in a coupled optimization problem that is difficult to solve. The GLC-AEM method is proposed to decouple the original EE optimization problem into sub-problems that can be handled easily by standard optimization techniques. Simulation results show that the GLC-AEM algorithm can be applied to UAV-enabled data collection scenarios with single and multiple UAV stations, and it can improve the overall EE effectively. Besides, the GLC-AEM algorithm shows good scalability and consistent performance in clustered MTC networks. The more MTCDs, the higher the achieved EE. [ABSTRACT FROM AUTHOR]

Cognitive radio networks (CRNs) and millimeter wave (mmWave) communications are two major technologies to enhance the spectrum efficiency (SE). Considering that the SE improvement in the CRNs is limited due to the interference temperature imposed on the primary user (PU), and the severe path loss and high directivity in mmWave communications make it vulnerable to blockage events, we introduce an intelligent reflecting surface (IRS) into mmWave CRNs. Due to the estimation mismatch and the passivity of Eavesdroppers (Eves), perfect channel state information (CSI) of wiretap links is challenging to obtain, which promotes our research on robust secure beamforming (BF) design in the IRS-assisted mmWave CRNs. This paper considers the collaborate scenario of Eves, which allows us to investigate the BF design in the harsh eavesdropping environment. Specifically, by using a uniform linear array (ULA) at the cognitive base station (CBS) and a uniform planar array (UPA) at the IRS, and supposing that imperfect CSIs of angle-of-departures for wiretap links are known, we formulate a constrained problem to maximize the worst-case achievable secrecy rate (ASR) of the secondary user (SU) by jointly designing the transmit BF at the CBS and reflect BF at the IRS. To solve the non-convex problem with coupled variables, an efficient alternating optimization algorithm is proposed. As for the transmit BF at the CBS, we propose a heuristic robust transmit BF algorithm to attain the BF vectors analytically. As for the reflect BF at the IRS, by means of an auxiliary variable, we transform the non-convex problem into a semi-definite programming problem with rank-1 constraint, which is handled with the help of an iterative penalty function, and then obtain the optimal reflect BF through CVX. Finally, simulation results indicate that the ASR performance of our proposed algorithm has a small gap with that of the optimal solution with perfect CSI compared with the other benchmarks. [ABSTRACT FROM AUTHOR]

The dual-function radar communication (DFRC) is an essential technology in Internet of Vehicles (IoV). Consider that the road-side unit (RSU) employs the DFRC signals to sense the vehicles’ position state information (PSI), and communicates with the vehicles based on PSI. The objective of this paper is to minimize the maximum communication delay among all vehicles by considering the estimation accuracy constraint of the vehicles’ PSI and the transmit power constraint of RSU. By leveraging convex optimization theory, two iterative power allocation algorithms are proposed with different complexities and applicable scenarios. Simulation results indicate that the proposed power allocation algorithm converges and can significantly reduce the maximum transmit delay among vehicles compared with other schemes. [ABSTRACT FROM AUTHOR]

This paper utilizes a reconfigurable intelligent surface (RIS) to enhance the anti-jamming performance of wireless communications, due to its powerful capability of constructing smart and reconfigurable radio environment. In order to establish the practical interactions between the base station (BS) and the jammer, a Bayesian Stackelberg game is formulated, where the BS is the leader and the jammer acts as the follower. Specifically, with the help of a RIS-assisted transmitter, the BS attempts to reliably convey information to users with maximum utilities, whereas the smart jammer tries to interfere the signal reception of users with desired energy efficiency (EE) threshold. Since the BS and the jammer are not cooperative parties, the practical assumption that neither side can obtain the other's strategies is adopted in the proposed game, and the angular information based imperfect channel state information (CSI) is also considered. After tackling the practical assumption by using Cauchy-Schwarz inequality and the imperfect angular information by using the discretization method, the closed-form solution of both sides can be obtained via the duality optimization theory, which constitutes the unique Stackelberg equilibrium (SE). Numerical results demonstrate the superiority and validity of our proposed robust schemes over the existing approaches. [ABSTRACT FROM AUTHOR]

The coexistence of multiple types of users in vehicular networks results in diversified service requirements and multiscale content differences, which poses new challenges to reliable content transmission. This paper proposes a hierarchical coded caching framework coupled with coded caching, vehicle-to-everything communications, and non-orthogonal multiple access techniques. We quantify the user request hit ratio under different communication modes and study the hit ratio maximization problem under the constraint of limited communication and caching resources. We propose a two-layer matching based optimization algorithm, including a user association layer in distributed content sharing and a user grouping layer in centralized content requesting. Simulation results verify that the proposed scheme can achieve a balance between hit ratio and transmission time, and meet the requirements of the content sharing scenario with multiscale content files and scalable user density. [ABSTRACT FROM AUTHOR]

In this paper, we propose a cost-efficient beamforming optimization algorithm for multi-user wireless communication systems associated with the intelligent reflecting surface (IRS). From the baseline successive refinement algorithm, which gives a sub-optimal solution for the power minimization problem under the signal-to-interference-plus-noise-ratio (SINR) constraint at each user, several optimization techniques are proposed to reduce the computation complexity while maintaining the algorithm-level performance. To reduce the number of required multiply-accumulate (MAC) operations, we first simplify the complicated matrix inversion by utilizing the channel hardening effect. We also present the two-phase refinement process for the group-level optimization of phase-shift elements, further relaxing the computation complexity as well as the processing latency. Applying the proposed optimization techniques, as a result, numerical results show that the fully-optimized algorithm can reduce the computational costs by up to 89.4% while showing less than 1 dB power loss, leading to the practical solution for the next-generation IRS-aided communication. [ABSTRACT FROM AUTHOR]

Different from conventional reflecting-only metasurfaces, intelligent omni-surfaces (IOSs) are capable of reflecting and transmitting the received signals simultaneously. As such, users located at the both sides of IOSs can be served efficiently. In this paper, a novel IOS-enhanced aerial secure offloading system is proposed in the presence of multiple ground eavesdroppers. Specifically, the IOS is adopted to prevent information leakage, improve legitimate reception quality and expand the security deployment range of unmanned aerial vehicles (UAVs). To maximize the secrecy energy efficiency (SEE) of the considered system, a non-convex resource allocation problem is formulated by allocating computing frequency, determining offloading strategy, controlling transmit power, designing phase shifts, and deploying UAV locations. The formulated problem is non-trivial and challenging to be solved directly due to the highly coupled variables. To tackle this issue, the alternating optimization technique is invoked to decouple the original one into five subproblems, and then the computing and communication settings are alternatively optimized using a low complexity iterative algorithm. Finally, simulation results demonstrate that: i) In terms of the SEE performance, our IOS-enhanced aerial secure offloading system significantly outperforms the benchmark schemes; ii) Compared with reflecting-only surfaces, IOSs can take full advantage of the flexible deployment ability of UAVs, such that their secure offloading space can be considerably expanded. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) and backscatter communication are two emerging technologies for low-power communication. In this paper, we consider a NOMA backscatter system, where signals from two backscatter devices are multiplexed on a frequency resource block using NOMA in each time slot. Our objective is to maximize the average energy efficiency by optimizing backscatter device pairing, reflection coefficients of backscatter devices, and the transmit power of the reader. We formulate the average energy efficiency maximization problem subject to the minimum circuit power and the minimum data rate requirements of the backscatter devices, and the transmit power constraint of the reader. The formulated problem is nonconvex. To obtain a suboptimal solution for this problem, we use alternating optimization technique and decompose the problem into two subproblems. The subproblems are solved by using fractional programming, Dinkelbach’s algorithm, and successive convex approximation method. Simulation results show that our proposed algorithm converges quickly to a suboptimal solution. Our proposed algorithm outperforms several baseline algorithms, including the genetic algorithm, fixed device pairing scheme, conventional device pairing scheme, maximum transmit power allocation scheme, and random reflection coefficient selection scheme, in terms of the average energy efficiency. The optimality gap of our proposed algorithm is investigated by comparing with the optimal scheme, in which the optimal device pairing is obtained based on exhaustive search. [ABSTRACT FROM AUTHOR]

In Multiple-input multiple-output (MIMO) broadcast channels (BCs), the transmitter simultaneously broadcasts signals to multiple receivers at same frequency band, resulting in that the communication capacity is affected by both interference, channel fading and random noise. Although channel fading can be mitigated by transceivers, the signal-to-noise-ratio (SNR) of the practical communication system is still dynamically changing due to the randomly changing noise. Traditional MIMO transceiver optimization algorithms can not flexibly adapt to the dynamic changes of SNR, resulting in large performance degradation. In this paper, we comprehensively consider signal power and signal space dimensions of the received signal in MIMO BCs, and propose two transceiver optimization algorithms which can dynamically adapt to the variance of SNRs. In the proposed algorithms, SNR is adopted to be an adjustment factor to cope with its variance. When SNR is low, i.e, large noise, the algorithm parameters are automatically adjusted so that the signal power is preserved as much as possible to combat the loss of communication capacity caused by large random noise. Correspondingly, under the condition of high SNR environment, the algorithm parameters are adjusted automatically to effectively compress the inter-user-interference (IUI) and intra-user-inter-stream-interference (ISI) by optimizing signal space dimensions. Simulation results show that in different SNR environments, the proposed algorithms can automatically adjust the focus of optimization, so that the optimization of signal power and signal space dimensions can automatically adapt to different SNRs. Compared with traditional transceiver optimization algorithms, the proposed algorithms can improve the communication capacity within a large dynamic range of SNR. [ABSTRACT FROM AUTHOR]

The around view monitor system (AVM) has been widely used in passenger vehicles. However, for articulated engineering vehicles (AEV), AVM is difficult to directly apply due to the long body and the articulation angle. In this paper, a flexible technique for variable-angle around view monitor system (VAVM) towards the AEV is proposed, which includes static calibration and dynamic execution. In the static calibration stage, the camera poses in the vehicle coordinate system with the joint of AEV as the coordinate origin can be calibrated using irregularly placed multiple checkerboards without knowing their relative position. This flexible calibration approach makes the variable-angle mapping from the fisheye image to the bird’s eye view image can be directly obtained by updating the camera poses on the tractor according to the articulation angle when the AEV turns. In the dynamic execution stage, an optimization algorithm based on minimizing the photometric error is designed to reduce the cumulative error of the angle sensor. Finally, all the bird’s eye view images are mosaiced and fused to a variable-angle around view image (VAVI). The experimental results show that the VAVM can output globally balanced and seamless VAVIs under different angles and visual environment conditions. Furthermore, the practicability of VAVM is also demonstrated by a real AEV. [ABSTRACT FROM AUTHOR]

Distributed phased Multiple-Input Multiple-Output (phased-MIMO) radar system consisting of separated subarrays possesses a high angle resolution but with sharing high sidelobes. This paper therefore focuses on the design of a virtual low-sidelobe beampattern in distributed phased-MIMO radar. An iterative framework with respect to subarray layout and receive weighting coefficients is proposed to minimize beampattern Peak Sidelobe Level (PSL) accounting for practical position constraints as well as the mainlobe level restriction. In each iteration, an efficient cyclic optimization algorithm based on the Coordinate Descent (CD) framework is developed to seek for the subarray layout through splitting high dimensional layout optimization problem into multiple one-dimensional optimization problems, and the SemiDefinite Relaxation (SDR) technique and rank one approximation are explored to design weighting coefficients. Numerical simulations are provided to assess the performance of the proposed algorithms in term of the achieved beampattern under different constraints and parameter settings. [ABSTRACT FROM AUTHOR]

This paper investigates a wireless federated learning (FL) network with limited communication bandwidth, where multiple mobile clients train their individual models with the help of one central server. We consider the practical communication scenarios, where the clients should complete the local computation and model upload within a defined latency. By jointly exploiting the dynamic characteristics of wireless channels and computational capability at the clients, we optimize the federated learning network by maximizing the number of active clients under the constraints of both latency and bandwidth. Specifically, we propose two bandwidth allocation (BA) schemes, where scheme I is based on the instantaneous channel state information (CSI), while scheme II employs the particle swarm optimization (PSO) method, based on the statistical CSI. Simulation results on the test accuracy and convergence rate are finally provided to demonstrate the advantages of the proposed optimization schemes for the considered FL network. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) and ambient backscatter communication (AmBC) have gained a lot of interest as key enabling technologies in wireless communications systems. NOMA is a key player for enhancing spectrum utilization either by multiplexing multiple messages for the same user or allowing multi-users access, while AmBC shows great potential for enhancing both spectrum and energy efficiency for battery-limited devices. In this paper, the performance of a downlink NOMA multiplexing based symbiotic-radio ($SR$) AmBC system is analyzed over Nakagami-m fading channels. New closed-form expressions for the exact and asymptotic outage probabilities are derived. Moreover, we analyze the diversity order and the influence of the system parameters on the outage performances. Besides, we proposed a power allocation optimization technique to achieve an outage-optimal performance. Through representative Monte-Carlo simulations, we have verified the analytical results. Finally, we compared the performance of the proposed system against a benchmark OMA-based system. [ABSTRACT FROM AUTHOR]

Integrated sensing and communication (ISAC) technique has been viewed as a promising component in future network. A major challenge for ISAC systems is that the constraint introduced by sensing functionality will constrain the degrees of freedom in waveform design and results in large multi-user interference (MUI), thus degrading the communication performance. In this paper, we study the employment of RIS in mitigating MUI in ISAC systems. For practical consideration, we investigate joint constant-modulus waveform and discrete RIS phase shift design, with the aim of minimizing MUI under the Cramer-Rao bound (CRB) constraint for direction of arrival (DOA) estimation. An alternating optimization algorithm is proposed to solve the formulated problem, and two schemes are proposed to deal with the discrete RIS phase shifts. Simulation results show that the proposed algorithm can dramatically improve the sum rate, and the performance under moderate phase shift quantization level is close to that under continuous phase shifts. [ABSTRACT FROM AUTHOR]

Multicasting does not work well for video applications such as video on demand, where individual users request video content at discrete and unpredictable moments. In this paper, we study a concurrent video multicast orchestration solution for the caching-assisted and centrally controlled mobile networks. The proposed solution strives to obtain rapid video prefetch and effective traffic reduction. By rapid video prefetch, user devices can cache required contents in advance, which can effectively improve the streaming fluency in unsteady wireless environments, especially the highly mobile vehicular environment. We introduce a maximum-rate concurrent multicast (MRCM) problem whose solution is intended to maximize the total video delivery rate by a concurrent multicast manner, and prove that the MRCM problem is NP-hard. Then, we propose a dynamic concurrent multicast tree construction algorithm and a global concurrent multicast tree optimization algorithm to approximately solve the MRCM problem in polynomial time. We also introduce a cache competition mechanism that strives to maximize the total cache hit rate when the cache space is insufficient. Performance evaluations show that compared with the existing cache-assisted multicast delivery solutions, the proposed solution significantly reduces the video delivery duration and the traffic stress of backhaul links. [ABSTRACT FROM AUTHOR]

Network Function Virtualization (NFV)-based 5G networks deliver specific services to a end-users through the creation of Service Function Chains (SFCs), which are composed of a number of Virtualized Network Functions (VNFs) interconnected via a set of virtual links (vLinks). VNFs consume computational resources of the network's servers, while vLinks utilize the communicational resources of the network. The efficient utilization of network resources remains a challenge in NFV-based networks. To this end, in this paper, we propose an analytical framework for the Admission Ratio (AR) calculation in NFV-based converged optical-wireless 5G networks. The proposed methodology employs a network slicing architecture in which different network slices form end-to-end logically isolated networks and each slice delivers a specific service type to the users through its SFC(s). In the proposed analysis, we not only take into account the occupancy distribution in both the network's computational and communicational domains (servers and fiber links), but we also consider the SFC establishment AR by taking into account different sub-service-classes belonging to different slices. The accuracy of the model is evaluated through the comparison of analytical and simulation results and was found satisfactory. Furthermore, the proposed model is employed for the determination of the optimal (minimum) capacity for all SFCs elements (VNFs and vLinks), in a way that users belonging to a specific slice experience a predefined value of AR as minimum. Additionally, our calculations deploy recursive formulas, which have a low computational complexity, as opposed to time-consuming simulations, without requiring the application of complex optimization algorithms. [ABSTRACT FROM AUTHOR]

This paper investigates the outage and throughput performance of full-duplex (FD) cooperative relaying (CR) based non-orthogonal multiple access system (NOMA) with energy harvesting (EH) i.e., FD-CR-EH-NOMA system. We consider a network scenario, where the base station (BS) serves two downlink users, with the near user configured as a FD relay to deliver messages to the far user. We derive analytical expressions for the outage probabilities experienced by the users and the system outage probability of FD-CR-EH-NOMA network under time switching relaying (TSR) protocol in the presence/absence of direct link from BS to the far user. Assuming imperfect successive interference cancellation (i-SIC), we derive analytical expressions for (i) optimal power allocation (OPA) factor at the BS and (ii) optimal time switching (OTS) factor at the relay that independently minimizes the system outage probability. Further, we use the alternating optimization technique to determine the jointly optimal power allocation and time switching factors that minimize the system outage probability. Furthermore, we determine the OTS factor that maximizes the asymptotic throughput of the system in the delay-limited transmission mode. With the help of numerical and simulation investigations, we show that the system outage and throughput of the considered network improve significantly under the proposed schemes. [ABSTRACT FROM AUTHOR]

In this paper, we consider the secure transmission problem in an unmanned aerial vehicle (UAV) and intelligent reflecting surface (IRS) assisted mmWave networks in the presence of an eavesdropper. The UAV base station (UAV-BS) and IRS are deployed to overcome the blockages. Artificial noise (AN) is exploited against the eavesdropper. Aiming to maximize the secrecy rate, we jointly design the positions and beamforming of UAV-BS and IRS, where the positions here represent the deployed position of the UAV-BS and the activation position of the IRS. Meanwhile, the maximum transmits power, minimum height constraint for UAV-BS, and the legitimate receiver minimum rate constraint are required. To obtain the optimal UAV-BS position, the elevation angle-dependent probabilistic LoS air-to-ground channel is exploited in this network. To tackle the formulated non-convex problem, we divide it into two subproblems: (1) design UAV-BS and IRS positions; (2) design UAV-BS and IRS beamforming. Moreover, to reduce the complexity, we propose an ideal beamforming model to find the near-optimal positions of UAV-BS and IRS. Then, semidefinite relaxation (SDR) is utilized to cope with the highly coupled and high-dimensional variable vectors. Finally, we obtain a sub-optimal solution by an efficient and low-complexity alternating optimization algorithm. Numerical results demonstrate the improvement of secrecy rate by jointly designing the positions as well as the significant performance gains achieved by our proposed schemes over benchmark schemes. [ABSTRACT FROM AUTHOR]

Both the jammer and the eavesdropper pose severe threat to wireless communications due to the broadcast nature of wireless channels. In this paper, an intelligent reflecting surface (IRS) assisted secure communication system is considered, where a base station (BS) wishes to reliably convey information to a user, in the presence of both a jammer and an eavesdropper whose transmit informations are not completely known. Specifically, with the imperfect third-party node's channel state information (CSI) and no knowledge of the jammer's transmit beamforming, we aim to maximize the system achievable rate by jointly designing the BS's transmit beamforming and the IRS's reflect beamforming, while limiting the information leakage to the potential eavesdropper. Due to the non-convexity and intractability of the original problem induced by the incompleted information, we utilize the auxiliary variables, Cauchy-Schwarz inequality, and General Sign-Definiteness transformation to convert the original optimization problem into a tractable convex optimization problem, and then obtain the high-quality optimal solution by using the successive convex approximation and penalty convex concave procedure. Numerical simulations demonstrate the superiority of our proposed optimization algorithm compared with existing approaches, and also reveal the impact of key parameters on the achievable system performance. [ABSTRACT FROM AUTHOR]

Power control in massive multiple input multiple output (MIMO) systems is an appealing technique to improve network performance and reliability. The traditional methods to solve such problems are based on the convex optimization theory, which incurs high computational complexity. In contrast, this work leverages deep neural networks to maximize the minimum data rate of the downlink users in the massive MIMO network. Based on the different setups in the practical systems, namely in-distribution case, weakly out-of-distribution case, and out-of-distribution case, we propose three approaches to solve them. Specifically, first, we establish a densely connected neural network for solving the power control problem. Then, for the case where the test data and training data come from the same distributions (the in-distribution case), we use the established neural network to obtain an approximately optimal power control strategy, and propose a self-training-based algorithm to use the unlabeled samples collected in the actual system to further improve the system performance. For the case that the test data and training data come from different distributions and a small amount of labeled target domain data can be obtained (the weakly out-of-distribution case), we propose a pre-training and fine-tuning algorithm to solve the problem. For the issue that we can not obtain the labels of the target domain data (the out-of-distribution case), we transform the problem into a covariate shift problem and propose an algorithm by weighting the loss function. Numerical results demonstrate that the proposed schemes not only match the optimal solution well but also have low online inference complexity. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) are foreseen to constitute promising airborne communication devices as a benefit of their superior channel quality. But UAV-to-ground (U2G) communications are vulnerable to eavesdropping. Hence, we conceive a sophisticated physical layer security solution for improving the secrecy rate of multi-antenna aided U2G systems. Explicitly, the secrecy rate of the U2G MIMO wiretap channels is derived by using random matrix theory. The resultant explicit expression is then applied in the joint optimization of the MIMO transceiver and the UAV location relying on an alternating optimization technique. Our numerical results show that the joint transceiver and location optimization conceived facilitates secure communications even in the challenging scenario, where the legitimate channel of confidential information is inferior to the eavesdropping channel. [ABSTRACT FROM AUTHOR]

Unmanned systems (USs) including unmanned aerial vehicles, unmanned underwater vehicles, and unmanned ground vehicles have great application prospects in military and civil fields, among which the process of finding feasible and optimal paths for the agents in USs is a kernel problem. Traditional path finding algorithms are hard to adequately obtain optimal paths in real-time under fast time-varying and poor communication environments. We propose an online optimal control algorithm for USs based on a one-way broadcast communication mode under the assumption of a poor communication environment, mobile targets, radars (or sonar), and missiles (or torpedoes). With the principle of receding horizon control, optimal (or suboptimal) paths are then generated by the approximation theory of neural networks and gradient optimization techniques, with low computation requirements. Also, we give a convergence analysis for our algorithm, and show that each agent can reach its target in finite time under some conditions on agents, targets and radar-missiles. Moreover, simulations demonstrate that the agents in USs can generate optimal (or suboptimal) paths in real time using our algorithm while effectively avoiding collision with other agents or detection by enemy radars. [ABSTRACT FROM AUTHOR]