Integrated sensing and communications (ISAC) is a disruptive technology enabling future sixth-generation (6G) networks. This paper investigates target detection in a bistatic ISAC system, in which the base station (BS) transmits superimposed ISAC signals comprising both Gaussian information-bearing and deterministic sensing components to simultaneously provide communication and sensing functionalities. First, we develop a Neyman-Pearson (NP)-based detector that effectively utilizes both the deterministic sensing and random communication signals. Closed-form analysis reveals that both signal components contribute to improving the overall detection performance. Subsequently, we optimize the BS transmit beamforming to maximize the detection probability, subject to a minimum signal-to-interference-plus-noise ratio (SINR) constraint for the communication user (CU) and a total transmit power budget at the BS. The resulting non-convex beamforming optimization problem is addressed via semi-definite relaxation (SDR) and successive convex approximation (SCA) techniques. Simulation results demonstrate the superiority of the proposed NP-based detector, which leverages both types of signals, over benchmark schemes that treat information signals as interference. They also reveal that a higher communication-rate threshold directs more transmit power to Gaussian information-bearing signals, thereby diminishing deterministic-signal power and weakening detection performance.

The growing demand for large artificial intelligence model (LAIM) services is driving a paradigm shift from traditional cloud-based inference to edge-based inference for low-latency, privacy-preserving applications. In particular, edge-device co-inference, which jointly executes LAIM inference across edge devices and servers, has emerged as a promising strategy for resource-efficient LAIM execution in wireless networks. In this paper, we investigate a pruning-aware LAIM co-inference scheme, where a pre-trained LAIM is pruned and partitioned into on-device and on-server sub-models for deployment. For analysis, we first prove that the LAIM output distortion is upper bounded by its parameter distortion. Then, we derive a lower bound on the parameter distortion via rate-distortion theory, analytically capturing the relationship between pruning ratio and co-inference performance. Next, based on the analytical results, we formulate an LAIM co-inference distortion bound minimization problem by jointly optimizing the pruning ratio, split point, transmit power, and computation frequency under system latency, energy, and available resource constraints. Moreover, we propose an efficient algorithm to tackle the considered highly non-convex problem. Finally, extensive experimental results demonstrate the effectiveness of the proposed design. In particular, model parameter distortion is shown to provide a reliable bound on output distortion. Also, the proposed joint design achieves superior performance in balancing trade-offs among inference performance, system latency, and energy consumption compared with various benchmark schemes.

Mobile metaverses are envisioned as a transformative digital ecosystem that delivers immersive, intelligent, and ubiquitous services through mobile devices. Driven by Large Language Models (LLMs) and Vision-Language Models (VLMs), Artificial Intelligence (AI) agents hold the potential to empower the creation, maintenance, and evolution of mobile metaverses, enabling seamless human-machine interaction and dynamic service adaptation. Currently, AI agents are primarily built upon cloud-based LLMs and VLMs. However, several challenges hinder their efficient deployment, including high service latency and a risk of sensitive data leakage during perception and processing. In this paper, we develop an edge-cloud collaboration-based federated AI agent construction framework in mobile metaverses. Specifically, Edge Servers (ESs), as agent infrastructures, first create agent modules in a distributed manner. The cloud server then integrates these modules into AI agents and deploys them at the edge, thereby enabling low-latency AI agent services for users. Considering that ESs may exhibit dynamic levels of willingness to participate in federated AI agent construction, we design a two-period dynamic contract model to continuously incentivize ESs to participate in agent module creation, effectively addressing the dynamic information asymmetry between the cloud server and ESs. Furthermore, we propose an Enhanced Diffusion Model-based Soft Actor-Critic (EDMSAC) algorithm to effectively generate optimal dynamic contracts. In the algorithm, we apply dynamic structured pruning to DM-based actor networks to enhance denoising efficiency and policy learning performance. Simulation results demonstrate that the EDMSAC algorithm outperforms the DMSAC algorithm by up to 23% in optimal dynamic contract generation.

This paper investigates detection orientated integrated sensing and communication (ISAC) system aided by hybrid reconfigurable intelligent surface (RIS). Target detection is conducted through communication signal echoes under the practical condition of unknown attenuation coefficient and sensing noise covariance, which makes our study more challenging than existing pertinent works. Firstly, we develop a closedform based generalized likelihood ratio test (GLRT) detector, which first effectively extrapolates unknown parameters through maximum likelihood estimation and then conducts hypothesis testing. Besides, we derive the asymptotic detection probability of the proposed GLRT detector in an analytic form, which is highly accurate for moderate sample size. Based on the above analysis, we propose robust beamforming design to maximize the worst-case detection probability while ensuring ergodic communication rate in awareness of channel state information (CSI) uncertainties. We provide a semidefinite programming (SDP) formulation to solve the robust beamforming problem. Additionally, by converting the variational and ergodic forms in robust formulation into explicit approximations, we further develop an efficient second order cone programming (SOCP) based solution, which is highly reliable when the CSI uncertainty becomes low. Numerical results validate the efficacy of the proposed GLRT detector, the correctness of the detection performance analysis, and the benefit of robust beamforming against CSI uncertainty.

This paper investigates a cooperative integrated sensing and communication (ISAC) system, where multiple base stations (BSs) employ coordinated transmit beamforming to communicate with their respective users and jointly sense a set of extended targets (ETs). Different from prior cooperative ISAC works considering point targets (PTs), the visible scatterers on the same extended target (ET) and the radar cross section (RCS) of the same scatterers observed by multiple BSs are considered to be different. Given the model, we first derive the Cramér-Rao bound (CRB) for the BSs to cooperatively estimate the ET’s parameters, thus quantifying the cooperative sensing gains. Next, based on the derived CRB, we formulate a joint node selection and coordinated transmit beamforming design problem with the object of minimizing the average trace of sensing CRB, while satisfying the minimum communication rate constraint, the maximum transmit power constraint, and the node selection constraints. To solve this non-convex optimization problem, we first utilize the block coordinate descent (BCD) method to decompose it into node selection sub-problem and beamforming design sub-problem. Next, the continuous relaxation and linear programming (LP) approach are employed to handle the node selection sub-problem, and a decentralized augmented Lagrangian manifold optimization algorithm is developed to solve the beamforming sub-problem with reduced computation complexity. Numerical simulations demonstrate that the proposed design outperforms benchmark designs with larger CRB-rate region. Moreover, our results show the impacts of the ET’s state and the number of network nodes on network performance to enable valuable ISAC beamforming design insights.

With the thriving artificial intelligence-generated content (AIGC), it is becoming increasingly appealing to exploit generative AI to generate wireless signals for facilitating wireless sensing. However, this is a challenging task, as wireless signals are highly random in general and contain rich physical information. To tackle these challenges, we propose a novel signal disentanglement and generation framework termed SigGen, which is inspired by the Fourier Transform (FT) that converts signals to the frequency domain and accordingly separates objectives by distinct frequency bands. In our proposed framework, we first disentangle the features of objects embedded in the signal and subsequently modify these features to generate the desired signals. Specifically, we devise a neural network based on the vision transformer (ViT) to extract effective features for signal generation. In this neural network, we incorporate both local and global frequency attention modules to adaptively leverage frequency features, and introduce a hybrid patch embedding module to enhance information interaction for the ViT architecture. Furthermore, we propose a novel sequential training method to improve the disentanglement and generation capability of the neural network. Finally, extensive experiments on two benchmark public wireless sensing datasets demonstrate that our framework can effectively decouple wireless signals and generate diverse signals closely resembling real ones, surpassing state-of-the-art methods by 30.83%. A practical case study further demonstrates that our framework can be used as a data augmentation method to improve gesture recognition accuracy by 12.74%.

This paper proposes a new hierarchically tunable six-dimensional movable antenna (HT-6DMA) architecture for base station (BS) in future wireless networks, aiming to improve the performance of both wireless communication and sensing. The HT-6DMA BS consists of multiple antenna arrays that can flexibly move on a spherical surface, with their three-dimensional (3D) positions and 3D rotations/orientations efficiently characterized in the global spherical coordinate system (SCS) and their individual local SCSs, respectively. As a result, the 6DMA system is hierarchically tunable in the sense that each array’s global position and local rotation can be separately adjusted in a sequential manner with the other being fixed, thus greatly reducing their design complexity and improving the achievable performance. In particular, we consider an HT-6DMA BS serving multiple single-antenna users in the uplink communication or sensing potential unmanned aerial vehicles (UAVs)/drones in a given airway area. Specifically, for the communication scenario, we aim to maximize the average sum rate of communication users in the long term by optimizing the positions and rotations of all 6DMA arrays at the BS. For the airway sensing scenario, we maximize the minimum received sensing signal power along the airway by optimizing the 6DMA arrays’ positions and rotations along with the BS’s transmit covariance matrix. Despite that the formulated problems are both non-convex and challenging to solve, we propose efficient solutions to them by exploiting the hierarchical tunability of positions/rotations of 6DMA arrays in our proposed model. Numerical results show that the proposed HT-6DMA design significantly outperforms not only the traditional BS with fixed-position antennas (FPAs), but also the existing 6DMA scheme based on alternating array position/rotation optimization. Furthermore, it is unveiled that the performance gains of HT-6DMA mostly come from the arrays’ global position adjustments on the spherical surface, rather than their local rotation adjustments, which provides a useful guide for implementing 6DMA systems under practical performance-complexity trade-off consideration.

This paper studies a wireless control system at network edge, in which a base station (BS) wirelessly coordinates the closed-loop control of multiple subsystems each consisting of a plant, a sensor, and an actuator. In this system, the BS first collects the state information from the sensors of plants, then processes the information via edge computing, and finally sends the obtained command signals back to the actuators for controlling the plants. In particular, we consider the hyper-reliable and low-latency communications (HRLLC) for the state and command signal transmission, by using the rate formulas based on short-packet communication. Under this setup, we first present a time-division-multiple-access (TDMA) protocol for coordinating the sensing, communication, and computation among the multiple plants. Then, we jointly optimize the task scheduling as well as the communication and computation resource allocations to minimize the closed-loop control latency while ensuring the stability of the multiple control subsystems. The considered problem is a highly non-convex combinatorial optimization problem that is difficult to solve. To resolve this issue, we present efficient algorithms by first optimizing the communication and computation resource allocations under given task scheduling via the techniques of alternating optimization and successive convex approximation, and then designing the task scheduling based on the exhaustive search or the low-complexity flow-shop scheduling. Numerical results show that the proposed joint resource allocation design with exhaustive search based task scheduling significantly outperforms other benchmark schemes without such joint optimization, and the proposed low-complexity task scheduling based on flow-shop scheduling achieves performance close to the upper bound by exhaustive search.

The advent of massive multiple-input multiple-output (MIMO) technology has provided new opportunities for capacity improvement via strategic antenna deployment, especially when the near-field effect is pronounced due to antenna proliferation. In this paper, we investigate the optimal antenna placement for maximizing the achievable rate of a point-to-point near-field channel, where the transmitter is deployed with massive movable antennas. First, we propose a novel design framework to explore the relationship between antenna positions and achievable data rate. By introducing the continuous antenna position function (APF) and antenna density function (ADF), we reformulate the antenna position design problem from the discrete to the continuous domain, which maximizes the achievable rate functional with respect to ADF. Leveraging functional analysis and variational methods, we derive the optimal ADF condition and propose a gradient-based algorithm for numerical solutions under general channel conditions. Furthermore, for the near-field line-of-sight (LoS) scenario, we present a closed-form solution for the optimal ADF, revealing the critical role of edge antenna density in enhancing the achievable rate. Finally, we propose a flexible antenna array-based deployment method that ensures practical implementation while mitigating mutual coupling issues. Simulation results demonstrate the effectiveness of the proposed framework, with uniform circular arrays emerging as a promising geometry for balancing performance and deployment feasibility in near-field communications.

In this paper, we investigate a bistatic integrated sensing and communications (ISAC) system, consisting of a base station (BS) with multiple transmit antennas, a sensing receiver with multiple receive antennas, a single-antenna communication user (CU), and a point target to be sensed. Specifically, the BS transmits a superposition of Gaussian information and deterministic sensing signals to support ISAC. The BS aims to deliver information symbols to the CU, while the sensing receiver aims to estimate the target’s direction-of-arrival (DoA) with respect to the sensing receiver by processing the echo signals reflected by the target. For the sensing receiver, we assume that only the sequences of the deterministic sensing signals and the covariance matrix of the information signals are perfectly known, whereas the specific realizations of the information signals remain unavailable. Under this setup, we first derive the corresponding Cram´er-Rao bounds (CRBs) for DoA estimation and propose practical estimators to accurately estimate the target’s DoA. Subsequently, we formulate the transmit beamforming design as an optimization problem aiming to minimize the CRB, subject to a minimum signal-to-interference-plus-noise ratio (SINR) requirement at the CU and a maximum transmit power constraint at the BS. When the BS employs only Gaussian information signals, the resulting beamforming optimization problem is convex, enabling the derivation of an optimal solution. In contrast, when both Gaussian information and deterministic sensing signals are transmitted, the resulting problem is non-convex and a locally optimal solution is acquired by exploiting successive convex approximation (SCA). Finally, numerical results demonstrate that the utilization of additional deterministic sensing signals is critical for sensing performance enhancement, while solely employing Gaussian information signals leads to a notable performance degradation for target sensing. It is unveiled that the proposed transmit beamforming design achieves a superior ISAC performance boundary compared with various benchmark schemes.

This paper proposes an efficient method for modeling and reconstructing the channel gain map (CGM) based on virtual scatterers. Specifically, we develop a virtual scatterer model to characterize the channel gain distribution in three-dimensional (3D) space, by capturing the multi-path propagation environment structure and exploiting the angular-domain spatial correlation of scatterer response. In this model, the CGM is represented as a function over a set of tunable parameters for virtual scatterers, including their number, positions, and scatterer response coefficients (SRCs), which can be estimated from a limited number of channel gain measurements at a given set of locations within the region of interest. This new representation offers a flexible and scalable modeling framework for efficient and accurate CGM reconstruction. Furthermore, we propose a progressive estimation algorithm to acquire the scatterers’ parameters. In this algorithm, we gradually increase the number of virtual scatterers to balance the computational complexity and reconstruction accuracy, and derive the closed-form solutions of SRCs with any given number and positions of virtual scatterers. In addition, by exploiting the spatial correlation of scatterer response, we propose a Gaussian process regression (GPR)-based inference method to predict the SRCs that cannot be directly estimated. Finally, ray-tracing-based simulation results under realistic physical environments validate the effectiveness of the proposed method, demonstrating that it achieves higher reconstruction accuracy compared to conventional CGM estimation approaches, especially for the scenario with limited channel measurements.

This paper studies an over-the-air federated edge learning (Air-FEEL) system with integrated sensing, communication, and computation (ISCC), in which one edge server coordinates multiple edge devices to wirelessly sense the objects and use the sensing data to collaboratively train a machine learning model for recognition tasks. In this system, over-the-air computation (AirComp) is employed to enable one-shot model aggregation from edge devices. Under this setup, we analyze the convergence behavior of the ISCC-enabled Air-FEEL in terms of the loss function degradation, by particularly taking into account the wireless sensing noise during the training data acquisition and the AirComp distortions during the over-the-air model aggregation. The result theoretically shows that sensing, communication, and computation compete for network resources to jointly decide the convergence rate. Based on the analysis, we design the ISCC parameters under the target of maximizing the loss function degradation while ensuring the latency and energy budgets in each round. The challenge lies on the tightly coupled processes of sensing, communication, and computation among different devices. To tackle the challenge, we derive a low-complexity ISCC algorithm by alternately optimizing the batch size control and the network resource allocation. It is found that for each device, less sensing power should be consumed if a larger batch of data samples is obtained and vice versa. Besides, with a given batch size, the optimal computation speed of one device is the minimum one that satisfies the latency constraint. Numerical results based on a human motion recognition task verify the theoretical convergence analysis and show that the proposed ISCC algorithm well coordinates the batch size control and resource allocation among sensing, communication, and computation to enhance the learning performance.

In this paper, sensing-assisted secure communication in a multi-user multi-eavesdropper integrated sensing and communication (ISAC) system is investigated. Confidential communication signals and dedicated sensing signals are jointly transmitted by a base station (BS) to simultaneously serve users and sense aerial eavesdroppers (AEs). A sum rate maximization problem is formulated under AEs’ Signal-to-Interference-plus-Noise Ratio (SINR) and sensing Signal-to-Clutter-plus-Noise Ratio (SCNR) constraints. A fractional-programming-based alternating optimization algorithm is developed to solve this problem for fully digital arrays, where successive convex approximation (SCA) and semidefinite relaxation (SDR) are leveraged to handle non-convex constraints. Furthermore, the minimum number of dedicated sensing beams is analyzed via a worst-case rank bound, upon which the proposed beamforming design is further extended to the hybrid analog-digital (HAD) array architecture, where the unit-modulus constraint is addressed by manifold optimization. Simulation results demonstrate that only a small number of sensing beams are sufficient for both sensing and jamming AEs, and the proposed designs consistently outperform strong baselines while also revealing the communication–sensing trade-off.

This paper studies an integrated sensing and communications (ISAC) system for low-altitude economy (LAE), where a ground base station (GBS) provides communication and navigation services for authorized unmanned aerial vehicles (UAVs), while sensing the low-altitude airspace to monitor the unauthorized mobile target. The expected communication sum-rate over a given flight period is maximized by jointly optimizing the beamforming at the GBS and UAVs’ trajectories, subject to the constraints on the average signal-to-noise ratio requirement for sensing, the flight mission and collision avoidance of UAVs, as well as the maximum transmit power at the GBS. Typically, this is a sequential decision-making problem with the given flight mission. Thus, we transform it to a specific Markov decision process (MDP) model called episode task. Based on this modeling, we propose a novel LAE-oriented ISAC scheme, referred to as Deep LAE-ISAC (DeepLSC), by leveraging the deep reinforcement learning (DRL) technique. In DeepLSC, a reward function and a new action selection policy termed constrained noise-exploration policy are judiciously designed to fulfill various constraints. To enable efficient learning in episode tasks, we develop a hierarchical experience replay mechanism, where the gist is to employ all experiences generated within each episode to jointly train the neural network. Besides, to enhance the convergence speed of DeepLSC, a symmetric experience augmentation mechanism, which simultaneously permutes the indexes of all variables to enrich available experience sets, is proposed. Simulation results demonstrate that compared with benchmarks, DeepLSC yields a higher sum-rate while meeting the preset constraints, achieves faster convergence, and is more robust against different settings.

This paper studies the unmanned aerial vehicle (UAV)-enabled aerial monitoring assisted by simultaneous transmitting and reflecting reconfigurable intelligent surfaces (STAR-RISs), in which one UAV aims to monitor a number of moving targets, and one STAR-RIS is installed on a building for assisting the UAV to broadcast the monitored information to both indoor and outdoor users. Due to the randomness of target movements over time, the UAV needs to adaptively adjust its flight trajectory to track them. This thus results in highly dynamic channel conditions and uncertain UAV energy consumption, which accordingly make the efficient aerial monitoring a challenging task. To address these challenges, we propose a STAR-RIS-aided UAV-enabled aerial monitoring framework, which aims to maximize the long-term average throughput for all users, through joint optimization of transmit beamforming, UAV trajectory, and STAR-RIS configuration, while ensuring the monitoring requirements under strict energy constraints. The formulated problem is a multi-stage stochastic optimization problem, due to the randomness of various system parameters. To handle this problem, we apply the Lyapunov optimization technique and introduce a virtual energy queue to transform it into a series of single-slot optimization subproblems that are solvable online. For each subproblem, we develop efficient algorithms to obtain a near-optimal solution, in which a penalty dual decomposition (PDD) approach is used for the transmit beamforming and STAR-RIS configuration optimization, and a sequential parametric convex approximation (SPCA) method is used for UAV trajectory optimization. Extensive simulations demonstrate that the proposed framework significantly outperforms benchmark schemes, effectively maximizing the throughput and energy efficiency under dynamic operational conditions.

Movable antenna (MA) enhances wireless communication performance by enabling the flexibility in antenna movement. Prior works on MA usually ignore the time overhead for antenna movement in channel estimation and/or performance improvement. However, due to the mechanically constrained MA movement speed and limited channel coherence time, the antenna movement time can significantly affect the effective communication rate of MA systems in practice. To address this issue, we propose to jointly design the MA’s trajectories for channel measurements and rate-optimal repositioning to maximize the average effective communication rate of an MA-aided receiver subject to the given transmission block duration. Specifically, we propose a two-timescale optimization approach, in which the MA’s trajectory for channel measurements is optimized in the long term based on the known channel distribution, while the MA’s trajectory for moving to the rate-optimal position is adaptively designed in the short term to cater to the instantaneous channel realizations, thus simplifying the design complexity and yet providing high adaptability to channel variations. In particular, we propose a kernel-based regression (KBR) method to efficiently reconstruct the channel map over the whole antenna moving region based on the limited channel measurements, utilizing an offline-learned kernel for which closed-form expressions are theoretically derived under different multipath channel distributions. Numerical results demonstrate that the proposed scheme outperforms the fixed-position antenna (FPA) system and other benchmark MA designs that neglect the antenna movement time, and even achieves performance comparable to that of the single-input multiple-output (SIMO) beamforming system. Furthermore, the implementation cost of the proposed MA scheme is analyzed to assess its practical feasibility. Although mechanical antenna movement incurs additional energy consumption, the proposed MA scheme achieves superior energy efficiency to both the FPA and SIMO systems.

Federated Learning (FL) enables multiple clients to collaboratively train models without sharing raw data, but is vulnerable to Byzantine attacks and data heterogeneity, which can severely degrade performance. Existing Byzantine-robust approaches tackle data heterogeneity, but incur high computational overhead during gradient aggregation, thereby slowing down the training process. To address this issue, we propose a simple yet effective Federated Normalized Gradients Algorithm (Fed-NGA), which performs aggregation by merely computing the weighted mean of the normalized gradients from each client. This approach yields a favorable time complexity of $\mathcal{O}(pM)$, where $p$ is the model dimension and $M$ is the number of clients. We rigorously prove that Fed-NGA is robust to both Byzantine faults and data heterogeneity. For non-convex loss functions, Fed-NGA achieves convergence to a neighborhood of stationary points under general assumptions, and further attains zero optimality gap under some mild conditions, which is an outcome rarely achieved in existing literature. In both cases, the convergence rate is $\mathcal{O}(1/T^{\frac{1}{2} - \delta})$, where $T$ denotes the number of iterations and $\delta \in (0, 1/2)$. Experimental results on benchmark datasets confirm the superior time efficiency and convergence performance of Fed-NGA over existing methods.

Future sixth-generation (6G) systems are expected to leverage extremely large-scale multiple-input multiple-output (XL-MIMO) technology, which significantly expands the range of the near-field region. The spherical wavefront characteristics in the near field introduce additional degrees of freedom (DoFs), namely distance and angle, into the channel model, which leads to unique challenges in channel estimation (CE). In this paper, we propose a new sensing-enhanced uplink CE scheme for near-field XL-MIMO, which notably reduces the required quantity of baseband samples and the dictionary size. In particular, we first propose a sensing method that can be accomplished in a single time slot. It employs power sensors embedded within the antenna elements to measure the received power pattern rather than baseband samples. A time inversion algorithm is then proposed to precisely estimate the locations of users and scatterers, which offers a substantially lower computational complexity. Based on the estimated locations from sensing, a novel dictionary is then proposed by considering the eigen-problem based on the near-field transmission model, which facilitates efficient near-field CE with less baseband sampling and a more lightweight dictionary. Moreover, we derive the general form of the eigenvectors associated with the near-field channel matrix, revealing their noteworthy connection to the discrete prolate spheroidal sequence (DPSS). Simulation results unveil that the proposed time inversion algorithm achieves accurate localization with power measurements only, and remarkably outperforms various widely-adopted algorithms in terms of computational complexity. Furthermore, the proposed eigen-dictionary considerably improves the accuracy in CE with a compact dictionary size and a drastic reduction in baseband samples by up to 66%.

This paper exploits the networked integrated sensing and communications (ISAC) to support low-altitude economy (LAE), in which a set of networked ground base stations (GBSs) cooperatively transmit joint information and sensing signals to communicate with multiple authorized uncrewed aerial vehicles (UAVs) and concurrently detect unauthorized objects over the interested region in the three-dimensional (3D) space. We assume that each GBS is equipped with uniform linear array (ULA) antennas, which are deployed either horizontally or vertically to the ground. We also consider two types of UAV receivers, which have and do not have the capability of canceling the interference caused by dedicated sensing signals, respectively. Under each setup, we jointly design the coordinated transmit beamforming at multiple GBSs together with the authorized UAVs’ trajectory control and their GBS associations, for enhancing the authorized UAVs’ communication performance while ensuring the sensing requirements. In particular, we aim to maximize the average sum rate of authorized UAVs over a given flight period, subject to the minimum illumination power constraints toward the interested 3D sensing region, the maximum transmit power constraints at individual GBSs, and the flight constraints of UAVs. These problems are highly non-convex and challenging to solve, due to the involvement of binary UAV-GBS association variables as well as the coupling of beamforming and trajectory variables. To solve these non-convex problems, we propose efficient algorithms by using the techniques of alternating optimization, successive convex approximation, and semi-definite relaxation. Numerical results show that the proposed joint coordinated transmit beamforming and UAV trajectory designs efficiently balance the sensing-communication performance tradeoffs and significantly outperform various benchmarks. It is also shown that the horizontally placed antennas lead to enhanced performance compared with their vertical counterparts due to the more flexible multi-beam design, and the sensing interference cancellation ability at UAV receivers is advantageous for further enhancing ISAC performance.

This paper investigates the energy-efficient hybrid beamforming design for a multi-functional integrated sensing, communications, and powering (ISCAP) system. In this system, a base station (BS) with a hybrid analog-digital (HAD) architecture sends unified wireless signals to communicate with multiple information receivers (IRs), sense multiple point targets, and wirelessly charge multiple energy receivers (ERs) at the same time. To facilitate the energy-efficient design, we present a novel HAD architecture for the BS transmitter, which allows dynamic on-off control of its radio frequency (RF) chains and analog phase shifters (PSs) through a switch network. We also consider a practical and comprehensive power consumption model for the BS, by taking into account the power-dependent non-linear power amplifier (PA) efficiency, and the on-off non-transmission power consumption model of RF chains and PSs. We jointly design the hybrid beamforming and dynamic on-off control at the BS, aiming to minimize its total power consumption, while guaranteeing the performance requirements on communication rates, sensing Cramér-Rao bound (CRB), and harvested power levels. The formulation also takes into consideration the per-antenna transmit power constraint and the constant modulus constraints for the analog beamformer at the BS. The resulting optimization problem for ISCAP is highly non-convex due to the binary on-off non-transmission power consumption of RF chains and PSs, the non-linear PA efficiency, and the coupling between analog and digital beamformers. To tackle this problem, we first approximate the binary on-off non-transmission power consumption into a continuous form, and accordingly propose an iterative algorithm to find a high-quality approximate solution with ensured convergence, by employing techniques from alternating optimization (AO), sequential convex approximation (SCA), and semi-definite relaxation (SDR). Then, based on the optimized beamforming weights, we develop an efficient method to determine the binary on-off control of RF chains and PSs, as well as the associated hybrid beamforming solution. Numerical results show that the proposed design achieves an improved energy efficiency for ISCAP than other benchmark schemes without joint design of hybrid beamforming and dynamic on-off control. This validates the benefit of dynamic on-off control in energy reduction, especially when the multi-functional performance requirements become less stringent.

Incorporating mobile edge computing (MEC) and integrated sensing and communication (ISAC) has emerged as a promising technology to enable integrated sensing, communication, and computing (ISCC) in the sixth generation (6G) networks. ISCC is particularly attractive for vehicle-to-everything (V2X) applications, where vehicles perform ISAC to sense the environment and simultaneously offload the sensing data to roadside base stations (BSs) for remote processing. In this paper, we investigate a particular ISCC-enabled V2X system consisting of multiple multi-antenna BSs serving a set of single-antenna vehicles, in which the vehicles perform their respective ISAC operations (for simultaneous sensing and offloading to the associated BS) over orthogonal sub-bands. With the focus on fairly minimizing the sensing completion latency for vehicles while ensuring the detection probability constraints, we jointly optimize the allocations of radio resources (i.e., the sub-band allocation, transmit power control at vehicles, and receive beamforming at BSs) as well as computation resources at BS MEC servers. To solve the formulated complex mixed-integer nonlinear programming (MINLP) problem, we propose an alternating optimization algorithm. In this algorithm, we determine the sub-band allocation via the branch-and-bound method, optimize the transmit power control via successive convex approximation (SCA), and derive the receive beamforming and computation resource allocation at BSs in closed form based on generalized Rayleigh entropy and fairness criteria, respectively. Simulation results demonstrate that the proposed joint resource allocation design significantly reduces the maximum task completion latency among all vehicles. Furthermore, we also demonstrate several interesting trade-offs between the system performance and resource utilizations.

Semantic communication is an emerging paradigm with significant potential for image transmission. However, resource-efficient architecture design and resource allocation in this field have not received adequate research attention. This paper proposes a resource-efficient multi-branch semantic communication architecture based on saliency detection, aimed at optimizing computational efficiency in image transmission. The architecture leverages models with varying capacities to process regions of images with different complexities. We further address the problem of multi-user uplink semantic communication and resource allocation, focusing on minimizing the total energy consumption for communication and computation. The optimization problem, subject to user demand, computation, delay, and transmission power constraints, is non-convex due to the coupling of variables, making it challenging to solve. To tackle this, we introduce a two-level decomposition approach. The lower-level problem, given a fixed compression rate, is solved using Karush-Kuhn-Tucker (KKT) conditions to derive closed-form solutions for transmission power and computation frequency. The upper-level problem, which optimizes the compression rate, is reformulated as a monotone optimization problem for efficient solution finding. Numerical results demonstrate that the proposed architecture significantly reduces computational resource usage while maintaining image quality, and the resource allocation strategy effectively minimizes energy consumption, outperforming baseline schemes in terms of energy efficiency.

This paper considers a multi-functional orthogonal frequency division multiplexing (OFDM) system with integrated sensing, communication, and powering (ISCAP), in which a multi-antenna base station (BS) transmits OFDM signals to simultaneously deliver information to multiple information receivers (IRs), provide energy supply to multiple energy receivers (ERs), and sense potential targets based on the echo signals. To facilitate ISCAP, the BS employs the joint transmit beamforming design by sending dedicated sensing/energy beams jointly with information beams. Furthermore, we consider the beam scanning for sensing, in which the joint beams scan in different directions over time to sense potential targets. In order to ensure the sensing beam scanning performance and meet the communication and powering requirements, it is essential to properly schedule IRs and ERs and design the resource allocation over time, frequency, and space. More specifically, we optimize the joint transmit beamforming over multiple OFDM symbols and subcarriers, with the objective of minimizing the average beampattern matching error of beam scanning for sensing, subject to the constraints on the average communication rates at IRs and the average harvested power at ERs. We find converged high-quality solutions to the formulated problem by proposing efficient iterative algorithms based on advanced optimization techniques. We also develop various heuristic designs based on the principles of zero-forcing (ZF) beamforming, round-robin user scheduling, and time switching, respectively. Numerical results show that our proposed algorithms adaptively generate information and sensing/energy beams at each time-frequency slot to match the scheduled IRs/ERs with the desired scanning beam, significantly outperforming the heuristic designs.

This paper studies a near-field integrated sensing and communication (ISAC) system with extremely large-scale antenna array (ELAA), in which a base station (BS) deployed with a very large number of antennas transmits wireless signals to communicate with multiple communication users (CUs) and simultaneously uses the echo signals to localize multiple point targets in the three-dimension (3D) space. To balance the performance tradeoff between near-field communication and 3D target localization, we design the transmit covariance matrix at the BS to optimize the localization performance while ensuring the signal-to-interference-plus-noise ratio (SINR) constraints at individual CUs. In particular, we formulate three design problems by considering different 3D localization performance metrics, including minimizing the sum Cramér-Rao bound (CRB) for estimating 3D locations, maximizing the minimum target illumination power, and maximizing the minimum target echo signal power. Although the three design problems are non-convex in general, we obtain their global optimal solutions via the technique of semi-definite relaxation (SDR) by proving the tightness of such relaxations. It is rigorously shown that the optimal solutions to the three problems have low-rank structures depending on the sensing and communication channel matrices, which can be exploited to greatly reduce the computational complexity of the SDR-based solutions. Interestingly, we find that in the special case with a single collocated target/CU present towards the middle of a symmetric uniform planar array (UPA), the optimal solutions to the three problems become identical to the SINR-maximization design and have a closed form, while in other cases they can be different in general. Besides, when the target/CU moves away from the transmitter/receiver, the CRB may first decrease and then increase. These two phenomena differ from those in the far-field scenario. Numerical results show the benefits of the proposed near-field designs in optimizing both sensing and communication performance, by exploiting the beam focusing capabilities of ELAA, while the benchmark based on far-field design yields inferior results due to model mismatch.

In some applications, edge learning is experiencing a shift in focus from conventional learning from scratch to two-stage learning combining pre-training and task-specific fine-tuning. This paper considers the problem of joint communication and computation resource management in a two-stage edge learning system. In this system, model pre-training is first conducted at an edge server via centralized learning on local pre-stored general data, and then task-specific fine-tuning is performed at edge devices based on the pre-trained model via federated edge learning. For the two-stage learning model, we first analyze the convergence behavior (in terms of the average squared gradient norm bound), which characterizes the impacts of various system parameters, such as the number of learning rounds and batch sizes in the two stages, on the convergence rate. Based on our analytical results, we then propose a joint communication and computation resource management design to minimize an average squared gradient norm bound, subject to constraints on the transmit power, overall system energy consumption, and training delay. The decision variables include the number of learning rounds, batch sizes, clock frequencies, and transmit power control for both pre-training and fine-tuning stages. Finally, numerical results are provided to evaluate the effectiveness of our proposed design. It is shown that the proposed joint resource management over the pre-training and fine-tuning stages well balances the system performance trade-off among the training accuracy, delay, and energy consumption. The proposed design is also shown to effectively leverage the inherent trade-off between pre-training and fine-tuning, which arises from the differences in data distribution between pre-stored general data versus real-time task-specific data, thus efficiently optimizing overall system performance.

This paper investigates the sensing performance of two intelligent reflecting surface (IRS)-enabled non-line-of-sight (NLoS) sensing systems with fully- and semi-passive IRSs, respectively. In particular, we consider a fundamental setup with one base station (BS), one uniform linear array (ULA) IRS, and one point target in the NLoS region of the BS. Accordingly, we analyze both the sensing signal-to-noise ratio (SNR) and the Cramér-Rao bound (CRB) for estimating the target’s direction-of-arrival (DoA) with joint transmit and reflective beamforming optimization. First, we characterize the maximum sensing SNR when the BS-IRS channel follows line-of-sight (LoS) and Rayleigh fading, respectively. It is revealed that when the number of reflecting elementsNequipped at the IRS becomes sufficiently large, the maximum sensing SNR increases proportionally toN2andN4for the semi- and fully-passive IRSs, respectively. Then, we analyze the minimum CRB performance when the BS-IRS channel follows Rayleigh fading. It is shown that whenNgrows, the minimum CRB decreases inversely proportionally toN4andN6for the semi- and fully-passive IRS, respectively. Finally, numerical results are presented to corroborate our analysis across general channel conditions. It is shown that the fully-passive IRS outperforms the semi-passive counterpart whenNexceeds a certain threshold due to the additional reflective beamforming gain in the IRS-BS path, which efficiently compensates for the path loss.

This paper studies a multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) networked integrated sensing and communication (ISAC) system, in which multiple base stations (BSs) perform beam tracking to communicate with a mobile device. In particular, we focus on the beam tracking over a number of tracking time slots (TTSs) and suppose that these BSs operate at non-overlapping frequency bands to avoid the severe inter-cell interference. Under this setup, we propose a new cooperative sensing-assisted predictive beam tracking design. In each TTS, the BSs use echo signals to cooperatively track the mobile device as a sensing target, and continuously adjust the beam directions to follow the device for enhancing the performance for both communication and sensing. First, we propose a cooperative sensing design to track the device, in which the BSs first employ the two-dimensional discrete Fourier transform (2D-DFT) technique to perform local target estimation, and then use the extended Kalman filter (EKF) method to fuse their individual measurement results for predicting the target parameters. Next, based on the predicted results, we obtain the achievable rate for communication and the predicted conditional Cramér-Rao lower bound (PC-CRLB) for target parameters estimation in the next TTS, as a function of the beamforming vectors. Accordingly, we formulate the predictive beamforming design problem, with the objective of maximizing the achievable communication rate in the following TTS, while satisfying the PC-CRLB requirement for sensing. To address the resulting non-convex problem, we first propose a semi-definite relaxation (SDR)-based algorithm to obtain the optimal solution, and then develop an alternative penalty-based algorithm to get a high-quality low-complexity solution. Simulation results indicate that the proposed cooperative sensing design achieves higher target tracking accuracy than other benchmark schemes. The results also validate the benefits of multi-BS cooperative sensing in improving tracking performance compared with the conventional single-BS sensing.

This paper studies the unmanned-aerial-vehicle (UAV)-enabled data collection for Internet-of-things (IoT) networks, in which multiple UAVs are dispatched to collect data over their correspondingly designated areas. In particular, we consider that the UAVs need to collect data in a timely manner. We further consider a practical segmented channel model, in which the air-to-ground wireless channel is assumed to follow Rayleigh or Rician fading when the corresponding line-of-sight (LoS) link is blocked or unblocked, respectively. Under this setup, we minimize the average Age-of-Information (AoI) for the IoT devices, by jointly optimizing the UAV trajectory, the collection scheduling, and the completion time. Since the problem is non-convex, and the dimension of optimization variables varies w.r.t. the completion time that needs to be optimized, the conventional methods are not applicable for efficiently solving the problem. To address this issue, we first propose a deep-reinforcement-learning (DRL) based algorithm to solve this problem in the special case with single UAV, and then exploit federated learning over multiple UAVs to efficiently train the model in a collaborative manner while preserving the data privacy. Numerical results verify that the proposed methods achieve significantly better performance than benchmarks in terms of the AoI, energy consumption, and completion time.

Radar systems typically employ well-designed deterministic signals for target sensing. In contrast to that, integrated sensing and communications (ISAC) systems have to use random signals to convey useful information, potentially causing sensing performance degradation. In this paper, we define a new sensing performance metric, namely, ergodic linear minimum mean square error (ELMMSE), accounting for the randomness of ISAC signals. Then, we investigate a data-dependent precoding scheme to minimize the ELMMSE, which attains the optimized sensing performance at the price of high computational complexity. To reduce the complexity, we present an alternative data-independent precoding scheme and propose a stochastic gradient projection (SGP) algorithm for ELMMSE minimization, which can be trained offline by locally generated signal samples. Finally, we demonstrate the superiority of the proposed methods by simulations.

This paper studies the transmit energy beamforming in a multi-antenna wireless power transfer (WPT) system, in which an access point (AP) equipped with a uniform linear array (ULA) sends radio signals to wirelessly charge multiple single-antenna energy receivers (ERs). Different from conventional energy beamforming designs that require the AP to acquire the channel state information (CSI) via training and feedback, we propose a new training-free energy beamforming approach assisted by wireless radar sensing, which is implemented based on the following two-stage protocol. In the first stage, the AP performs wireless radar sensing to estimate the path gain and angle parameters of the ERs for constructing the corresponding CSI. In the second stage, the AP implements the transmit energy beamforming based on the constructed CSI to efficiently charge these ERs in a fair manner. Under this setup, first, we jointly optimize the sensing beamformers and duration in the first stage to minimize the sensing duration, while ensuring a given accuracy threshold for parameters estimation subject to the maximum transmit power constraint at the AP. Next, we optimize the energy beamformers in the second stage to maximize the minimum harvested energy by all ERs. In this approach, the estimation accuracy threshold for the first stage is properly designed to balance the resource allocation between the two stages for optimizing the ultimate energy harvesting performance. Finally, numerical results show that the proposed training-free energy beamforming design performs close to the performance upper bound with perfect CSI, and outperforms the benchmark schemes without such joint optimization and that with isotropic transmission.

This paper studies the integration of over-the-air computation (AirComp) and wireless power transfer (WPT) for achieving sustainable wireless data aggregation (WDA). In such wireless powered AirComp system, a multi-antenna hybrid access point (HAP) employs the transmit energy beamforming to charge multiple single-antenna low-power wireless devices (WDs) in the downlink, and the WDs utilize their harvested energy to simultaneously send messages to the HAP for AirComp in the uplink. Under this setup, our objective is to minimize the computation mean square error (MSE) by jointly optimizing the transmit en-ergy beamforming and the receive AirComp beamforming at the HAP, as well as the transmit power control at the WDs, subject to the wireless energy harvesting constraints at individual WDs. To tackle the non-convex computation MSE minimization problem, we present an efficient algorithm to find a converged high-quality solution by using the alternating optimization technique, in which the transmit energy beamforming (together with WDs' power control) and the receive beamforming are alternately optimized. Simulation results show that the proposed joint WPT-AirComp scheme significantly decreases the system's MSE, as compared to conventional designs without such joint optimization.

This paper investigates the energy efficiency of a multiple-input multiple-output (MIMO) integrated sensing and communications (ISAC) system for Internet of things (IoT), in which one multi-antenna IoT transceiver transmits unified ISAC signals to a multi-antenna communication user (CU) and at the same time use the echo signals to estimate an extended target. We focus on one particular ISAC transmission block and take into account the practical on-off non-transmission power at the IoT transceiver. Under this setup, we minimize the energy consumption at the transceiver while ensuring a minimum average data rate requirement for communication and a maximum Cramér-Rao bound (CRB) requirement for target estimation, by jointly optimizing the transmit covariance matrix and the “on” duration for active transmission. We obtain the optimal solution to the rate-and-CRB-constrained energy minimization problem in a semi-closed form. Interestingly, the obtained optimal solution is shown to unify the spectrum-efficient and energy-efficient communications and sensing designs. In particular, for the special MIMO sensing case with rate constraint inactive, the optimal solution follows the isotropic transmission with shortest “on” duration, in which the IoT transceiver radiates the required sensing energy by using sufficiently high power over the shortest duration. For the general ISAC case, the optimal transmit covariance solution is of full rank and follows the eigenmode transmission based on the communication channel, while the optimal “on” duration is determined based on both the rate and CRB constraints. Numerical results show that the proposed ISAC design achieves significantly reduced energy consumption as compared to the benchmark schemes based on isotropic transmission, always-on transmission, and sensing or communications only designs, especially when the rate and CRB constraints become stringent.

This paper studies a secure cell-free integrated sensing and communication (ISAC) system, in which multiple ISAC transmitters collaboratively send confidential information to multiple communication users (CUs) and concurrently conduct target detection. Different from prior works investigating communication security against potential information eavesdropping, we consider the security of both communication and sensing in the presence of information and sensing eavesdroppers that aim to intercept confidential communication information and extract target information, respectively. Towards this end, we optimize the joint information and sensing transmit beamforming at these ISAC transmitters for secure cell-free ISAC. Our objective is to maximize the detection probability over a designated sensing area while ensuring the minimum signal-to-interference-plus-noise-ratio (SINR) requirements at CUs. Our formulation also takes into account the maximum tolerable signal-to-noise ratio (SNR) constraints at information eavesdroppers for ensuring the confidentiality of information transmission, and the maximum detection probability constraints at sensing eavesdroppers for preserving sensing privacy. The formulated secure joint transmit beamforming problem is highly non-convex due to the intricate interplay between the detection probabilities, beamforming vectors, and SINR constraints. Fortunately, through strategic manipulation and via applying the semidefinite relaxation (SDR) technique, we successfully obtain the globally optimal solution to the design problem by rigorously verifying the tightness of SDR. Furthermore, we present two alternative joint beamforming designs based on the sensing SNR maximization over the specific sensing area and the coordinated beamforming, respectively. Numerical results reveal the benefits of our proposed design over these alternative benchmarks.

In the sixth-generation (6G) networks, massive low-power devices are expected to sense environment and deliver tremendous data. To enhance the radio resource efficiency, the integrated sensing and communication (ISAC) technique exploits the sensing and communication functionalities of signals, while the simultaneous wireless information and power transfer (SWIPT) techniques utilizes the same signals as the carriers for both information and power delivery. The further combination of ISAC and SWIPT leads to the advanced technology namely integrated sensing, communication, and power transfer (ISCPT). In this paper, a multi-user multiple-input multiple-output (MIMO) ISCPT system is considered, where a base station equipped with multiple antennas transmits messages to multiple information receivers (IRs), transfers power to multiple energy receivers (ERs), and senses a target simultaneously. The sensing target can be regarded as a point or an extended surface. When the locations of IRs and ERs are separated, the MIMO beamforming designs are optimized to improve the sensing performance while meeting the communication and power transfer requirements. The resultant non-convex optimization problems are solved based on a series of techniques including Schur complement transformation and rank reduction. Moreover, when the IRs and ERs are co-located, the power splitting factors are jointly optimized together with the beamformers to balance the performance of communication and power transfer. To better understand the performance of ISCPT, the target positioning problem is further investigated. Simulations are conducted to verify the effectiveness of our proposed designs, which also reveal a performance tradeoff among sensing, communication, and power transfer.

This paper studies the over-the-air computation (AirComp) in an orthogonal frequency division multiplexing (OFDM) system with imperfect channel state information (CSI), in which multiple single-antenna wireless devices (WDs) simultaneously send uncoded signals to a multi-antenna access point (AP) for distributed functional computation over multiple subcarriers. In particular, we consider two scenarios with best-effort and error-constrained computation tasks, with the objectives of minimizing the average computation mean squared error (MSE) and the computation outage probability over the multiple subcarriers, respectively. Towards this end, we jointly optimize the transmit coefficients at the WDs and the receive beamforming vectors at the AP over subcarriers, subject to the maximum transmit power constraints at individual WDs. First, for the special case with a single receive antenna at the AP, we propose the semi-closed-form globally optimal solutions to the two problems using the Lagrange-duality method. It is shown that at each subcarrier, the WDs’ optimized power control policy for average MSE minimization follows a regularized channel inversion structure, while that for computation outage probability minimization follows an on-off regularized channel inversion, with the regularization dependent on the transmit power budget and channel estimation error. Next, for the general case with multiple receive antennas at the AP, we present efficient algorithms based on alternating optimization and convex optimization to find converged solutions to both problems. It is shown that with finite receive antennas at the AP, a non-zero computation MSE for AirComp is inevitable due to the channel estimation errors even when the transmit powers at WDs tend to infinity, while with massive receive antennas, the average MSE and outage probability vanish when the channel vectors are independent and identically distributed. Finally, numerical results are provided to demonstrate the effectiveness of the proposed designs.

This paper studies a multi-intelligent-reflecting-surface-(IRS)-enabled integrated sensing and communications (ISAC) system, in which multiple IRSs are installed to help the base station (BS) provide ISAC services at separate line-of-sight (LoS) blocked areas. We focus on the scenario with semi-passive uniform linear array (ULA) IRSs for sensing, in which each IRS is integrated with dedicated sensors for processing echo signals, and each IRS simultaneously serves one sensing target and multiple communication users (CUs) in its coverage area. We consider two cases with point and extended targets, in which each IRS aims to estimate the target direction-of-arrival (DoA) and the complete target response matrix, respectively. Under this setup, we first derive the closed-form Cramér-Rao bounds (CRBs) for parameter estimation under the two target models. Then, we assume that the BS sends combined information and dedicated sensing signals for ISAC, and accordingly consider two different types of CU receivers that can and cannot cancel the interference from dedicated sensing signals. Under this setup, we minimize the maximum CRB at all IRSs, via jointly optimizing the transmit beamformers at the BS and the reflective beamformers at the multiple IRSs, subject to the minimum signal-to-interference-plus-noise ratio (SINR) constraints at individual CUs, the maximum transmit power constraint at the BS, and the unit-modulus constraints at the multiple IRSs. To tackle the highly non-convex SINR-constrained max-CRB minimization problems, we propose efficient algorithms based on alternating optimization and semi-definite relaxation, to obtain converged solutions. Finally, numerical results are provided to verify the benefits of our proposed designs over various benchmark schemes based on separate or heuristic beamforming designs.

This paper unifies integrated sensing and communication (ISAC) and simultaneous wireless information and power transfer (SWIPT), by investigating a new multi-functional multiple-input multiple-output (MIMO) system that integrates wireless sensing, communication, and powering. In this system, a multi-antenna hybrid access point (H-AP) transmits wireless signals to communicate with a multi-antenna information decoding (ID) receiver, wirelessly charges a multi-antenna energy harvesting (EH) receiver, and performs radar target sensing based on the echo signal concurrently. Under this setup, we aim to reveal the fundamental performance tradeoff limits among sensing, communication, and powering, in terms of the estimation Cramér-Rao bound (CRB), achievable communication rate, and harvested energy, respectively. In particular, we consider two different target models for radar sensing, namely the point and extended targets, for which we are interested in estimating the target angle and the complete target response matrix, respectively. For both models, we define the achievable CRB-rate-energy (C-R-E) region and characterize its Pareto boundary by maximizing the achievable rate at the ID receiver, subject to the estimation CRB requirement for target sensing, the minimum harvested energy requirement at the EH receiver, and the maximum transmit power constraint at the H-AP. We obtain partitionable optimal transmit covariance matrix solutions to the two formulated problems by applying advanced convex optimization techniques. The numerical results demonstrate the optimal C-R-E region boundary achieved by our proposed design, as compared to the benchmark schemes based on time division and eigenmode transmission (EMT).

This paper studies a multi-antenna networked integrated sensing and communications (ISAC) system, in which a set of multi-antenna base stations (BSs) employ the coordinated transmit beamforming to serve multiple single-antenna communication users (CUs) and concurrently perform joint target detection by exploiting the echo signals. To facilitate target sensing, the BSs transmit dedicated sensing signals combined with their information signals. We consider two types of CU receivers with and without the capability of canceling the interference from the dedicated sensing signals, respectively. We also investigate two scenarios with and without time synchronization among the BSs. For the scenario with synchronization, the BSs can exploit the target-reflected signals over both the direct links (BS-to-target-to-originated-BS links) and the cross-links (BS-to-target-to-other-BSs links) for joint detection, while in the unsynchronized scenario, the BSs can only utilize the target-reflected signals over the direct links. For each scenario under different types of CU receivers, we optimize the coordinated transmit beamforming at the BSs to maximize the minimum detection probability over a particular targeted area, while guaranteeing the required minimum signal-to-interference-plus-noise ratio (SINR) constraints at the CUs. These SINR-constrained detection probability maximization problems are recast as non-convex quadratically constrained quadratic programs (QCQPs), which are then optimally solved via the semi-definite relaxation (SDR) technique. Numerical results show that for each considered scenario, the proposed ISAC design achieves enhanced target detection probability compared with various benchmark schemes. In particular, enabling time synchronization and sensing signal cancellation at the BSs is always beneficial for further improving the joint detection and communication performance.

This paper studies a multiple-input multiple-output (MIMO) integrated sensing and communication (ISAC) system, in which a multi-antenna base station (BS) sends unified wireless signals to estimate one sensing target and communicate with a multi-antenna communication user (CU) simultaneously. We consider two sensing target models, namely the point and extended targets, respectively. For the point target case, the BS estimates the target angle and the reflection coefficient as unknown parameters, and we adopt the Cramér-Rao bound (CRB) for angle estimation as the sensing performance metric. For the extended target case, the BS estimates the complete target response matrix, and we consider three different sensing performance metrics including the trace, the maximum eigenvalue, and the determinant of the CRB matrix for target response matrix estimation. For each of the four scenarios with different CRB measures, we investigate the fundamental tradeoff between the estimation CRB for sensing and the data rate for communication, by characterizing the Pareto boundary of the achievable CRB-rate (C-R) region. In particular, we formulate a new MIMO rate maximization problem for each scenario, by optimizing the transmit covariance matrix at the BS, subject to a different form of maximum CRB constraint and its maximum transmit power constraint. For these problems, we obtain the optimal transmit covariance solutions in semi-closed forms by using advanced convex optimization techniques. For the point target case, the optimal solution is obtained by diagonalizing acomposite channel matrixvia singular value decomposition (SVD) together with water-filling-like power allocation over these decomposed subchannels. For the three scenarios in the extended target case, the optimal solutions are obtained by diagonalizing thecommunication channelvia SVD, together with proper power allocation over two orthogonal sets of subchannels, one for both communication and sensing, and the other for dedicated sensing only. Finally, numerical results show the C-R region achieved by the optimal design in each scenario, which significantly outperforms that by other benchmark schemes such as time switching.

With the recent advancements in edge artificial intelligence (AI), future sixth-generation (6G) networks need to support new AI tasks such as classification and clustering apart from data recovery. Motivated by the success of deep learning, the semantic-aware and task-oriented communications with deep joint source and channel coding (JSCC) have emerged as new paradigm shifts in 6G from the conventional data-oriented communications with separate source and channel coding (SSCC). However, most existing works focused on the deep JSCC designs for one task of data recovery or AI task execution independently, which cannot be transferred to other unintended tasks. Differently, this paper investigates the JSCC semantic communications to support multi-task services, by performing the image data recovery and classification task execution simultaneously. First, we propose a new end-to-end deep JSCC framework by unifying the coding rate reduction maximization and the mean square error (MSE) minimization in the loss function. Here, the coding rate reduction maximization facilitates the learning of discriminative features for enabling to perform classification tasks directly in the feature space, and the MSE minimization helps the learning of informative features for high-quality image data recovery. Next, to further improve the robustness against variational wireless channels, we propose a new gated deep JSCC design, in which a gated net is incorporated for adaptively pruning the output features to adjust their dimensions based on channel conditions. Finally, we present extensive numerical experiments to validate the performance of our proposed deep JSCC designs as compared to various benchmark schemes. It is shown that our proposed designs simultaneously provide efficient multi-task services, and the proposed gated deep JSCC framework efficiently reduces the communication overhead with only marginal performance loss. It is also shown that performing the classification task on the feature space via coding rate reduction maximization is able to better defend the label corruption than the traditional label-fitting methods.

This paper investigates the performance tradeoff for a multi-antenna integrated sensing and communication (ISAC) system with simultaneous information multicasting and multi-target sensing, in which a multi-antenna base station (BS) sends the common information messages to a set of single-antenna communication users (CUs) and estimates the parameters of multiple sensing targets based on the echo signals concurrently. We consider two target sensing scenarios without and with prior target knowledge at the BS, in which the BS is interested in estimating the complete multi-target response matrix and the target reflection coefficients/angles, respectively. First, we consider the capacity-achieving transmission and characterize the fundamental tradeoff between the achievable rate and the multi-target estimation Cramér-Rao bound (CRB) accordingly. To this end, we design the optimal transmit signal covariance matrix at the BS to minimize the estimation CRB for each of the two scenarios, subject to the minimum multicast rate requirement and the maximum transmit power constraint. It is shown that the optimal covariance matrix consists of two parts for ISAC and dedicated sensing, respectively. Next, we consider the transmit beamforming designs, in which the BS sends one information beam together with multiple a-priori known dedicated sensing beams for effective ISAC and each CU can cancel the interference caused by the sensing signals. By exploiting the successive convex approximation (SCA) technique, we develop efficient algorithms to obtain the joint information and sensing beamforming solutions to the resultant rate-constrained CRB minimization problems. Finally, we provide numerical results to validate the CRB-rate (C-R) tradeoff achieved by our proposed designs, as compared to two benchmark schemes, namely the isotropic transmission and the joint beamforming without sensing interference cancellation. It is shown that the proposed optimal transmit covariance solution achieves much better C-R performance than the benchmark schemes and the proposed joint beamforming with sensing interference cancellation performs close to the optimal transmit covariance solution when the number of CUs is small. We also conduct simulations to show the practical estimation performance achieved by our proposed designs, by considering randomly generated information signals and practical estimators.

This paper investigates an intelligent reflecting surface (IRS) enabled multiuser integrated sensing and communications (ISAC) system, which consists of one multi-antenna base station (BS), one IRS, multiple single-antenna communication users (CUs), and one target at the non-line-of-sight (NLoS) region of the BS. The IRS is deployed to not only assist the communication from the BS to the CUs, but also enable the BS’s NLoS target sensing based on the echo signals from the BS-IRS-target-IRS-BS link. We consider two types of targets, namely the extended and point targets, for which the BS aims to estimate the complete target response matrix and the target’s direction-of-arrival (DoA) with respect to the IRS, respectively. To provide full degrees of freedom for sensing, we consider that the BS sends dedicated sensing signals in addition to the communication signals. Accordingly, we model two types of CU receivers, namely Type-I and Type-II CU receivers, which do not have and have the capability of canceling the interference from the sensing signals, respectively. Under each setup, we jointly optimize the transmit beamforming at the BS and the reflective beamforming at the IRS to minimize the Cramér-Rao bound (CRB) for target estimation, subject to the minimum signal-to-interference-plus-noise ratio (SINR) constraints at the CUs and the maximum transmit power constraint at the BS. We present efficient algorithms to solve the highly non-convex SINR-constrained CRB minimization problems, by using the techniques of alternating optimization, semi-definite relaxation, and successive convex approximation. Numerical results show that the proposed design achieves lower estimation CRB than other benchmark schemes, and the sensing signal interference cancellation at Type-II CU receivers is beneficial when the number of CUs is greater than one.

This paper studies a new multi-device edge artificial-intelligent (AI) system, which jointly exploits the AI model split inference and integrated sensing and communication (ISAC) to enable low-latency intelligent services at the network edge. In this system, multiple ISAC devices perform radar sensing to obtain multi-view data, and then offload the quantized version of extracted features to a centralized edge server, which conducts model inference based on the cascaded feature vectors. Under this setup and by considering classification tasks, we measure the inference accuracy by adopting an approximate but tractable metric, namely discriminant gain, which is defined as the distance of two classes in the Euclidean feature space under normalized covariance. To maximize the discriminant gain, we first quantify the influence of the sensing, computation, and communication processes on it with a derived closed-form expression. Then, an end-to-end task-oriented resource management approach is developed by integrating the three processes into a joint design. This integrated sensing, computation, and communication (ISCC) design approach, however, leads to a challenging non-convex optimization problem, due to the complicated form of discriminant gain and the device heterogeneity in terms of channel gain, quantization level, and generated feature subsets. Remarkably, the considered non-convex problem can be optimally solved based on the sum-of-ratios method. This gives the optimal ISCC scheme, that jointly determines the transmit power and time allocation at multiple devices for sensing and communication, as well as their quantization bits allocation for computation distortion control. By using human motions recognition as a concrete AI inference task, extensive experiments are conducted to verify the performance of our derived optimal ISCC scheme.

Signal detection and modulation classification are two crucial tasks in various wireless communication systems. Different from prior works that investigate them independently, this paper studies the joint signal detection and automatic modulation classification (AMC) by considering a realistic and complex scenario, in which multiple signals with different modulation schemes coexist at different carrier frequencies. We first generate a coexisting RADIOML dataset (CRML23) to facilitate the joint design. Different from the publicly available AMC dataset, ignoring the signal detection step and containing only one signal, our synthetic dataset covers the more realistic multiple-signal coexisting scenario. Then, we present a joint framework for detection and classification (JDM) for such a multiple-signal coexisting environment, which consists of two modules for signal detection and AMC, respectively. In particular, these two modules are interconnected using a designated data structure called “proposal”. Finally, we conduct extensive simulations over the newly developed dataset, which demonstrate the effectiveness of our designs. Our code and dataset are now available as open-source resources athttps://github.com/Singingkettle/ChangShuoRadioData.

This paper studies a networked integrated sensing and communication (ISAC) system, where distributed base stations (BSs) implement coordinated transmit beamforming to communicate with their respective user and cooperatively perform multi-static target sensing. To fully reap the performance gains provided by the networked ISAC system, accurate channel state information (CSI) and time synchronization (TS) among distributed BSs are crucial. However, CSI errors and TS errors are inevitable in practice due to the imperfect channel training and the inaccurate synchronization. To reveal the effect of CSI errors on communication, a Gaussian distributed CSI error model is formulated based on the channel estimation process, and accordingly, the users’ achievable rates with CSI errors are derived. To characterize the effect of TS errors on multi-static sensing, the Cramér-Rao lower bound (CRLB) for estimating target position in the presence of TS errors is derived. It is shown that due to the existence of CSI errors and TS errors, additional terms are introduced in the achievable rate and CRLB formulas, degrading the communication and sensing performance, respectively. Based on the above derivations, we aim at maximizing the sum-rate of users by designing the coordinated transmit beamforming at the BSs, while guaranteeing the CRLB requirements for target sensing. In particular, we consider two cases with and without TS errors, for which the corresponding non-convex optimization problems are solved via a penalty-based algorithm and an alternating optimization algorithm, respectively. Simulation results show that the proposed algorithms significantly outperform benchmark schemes for both cases with and without CSI/TS errors, thus validating the robustness in ISAC performance optimization.

This paper studies a multi-intelligent-reflecting-surface (IRS)-enabled integrated sensing and communications (ISAC) system, in which multiple IRSs are installed to help a base station (BS) provide ISAC services at the line-of-sight (LoS) blocked areas. In particular, we consider the case with semi-passive uniform linear array (ULA) IRSs each integrated with dedicated sensors for receiving echo signals, in which each IRS simultaneously senses one point target and communicates with one communication user (CU) within its coverage area. Under this setup, we first derive the closed-form Cramér-Rae bound (CRB) for the targets' direction-of-arrival (DoA) estimation at the corresponding IRSs. Then, to achieve fair and optimal sensing performance, we minimize the maximum CRB for targets' DoA estimation at all IRSs, by jointly optimizing the transmit beamformers at the BS and the reflective beamformers at the IRSs, subject to the minimum signal-to-interference-plus-noise ratio (SINR) constraints at individual CUs, the maximum transmit power constraint at the BS, and the unit-modulus constraints at the IRSs. To tackle the highly non-convex SINR-constrained max-CRB minimization problem, we propose an efficient algorithm based on alternating optimization and semi-definite relaxation, to obtain a converged solution. Finally, numerical results are provided to verify the effectiveness of our proposed design over various benchmark schemes based on separate or heuristic beamforming designs.

Future sixth-generation (6G) networks are envisioned to provide both sensing and communications functionalities by using densely deployed base stations (BSs) with massive antennas operating in millimeter wave (mmWave) and terahertz (THz). Due to the large number of antennas and the high frequency band, the sensing and communications are expected to be implemented within the near-field region, thus making the conventional designs based on the far-field channel models inapplicable. This paper studies a near-field multiple-input-multiple-output (MIMO) radar sensing system, in which the transceivers with massive antennas aim to localize multiple near-field targets in the three-dimensional (3D) space. In particular, we adopt a general wavefront propagation model by considering the exact spherical wavefront with both channel phase and amplitude variations over different antennas. Besides, we consider the general transmit signal waveforms and also consider the unknown cluttered environments. Under this setup, the unknown parameters to estimate include the 3D coordinates and the complex reflection coefficients of the targets, as well as the noise and interference covariance matrix. Accordingly, we derive the Fisher information matrix (FIM) corresponding to the 3D coordinates and the complex reflection coefficients of the targets and accordingly obtain the Cramér-Rao bound (CRB) for the 3D coordinates. This provides a performance bound for 3D near-field target localization. Next, to facilitate practical localization, we propose an efficient estimation algorithm based on the 3D approximate cyclic optimization (3D-ACO), which is obtained following the maximum likelihood (ML) criterion. Finally, numerical results show that considering the exact antenna-varying channel amplitudes achieves more accurate CRB as compared to prior works based on constant channel amplitudes across antennas, especially when the targets are close to the transceivers. It is also shown that the proposed estimator achieves localization performance close to the derived CRB, thus validating its effectiveness in practical implementation.

This paper unifies integrated sensing and communication (ISAC) and simultaneous wireless information and power transfer (SWIPT), by investigating a new multi-functional multiple-input multiple-output (MIMO) system integrating wireless sensing, communication, and powering. In this system, one multi-antenna hybrid access point (H-AP) transmits wireless signals to communicate with one multi-antenna information decoding (ID) receiver, wirelessly charge one multi-antenna energy harvesting (EH) receiver, and perform radar sensing for a point target based on the echo signal at the same time. Under this setup, we aim to reveal the fundamental performance tradeoff limits of sensing, communication, and powering, in terms of the estimation Cramér-Rao bound (CRB), achievable communication rate, and harvested energy level, respectively. Towards this end, we define the achievable CRB-rate-energy (C-R-E) region and characterize its Pareto boundary by maximizing the achievable rate at the ID receiver, subject to the estimation CRB requirement for target sensing, the harvested energy requirement at the EH receiver, and the maximum transmit power constraint at the H-AP. We obtain the semi-closed-form optimal transmit covariance solution to the formulated problem by applying advanced convex optimization techniques. Numerical results show the optimal C-R-E region boundary achieved by our proposed design, as compared to the benchmark scheme based on time switching.

This paper studies a multi-antenna network integrated sensing and communication (ISAC) system, in which a set of multi-antenna base stations (BSs) employ the coordinated transmit beamforming to serve their respectively associated single-antenna communication users (CUs), and at the same time reuse the reflected information signals to perform joint target detection. In particular, we consider two target detection scenarios depending on the time synchronization among BSs. In Scenario I, these BSs are synchronized and can exploit the target-reflected signals over both the direct links (from each BS to target to itself) and the cross links (from each BS to target to other BSs) for joint detection. In Scenario II, these BSs are not synchronized and can only utilize target-reflected signals over the direct links for joint detection. For each scenario, we derive the detection probability under a specific false alarm probability at any given target location. Based on the derivation, we optimize the coordinated transmit beamforming at the BSs to maximize the minimum detection probability over a particular target area, while ensuring the minimum signal-to-interference-plus-noise ratio (SINR) constraints at the CUs, subject to the maximum transmit power constraints at the BSs. We use the semi-definite relaxation (SDR) technique to obtain highly-quality solutions to the formulated problems. Numerical results show that for each scenario, the proposed design achieves higher detection probability than the benchmark scheme based on communication design. It is also shown that the time synchronization among BSs is beneficial in enhancing the detection performance as more reflected signal paths are exploited.

This paper investigates an intelligent reflecting surface (IRS) enabled multiuser integrated sensing and communication (ISAC) system, which consists of one multi-antenna base station (BS), one IRS, multiple single-antenna communication users (CUs), and one extended target at the non-line-of-sight (NLoS) region of the BS. The IRS is deployed to not only assist the communication from the BS to the CUs, but also enable the BS's NLoS target sensing based on the echo signals from the BS-IRS-target-IRS-BS link. To provide full degrees of freedom for sensing, we suppose that the BS sends additional dedicated sensing signals combined with the information signals. Accordingly, we consider two types of CU receivers, namely Type-I and Type-II receivers, which do not have and have the capability of cancelling the interference from the sensing signals, respectively. Under this setup, we jointly optimize the transmit beamforming at the BS and the reflective beamforming at the IRS to minimize the Cramer-Rao bound (CRB) for estimating the target response matrix with respect to the IRS, subject to the minimum signal-to-interference-plus-noise ratio (SINR) constraints at the CUs and the maximum transmit power constraint at the BS. We present efficient algorithms to solve the highly non-convex SINR-constrained CRB minimization problems, by using the techniques of alternating optimization and semi-definite relaxation. Numerical results show that the proposed design achieves lower estimation CRB than other benchmark schemes, and the sensing signal interference pre-cancellation is beneficial when the number of CUs is greater than one.

This paper studies a new multi-device edge artificial-intelligent (AI) system, which jointly exploits the AI model split inference and integrated sensing and communication (ISAC) to enable low-latency intelligent services at the network edge. In this system, multiple ISAC devices perform radar sensing to obtain multi-view data, and then offload the quantized version of extracted features to a centralized edge server, which conducts model inference based on the cascaded feature vectors. Under this setup and by considering classification tasks, we measure the inference accuracy by adopting an approximate but tractable metric, namely discriminant gain, which is defined as the distance of two classes in the Euclidean feature space under normalized covariance. To maximize the discriminant gain, we first quantify the influence of the sensing, computation, and communication processes on it with a derived closed-form expression. Then, an end-to-end task-oriented resource management approach is developed by designing an optimal integrated sensing, computation, and communication (ISCC) scheme. By using human motions recognition as a concrete AI inference task, extensive experiments are conducted to verify the performance of the proposed scheme.

State-of-the-art multi-agent collision avoidance algorithms face limitations when applied to cluttered public environments, where obstacles may have a variety of shapes and structures. The issue arises because most of these algorithms are agent-level methods. They concentrate solely on preventing collisions between the agents while the obstacles are handled merely out-of-policy. Obstacle-aware policies output an action considering both agents and obstacles. Current obstacle-aware algorithms, mainly based on Lidar sensor data, struggle to handle collision avoidance around complex obstacles. To resolve this issue, this paper investigates how to find a better way to travel around diverse obstacles. In particular, we present a global map assisted collision avoidance algorithm which, following the lead of a high-level goal guide and using an obstacle representation called distance map, considers other agents and obstacles simultaneously. Moreover, our model can be loaded into each agent individually, making it applicable to large maps or more agents. Simulation results indicate that our model outperforms the state-of-the-art algorithms, showing in scenarios with complex obstacles. We present a notion for incorporating global information in decentralized decision-making, along with a method for extending agent-level algorithms to cluttered environments in real-world scenarios.

This paper studies the wireless control system at network edge, in which one base station (BS) coordinates the closed-loop wireless control of multiple subsystems each consisting of a plant, sensor, and actuator. In this system, the BS first collects the state information from the sensors of plants, then processes the information via edge computing, and finally sends the obtained command signals back to the actuators for controlling the plants. In particular, we consider the ultra-reliable low-latency communication (URLLC) for the state and command signal transmission, by using the rate formulas based on short-packet communication. Under this setup, we first present a time-division-multiple-access (TDMA) protocol for coordinating the sensing, communication, and computation among the multiple plants. Then, we jointly optimize the communication and computation resource allocations to minimize the closed-loop control latency while ensuring the stability of the controlled plants. Though the considered problem is difficult to solve, we transform it into a non-convex problem with semi-definite constraints, and then present an efficient solution via the techniques of alternating optimization and convex approximation. Numerical results show that the proposed solution efficiently reduces the closed-loop control latency as compared to other benchmark schemes with heuristic resource allocations.

This paper studies a downlink secure integrated sensing and communication (ISAC) system, in which a multi-antenna base station (BS) transmits confidential messages to a single-antenna communication user (CU) while performing sensing on targets that may act as suspicious eavesdroppers. To ensure the quality of target sensing while preventing their potential eavesdropping, the BS combines the transmit confidential information signals with additional dedicated sensing signals, which play a dual role of artificial noise (AN) for degrading the qualities of eavesdropping channels. Under this setup, we jointly design the transmit information and sensing beamforming, with the objective of minimizing the weighted sum of beampattern matching errors and cross-correlation patterns for sensing subject to secure communication constraints. The robust design takes into account the channel state information (CSI) imperfectness of the eavesdroppers in two practical CSI error scenarios. First, we consider the scenario with bounded CSI errors of eavesdroppers, in which the worst-case secrecy rate constraint is adopted to ensure secure communication performance. In this scenario, we present the optimal solution to the worst-case secrecy rate constrained sensing beampattern optimization problem, by adopting the techniques of S-procedure, semi-definite relaxation (SDR), and a one-dimensional (1D) search, for which the tightness of the SDR is rigorously proved. Next, we consider the scenario with Gaussian CSI errors of eavesdroppers, in which the secrecy outage probability constraint is adopted. In this scenario, we present an efficient algorithm to solve the more challenging secrecy outage-constrained sensing beampattern optimization problem, by exploiting the convex restriction technique based on the Bernstein-type inequality, together with the SDR and 1D search. Finally, numerical results show that the proposed designs can properly adjust the information and sensing beams to balance the tradeoffs among communicating with CU, sensing targets, and confusing eavesdroppers, so as to achieve desirable sensing transmit beampatterns while ensuring the CU’s secrecy requirements for the two scenarios.

This paper studies the unmanned aerial vehicle (UAV)-enabled integrated sensing and communication (ISAC), in which UAVs are dispatched as aerial dual-functional access points (APs) that can exploit the UAV maneuver control and strong line-of-sight (LoS) air-to-ground (A2G) links for efficient communication and sensing. In particular, we consider that one UAV-AP, equipped with a vertically placed uniform linear array (ULA), sends combined information and sensing signals to communicate with multiple users and at the same time sense potential targets at interested areas on the ground. Under this setup, we consider two scenarios with quasi-stationary and fully mobile UAVs, in which the UAV is deployed at an optimizable location over the whole ISAC mission period and can fly over different locations during the ISAC mission period, respectively. For the two scenarios, our objective is to jointly design the UAV maneuver (deployment location or flight trajectory) and the transmit beamforming, for maximizing the weighted sum-rate throughput of communication users, while ensuring the sensing beampattern gain requirements, subject to the transmit power and flight constraints. However, due to the ULA consideration at the UAV, the two formulated problems are highly non-convex and very difficult to be optimally solved, as the UAV’s location/trajectory variables are involved on the exponent parts of each entry in the steering vectors, and are closely coupled with the transmit beamforming vectors. To tackle this issue, we propose efficient algorithms to find their suboptimal but high-quality solutions, by using various techniques from convex and non-convex optimization. Finally, numerical results are provided to validate the superiority of our proposed designs as compared to various benchmark schemes with heuristic maneuver designs. It is shown that the joint maneuver and transmit beamforming design efficiently balances the inherent tradeoff between sensing and communication with regards to different beampattern gain thresholds.

This paper studies a multiple-input multiple-output (MIMO) integrated sensing and communication (ISAC) system, in which a multi-antenna base station (BS) sends unified wireless signals to estimate an extended target and communicate with a multi-antenna communication user (CU) at the same time. We investigate the fundamental tradeoff between the estimation Cramér-Rao bound (CRB) for sensing and the data rate for communication, by characterizing the Pareto boundary of the achievable CRB-rate (C-R) region. Towards this end, we formulate a new MIMO rate maximization problem by optimizing the transmit covariance matrix at the BS, subject to a new form of maximum CRB constraint together with a maximum transmit power constraint. We derive the optimal transmit covariance solution in a semi-closed form, by first implementing the singular-value decomposition (SVD) to diagonalize the communication channel and then properly allocating the transmit power over these subchannels for communication and other orthogonal subchannels (if any) for dedicated sensing. It is shown that the optimal transmit covariance is of full rank, which unifies the conventional rate maximization design with water-filling power allocation and the CRB minimization design with isotropic transmission. Numerical results are provided to validate the performance achieved by our proposed optimal design, in comparison with other benchmark schemes.

This paper studies the unmanned aerial vehicle (UAV)-enabled integrated sensing and communication (ISAC), in which UAVs are dispatched as aerial dual-functional access points (APs) that can exploit the UAV maneuver control and strong line- of-sight (LoS) aerial-to-ground (A2G) links for efficient ISAC. Particularly, we consider a scenario with one UAV-AP equipped with a vertically placed uniform linear array (ULA), which sends combined information and sensing signals to communicate with multiple users and at the same time sense potential targets on the ground. Our objective is to jointly design the UAV trajectory and transmit beamforming to maximize the average weighted sum-rate throughput of communication users over the whole period, subject to the sensing beampattern gain requirements and transmit power constraints over different time slots, as well as practical flight constraints. While the above problem is challenging to solve, we propose an efficient algorithm by adopting the alternating optimization together with the successive convex approximation (SCA) and semidefinite relaxation (SDR). Numerical results are provided to validate the superiority of our proposed designs as compared to various benchmark schemes with heuristic trajectory designs.

This paper studies a secrecy integrated sensing and communication (ISAC) system, in which a multi-antenna base station (BS) aims to send confidential messages to a single-antenna communication user (CU), and at the same time sense several targets that may be suspicious eavesdroppers. To ensure the sensing quality while preventing the eavesdropping, we consider that the BS sends dedicated sensing signals (in addition to confidential information signals) that play a dual role of artificial noise (AN) for confusing the eavesdropping targets. Under this setup, we jointly optimize the transmit information and sensing beamforming at the BS, to minimize the matching error between the transmit beampattern and a desired beampattern for sensing, subject to the minimum secrecy rate requirement at the CU and the transmit power constraint at the BS. Although the formulated problem is non-convex, we propose an algorithm to obtain the globally optimal solution by using the semidefinite relaxation (SDR) together with a one-dimensional (1D) search. Next, to avoid the high complexity induced by the 1D search, we also present two sub-optimal solutions based on zero-forcing and separate beamforming designs, respectively. Numerical results show that the proposed designs properly adjust the information and sensing beams to balance the tradeoffs among communicating with CU, sensing targets, and confusing eavesdroppers, thus achieving desirable transmit beampattern for sensing while ensuring the CU’s secrecy rate.

This paper studies a mobile edge computing (MEC) network to support emerging Internet-of-things applications, where multiple access points (APs), each attached with an MEC server, need to collect data from multiple sensors, process them, and then send computation results to the paired actuators for control. Specifically, we consider a three-phase operation protocol for data uploading, edge computing, and results downloading, where the frequency-division multiple access is implemented to accommodate communications of multiple sensors/actuators. Under this setup, we minimize the end-to-end (E2E) latency of the sensing-communication-computation-actuation loop by properly designing the user association and resource allocation policy, subject to the communication and computation resource constraints. The formulated problem, however, is a mixed-integer non-linear program that is difficult to be optimized. Despite this fact, we first search the optimal solution for user association, and then apply convex optimization for resource allocation given the obtained optimal user association. Finally, numerical results show that the proposed optimal joint design significantly reduces the E2E latency, as compared to conventional designs without such joint designs.

Channel knowledge map (CKM) is an emerging technique to enable environment-aware wireless communications, in which databases with location-specific channel knowledge are used to facilitate or even obviate real-time channel state information acquisition. One fundamental problem for CKM-enabled communication is how to efficiently construct the CKM based on finite measurement data points at limited user locations. Towards this end, this paper proposes a novel map construction method based on the expectation maximization (EM) algorithm, by utilizing the available measurement data, jointly with the expert knowledge of well-established statistic channel models. The key idea is to partition the available data points into different groups, where each group shares the same modelling parameter values to be determined. We show that determining the modelling parameter values can be formulated as a maximum likelihood estimation problem with latent variables, which is then efficiently solved by the classic EM algorithm. Compared to the pure data-driven methods such as the nearest neighbor based interpolation, the proposed method is more efficient since only a small number of modelling parameters need to be determined and stored. Furthermore, the proposed method is extended for constructing a specific type of CKM, namely, the channel gain map (CGM), where closed-form expressions are derived for the E-step and M-step of the EM algorithm. Numerical results are provided to show the effectiveness of the proposed map construction method as compared to the benchmark curve fitting method with one single model.

This paper studies an intelligent reflecting surface (IRS)-assisted integrated sensing and communication (ISAC) system, in which one IRS with a uniform linear array (ULA) is deployed to not only assist the wireless communication from a multi-antenna base station (BS) to a single-antenna communication user (CU), but also create virtual line-of-sight (LoS) links for sensing potential targets at areas with LoS links blocked. We consider that the BS transmits combined information and sensing signals for ISAC. Under this setup, we jointly optimize the transmit information and sensing beamforming at the BS and the reflective beamforming at the IRS, to maximize the IRS’s minimum beampattern gain towards the desired sensing angles, subject to the minimum signal-to-noise ratio (SNR) requirement at the CU and the maximum transmit power constraint at the BS. Although the formulated SNR-constrained beampattern gain maximization problem is non-convex and difficult to solve, we present an efficient algorithm to obtain a high-quality solution by using the techniques of alternating optimization and semi-definite relaxation (SDR). Numerical results show that the proposed joint beamforming design achieves improved sensing performance while ensuring the communication requirement as compared to benchmarks without such joint optimization. It is also shown that the use of dedicated sensing beams is beneficial in enhancing the performance for IRS-assisted ISAC.

This paper studies the problem of predicting the spectrum efficiency (SE) for massive multiple-input multiple-output (MIMO) empowered 5G networks based on the reference signal received power (RSRP) collected from the drive test (DT). This problem is challenging because there is no precise model between the RSRP and the SE. The SE not only depends on the RSRP, which only captures the statistic of the channel, but also the beamforming strategy of the serving base station (BS) and the interference from the neighboring cells, which are not measured at the 5G client. This paper adopts a model-assisted data-driven approach to develop a machine learning model for the SE prediction. Specifically, a joint interference and SE prediction network is built, demonstrating prediction improvement over pure data-driven neural networks. In addition, a classification-assisted SE prediction network is constructed, which substantially reduces the prediction error at the low SE regime with marginally compromising the total prediction error. It is found that the model-assisted approach generally enhances the SE prediction accuracy by 2% approximately over a purely data-driven approach.

Over-the-air computation(AirComp) has emerged as a new analog power-domainnon-orthogonal multiple access(NOMA) technique for low-latency model/gradient-updatesaggregation in federated edge learning(FEEL). By integrating communication and computation into a joint design, AirComp can significantly enhance the communication efficiency, but at the cost of aggregation errors caused by channel fading and noise. This paper studies a particular type of FEEL with federated averaging (FedAvg) and AirComp-based model-update aggregation, namelyover-the-airFedAvg (Air-FedAvg). We investigate the transmission power control in Air-FedAvg to combat against the AirComp aggregation errors for enhancing the training accuracy and accelerating the training speed. Towards this end, we first analyze the convergence behavior (in terms of the optimality gap) of Air-FedAvg with aggregation errors at different outer iterations. Then, to enhance the training accuracy, we minimize the optimality gap by jointly optimizing the transmission power control at edge devices and the denoising factors at edge server, subject to a series of power constraints at individual edge devices. Furthermore, to accelerate the training speed, we also minimize the training latency of Air-FedAvg with a given targeted optimality gap, in which learning hyper-parameters including the numbers of outer iterations and local training epochs are optimized jointly with the power control. Finally, numerical results show that the proposed transmission power control policy achieves significantly faster convergence speed for Air-FedAvg, as compared with benchmark policies with fixed power transmission or per-iterationmean squared error(MSE) minimization. It is also shown that the Air-FedAvg achieves an order-of-magnitude shorter training latency than the conventional FedAvg with digitalorthogonal multiple access(OMA-FedAvg).

Over-the-air federated edge learning(Air-FEEL) has emerged as a communication-efficient solution to enable distributed machine learning over edge devices by using their data locally to preserve the privacy. By exploiting the waveform superposition property of wireless channels, Air-FEEL allows the “one-shot” over-the-air aggregation of gradient-updates to enhance the communication efficiency, but at the cost of a compromised learning performance due to the aggregation errors caused by channel fading and noise. This paper investigates the transmission power control to combat against such aggregation errors in Air-FEEL. Different from conventional power control designs (e.g., to minimize the individualmean squared error(MSE) of the over-the-air aggregation at each round), we consider a new power control design aiming at directly maximizing the convergence speed. Towards this end, we first analyze the convergence behavior of Air-FEEL (in terms of the optimality gap) subject to aggregation errors at different communication rounds. It is revealed that if the aggregation estimates are unbiased, then the training algorithm would converge exactly to the optimal point with mild conditions; while if they are biased, then the algorithm would converge with an error floor determined by the accumulated estimate bias over communication rounds. Next, building upon the convergence results, we optimize the power control to directly minimize the derived optimality gaps under the cases without and with unbiased aggregation constraints, subject to a set of average and maximum power constraints at individual edge devices. We transform both problems into convex forms, and obtain their structured optimal solutions, both appearing in a form of regularized channel inversion, by using the Lagrangian duality method. Finally, numerical results show that the proposed power control policies achieve significantly faster convergence for Air-FEEL, as compared with benchmark policies with fixed power transmission or conventional MSE minimization.

As the standardization of 5G solidifies, researchers are speculating what 6G will be. The integration of sensing functionality is emerging as a key feature of the 6G Radio Access Network (RAN), allowing for the exploitation of dense cell infrastructures to construct a perceptive network. In this IEEE Journal on Selected Areas in Communications (JSAC) Special Issue overview, we provide a comprehensive review on the background, range of key applications and state-of-the-art approaches of Integrated Sensing and Communications (ISAC). We commence by discussing the interplay between sensing and communications (S&C) from a historical point of view, and then consider the multiple facets of ISAC and the resulting performance gains. By introducing both ongoing and potential use cases, we shed light on the industrial progress and standardization activities related to ISAC. We analyze a number of performance tradeoffs between S&C, spanning from information theoretical limits to physical layer performance tradeoffs, and the cross-layer design tradeoffs. Next, we discuss the signal processing aspects of ISAC, namely ISAC waveform design and receive signal processing. As a step further, we provide our vision on the deeper integration between S&C within the framework of perceptive networks, where the two functionalities are expected to mutually assist each other, i.e., via communication-assisted sensing and sensing-assisted communications. Finally, we identify the potential integration of ISAC with other emerging communication technologies, and their positive impacts on the future of wireless networks.

Driving a gradual integration of the physical and digital worlds is perceived to become a reality in the 6G era, from vehicles to drones, from surveillance facilities in cities to agricultural tools in the countryside. Jointly motivated by recent advances in communication and signal processing, radio sensing functionality can be integrated into a 6G radio access network (RAN) in a low-cost and fast manner. That is, future networks have the ability to “see” the physical world through imaging and measuring the surrounding environment, which enables advanced location-aware services, ranging from the physical to application layers. In essence, a radio emission could simultaneously convey communication data from the transmitter to the receiver and deliver environmental information from the scattered echoes. Therefore, sensing and communication (S&C) functionalities are possible to be co-designed to utilize resources efficiently and to assist each other for mutual benefits. This type of research is typically referred to as integrated sensing and communication (ISAC).

This is Part II of the double-part Special Issue (SI) on Integrated Sensing and Communication (ISAC). This SI aims at bringing together contributions from both academia and industry to highlight the recent progress of ISAC, where sensing and communication (S$\$ $C) functionalities are jointly designed to utilize wireless/hardware resources efficiently and to assist each other for mutual benefits. The 32 accepted articles of this SI are arranged into six groups, namely, 1) Fundamental Performance Bounds and Optimization, 2) Time-Frequency Signal Processing, 3) Spatial Signal Processing, 4) Networking and Resource Allocation, 5) ISAC With Emerging Communications Technologies, and 6) ISAC Applications. We kindly refer readers to Part I of this SI for a comprehensive overview written by the Guest Editorial Team, which provides both a bird’s eye view and technical details regarding state-of-the-art ISAC innovations. The contributions made by the papers in Part II are summarized as follows, which correspond to paper groups 4), 5), and 6).

Beamforming design is an important technique for enhancing the performance of integrated sensing and communication (ISAC) systems. However, related research based on the hybrid analog-digital (HAD) architecture is still limited. In this paper, we investigate the partially-connected hybrid beamforming design for multi-user ISAC systems. Instead of the commonly used beampattern related metric, the Cramér-Rao bound (CRB) is employed as the sensing performance metric for direction of arrival (DOA) estimation. We aim to minimize the CRB while satisfying the signal-to-interference-plus-noise ratio (SINR) constraints for individual communication users by jointly optimizing the digital and analog beamformers. Subsequently, we propose an alternating optimization based framework, which is significantly different from the conventional methods based on the approximation of the optimal fully-digital beamformer with a hybrid one. We also consider an alternative formulation of optimizing the SINR of radar echo signals. Based on optimal receive beamformer design, we transform the SINR based joint transmitter and receiver optimization problem to a series of problems sharing a similar form with the CRB based transmitter optimization problem, which can be efficiently solved via the proposed algorithm. Simulation results show that the proposed designs provide significant performance gains in DOA estimation over the existing beampattern approximation based design.

This paper studies an unmanned aerial vehicle (UAV)-enabled wireless sensor network, in which one UAV flies in the sky to collect the data transmitted from a set of ground nodes (GNs) via distributed beamforming. We consider two scenarios with delay-tolerant and delay-sensitive applications, in which the GNs send the common/shared messages to the UAV via adaptive- and fixed-rate transmissions, respectively. For the two scenarios, we aim to maximize the average data-rate throughput and minimize the transmission outage probability, respectively, by jointly optimizing the UAV’s trajectory design and the GNs’ transmit power allocation over time, subject to the UAV’s flight speed constraints and the GNs’ individual average power constraints. However, the two formulated problems are both non-convex and thus generally difficult to be optimally solved. To tackle this issue, we first consider the relaxed problems in the ideal case with the UAV’s flight speed constraints ignored, for which the well-structured optimal solutions are obtained to reveal the fundamental performance upper bounds. It is shown that for the two approximate problems, the optimal trajectory solutions have the same multi-location-hovering structure, but with different optimal power allocation strategies. Next, for the general problems with the UAV’s flight speed constraints considered, we propose efficient algorithms to obtain high-quality solutions by using the techniques from convex optimization and approximation. Finally, numerical results show that our proposed designs significantly outperform other benchmark schemes, in terms of the achieved data-rate throughput and outage probability under the two scenarios. It is also observed that when the mission period becomes sufficiently long, our proposed designs approach the performance upper bounds when the UAV’s flight speed constraints are ignored.

This paper studies a mobile edge computing (MEC) network to support emerging applications for Internet-of-things, where multiple access points, each attached with an MEC server, need to collect data from multiple sensors, process them, and then send computation results to the paired actuators for control. Specifically, we consider a three-phase operation protocol for data uploading, edge computing, and result downloading, where the frequency-division multiple access is implemented to accommodate communications of multiple sensors/actuators. Under this setup, we minimize the end-to-end (E2E) latency of the sensing-communication-computation-actuation loop by properly designing the user association and resource allocation policy, subject to the communication and computation resource constraints. The formulated problem, however, is a mixed-integer non-linear program that is difficult to be solved. Despite this fact, we obtain the optimal solution via using the brute-force search for user association, and convex optimization for resource allocation under given user associations. Next, to reduce the computation complexity from the brute-force search, we propose an alternative algorithm, where the user association and resource allocation are optimized iteratively in an alternating manner, via concave-convex procedure and convex optimization, respectively. Finally, numerical results show that the proposed designs significantly reduce the E2E latency, compared with conventional separate designs.

Over-the-air computation (AirComp) has emerged as a promising technique in future intelligent wireless networks, which enables swift functional computation among distributed wireless devices (WDs) by exploiting the superposition property of wireless channels. This paper studies a newhierarchicalAirComp network over a large area, in which a set of intermediate relays are exploited to facilitate the massive data aggregation from a large number of WDs. Under this setup, we present a two-phase amplify-and-forward (AF) relaying protocol. In the first phase, the WDs simultaneously send their data to the relays, while in the second phase, the relays amplify the respectively received signals and concurrently forward them to the fusion center (FC) for aggregation. Our objective is to minimize the computational mean squared error (MSE) at the FC, by jointly optimizing the transmit coefficients of the WDs, the AF coefficients of the relays, and the de-noising factor of the FC, subject to their individual transmit power constraints. First, we consider the centralized design with global channel state information (CSI), in which the inter-relay signals can be exploited beneficially for data aggregation. In this case, we develop an alternating-optimization-based algorithm to obtain a high-quality solution to the computational MSE minimization problem. The obtained solution shows that the phase of the transmit coefficient at each WD is opposite to that of the WD-relay-FC channel to ensure the signal phase alignment at the FC, and the transmit power of each WD/relay follows a regularized composite-channel-inversion structure to strike a balance between minimizing the signal-magnitude-misalignment-induced error and the noise-induced error. Next, to reduce the signaling overhead caused by the centralized design, we consider an alternative decentralized design with partial CSI, in which the relays and the FC make their own decisions by only requiring the channel power gain information across different relays. In this case, the relays and FC need to treat the inter-relay signals as harmful interference or noise. Accordingly, we optimize the transmit coefficients of the WDs associated with each relay, and the relay AF coefficients (together with the FC de-noising factor) in an iterative manner, which can be implemented efficiently in a decentralized way. Finally, numerical results show the fast convergence of the proposed centralized and decentralized designs. It is also shown that both designs achieve significant MSE performance gains over benchmark schemes without the joint optimization.

This paper studies the transmit beamforming in a downlink integrated sensing and communication (ISAC) system, where a base station (BS) equipped with a uniform linear array (ULA) sends combined information-bearing and dedicated radar signals to simultaneously perform downlink multiuser communication and radar target sensing. Under this setup, we minimize the radar sensing beampattern matching errors, subject to the communication users' minimum signal-to-interference-plus-noise ratio (SINR) requirements and the BS's transmit power constraints. In particular, we consider two types of communication receivers, namely Type-I and Type-II receivers, which do not have and do have the capability of cancelling the interference from the a-priori known dedicated radar signals, respectively. Under both Type-I and Type-II receivers, the nonconvex beampattern matching problems are globally optimally solved via applying the semidefinite relaxation (SDR) technique. It is shown that at the optimality, dedicated radar signals are not required with Type-I receivers under some specific conditions, while dedicated radar signals are always needed to enhance the performance with Type-II receivers. Numerical results show that by exploiting the capability of canceling the interference caused by the radar signals, the case with Type-II receivers results in better sensing performance in terms of beampattern matching error than that with Type-I receivers and other conventional designs.

Over-the-air federated edge learning (Air-FEEL) is a communication-efficient solution for privacy-preserving distributed learning over wireless networks. Air-FEEL allows "one-shot" over-the-air aggregation of gradient/model-updates by exploiting the waveform superposition property of wireless channels, and thus promises an extremely low aggregation latency that is independent of the network size. However, such communication efficiency may come at a cost of learning performance degradation due to the aggregation error caused by the non-uniform channel fading over devices and noise perturbation. Prior work adopted channel inversion power control (or its variants) to reduce the aggregation error by aligning the channel gains, which, however, could be highly suboptimal in deep fading scenarios due to the noise amplification. To overcome this issue, we investigate the power control optimization for enhancing the learning performance of Air-FEEL. Towards this end, we first analyze the convergence behavior of the Air-FEEL by deriving the optimality gap of the loss-function under any given power control policy. Then we optimize the power control to minimize the optimality gap for accelerating convergence, subject to a set of average and maximum power constraints at edge devices. The problem is generally non-convex and challenging to solve due to the coupling of power control variables over different devices and iterations. To tackle this challenge, we develop an efficient algorithm by jointly exploiting the successive convex approximation (SCA) and trust region methods. Numerical results show that the optimized power control policy achieves significantly faster convergence than the benchmark policies such as channel inversion and uniform power transmission.

Different from public 4G/5G networks that are dominated by downlink (DL) traffic, emerging 5G non-public networks (NPNs) need to support significant uplink (UL) traffic to enable emerging applications such as industrial Internet of things (IIoT). The UL-DL spectrum sharing is becoming a viable solution to enhance the UL throughput of NPNs, which allows NPNs to perform the UL transmission over the time-frequency resources configured for DL transmission in coexisting public networks. To deal with the severe interference from the DL public base station (BS) transmitter to the coexisting UL non-public BS receiver, we propose an adaptive asymmetric successive interference cancellation (SIC) approach, in which the non-public BS is enabled to have the capability of decoding the DL signals transmitted from the public BS and cancelling them for interference mitigation. In particular, this paper studies a basic UL-DL spectrum sharing scenario when a UL non-public BS and a DL public BS coexist in the same area, each communicating with multiple users via orthogonal frequency-division multiple access (OFDMA). Under this setup, we aim to maximize the common UL throughput of all non-public users, under the condition that the DL throughput of each public user is above a certain threshold. The decision variables include the subcarrier allocation and user scheduling for both non-public and public BSs, the receiver mode of the non-public BS over subcarriers, as well as the rate and power control. Numerical results show that the proposed design significantly improves the common UL throughput as compared to benchmark schemes without such consideration.

Wireless communication is an essential technology to unlock the full potential of unmanned aerial vehicles (UAVs) in numerous applications and has thus received unprecedented attention recently. Although technologies such as direct link, WiFi, and satellite communications are still useful in some remote scenarios where cellular services are unavailable, it is believed that exploiting the thriving 5G and beyond cellular networks to support UAV communications is the most promising and cost-effective approach, especially when the number of UAVs grows dramatically. On the one hand, to guarantee safe and efficient flight operations of multiple UAVs, it is of paramount importance to provide secure and ultra-reliable communication links between the UAVs and their ground pilots or control stations for conveying command and control signals, especially in beyond-visual-line-of-sight (BVLOS) scenarios. On the other hand, because of advances in communication equipment miniaturization as well as UAV manufacturing, mounting compact and lightweight base stations (BSs) or relays on UAVs becomes increasingly feasible. This has led to two promising research paradigms for UAV communications, namely, UAV-assisted cellular communications and cellular-connected UAVs, where UAVs are integrated into cellular networks as aerial communication platforms and aerial users, respectively. As such, integrating UAVs into cellular networks is believed to be a win-win technology for both UAV-related industries and cellular network operators, which not only creates plenty of new business opportunities but also benefits the communication performance of 3-D wireless networks. In addition, UAV related sensing and computing are also helpful for achieving efficient and reliable communication (e.g., in avoiding coverage holes) as well as smart UAV coordination, positioning, and trajectory design. However, 5G and beyond wireless networks with UAVs significantly differs from traditional communication systems, because of the high altitude and high maneuverability of UAVs, the unique UAV-ground channels, the diversified quality of service (QoS) requirements for downlink command and control (C&C) and uplink mission-related data transmission, the stringent constraints imposed by the size, weight, and power (SWAP) limitations of UAVs, as well as the new design degrees of freedom enabled by joint UAV mobility control and communication resource allocation.

Due to the advancements in cellular technologies and the dense deployment of cellular infrastructure, integrating unmanned aerial vehicles (UAVs) into the fifth-generation (5G) and beyond cellular networks is a promising solution to achieve safe UAV operation as well as enabling diversified applications with mission-specific payload data delivery. In particular, 5G networks need to support three typical usage scenarios, namely, enhanced mobile broadband (eMBB), ultra-reliable low-latency communications (URLLC), and massive machine-type communications (mMTC). On the one hand, UAVs can be leveraged as cost-effective aerial platforms to provide ground users with enhanced communication services by exploiting their high cruising altitude and controllable maneuverability in three-dimensional (3D) space. On the other hand, providing such communication services simultaneously for both UAV and ground users poses new challenges due to the need for ubiquitous 3D signal coverage as well as the strong air-ground network interference. Besides the requirement of high-performance wireless communications, the ability to support effective and efficient sensing as well as network intelligence is also essential for 5G-and-beyond 3D heterogeneous wireless networks with coexisting aerial and ground users. In this paper, we provide a comprehensive overview of the latest research efforts on integrating UAVs into cellular networks, with an emphasis on how to exploit advanced techniques (e.g., intelligent reflecting surface, short packet transmission, energy harvesting, joint communication and radar sensing, and edge intelligence) to meet the diversified service requirements of next-generation wireless systems. Moreover, we highlight important directions for further investigation in future work.

Wireless communication is an essential technology to unlock the full potential of unmanned aerial vehicles (UAVs) in numerous applications and has thus received unprecedented attention recently. Although technologies such as direct link, WiFi, and satellite communications are still useful in some remote scenarios where cellular services are unavailable, it is believed that exploiting the thriving 5G and beyond cellular networks to support UAV communications is the most promising and cost-effective approach, especially when the number of UAVs grows dramatically. On the one hand, to guarantee safe and efficient flight operations of multiple UAVs, it is of paramount importance to provide secure and ultra-reliable communication links between the UAVs and their ground pilots or control stations for conveying command and control signals, especially in beyond-visual-line-of-sight (BVLOS) scenarios. On the other hand, because of advances in communication equipment miniaturization as well as UAV manufacturing, mounting compact and lightweight base stations (BSs) or relays on UAVs becomes increasingly feasible. This has led to two promising research paradigms for UAV communications, namely, UAV-assisted cellular communications and cellular-connected UAVs, where UAVs are integrated into cellular networks as aerial communication platforms and aerial users, respectively. As such, integrating UAVs into cellular networks is believed to be a win-win technology for both UAV-related industries and cellular network operators, which not only creates plenty of new business opportunities but also benefits the communication performance of 3-D wireless networks. In addition, UAV related sensing and computing are also helpful for achieving efficient and reliable communication (e.g., in avoiding coverage holes) as well as smart UAV coordination, positioning, and trajectory design. However, 5G and beyond wireless networks with UAVs significantly differs from traditional communication systems, because of the high altitude and high maneuverability of UAVs, the unique UAV-ground channels, the diversified quality of service (QoS) requirements for downlink command and control (C&C) and uplink mission-related data transmission, the stringent constraints imposed by the size, weight, and power (SWAP) limitations of UAVs, as well as the new design degrees of freedom enabled by joint UAV mobility control and communication resource allocation.

Over-the-air computation (AirComp) has been recognized as a promising technique in Internet-of-Things (IoT) networks for fast data aggregation from a large number of wireless devices. However, the computation accuracy of AirComp highly depends on the devices with the worst channels condition, which degrades severely when the number of devices becomes large. To address this issue, we exploit the massive multiple-input multiple-output (MIMO) with hybrid beamforming, in order to enhance the computational accuracy of AirComp in a cost-effective manner. In particular, we consider the scenario with a large number of multi-antenna devices simultaneously sending data to an access point (AP) equipped with massive antennas for functional computation over the air. Under this setup, we jointly optimize the transmit digital beamforming at the wireless devices and the receive hybrid beamforming at the AP, with the objective of minimizing the computational mean-squared error (MSE) subject to the individual transmit power constraints at the wireless devices. To solve the non-convex hybrid beamforming design optimization problem, we propose an alternating-optimization-based approach, in which the transmit digital beamforming and the receive analog and digital beamforming are optimized in an alternating manner. In particular, we propose two computationally efficient algorithms to handle the challenging receive analog beamforming problem, by exploiting the techniques of successive convex approximation (SCA) and coordinate descent (CD), respectively. It is shown that for the special case with a fully-digital receiver at the AP, the achieved MSE of the massive MIMO AirComp system is inversely proportional to the number of receive antennas. Furthermore, numerical results show that the proposed hybrid beamforming design substantially enhances the computation MSE performance as compared to other benchmark schemes, while the SCA-based algorithm performs closely to the performance upper bound achieved by the fully-digital beamforming.

Recently, over-the-air computation (AirComp) has emerged as an efficient solution for access points (APs) to aggregate distributed data from many edge devices (e.g., sensors) by exploiting the waveform superposition property of multiple access (uplink) channels. While prior work focuses on the single-cell setting where inter-cell interference is absent, this article considers a multi-cell AirComp network limited by such interference and investigates the optimal policies for controlling devices' transmit power to minimize the mean squared errors (MSEs) in aggregated signals received at different APs. First, we consider the scenario of centralized multi-cell power control. To quantify the fundamental AirComp performance tradeoff among different cells, we characterize the Pareto boundary of the multi-cell MSE region by minimizing the sum MSE subject to a set of constraints on individual MSEs. Though the sum-MSE minimization problem is non-convex and its direct solution intractable, we show that this problem can be optimally solved via equivalently solving a sequence of convex second-order cone program (SOCP) feasibility problems together with a bisection search. This results in an efficient algorithm for computing the optimal centralized multi-cell power control, which optimally balances the interference-and-noise-induced errors and the signal misalignment errors unique for AirComp. Next, we consider the other scenario of distributed power control, e.g., when there lacks a centralized controller. In this scenario, we introduce a set of interference temperature (IT) constraints, each of which constrains the maximum total inter-cell interference power between a specific pair of cells. Accordingly, each AP only needs to individually control the power of its associated devices for single-cell MSE minimization, but subject to a set of IT constraints on their interference to neighboring cells. By optimizing the IT levels, the distributed power control is shown to provide an alternative method for characterizing the same multi-cell MSE Pareto boundary as the centralized counterpart. Building on this result, we further propose an efficient algorithm for different APs to cooperate in iteratively updating the IT levels to achieve a Pareto-optimal MSE tuple, by pairwise information exchange. Last, simulation results demonstrate that cooperative power control using the proposed algorithms can substantially reduce the sum MSE of AirComp networks compared with the conventional single-cell approaches.

This paper investigates an intelligent reflecting surface (IRS)-aided multi-cell multiple-input single-output (MISO) network with a set of multi-antenna base stations (BSs) each communicating with multiple single-antenna users, in which an IRS is dedicatedly deployed for assisting the wireless transmission and suppressing the inter-cell interference. Under this setup, we jointly optimize the coordinated transmit beamforming vectors at the BSs and the reflective beamforming vector (with both reflecting phases and amplitudes) at the IRS, for the purpose of maximizing the minimum weighted signal-to-interference-plus-noise ratio (SINR) at the users, subject to the individual maximum transmit power constraints at the BSs and the reflection constraints at the IRS. To solve the non-convex min-weighted-SINR maximization problem, we first present an exact-alternating-optimization approach to optimize the transmit and reflective beamforming vectors in an alternating manner, in which the transmit and reflective beamforming optimization subproblems are solved exactly in each iteration by using the techniques of second-order-cone program (SOCP) and semi-definite relaxation (SDR), respectively. However, the exact-alternating-optimization approach has high computational complexity, and may lead to compromised performance due to the uncertainty of randomization in SDR. To avoid these drawbacks, we further propose an inexact-alternating-optimization approach, in which the transmit and reflective beamforming optimization subproblems are solved inexactly in each iteration based on the principle of successive convex approximation (SCA). In addition, to further reduce the computational complexity, we propose a low-complexity inexact-alternating-optimization design, in which the reflective beamforming optimization subproblem is solved more inexactly. Via numerical results, it is shown that the proposed three designs achieve significantly increased min-weighted-SINR values, as compared with benchmark schemes without the IRS or with random reflective beamforming. It is also shown that the inexact-alternating-optimization design outperforms the exact-alternating-optimization one in terms of both the achieved min-weighted-SINR value and the computational complexity, while the low-complexity inexact-alternating-optimization design has much lower computational complexity with slightly compromised performance. Furthermore, we show that our proposed design can be applied to the scenario with unit-amplitude reflection constraints, with a negligible performance loss.

In this paper, we study an unmanned aerial vehicle (UAV)-enabled multiuser wireless power transfer (WPT) network, where a UAV is responsible for providing wireless energy for a set of ground devices (GDs) deployed in an area. We focus on the design of UAV trajectory subject to the maximum flight speed limit, in order to maximize the minimum harvested energy among GDs over a particular charging duration. Different from prior works that considered simplified linear energy harvesting models, this paper for the first time takes into account the realistic nonlinear energy harvesting model for the UAV trajectory design. However, the formulated trajectory design problem is highly non-convex and has infinite number of variables, thus making it be challenging to be solved optimally. To tackle this difficulty, we adopt the following three-step approach to obtain an efficient solution. First, we rigorously characterize that the optimal trajectory follows a new successive-hover-and-fly (SHF) structure, where the UAV hovers at a certain set of points for efficiently transferring energy, and flies among these hovering points with the maximum speed following certain arcs (not necessarily straight lines). Next, based on this SHF structure, we transform the original problem to a new one for finding a set of turning point variables during the maximum-speed flight, at which the UAV changes the flight direction without hovering. Finally, we use the techniques of convex approximation to solve the transformed problem. According to the convexity of the nonlinear energy harvesting model, we iteratively solve a series of convex optimization problems to update the UAV trajectory towards a high-quality solution. Numerical results show the convergence of the proposed approach, and validate its performance gain over conventional designs.

This paper studies an intelligent reflecting surface (IRS)-assisted multiuser multiple-input single-output (MISO) simultaneous wireless information and power transfer (SWIPT) system. In this system, a multi-antenna access point (AP) uses transmit beamforming to send both information and energy signals to a set of receivers each for information decoding (ID) or energy harvesting (EH), and a dedicatedly deployed IRS properly controls its reflecting phase shifts to form passive reflection beams for facilitating both ID and EH at receivers. Under this setup, we jointly optimize the (active) information and energy transmit beamforming at the AP together with the (passive) reflective beamforming at the IRS, to maximize the minimum power received at all EH receivers, subject to individual signal-to-interference-plus-noise ratio (SINR) constraints at ID receivers, and the maximum transmit power constraint at the AP. Although the formulated SINR-constrained min-energy maximization problem is highly non-convex, we present an efficient algorithm to obtain a high-quality solution by using the techniques of alternating optimization and semi-definite relaxation (SDR). Numerical results show that the proposed IRS-assisted SWIPT system with both information and energy signals achieves significant performance gains over benchmark schemes without IRS deployed and/or without dedicated energy signals used.

This paper investigates an intelligent reflecting surface (IRS)-aided multi-cell multiple-input single-output (MISO) system consisting of several multi-antenna base stations (BSs) each communicating with a single-antenna user, in which an IRS is dedicatedly deployed for assisting the wireless transmission and suppressing the inter-cell interference. Under this setup, we jointly optimize the coordinated transmit beamforming at the BSs and the reflective beamforming at the IRS, for the purpose of maximizing the minimum weighted received signal-to-interference-plus-noise ratio (SINR) at users, subject to the individual maximum transmit power constraints at the BSs and the reflection constraints at the IRS. To solve the difficult non-convex minimum SINR maximization problem, we propose efficient algorithms based on alternating optimization, in which the transmit and reflective beamforming vectors are optimized in an alternating manner. In particular, we use the second-order-cone programming (SOCP) for optimizing the coordinated transmit beamforming, and develop two efficient designs for updating the reflective beamforming based on the techniques of semi-definite relaxation (SDR) and successive convex approximation (SCA), respectively. Numerical results show that the use of IRS leads to significantly higher SINR values than benchmark schemes with-out IRS or without proper reflective beamforming optimization; while the developed SCA-based solution outperforms the SDR-based one with lower implementation complexity.

This paper considers an unmanned aerial vehicle (UAV)-enabled uplink non-orthogonal multiple-access (NOMA) system, where multiple users on the ground send independent messages to a UAV via NOMA transmission. We aim to design the UAV's dynamic maneuver in real time for maximizing the sum-rate throughput of all ground users over a finite time horizon. Different from conventional offline designs considering static user locations under deterministic or stochastic channel models, we consider a more challenging scenario with mobile users and segmented channel models, where the UAV only causally knows the users' (moving) locations and channel state information (CSI). Under this setup, we first propose a new approach for UAV dynamic maneuver design based on reinforcement learning (RL) via Q-learning. Next, in order to further speed up the convergence and increase the throughput, we present an enhanced RL-based approach by additionally exploiting expert knowledge of well-established wireless channel models to initialize the Q-table values. Numerical results show that our proposed RL-based and enhanced RL-based approaches significantly improve the sum-rate throughput, and the enhanced RL-based approach considerably speeds up the learning process owing to the proposed Q-table initialization.

This article considers a wireless powered multiuser mobile edge computing (MEC) system, in which a multi-antenna hybrid access point (AP) wirelessly charges multiple users, and each user relies on the harvested energy to execute computation tasks. We jointly optimize the energy beamforming and remote task execution at the AP, as well as the local computing and task offloading, aiming to minimize the total system energy consumption over a finite time horizon, subject to causality constraints for both energy harvesting and task arrival at the users. In particular, we consider a practical scenario with casual task state information (TSI) and channel state information (CSI), i.e., only the current and previous TSI and CSI are available, but the future TSI and CSI can only be predicted subject to certain errors. To solve this real-time resource allocation problem, we propose an offline-optimization inspired online design approach. First, we consider the offline optimization case by assuming that the TSI and CSI are perfectly known a-priori. In this case, the energy minimization problem corresponds to a convex problem, for which the semi-closed-form optimal solution is obtained via the Lagrange duality method. Next, inspired by the optimal offline solution, we propose a sliding-window based online resource allocation design in practical cases by integrating with the sequential optimization. Finally, numerical results show that the proposed joint wireless powered MEC designs significantly improve the system's energy efficiency, as compared with the benchmark schemes that consider a sliding window of size one or without such joint optimization.

This paper studies an unmanned aerial vehicle (UAV)-enabled two-user interference channel for wireless powered communication networks (WPCNs). In this system, two UAVs wirelessly charge two low-power Internet-of-things (IoT)-devices on the ground and collect information from them. We consider two scenarios when both UAVs cooperate in energy transmission and/or information reception via interference coordination and coordinated multi-point (CoMP), respectively. For both scenarios, the UAVs' trajectories are designed to not only enhance the wireless power transfer (WPT) efficiency in the downlink, but also mitigate the co-channel interference for wireless information transfer (WIT) in the uplink. In particular, the objective is to maximize the uplink common (minimum) throughput of the two IoT-devices over a finite UAV mission period, by jointly optimizing the trajectories of both UAVs and the downlink/uplink wireless resource allocation, subject to the maximum flying speed and collision avoidance constraints for UAVs, as well as the individual energy neutrality constraints at IoT-devices. Under both scenarios with interference coordination and CoMP, we first obtain the optimal solutions to the two common-rate maximization problems for the special case with sufficiently long UAV mission duration. Next, we obtain high-quality solutions for the practical case with finite UAV mission duration by using the alternating optimization and successive convex approximation (SCA). Numerical results show that the proposed designs significantly outperform benchmark schemes, and the utilization of CoMP achieves much higher uplink throughput than interference coordination.

Over-the-air computation (AirComp) of a function (e.g., averaging) has recently emerged as an efficient multiple-access scheme for fast aggregation of distributed data at mobile devices (e.g., sensors) at a fusion center (FC) over wireless channels. To realize reliable AirComp in practice, it is crucial to adaptively control the devices' transmit power for coping with channel distortion to achieve the desired magnitude alignment of simultaneous signals. In this paper, we solve the power control problem. Our objective is to minimize the computation error by jointly optimizing the transmit power at devices and a signal scaling factor (called denoising factor) at the FC, subject to individual average power constraints at devices. The problem is generally non-convex due to the coupling of the transmit powers at devices and denoising factor at the FC. To tackle the challenge, we first consider the special case with static channels, for which we derive the optimal solution in closed form. The derived power control exhibits a threshold-based structure: if the product of the channel quality and power budget for each device, called quality indicator, exceeds an optimized threshold, this device applies channel-inversion power control; otherwise, it performs full power transmission. We proceed to consider the general case with time-varying channels. To solve the more challenging non-convex power control problem, we use the Lagrange-duality method via exploiting its “time-sharing” property. The derived power control exhibits a regularized channel inversion structure, where the regularization balances the tradeoff between the signal-magnitude alignment and noise suppression. Moreover, for the special case with only one device being power limited, we show that the power control for the power-limited device has an interesting channel-inversion water-filling structure, while those for other devices (with sufficiently large power budgets) reduce to channel-inversion power control. Numerical results show that the derived power control significantly reduces the computation error as compared with the conventional designs.

This paper studies an unmanned aerial vehicle (UAV)-enabled multiple access channel (MAC), in which multiple ground users transmit individual messages to a mobile UAV in the sky. We consider a linear topology scenario, where these users locate in a straight line and the UAV flies at a fixed altitude above the line connecting them. Under this setup, we jointly optimize the one-dimensional (1D) UAV trajectory and wireless resource allocation to reveal the fundamental rate limits of the UAV-enabled MAC, under the users' individual maximum power constraints and the UAV's maximum flight speed constraints. First, we consider the capacity-achieving non-orthogonal multiple access (NOMA) transmission with successive interference cancellation (SIC) at the UAV receiver. In this case, we characterize the capacity region by maximizing the average sum-rate of all users subject to a set of rate profile constraints. To optimally solve this highly non-convex problem with infinitely many UAV location variables over time, we show that any speed-constrained UAV trajectory is equivalent to the combination of a maximum-speed flying trajectory and a speed-free trajectory, and accordingly transform the original speed-constrained trajectory optimization problem into a speed-free problem that is optimally solvable via the Lagrange dual decomposition. It is rigorously proved that the optimal 1D trajectory solution follows the successive hover-and-fly (SHF) structure, i.e., the UAV successively hovers above a number of optimized locations, and flies unidirectionally among them at the maximum speed. Next, we consider two orthogonal multiple access (OMA) transmission schemes, i.e., frequency-division multiple access (FDMA) and time-division multiple access (TDMA). We maximize the achievable rate regions in the two cases by jointly optimizing the 1D trajectory design and wireless resource (frequency/time) allocation. It is shown that the optimal trajectory solutions still follow the SHF structure but with different hovering locations for each scheme. Finally, numerical results show that the proposed optimal trajectory designs achieve considerable rate gains over other benchmark schemes, and the capacity region achieved by NOMA significantly outperforms the rate regions by FDMA and TDMA.

This paper studies a single-user wireless powered mobile edge computing (MEC) system, in which one multi-antenna energy transmitter (ET) employs energy beamforming for wireless power transfer (WPT) towards the user, and the user relies on the harvested energy to locally execute a portion of tasks and offload the other portion to an access point (AP) integrated with an MEC server for remote execution. Different from prior works considering static wireless channels and computation tasks at the user, this paper considers both energy and task causality constraints due to the channel fluctuations and dynamic task arrivals over time. Towards an energy-efficient joint-WPT-MEC design, we minimize the total transmission energy consumption at the ET over a particular finite horizon while ensuring the user's successful task execution, by jointly optimizing the transmission energy allocation at the ET for WPT and the task allocation at the user for local computing and offloading over a particular finite horizon. First, in order to characterize the fundamental performance limit, we consider the offline optimization by assuming that the perfect knowledge of channel state information (CSI) and task state information (TSI) (i.e., task arrival timing and amounts) is known a-priori. In this case, we obtain the well-structured optimal solution to the energy minimization problem by using convex optimization techniques. The optimal solution shows that in the scenario with static channels, the ET should allocate the transmission energy uniformly over time, and the user should employ staircase task allocation for both local computing and offloading, with the number of executed task input-bits monotonically increasing over time. It also shows that in the scenario with time-varying channels, the ET should transmit energy sporadically at slots with causally dominating channel power gains, and the user should apply the staircase task allocation for local computing and staircase water-filling task allocation for offloading with monotonically increasing computation levels over time. Next, inspired by the structured offline solutions obtained above, we develop heuristic online designs for the joint energy and task allocation when the knowledge of CSI/TSI is only causally known. Finally, numerical results show that the proposed joint energy and task allocation designs achieve significantly smaller energy consumption than benchmark schemes with only local computing or full offloading at the user, and the proposed heuristic online designs perform close to the optimal offline solutions and considerably outperform the conventional myopic designs.

This paper studies a secrecy unmanned aerial vehicle (UAV) communication system with coordinated multi-point (CoMP) reception, in which one UAV sends confidential messages to a set of cooperative ground receivers (GRs), in the presence of several suspicious eavesdroppers. In particular, we consider two types of eavesdroppers that are non-colluding and colluding, respectively. Under this setup, we exploit the UAV's maneuver in three dimensional (3D) space together with transmit power adaptation for optimizing the secrecy communication performance. First, we consider the quasi-stationary UAV scenario, in which the UAV is placed at a fixed but optimizable location during the communication period. In this scenario, we jointly optimize the UAV's 3D placement and transmit power control to maximize the secrecy rate. Under both non-colluding and colluding eavesdroppers, we obtain the optimal solutions to the joint 3D placement and transmit power control problems in well structures. Next, we consider the mobile UAV scenario, in which the UAV has a mission to fly from an initial location to a final location during the communication period. In this scenario, we jointly optimize the UAV's 3D trajectory and transmit power allocation to maximize the average secrecy rate during the whole communication period. To deal with the difficult joint 3D trajectory and transmit power allocation problems, we present alternating-optimization-based approaches to obtain high-quality solutions. Finally, we provide numerical results to validate the performance of our proposed designs. It is shown that due to the consideration of CoMP reception, our proposed design with 3D maneuver significantly outperforms the conventional design with two dimensional (2D) (horizontal) maneuver only, by exploiting the additional degrees of freedom in altitudes. It is also shown that the non-colluding and colluding eavesdroppers lead to distinct 3D UAV maneuver behaviors, e.g., under colluding eavesdroppers, the UAV should fly farther apart from them (than that under the non-colluding ones) for avoiding their collaborative interception.

Over-the-air computation (AirComp) of a function (e.g., averaging) has recently emerged as an efficient multi-access scheme for fast aggregation of distributed data at devices (e.g., sensors) to fusion centers (FCs) over wireless channels. To realize reliable AirComp in practice, it is crucial to control the devices' transmit power for coping with channel distortion to achieve the desired magnitude alignment of simultaneous signals. % to strike a balance between enforcing signal-magnitude alignment for overcoming heterogenous channel fading and suppressing noise. In this paper, we study the power control problem for AirComp over fading channels. Our objective is to minimize the computation error by jointly optimizing the transmit power at devices and a signal scaling factor at the FC, called denoising factor, subject to the individual average power constraints at devices. The problem is generally non-convex due to the coupling of transmit power over devices and denoising factor. To optimally solve this problem, we apply the Lagrange duality method via exploiting its ''time-sharing'' property. The derived optimal power control exhibits a regularized channel inversion structure where the regularization has the function of balancing the tradeoff between the signal-magnitude alignment and noise suppression. Moreover, for the special case that only one device is power-limited, we show that the optimal power control for the power-limited device has an interesting channel-inversion water- filling structure, while those for other devices (with sufficiently large power budgets) reduce to channel-inversion power control over all fading states. Numerical results show that the optimal power control remarkably reduces the computation error as compared with other heuristic designs.

This paper studies a secrecy unmanned aerial vehicle (UAV) communication system with coordinated multi- point (CoMP) reception, in which one UAV sends confidential messages to a set of distributed ground nodes (GNs) that can cooperate in signal detection, in the presence of several colluding suspicious eavesdroppers. Different from prior works considering the two-dimensional (2D) horizontal trajectory design in the non-CoMP scenario, this paper additionally exploits the UAV's vertical trajectory (or altitude) control for further improving the secrecy communication performance with CoMP. In particular, we jointly optimize the three dimensional (3D) trajectory and transmit power allocation of the UAV to maximize the average secrecy rate at GNs over a particular flight period, subject to the UAV's maximum flight speed and maximum transmit power constraints. To solve the non-convex optimization problem, we propose an alternating-optimization-based approach, which optimizes the transmit power allocation and trajectory design in an alternating manner, by convex optimization and successive convex approximation (SCA), respectively. Numerical results show that in the scenario with CoMP reception, our proposed 3D trajectory optimization significantly outperforms the conventional 2D horizontal trajectory design, by exploiting the additional degree of freedom in vertical trajectory.

This paper considers a wireless powered multiuser mobile edge computing (MEC) system, where a multi-antenna access point (AP) employs the radio-frequency (RF) signal based wireless power transfer (WPT) to charge a number of distributed users, and each user utilizes the harvested energy to execute computation tasks via local computing and task offloading. We consider the frequency division multiple access (FDMA) protocol to support simultaneous task offloading from multiple users to the AP. Different from previous works that considered one-shot optimization with static task models, we study the joint computation and wireless resource allocation optimization with dynamic task arrivals over a finite time horizon consisting of multiple slots. Under this setup, our objective is to minimize the system energy consumption including the AP's transmission energy and the MEC server's computing energy over the whole horizon, by jointly optimizing the transmit energy beamforming at the AP, and the local computing and task offloading strategies at the users over different time slots. To characterize the fundamental performance limit of such systems, we focus on the offline optimization by assuming the task and channel information are known a-priori at the AP. In this case, the energy minimization problem corresponds to a convex optimization problem. Leveraging the Lagrange duality method, we obtain the optimal solution to this problem in a well structure. It is shown that in order to maximize the system energy efficiency, the optimal number of task input-bits at each user and the AP are monotonically increasing over time, and the offloading strategies at different users depend on both the wireless channel conditions and the task load at the AP. Numerical results demonstrate the benefit of the proposed joint-WPT-MEC design over alternative benchmark schemes without such joint design.

This paper proposes a novel user cooperation approach in both computation and communication for mobile edge computing (MEC) systems to improve the energy efficiency for latency-constrained computation. We consider a basic three-node MEC system consisting of a user node, a helper node, and an access point (AP) node attached with an MEC server, in which the user has latency-constrained and computation-intensive tasks to be executed. We consider two different computation offloading models, namely, the partial and binary offloading, respectively. For partial offloading, the tasks at the user are divided into three parts that are executed at the user, helper, and AP, respectively; while for binary offloading, the tasks are executed as a whole only at one of three nodes. Under this setup, we focus on a particular time block and develop an efficient four-slot transmission protocol to enable the joint computation and communication cooperation. Besides the local task computing over the whole block, the user can offload some computation tasks to the helper in the first slot, and the helper cooperatively computes these tasks in the remaining time; while in the second and third slots, the helper works as a cooperative relay to help the user offload some other tasks to the AP for remote execution in the fourth slot. For both cases with partial and binary offloading, we jointly optimize the computation and communication resources allocation at both the user and the helper (i.e., the time and transmit power allocations for offloading, and the central process unit frequencies for computing), so as to minimize their total energy consumption while satisfying the user's computation latency constraint. Although the two problems are nonconvex in general, we develop efficient algorithms to solve them optimally. Numerical results show that the proposed joint computation and communication cooperation approach significantly improves the computation capacity and energy efficiency at the user and helper, as compared to other benchmark schemes without such a joint design.

This paper studies an unmanned aerial vehicle (UAV)-enabled wireless powered communication network (WPCN), in which a UAV is dispatched as a mobile access point (AP) to serve a set of ground users periodically. The UAV employs the radio frequency (RF) wireless power transfer (WPT) to charge the users in the downlink, and the users use the harvested RF energy to send independent information to the UAV in the uplink. Unlike the conventional WPCN with fixed APs, the UAV-enabled WPCN can exploit the mobility of the UAV via trajectory design, jointly with the wireless resource allocation optimization, to maximize the system throughput. In particular, we aim to maximize the uplink common (minimum) throughput among all ground users over a finite UAV's flight period, subject to its maximum speed constraint and the users' energy neutrality constraints. The resulted problem is nonconvex and thus difficult to be solved optimally. To tackle this challenge, we first consider an ideal case without the UAV's maximum speed constraint, and obtain the optimal solution to the relaxed problem. The optimal solution shows that the UAV should successively hover above a finite number of ground locations for downlink WPT, as well as above each of the ground users for uplink communication. Next, we consider the general problem with the UAV's maximum speed constraint. Based on the above multilocation-hovering solution, we first propose an efficient successive hover-and-fly trajectory design, jointly with the downlink and uplink wireless resource allocation, and then propose a locally optimal solution by applying the techniques of alternating optimization and successive convex programming (SCP). Numerical results show that the proposed UAV-enabled WPCN achieves significant throughput gains over the conventional WPCN with fixed-location AP.

This letter studies an unmanned aerial vehicle (UAV)enabled two-user interference channel, in which two ground users send individual messages to their respective UAVs in the sky. By considering probabilistic line-of-sight (LoS) channel models, we jointly optimize the two UAVs' three-dimensional (3D) positioning locations and the two users' power control, to maximize their sumrate throughput. Although this problem is non-convex and difficult to solve in general, we obtain the optimal solution by decoupling the positioning optimization and power control. The optimal solution shows that if the signal-to-noise-ratio (SNR) ρ is high, then the two users should take turns to transmit at the maximum power in anonoff manner and each UAV is positioned exactly above the associated user. By contrast, if ρ is low and/or the two users' distance D is large, then the two users should transmit simultaneously at the maximum power, and each UAV should be positioned away from the two users for interference mitigation.

This letter investigates a multiple-input multiple-output (MIMO) wireless power transfer system under practical nonliner energy harvesting (EH) models. We propose a new generic energy receiver (ER) architecture consisting of N receive antennas and L rectifiers, for which one power splitter is inserted after each antenna to adaptively split the received radio frequency (RF) signals among the L rectifiers for efficient nonlinear RF-to-direct current (dc) conversion. With the proposed architecture, we maximize the total harvested dc power at the ER, by jointly optimizing the transmit energy beamforming at the energy transmitter and the power splitting ratios at the ER. Numerical results show that our proposed design by exploiting the nonlinearity of EH significantly improves the harvested dc power at the ER, as compared to two conventional designs.

In this paper, we study an unmanned aerial vehicle (UAV)-enabled wireless power transfer network, where a UAV flies at a constant altitude in the sky to provide wireless energy supply for a set of ground nodes with a linear topology. Our objective is to maximize the minimum received energy among all ground nodes by optimizing the UAV's one-dimensional (1D) trajectory, subject to the maximum UAV flying speed constraint. Different from previous works that only provided heuristic and locally optimal solutions, this paper is the first to present the globally optimal 1D UAV trajectory solution to the considered min-energy maximization problem. Toward this end, we first show that for any given speed-constrained UAV trajectory, we can always construct a maximum-speed trajectory and a speed-free trajectory, such that their combination can achieve the same received energy at all these ground nodes. Next, we transform the UAV-speed-constrained trajectory design problem into an equivalent UAV-speed-free problem, which is then optimally solved via the Lagrange dual method. The optimal 1D UAV trajectory solution follows the so-called successive hover-and-fly structure, i.e., the UAV successively hovers at a finite number of hovering points each for an optimized hovering duration, and flies among these hovering points at the maximum speed. Building upon the optimal UAV trajectory structure, we further present a low-complexity UAV trajectory design by first transforming the original problem into an equivalent non-convex problem with only the UAV hovering locations and durations as optimization variables and then updating the trajectory via the successive convex approximation technique. Our analysis shows that the low-complexity design is guaranteed to converge to a suboptimal solution at a significantly lower complexity irrespective of the geographical network size. Numerical results show that the proposed low-complexity design actually achieves the same performance as the proposed optimal solution, and both of them outperform the benchmark algorithms in prior works under different scenarios.

This paper investigates a new scenario of spectrum sharing between unmanned aerial vehicle (UAV) and terrestrial wireless communication, in which a cognitive/secondary UAV transmitter communicates with a ground secondary receiver (SR), in the presence of a number of primary terrestrial communication links that operate over the same frequency band. We exploit the UAV’s mobility in three-dimensional (3D) space to improve its cognitive communication performance while controlling the co-channel interference at the primary receivers (PRs), such that the received interference power at each PR is below a prescribed threshold termed as interference temperature (IT). First, we consider the quasi-stationary UAV scenario, where the UAV is placed at a static location during each communication period of interest. In this case, we jointly optimize the UAV’s 3D placement and power control to maximize the SR’s achievable rate, subject to the UAV’s altitude and transmit power constraints, as well as a set of IT constraints at the PRs to protect their communications. Second, we consider the mobile UAV scenario, in which the UAV is dispatched to fly from an initial location to a final location within a given task period. We propose an efficient algorithm to maximize the SR’s average achievable rate over this period by jointly optimizing the UAV’s 3D trajectory and power control, subject to the additional constraints on UAV’s maximum flying speed and initial/final locations. Finally, numerical results are provided to evaluate the performance of the proposed designs for different scenarios, as compared to various benchmark schemes. It is shown that in the quasi-stationary scenario the UAV should be placed at its minimum altitude while in the mobile scenario the UAV should adjust its altitude along with horizontal trajectory, so as to maximize the SR’s achievable rate in both scenarios.

This paper studies a multiuser mobile edge computing (MEC) system in which one base station (BS) serves multiple users with intensive computation tasks. We exploit the multi-antenna non-orthogonal multiple access (NOMA) technique for multiuser computation offloading, such that different users can simultaneously offload their computation tasks to the multi-antenna BS over the same time/frequency resources, and the BS can employ successive interference cancelation (SIC) to efficiently decode all users' offloaded tasks for remote execution. In particular, we pursue energy-efficient MEC designs by considering two cases with partial and binary offloading, respectively. We aim to minimize the weighted sum-energy consumption at all users subject to their computation latency constraints, by jointly optimizing the communication and computation resource allocation as well as the BS's decoding order for SIC. For the case with partial offloading, the weighted sum-energy minimization is a convex optimization problem, for which an efficient algorithm based on the Lagrange duality method is presented to obtain the globally optimal solution. For the case with binary offloading, the weighted sum-energy minimization corresponds to a mixed Boolean convex optimization problem that is generally more difficult to be solved. We first use the branch-and-bound (BnB) method to obtain the globally optimal solution and then develop two low-complexity algorithms based on the greedy method and the convex relaxation, respectively, to find suboptimal solutions with high quality in practice. Via numerical results, it is shown that the proposed NOMA-based computation offloading design significantly improves the energy efficiency of the multiuser MEC system as compared to other benchmark schemes. It is also shown that for the case with binary offloading, the proposed greedy method performs close to the optimal BnB-based solution, and the convex relaxation-based solution achieves a suboptimal performance but with lower implementation complexity.

With the proliferation of computation-extensive and latency-critical applications in the 5G and beyond networks, mobile-edge computing (MEC) or fog computing, which provides cloud-like computation and/or storage capabilities at the network edge, is envisioned to reduce computation latency as well as to conserve energy for wireless devices (WDs). This paper studies a novel device-to-device (D2D)-enabled multi-helper MEC system, in which a local user solicits its nearby WDs serving as helpers for cooperative computation. We assume a time division multiple access (TDMA) transmission protocol, under which the local user offloads the tasks to multiple helpers and downloads the results from them over orthogonal pre-scheduled time slots. Under this setup, we minimize the computation latency by optimizing the local user's task assignment jointly with the time and rate for task offloading and results downloading, as well as the computation frequency for task execution, subject to individual energy and computation capacity constraints at the local user and the helpers. However, the formulated problem is a mixed-integer non-linear program (MINLP) that is difficult to solve. To tackle this challenge, we propose an efficient algorithm by first relaxing the original problem into a convex one, and then constructing a suboptimal task assignment solution based on the obtained optimal one. Furthermore, we consider a benchmark scheme that endows the WDs with their maximum computation capacities. To further reduce the implementation complexity, we also develop a heuristic scheme based on the greedy task assignment. Finally, the numerical results validate the effectiveness of our proposed algorithm, as compared against the heuristic scheme and other benchmark ones without either joint optimization of radio and computation resources or task assignment design.

This paper considers the secrecy transmission in a large-scale unmanned aerial vehicle (UAV)-enabled wireless network, in which a set of UAVs in the sky transmit confidential information to their respective legitimate receivers on the ground, in the presence of another set of randomly distributed suspicious ground eavesdroppers. We assume that the horizontal locations of legitimate receivers and eavesdroppers are distributed as two independent homogeneous Possion point processes (PPPs), and each of the UAVs is positioned exactly above its corresponding legitimate receiver for efficient secrecy communication. Furthermore, we consider an elevation-angle-dependent line-of-sight (LoS)/non-LoS (NLoS) path-loss model for air-to-ground (A2G) wireless channels and employ the wiretap code for secrecy transmission. Under such setups, we first characterize the secrecy communication performance (in terms of the connection probability, secrecy outage probability, and secrecy transmission capacity) in mathematically tractable forms, and accordingly optimize the system configurations (i.e., the wiretap code rates and UAV positioning altitude) to maximize the secrecy transmission capacity, subject to a maximum secrecy outage probability constraint. Next, we propose to use the secrecy guard zone technique for further secrecy protection, and analyze the correspondingly achieved secrecy communication performance. Finally, we present numerical results to validate the theoretical analysis. It is shown that the employment of secrecy guard zone significantly improves the secrecy transmission capacity of this network, and the desirable guard zone radius generally decreases monotonically as the UAVs’ and/or the eavesdroppers’ densities increase.

This paper studies unmanned aerial vehicle (UAV)-enabled wireless communication, where a rotary-wing UAV is dispatched to communicate with multiple ground nodes (GNs). We aim to minimize the total UAV energy consumption, including both propulsion energy and communication related energy, while satisfying the communication throughput requirement of each GN. To this end, we first derive a closed-form propulsion power consumption model for rotary-wing UAVs, and then formulate the energy minimization problem by jointly optimizing the UAV trajectory and communication time allocation among GNs, as well as the total mission completion time. The problem is difficult to be optimally solved, as it is non-convex and involves infinitely many variables over time. To tackle this problem, we first consider the simple fly-hover-communicate design, where the UAV successively visits a set of hovering locations and communicates with one corresponding GN while hovering at each location. For this design, we propose an efficient algorithm to optimize the hovering locations and durations, as well as the flying trajectory connecting these hovering locations, by leveraging the travelling salesman problem with neighborhood and convex optimization techniques. Next, we consider the general case, where the UAV also communicates while flying. We propose a new path discretization method to transform the original problem into a discretized equivalent with a finite number of optimization variables, for which we obtain a high-quality suboptimal solution by applying the successive convex approximation technique. The numerical results show that the proposed designs significantly outperform the benchmark schemes.

This paper studies a wireless communication system with a rotary-wing unmanned aerial vehicle (UAV) dispatched to communicate with multiple ground nodes (GNs). With limited on-board energy available at the UAV, we aim to maximize the weighted minimum of the communication throughput of the GNs, by jointly designing the UAV trajectory and communication resource allocation. The formulated problem is difficult to be directly solved, as it is non-convex and involves infinitely many variables over time. To tackle this problem, we first propose a simple fly-hover-communicate protocol, where the UAV successively visits a set of hovering locations and at each of them communicates with one corresponding GN. By leveraging the classic travelling salesman problem (TSP) and convex optimization techniques, we propose an efficient algorithm to optimize the hovering locations and durations, as well as the flying trajectory connecting these hovering locations. To further improve the performance, we consider the general scenario where the UAV also communicates while flying, and under a given UAV path, we find the optimal time allocation by solving a linear programming (LP) problem. Numerical results show the significant performance gains of the proposed designs over benchmark schemes.

This paper studies an unmanned aerial vehicle (UAV)-enabled multicast channel, in which a UAV serves as a mobile transmitter to deliver common information to a set of ground users. We aim to characterize the capacity of this channel over a finite UAV mission/communication period, subject to its maximum speed constraint and an average transmit power constraint. To achieve the capacity, the UAV should use a sufficiently long code that spans over its whole mission/communication period. Accordingly, the multicast channel capacity is achieved via maximizing the minimum achievable time-averaged rates of the users, by jointly optimizing the UAV's trajectory and transmit power allocation over time. However, this problem is non-convex and difficult to be solved optimally. To tackle this problem, we first consider a relaxed problem by ignoring the maximum UAV speed constraint, and obtain its globally optimal solution via the Lagrange dual method. The optimal solution reveals that the UAV should hover above a finite number of ground locations, with the optimal hovering duration and transmit power at each location. Next, based on such a multi-location-hovering solution, we present a successive hover-and-fly trajectory design and obtain the corresponding optimal transmit power allocation for the case with the maximum UAV speed constraint. Numerical results show that our proposed joint UAV trajectory and transmit power optimization significantly improves the achievable rate of the UAV-enabled multicast channel, and also greatly outperforms the conventional multicast channel with a fixed-location transmitter.

This paper studies a multi-user cooperative mobile- edge computing (MEC) system, in which a local mobile user can offload intensive computation tasks to multiple nearby edge devices serving as helpers for remote execution. We focus on the scenario where the local user has a number of independent tasks that can be executed in parallel but cannot be further partitioned. We consider a time division multiple access (TDMA) communication protocol, in which the local user can offload computation tasks to the helpers and download results from them over pre- scheduled time slots. Under this setup, we minimize the local user's computation latency by optimizing the task assignment jointly with the time and power allocations, subject to individual energy constraints at the local user and the helpers. However, the joint task assignment and wireless resource allocation problem is a mixed-integer non-linear program (MINLP) that is hard to solve optimally. To tackle this challenge, we first relax it into a convex problem, and then propose an efficient suboptimal solution based on the optimal solution to the relaxed convex problem. Finally, numerical results show that our proposed joint design significantly reduces the local user's computation latency, as compared against other benchmark schemes that design the task assignment separately from the offloading/downloading resource allocations and local execution.

This paper studies an unmanned aerial vehicle (UAV)-enabled wireless powered communication network (WPCN), in which a UAV is dispatched as a mobile access point (AP) to serve a set of ground users periodically. The UAV employs the radio frequency (RF) wireless power transfer (WPT) to charge the users in the downlink, and the users use the harvested RF energy to send independent information to the UAV in the uplink. Unlike the conventional WPCN with fixed APs, the UAV-enabled WPCN can exploit the mobility of the UAV via periodic trajectory design, jointly with the transmission resource allocation optimization, to improve the system performance. In particular, we aim to maximize the uplink common (minimum) throughput among all ground users over a finite UAV's flight period, subject to its maximum speed constraint and the users' energy neutrality constraints. The resulting problem is non-convex and thus difficult to be solved optimally. To tackle this challenge, we first consider an ideal case without the maximum UAV speed constraint, and obtain the optimal solution to the relaxed problem. The optimal solution shows that the UAV should successively hover above a finite number of ground locations for downlink WPT, as well as above each of the ground users for uplink communication. Next, based on the above multi-location-hovering solution, we propose a successive hover-and-fly trajectory, jointly with the downlink and uplink power allocations, to find an efficient suboptimal solution to the problem with the maximum UAV speed constraint. Numerical results show that the proposed UAV-enabled WPCN achieves significant common throughput gain over the conventional WPCN with a fixed-location AP.

This paper proposes a joint computation and communication cooperation approach in mobile edge computing (MEC) systems for improving the energy efficiency in mobile computing. In particular, we consider a basic three-node MEC system that consists of a user node, a helper node, and an access point (AP) node attached with an MEC server. We focus on the user's latency-constrained computation over a finite-length block and develop a four-slot protocol for implementing the joint computation and communication cooperation. Under this setup, we jointly optimize the task partition and time allocation, and the transmit power for offloading and central processing unit (CPU) frequencies of local computing at the user and the helper, so as to minimize their total energy consumption subject to the user's computation latency constraint. This problem is optimally solved via convex optimization techniques. Numerical results show that the proposed approach significantly improves the computation capacity and the energy efficiency for the user, as compared to other benchmark schemes without such a joint design.

Unmanned aerial vehicles (UAVs) have recently gained growing popularity in wireless communications owing to their many advantages such as swift and cost-effective deployment, line-of-sight (LoS) aerial-to-ground link, and controllable mobility in three-dimensional (3D) space. Although prior works have exploited the UAV's mobility to enhance the wireless communication performance under different setups, the fundamental capacity limits of UAV-enabled/aided multiuser communication systems have not yet been characterized. To fill this gap, we consider, in this paper, a UAV-enabled two-user broadcast channel (BC), where a UAV flying at a constant altitude is deployed to send independent information to two users at different fixed locations on the ground. We aim to characterize the capacity region of this new type of BC over a given UAV flight duration, by jointly optimizing the UAV's trajectory and transmit power/rate allocations over time, subject to the UAV's maximum speed and maximum transmit power constraints. First, to draw essential insights, we consider two special cases with asymptotically large/low UAV flight duration/speed, respectively. For the former case, it is shown that a simple hover-fly-hover (HFH) UAV trajectory with time division multiple access (TDMA)-based orthogonal multiuser transmission is capacity-achieving; while in the latter case, the UAV should hover at a fixed location that is nearer to the user with larger achievable rate and in general superposition coding (SC)-based non-orthogonal transmission with interference cancellation at the receiver of the nearer user is required. Next, we consider the general case with finite UAV speed and flight duration. We show that the optimal UAV trajectory should follow a general HFH structure, i.e., the UAV successively hovers at a pair of optimal initial and final locations above the line segment connecting the two users each with a certain amount of time and flies unidirectionally between them at the maximum speed, and SC is generally needed. Furthermore, when TDMA-based transmission is considered for low-complexity implementation, we show that the optimal UAV trajectory still follows an HFH structure, but the hovering locations can only be those above the two users. Extensive simulation results are provided to verify our analysis, which also reveal useful guidelines to the practical design of UAV trajectory and communication jointly.

Mobile-edge computing (MEC) and wireless power transfer (WPT) have been recognized as promising techniques in the Internet of Things era to provide massive low-power wireless devices with enhanced computation capability and sustainable energy supply. In this paper, we propose a unified MEC-WPT design by considering a wireless powered multiuser MEC system, where a multiantenna access point (AP) (integrated with an MEC server) broadcasts wireless power to charge multiple users and each user node relies on the harvested energy to execute computation tasks. With MEC, these users can execute their respective tasks locally by themselves or offload all or part of them to the AP based on a time-division multiple access protocol. Building on the proposed model, we develop an innovative framework to improve the MEC performance, by jointly optimizing the energy transmit beamforming at the AP, the central processing unit frequencies and the numbers of offloaded bits at the users, as well as the time allocation among users. Under this framework, we address a practical scenario where latency-limited computation is required. In this case, we develop an optimal resource allocation scheme that minimizes the AP's total energy consumption subject to the users' individual computation latency constraints. Leveraging the state-of-the-art optimization techniques, we derive the optimal solution in a semiclosed form. Numerical results demonstrate the merits of the proposed design over alternative benchmark schemes.

With recent developments in wireless communication technologies, malicious users can use them to commit crimes or launch terror attacks, thus imposing new threats on public security. To quickly respond to these attacks, authorized parities need to intervene in the malicious communication links over the air. This paper investigates the emerging wireless communication intervention problem at the physical layer. Unlike prior studies using jamming to disrupt or disable the targeted wireless communications, we propose a new physical-layer spoofing approach to change their communicated information. Consider an abstract three-node model over additive white Gaussian noise channels, in which a legitimate spoofer aims to spoof a malicious communication link from a malicious transmitter to a malicious receiver, such that the received message at the receiver is changed from the transmitter's originally sent message to the one desired by the spoofer. We propose a new symbol-level spoofing scheme, where the spoofer designs the spoofing signal by exploiting the symbol-level relationship between each original constellation point of the transmitter and the desirable one of the spoofer. In particular, the spoofer aims to minimize the average spoofing-symbol-error-rate (SSER), which is defined as the average probability that the symbols decoded by the malicious receiver fail to be changed or spoofed, by designing its spoofing signals over symbols subject to the average transmit power constraint. By considering two cases when the malicious transmitter employs the widely-used binary phase-shift keying and quadrature phase-shift keying modulations, we obtain the respective optimal solutions to the two average SSER minimization problems. Numerical results show that the symbol-level spoofing scheme with optimized transmission achieves a much lower average SSER, as compared with other benchmark schemes.

This paper studies a new unmanned aerial vehicle (UAV)-enabled wireless power transfer system, where a UAV-mounted mobile energy transmitter is dispatched to deliver wireless energy to a set of energy receivers (ERs) at known locations on the ground. We investigate how the UAV should optimally exploit its mobility via trajectory design to maximize the amount of energy transferred to all ERs during a finite charging period. First, we consider the maximization of the sum energy received by all ERs by optimizing the UAV's trajectory subject to its maximum speed constraint. Although this problem is non-convex, we obtain its optimal solution, which shows that the UAV should hover at one single fixed location during the whole charging period. However, the sum-energy maximization incurs a “near-far” fairness issue, where the received energy by the ERs varies significantly with their distances to the UAV's optimal hovering location. To overcome this issue, we consider a different problem to maximize the minimum received energy among all ERs, which, however, is more challenging to solve than the sum-energy maximization. To tackle this problem, we first consider an ideal case by ignoring the UAV's maximum speed constraint, and show that the relaxed problem can be optimally solved via the Lagrange dual method. The obtained trajectory solution implies that the UAV should hover over a set of fixed locations with optimal hovering time allocations among them. Then, for the general case with the UAV's maximum speed constraint considered, we propose a new successive hover-and-fly trajectory motivated by the optimal trajectory in the ideal case and obtain efficient trajectory designs by applying the successive convex programing optimization technique. Finally, numerical results are provided to evaluate the performance of the proposed designs under different setups, as compared with benchmark schemes.

This paper investigates an unmanned aerial vehicle (UAV)-enabled multiuser wireless power transfer (WPT) system, where a UAV-mounted energy transmitter (ET) is dispatched to broadcast wireless energy to charge multiple energy receivers (ERs) on the ground. To ensure efficient and fair WPT, we maximize the minimum of the energy harvested by all ERs during a given charging period, by optimizing the UAV's trajectory subject to its maximum speed constraints. Such a min-energy maximization problem, however, is non-convex, and thus is challenging to be directly solved. To tackle this problem, we first consider an ideal case by ignoring the UAV's maximum speed constraint, and show that the relaxed problem can be optimally solved via the Lagrange dual method. The obtained trajectory solution implies that the UAV should hover over a set of fixed locations with optimal allocation of the hovering time among them. Then, for the general case with the UAV's maximum speed constraint considered, we propose a new successive hover-and-fly trajectory motivated by the optimal trajectory in the ideal case, and obtain efficient trajectory designs by applying the successive convex programing (SCP) optimization technique. Numerical results show that our proposed trajectory designs significantly improve the min-energy transferred to all ERs, as compared to other benchmark schemes.

This paper studies the wireless surveillance of a hybrid automatic repeat request (HARQ) based suspicious communication link over Rayleigh fading channels. We propose a proactive eavesdropping approach, where a half-duplex monitor can opportunistically jam the suspicious link to exploit its potential retransmissions for overhearing more efficiently. In particular, we consider that the suspicious link uses at most two HARQ rounds for transmitting the same data packet, and we focus on two cases without and with HARQ combining at the monitor receiver. In both cases, we aim to maximize the successful eavesdropping probability at the monitor, by adaptively allocating the jamming power in the first HARQ round according to fading channel conditions, subject to an average jamming power constraint. For both cases, we show that the optimal jamming power allocation follows a threshold-based policy, and the monitor jams with constant power when the eavesdropping channel gain is less than the threshold. Numerical results show that the proposed proactive eavesdropping scheme achieves higher successful eavesdropping probability than the conventional passive eavesdropping, and HARQ combining can help further improve the eavesdropping performance.

Integrating mobile-edge computing (MEC) and wireless power transfer (WPT) is a promising technique in the Internet of Things (IoT) era. It can provide massive low-power mobile devices with enhanced computation capability and sustainable energy supply. In this paper, we consider a wireless powered multiuser MEC system, where a multi-antenna access point (AP) (integrated with an MEC server) broadcasts wireless power to charge multiple users and each user node relies on the harvested energy to execute latency-sensitive computation tasks. With MEC, these users can execute their respective tasks locally by themselves or offload all or part of the tasks to the AP based on a time division multiple access (TDMA) protocol. Under this setup, we pursue an energy-efficient MEC-WPT system design by jointly optimizing the transmit energy beamformer at the AP, the central processing unit (CPU) frequencies and the offloaded bits at each user, as well as the time allocation among different users. In particular, we minimize the energy consumption at the AP over a particular time block subject to the computation latency and energy harvesting constraints per user. By formulating this problem into a convex framework and employing the Lagrange duality method, we obtain its optimal solution in a semi-closed form. Numerical results demonstrate the merits of the proposed joint design over alternative benchmark schemes.

To enhance the national security, there is a growing need for authorized parties to legitimately monitor suspicious communication links for preventing intended crimes and terror attacks. In this paper, we propose a new wireless information surveillance paradigm by investigating a scenario, where a legitimate monitor aims to intercept a suspicious wireless link over fading channels. The legitimate monitor can successfully eavesdrop (decode) the information of the suspicious link at each fading state only when its achievable data rate is no smaller than that at the suspicious receiver. We propose a new approach, namely, proactive eavesdropping via cognitive jamming, in which the legitimate monitor purposely jams the receiver in a full-duplex mode so as to change the suspicious communication (e.g., to a smaller data rate) for overhearing more efficiently. By assuming perfect self-interference cancelation (SIC) and global channel state information (CSI) at the legitimate monitor, we characterize the fundamental information-theoretic limits of proactive eavesdropping. We consider both delay-sensitive and delay-tolerant applications for the suspicious communication, under which the legitimate monitor maximizes the eavesdropping non-outage probability (for event-based monitoring) and the relative eavesdropping rate (for content analysis), respectively, by optimizing the jamming power allocation over different fading states subject to an average power constraint. Numerical results show that the proposed proactive eavesdropping via cognitive jamming approach greatly outperforms other benchmark schemes. Furthermore, by extending to a more practical scenario with residual SI and local CSI, we design an efficient online cognitive jamming scheme inspired by the optimal cognitive jamming with perfect SIC and global CSI.

This paper studies a full-duplex filter-and-forward (FD-FF) relay system in frequency-selective channels. Conventionally, the loop-back signal at the FD relay is treated as harmful self- interference and needs to be significantly suppressed via both analog- and digital-domain cancellation. However, the performance of the conventional self-interference cancellation approach is fundamentally limited due to the quantization error induced by the analog-to-digital converter (ADC) with limited dynamic range. In this paper, we consider an analog filter-and-forward design to help avoid the quantization error, and surprisingly show that the maximum achievable rate of such an FD-FF relay system is in fact regardless of the loop- back channel at the FD relay. We characterize the maximum achievable rate of this channel by jointly optimizing the transmit power allocation over frequency at the source and the frequency response of the filter at the relay, subject to their individual power constraints. Although this problem is non- convex, we obtain its optimal solution by applying the Lagrange duality method. By simulations it is shown that the proposed joint source and relay optimization achieves rate gains over other heuristic designs, and is also advantageous over the conventional approach by cancelling the relay loop- back signal as self-interference, especially when the residual self-interference after cancellation is still significant.

There is a growing need for government agencies to monitor suspicious communication links to prevent crimes and terror attacks. In this paper, we study a legitimate surveillance scenario where a legitimate monitor aims to intercept the suspicious communication between a transmitter and a receiver over fading channels. The legitimate monitor can eavesdrop (decode) the information of the suspicious link only when its achievable data rate is no smaller than that at the suspicious receiver. In practice, the legitimate eavesdropping is challenging, especially when the legitimate monitor is far from the suspicious transmitter. To overcome this issue, we propose a new approach, namely proactive eavesdropping via cognitive jamming, in which the legitimate monitor purposely jams the receiver and changes the suspicious communication (e.g., to a smaller data rate) in order to overhear easily. In particular, we consider delay-sensitive and delay-insensitive applications for the suspicious transmission, under which the legitimate monitor maximizes the eavesdropping non-outage probability and the relative eavesdropping rate, respectively, by optimizing its jamming power allocation over different fading states subject to an average power constraint. We present efficient algorithms for optimally solving the formulated problems. Numerical results show that thanks to the cognitive jamming, the proposed proactive eavesdropping scheme greatly outperforms the conventional passive eavesdropping without jamming.

In the emerging hybrid electricity market, mobile network operators (MNOs) of cellular networks can make day-ahead energy purchase commitments at low prices and real-time flexible energy purchase at high prices. To minimize electricity bills, it is essential for MNOs to jointly optimize the day-ahead and real-time energy purchase based on their time-varying wireless traffic load. In this paper, we consider two different MNOs coexisting in the same area, and exploit their collaboration in both energy purchase and wireless load sharing for energy cost saving. Specifically, we propose a new approach named energy group buying with load sharing, in which the two MNOs are aggregated as a single group to make the day-ahead and real-time energy purchase, and their base stations (BSs) share the wireless traffic to maximally turn lightly-loaded BSs into sleep mode. When the two MNOs belong to the same entity and aim to minimize their total energy cost, we use the two-stage stochastic programming to obtain the optimal day-ahead and real-time energy group buying jointly with wireless load sharing. When the two MNOs belong to different entities and are self-interested in minimizing their individual energy costs, we propose a novel repeated Nash bargaining scheme for them to negotiate and share their energy costs under energy group buying and load sharing. Our proposed repeated Nash bargaining scheme is shown to achieve Pareto-optimal and fair energy cost reductions for both MNOs.

This paper studies a multiple-input single-output (MISO) broadcast channel (BC) featuring simultaneous wireless information and power transfer (SWIPT), where a multi-antenna access point (AP) delivers both information and energy via radio signals to multiple single-antenna receivers simultaneously, and each receiver implements either information decoding (ID) or energy harvesting (EH). We characterize the capacity region for ID receivers under given energy requirements for EH receivers, by solving a sequence of weighted sum-rate (WSR) maximization (WSRMax) problems subject to a maximum sum-power constraint for the AP, and a set of minimum harvested power constraints for individual EH receivers. The problem corresponds to a new form of WSRMax problem in MISO-BC with combined maximum and minimum linear transmit covariance constraints (MaxLTCCs and MinLTCCs), which has not been addressed in the literature and is challenging to solve. By extending the general BC-multiple access channel (MAC) duality, which is only applicable to WSRMax problems with MaxLTCCs, and applying the ellipsoid method, we propose an efficient algorithm to solve this problem globally optimally. Numerical results are presented to validate our proposed algorithm.

This paper studies a multiple-input–single-output (MISO) broadcast channel (BC) featuring simultaneous wireless information and power transfer, where a multiantenna access point (AP) delivers both information and energy via radio signals to multiple single-antenna receivers simultaneously, and each receiver implements either information decoding (ID) or energy harvesting (EH). In particular, pseudorandom sequences that area prioriknown and therefore can be cancelled at each ID receiver are used as the energy signals, and the information-theoretically optimal dirty paper coding is employed for the information transmission. We characterize the capacity region for ID receivers by solving a sequence of weighted sum-rate (WSR) maximization (WSRMax) problems subject to a maximum sum-power constraint for the AP, and a set of minimum harvested power constraints for individual EH receivers. The problem corresponds to a new form of WSRMax problem in MISO-BC with combined maximum and minimum linear transmit covariance constraints (MaxLTCCs and MinLTCCs), which differs from the celebrated capacity region characterization problem for MISO-BC under a set of MaxLTCCs only and is challenging to solve. By extending the general BC–multiple-access-channel duality, which is only applicable to WSRMax problems with MaxLTCCs, and applying the ellipsoid method, we propose an efficient iterative algorithm to solve this problem globally optimally. Furthermore, we also propose two suboptimal algorithms with lower complexity by assuming that the information and energy signals are designed separately. Finally, numerical results are provided to validate our proposed algorithms.

This paper studies the energy management in the coordinated multi-point (CoMP) systems powered by smart grids, where each base station (BS) with local renewable energy generation is allowed to implement the two-way energy trading with the grid. Due to the unevenly generated renewable energy over distributed BSs and the difference in the prices for buying/selling energy from/to the gird, it is in general beneficial for the cooperative BSs to jointly manage their energy trading with the grid and energy consumption in CoMP based communication for reducing the total energy cost. We consider the downlink transmission in one CoMP cluster by jointly optimizing the BSs' purchased/sold energy units from/to the grid and their cooperative transmit beamforming, so as to minimize the total energy cost subject to the given quality of service (QoS) constraints for the users. By applying techniques from convex optimization and uplink-downlink duality, we propose an efficient algorithm to solve this problem optimally. Through simulations, we show the performance gain achieved by our proposed joint energy trading and communication cooperation scheme in terms of cost reduction, as compared to a baseline scheme with the separate designs of communication cooperation and energy trading.

This paper investigates the real-time energy management in power system with distributed microgrids, which are independently operated and each is modeled to comprise of a renewable generation system, an energy storage system and an aggregated load. We jointly optimize the energy charged/discharged to/from the storage system and that drawn from the main grid over a finite horizon to minimize the total energy cost of conventional generation subject to given load and storage constraints. We assume that the renewable energy offset by the load over time, named net energy profile, is predictable but with finite errors. First, we consider the “off-line” optimization under an idealized assumption that the net energy profile is known ahead of time, and derive its optimal closed-form solution. Next, by applying the off-line solution combined with a sliding-window based sequential optimization, we propose a new “online” algorithm for real-time energy management under the practical setup with noisy predicted net energy profile subject to arbitrary errors. Finally, through simulations, we compare the performance of our proposed online algorithm against the conventional dynamic programming based solution as well as a heuristically designed myopic algorithm under a practical setup.

Wireless energy transfer (WET) via far-field radio signal has emerged as a new solution for powering wireless networks. To overcome the significant path loss in wireless channels, multi-antenna or multiple-input multiple-output (MIMO) techniques have been proposed to enhance the transmission efficiency and distance for WET. However, in order to reap the large energy beamforming gain in WET, acquiring channel state information (CSI) at the energy transmitter (ET) is an essential task. This task is particularly challenging for WET systems, since existing channel training and feedback methods used for communication receivers cannot be implemented at the energy receiver (ER) due to the hardware limitation. To tackle this problem, in this paper we consider a point-to-point MIMO WET system with transmit energy beamforming, and propose a new channel learning method that requires only one feedback bit from the ER to ET per feedback interval. Each feedback bit indicates the increase or decrease of the harvested energy by the ER between the present and previous intervals, which can be measured without changing the existing hardware at the ER. Based on such feedback information, the ET adjusts transmit energy beamforming in different intervals and at the same time obtains an improved estimate of the MIMO channel by applying the analytic center cutting plane method (AC-CPM). By numerical examples, we show the performance of our proposed new channel learning algorithm for MIMO WET systems in terms of convergence speed and energy transfer efficiency, as compared to existing algorithms.

Powered by renewable energy sources, cellular communication systems usually have different traffic loads and resource availabilities over time. It is helpful for two neighbouring systems to cooperate in resource sharing when one is excessive in one resource (e.g., spectrum), while the other is sufficient in another resource (e.g., energy). In this paper, we propose a joint energy and spectrum sharing scheme between different cellular systems to save their operational costs. When the two systems are fully cooperative (e.g., belonging to the same entity), we formulate their cooperation problem to minimize the weighted sum cost as a convex optimization problem and obtain its closed-form optimal solution. We also study another partially cooperative scenario where the two systems have their own interests. We show that the two systems seek for partial cooperation when they find complementarity between the spectrum and energy resources. Under the partial cooperation conditions, we propose a distributed algorithm for the two systems to gradually and simultaneously reduce their costs from a non-cooperation benchmark to the Pareto optimum. This distributed algorithm also takes fairness into consideration, by reducing each system's cost proportionally. Finally, numerical results are presented to demonstrate the improvement made by our proposed schemes.

Developing green radio networks is desirable to improve energy efficiency under quality of service (QoS) constraints. In this paper, we propose a QoS aware energy efficient resource allocation scheme in multiuser high speed downlink packet access (HSDPA) systems. First, we derive a new metric, namely effective energy efficiency (EEE), to represent the delivered service bits at the media access control (MAC) layer per joule subject to given QoS constraints. Then, by using this new metric, a EEE optimization problem in the mixed traffic scenario is formulated, where we can exploit the multi-traffic diversity. With the help of primal decomposition technique, we solve the formulated problem and propose a cross-layer resource allocation scheme, in which determines the EEE optimal transmit power level for each user and schedules the set of EEE near-optimal users. Numerical results are presented to quantify the superiority of our proposed scheme over the conventional resource allocation schemes.

Characterizing the fundamental tradeoffs for maximizing energy efficiency (EE) versus spectrum efficiency (SE) is a key problem in wireless communication. In this paper, we address this problem for a point-to-point additive white Gaussian noise (AWGN) channel with the transmitter powered solely via energy harvesting from the environment. In addition, we assume a practical on-off transmitter model with non-ideal circuit power, i.e., when the transmitter is on, its consumed power is the sum of the transmit power and a constant circuit power. Under this setup, we study the optimal transmit power allocation to maximize the average throughput over a finite horizon, subject to the time-varying energy constraint and the non-ideal circuit power consumption. First, we consider the off-line optimization under the assumption that the energy arrival time and amount are a priori known at the transmitter. Although this problem is non-convex due to the non-ideal circuit power, we show an efficient optimal solution that in general corresponds to a two-phase transmission: the first phase with an EE-maximizing on-off power allocation, and the second phase with a SE-maximizing power allocation that is non-decreasing over time, thus revealing an interesting result that both the EE and SE optimizations are unified in an energy harvesting communication system. We then extend the optimal off-line algorithm to the case with multiple parallel AWGN channels, based on the principle of nested optimization. Finally, inspired by the off-line optimal solution, we propose a new online algorithm under the practical setup with only the past and present energy state information (ESI) known at the transmitter.

Powered by renewable energy sources, cellular communication systems usually have different wireless traffic loads and available resources over time. To match their traffics, it is beneficial for two neighboring systems to cooperate in resource sharing when one is excessive in one resource (e.g., spectrum), while the other is sufficient in another (e.g., energy). In this paper, we propose a joint energy and spectrum cooperation scheme between different cellular systems to reduce their operational costs. When the two systems are fully cooperative in nature (e.g., belonging to the same entity), we formulate the cooperation problem as a convex optimization problem to minimize their weighted sum cost and obtain the optimal solution in closed form. We also study another partially cooperative scenario where the two systems have their own interests. We show that the two systems seek for partial cooperation as long as they find inter-system complementarity between the energy and spectrum resources. Under the partial cooperation conditions, we propose a distributed algorithm for the two systems to gradually and simultaneously reduce their costs from the non-cooperative benchmark to the Pareto optimum. This distributed algorithm also has proportional fair cost reduction by reducing each system's cost proportionally over iterations. Finally, we provide numerical results to validate the convergence of the distributed algorithm to the Pareto optimality and compare the centralized and distributed cost reduction approaches for fully and partially cooperative scenarios.

In this paper, we investigate the optimal energy efficient coordinated beamforming in multi-cell multiple-input single-output (MISO) systems with K multiple-antenna base stations (BS) and K single-antenna mobile stations (MS), where each BS sends information to its own intended MS with cooperatively designed transmit beamforming. We assume single user detection at the MS by treating the interference as noise. By taking into account a realistic power model at the BS, we characterize the Pareto boundary of the achievable energy efficiency (EE) region of the K links, where the EE of each link is defined as the achievable data rate at the MS divided by the total power consumption at the BS. Since the EE of each link is non-cancave (which is a non-concave function over an affine function), characterizing this boundary is difficult. To meet this challenge, we relate this multi-cell MISO system to cognitive radio (CR) MISO channels by applying the concept of interference temperature (IT), and accordingly transform the EE boundary characterization problem into a set of fractional concave programming problems. Then, we apply the fractional concave programming technique to solve these fractional concave problems, and correspondingly give a parametrization for the EE boundary in terms of IT levels. Based on this characterization, we further present a decentralized algorithm to implement the multi-cell coordinated beamforming, which is shown by simulations to achieve the EE Pareto boundary.

In this paper, we pursue a unified study on energy harvesting and coordinated multi-point (CoMP) enabled wireless communication by investigating a new joint energy and communication cooperation approach. We consider a practical CoMP system with clusters of multiple-antenna base stations (BSs) each powered by hybrid power supplies (including both the conventional grid and renewable energy sources) cooperatively transmitting to multiple single-antenna mobile terminals (MTs). We propose a new design paradigm termed energy cooperation among BSs within each cluster, which share energy for more efficient cooperative transmission via injecting/drawing power to/from the grid with a zero-sum net energy transfer. We maximize the downlink sum-rate for all MTs in one particular CoMP cluster with cooperative zero-forcing precoding at BSs subject to a new type of transmit power constraints featuring energy cooperation among BSs with a given loss ratio. To jointly optimize the precoders at BSs and the amount of energy transferred among them, we propose an efficient algorithm by applying the techniques from convex optimization. By simulations, we show that the proposed joint communication and energy cooperation solution substantially improves the downlink throughput for energy harvesting CoMP systems, as compared to suboptimal designs without communication and/or energy cooperation.

This paper studies a multiuser multiple-input single-output (MISO) broadcast system for simultaneous wireless information and power transfer (SWIPT), where a multi-antenna access point (AP) sends information and energy simultaneously via beamforming to multiple single-antenna receivers. We maximize the weighted sum-power transferred to energy harvesting (EH) receivers subject to a set of minimum signal-to-interference-and-noise ratio (SINR) constraints at information decoding (ID) receivers. In particular, we consider two types of ID receivers, namely Type I and Type II receivers, without and with the capability of cancelling the interference from energy signals, respectively. For each type of ID receivers, we formulate the joint information and energy transmit beamforming problem as a non-convex quadratically constrained quadratic program (QC-QP), for which the globally optimal solution is obtained by applying the technique of semidefinite relaxation (SDR). It is shown that for Type I ID receivers, dedicated energy beamforming is not needed to achieve the optimal solution, while for Type II ID receivers, employing no more than one energy beam is optimal.

Characterizing the fundamental energy efficiency (EE) limits of MIMO broadcast channels (BC) is significant for the development of green wireless communications. We address the EE optimization problem for MIMO-BC in this paper and consider a practical power model, i.e., taking into account a transmit independent power which is related to the number of active transmit antennas. Under this setup, we propose a new optimization approach, in which the transmit covariance is optimized under fixed active transmit antenna sets, and then active transmit antenna selection (ATAS) is utilized. During the transmit covariance optimization, we propose a globally optimal energy efficient iterative water-filling scheme through solving a series of concave-convex fractional programs based on the block-coordinate ascent algorithm. After that, ATAS is employed to determine the active transmit antenna set. Since activating more transmit antennas can achieve higher sum-rate but at the cost of larger transmit independent power consumption, there exists a tradeoff between the sum-rate gain and the power consumption. Here ATAS can explore the optimal tradeoff curve and thus further improve the EE. Optimal exhaustive search and low-complexity norm based ATAS schemes are developed. Through simulations, we discuss the effect of different parameters on the EE of the MIMO-BC.

In this paper, we consider the robust retransmission precoder design for amplify-and-forward (AF) multi-input multi-output (MIMO) relay systems with channel estimation errors. With the objective of minimizing the average mean-squared-error of symbol estimations, we propose a novel progressive retransmission precoder by employing matrix diagonalization and channel pairing. As a consequence, we formulate the precoder design as a joint source/relay power allocation (PA) and channel pairing optimization problem. First, we propose the globally optimal solution, in which exhaustive search is employed for the channel pairing, while with each given channel pairing, an optimal PA algorithm is proposed to solve the nonconvex PA problem by utilizing the necessary conditions for optimality. However, the optimal channel pairing and PA solution is of very high complexity. In order to reduce the complexity, we then propose a suboptimal PA algorithm by iteratively optimizing the PA at the source and the relay, as well as a simplified channel pairing searching method based on the asymptotic optimal solution. It is shown that our proposed robust retransmission precoder improves the system performance significantly, meanwhile, the performance degradation of the low complexity PA and channel pairing algorithm is slight as compared to the optimal PA algorithm and the optimal channel pairing method.

Optimizing energy efficiency (EE) for the MIMO broadcasting channels (BC) is considered in this paper, where a practical power model is taken into account. Although the EE of the MIMO BC is non-concave, we reformulate it as a quasiconcave function based on the uplink-downlink duality. After that, an energy efficient iterative waterfilling scheme is proposed based on the block-coordinate ascent algorithm to obtain the optimal transmission policy efficiently, and the solution is proved to be convergent. Through simulations, we validate the efficiency of the proposed scheme and discuss the system parameters' effect on the EE.

TDD multiuser downlink MIMO channels with delayed channel state information at the transmitter (CSIT) are considered. Block diagonalization is applied at the base station (BS). In order to cope with the inter-user interference caused by the delayed CSIT, we develop a novel capacity estimation method at first and then propose robust delayed CSIT aware multimode selection schemes based on the estimation. The robust schemes can choose the mode with appropriate number of data streams and corresponding user and receive antenna set to compromise the multiuser spatial multiplexing gain and the rate loss caused by the inter-user interference. The proposed schemes are applicable to the heterogeneous case in which the moving speed of each user is different. Through simulation, the proposed schemes outperform the previous naive schemes and are promising in the practical system.

Network coded multiuser uplink MIMO channels have been discussed in this paper. A three slots transmission is considered here and spatial division multiple access (SDMA) has been employed to serve multiuser simultaneously. Minimum mean-square-error successive interference cancelation (MMSE-SIC) is applied in the first two slots and singular value decomposition (SVD) is applied for the third slots. In order to get the optimal performance, user scheduling, decoding ordering and user pairing need to be considered. However, the optimal exhaust searching algorithm is too complex to implement. We propose a low complexity scheme to solve this problem and the simulation results show the performance gain. The proposed scheme is promising in the real systems.

This paper considers the effect of channel estimation error in the multiuser downlink MIMO relay channels. We introduce a modified upper bound and a modified power allocation strategy for the previous asymptotic optimal singular value decomposition zero-forcing beamforming (SVD-ZFBF) [2] at first. And then the effect of channel estimation error to SVDZFBF would be discussed. Similar with the full channel side information (CSI) case, SVD-ZFBF can approach the modified upper bound in the large user number case, no matter how large the channel estimation error is. And in the limited user number case, increasing relay station (RS) power would not make SVD-ZFBF approach the upper bound, which is different from the full CSI case. There is a capacity gap, which is mainly related to the channel estimation error from RS to users, between SVD-ZFBF and the upper bound.