In this paper, we consider an unmanned aerial vehicle (UAV) enabled relaying system where multiple UAVs are deployed as aerial relays to support simultaneous communications from a set of source nodes to their destination nodes on the ground. An optimization problem is formulated under practical channel models to maximize the minimum achievable expected rate among all pairs of ground nodes by jointly designing UAVs' three-dimensional (3D) placement as well as the bandwidth-and-power allocation. This problem, however, is non-convex and thus difficult to solve. As such, we propose a new method, called iterative Gibbs-sampling and block-coordinate-descent (IGS-BCD), to efficiently obtain a high-quality suboptimal solution by synergizing the advantages of both the deterministic (BCD) and stochastic (GS) optimization methods. Specifically, our proposed method alternates between two optimization phases until convergence is reached, namely, one phase that uses the BCD method to find locally-optimal UAVs' 3D placement and the other phase that leverages the GS method to generate new UAVs' 3D placement for exploration. Moreover, we present an efficient method for properly initializing UAVs' placement that leads to faster convergence of the proposed IGS-BCD algorithm. Numerical results show that the proposed IGS-BCD and initialization methods outperform the conventional BCD or GS method alone in terms of convergence-and-performance trade-off, as well as other benchmark schemes.
In this paper, the bit-error-rate (BER) performance of two signalling schemes for high rate data transmission in the 3rd generation direct-sequence, wide-band code-division-multiple-access (DS/WCDMA) systems are compared. The transmission channel is frequency selective with Rician and Rayleigh fading, and a RAKE receiver is employed to achieve diversity gain with maximal ratio combining (MRC). In the first scheme, referred to as the single code scheme, high rate data transmission is achieved by using a single spreading pseudo-noise (PN) code with varying processing gain (PG) that might be as low as 4. In the other scheme, called the multi-code scheme, the high rate data stream is split into several low rate substreams. Each substream is spread by a concatenated Walsh/PN sequence and all the substreams are then transmitted in parallel. It is shown that notable performance improvement can be achieved by using multi-code scheme in the multipath fading channel when the channel delay spread is small.
This paper studies a new decentralized resource allocation strategy, named iterative spectrum shaping (ISS), for a multi-carrier-based spectrum sharing system, where two co-existing users independently and sequentially update transmit power allocation over parallel subcarriers to maximize their individual transmit rates. Unlike the conventional iterative water-filling (IWF) algorithm that applies the single-user detection (SD) at each user receiver by treating the interference from the other user as additional noise, the proposed ISS algorithm opportunistically applies multiuser detection techniques to decode both the desired user and interference user messages, thus termed as opportunistic multiuser detection (OMD). For OMD, this paper derives the optimal user power and rate allocation strategy at each iteration of transmit adaptation. Numerical examples show that the proposed ISS deploying OMD is able to achieve substantial throughput gains over the conventional IWF deploying SD in decentralized spectrum sharing systems.
In this paper, we propose a model for energy cooperation between cellular base stations (BSs) with individual renewable energy sources, limited energy storages and connected by resistive power lines for energy sharing. When the renewable energy profile and energy demand profile at all BSs are deterministic or known ahead of time, we show that the optimal energy cooperation policy for the BSs can be found by solving a linear program. We show the benefits of energy cooperation in this regime. When the renewable energy and demand profiles are stochastic and only causally known at the BSs, we propose an online energy cooperation algorithm and show the optimality properties of this algorithm under certain conditions. Furthermore, the energy-saving performances of the developed offline and online algorithms are compared by simulations, and the effect of the availability of energy state information (ESI) on the performance gains of the BSs' energy cooperation is investigated.
This paper studies a new active eavesdropping technique via the so-called spoofing relay attack, which could be launched by the eavesdropper to significantly enhance the information leakage rate from the source over conventional passive eavesdropping. With this attack, the eavesdropper acts as a relay to spoof the source to vary transmission rate in favor of its eavesdropping performance by either enhancing or degrading the effective channel of the legitimate link. The maximum information leakage rate achievable by the eavesdropper and the corresponding optimal operation at the spoofing relay are obtained. It is shown that such a spoofing relay attack could impose new challenges from a physical-layer security perspective since it leads to significantly higher information leakage rate than conventional passive eavesdropping.
This letter studies an emerging wireless communication intervention problem at the physical layer, where a legitimate spoofer aims to spoof a malicious link from Alice to Bob, by replacing Alice's transmitted source message with its target message at Bob side. From an information-theoretic perspective, we are interested in characterizing the maximum achievable spoofing rate of this new spoofing channel, which is equivalent to the maximum achievable rate of the target message at Bob, under the condition that Bob cannot decode the source message from Alice. We propose a novel combined spoofing approach, where the spoofer sends its own target message, combined with a processed version of the source message to cancel the source message at Bob. For both cases when Bob treats interference as noise (TIN) or applies successive interference cancelation (SIC), we obtain the maximum achievable spoofing rates by optimizing the power allocation between the target and source messages at the spoofer.
Energy beamforming (EB) is a key technique for achieving efficient radio-frequency (RF) transmission enabled wireless energy transfer (WET). By optimally designing the waveforms from multiple energy transmitters (ETs) over the wireless channels, they are constructively combined at the energy receiver (ER) to achieve an EB gain that scales with the number of ETs. However, the optimal design of transmit waveforms requires accurate channel state information (CSI) at the ETs, which is challenging to obtain in practical WET systems. In this paper, we propose a new channel training scheme to achieve optimal EB gain in a distributed WET system, where multiple separated ETs adjust their transmit phases to collaboratively send power to a single ER in an iterative manner, based on one-bit feedback from the ER per training interval which indicates the increase/decrease of the received power level from one particular ET over two preassigned transmit phases. The proposed EB algorithm can be efficiently implemented in practical WET systems even with a large number of distributed ETs, and is analytically shown to converge quickly to the optimal EB design as the number of feedback intervals per ET increases. Numerical results are provided to evaluate the performance of the proposed algorithm as compared to other distributed EB designs.
No abstract is provided for this article.
Intelligent reflecting surface (IRS) is a promising solution to enhance the wireless communication capacity both cost-effectively and energy-efficiently, by properly altering the signal propagation via tuning a large number of passive reflecting units. In this paper, we aim to characterize the fundamental capacity limit of IRS-aided point-to-point multiple-input multiple-output (MIMO) communication systems with multi-antenna transmitter and receiver in general, by jointly optimizing the IRS reflection coefficients and the MIMO transmit covariance matrix. First, we consider narrowband transmission under frequency-flat fading channels, and develop an efficient alternating optimization algorithm to find a locally optimal solution by iteratively optimizing the transmit covariance matrix or one of the reflection coefficients with the others being fixed. Next, we consider capacity maximization for broadband transmission in a general MIMO orthogonal frequency division multiplexing (OFDM) system under frequency-selective fading channels, where transmit covariance matrices are optimized for different subcarriers while only one common set of IRS reflection coefficients is designed to cater to all the subcarriers. To tackle this more challenging problem, we propose a new alternating optimization algorithm based on convex relaxation to find a high-quality suboptimal solution. Numerical results show that our proposed algorithms achieve substantially increased capacity compared to traditional MIMO channels without the IRS, and also outperform various benchmark schemes. In particular, it is shown that with the proposed algorithms, various key parameters of the IRS-aided MIMO channel such as channel total power, rank, and condition number can be significantly improved for capacity enhancement.
Integrating unmanned aerial vehicles (UAVs) into the cellular network as new aerial users is a promising solution to meet their ever-increasing communication demands in a plethora of applications. Due to the high UAV altitude, the channels between UAVs and the ground base stations (GBSs) are dominated by the strong line-of-sight (LoS) links, thus severe interference may be generated to/from the GBSs in the uplink/downlink, which renders the interference management with coexisting terrestrial and aerial users a more challenging problem to solve. In this paper, we study the uplink communication from a multi-antenna UAV to a set of GBSs in its signal coverage region. Among these GBSs, we denote available GBSs as the ones that do not serve any terrestrial users at the assigned resource block (RB) of the UAV, and occupied GBSs as the rest that are serving their respectively associated terrestrial users in the same RB. We propose a new cooperative interference cancellation strategy for the multi-beam UAV uplink communication, which aims to eliminate the co-channel interference at each of the occupied GBSs and in the meanwhile maximize the sum-rate to the available GBSs. Specifically, the multi-antenna UAV sends multiple data streams to selected available GBSs, which in turn forward their decoded data streams to their backhaul-connected occupied GBSs for interference cancellation. To draw useful insights, the maximum degrees-of-freedom (DoF) achievable by the multi-beam UAV communication for sum-rate maximization in the high signal-to-noise ratio (SNR) regime is first characterized, subject to the stringent constraint that all the occupied GBSs do not suffer from any interference in the UAV's uplink transmission. Then, based on the DoF-optimal design, the achievable sum-rate at finite SNR is maximized, subject to given maximum allowable interference power constraints at each occupied GBS.
A non-null aspheric surface testing system using a quadriwave lateral shearing interferometer (QWLSI) based on the randomly encoded hybrid grating is proposed. The system uses a non-null lens to partially compensate for the longitude aberration of the aspheric surface, which is more versatile than the null configuration. QWLSI is a common-path and self-reference system and requires no reference surface. Compared with the conventional Twyman–Green interferometer (TGI), QWLSI has higher dynamic range, better antivibration ability, and higher stability. For a non-null testing system based on the QWLSI and TGI, the compensation ranges of different aspheric surfaces and the allowable range of aspheric axial positions are analyzed under the condition that the interference fringe satisfies the Nyquist sampling theorem. The iterative reverse optimization retrace error-correction algorithm based on the exact system modeling and the localization algorithm of aspheric axial position are discussed. Simulation results show that the root mean square value of the aspheric surface reconstruction residual is less than <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mn>1</mml:mn> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo>/</mml:mo> </mml:mrow> <mml:mn>200</mml:mn> </mml:mrow> <mml:mspace width="thickmathspace"/> <mml:mi>λ</mml:mi> </mml:math> , which indicates that the system has extremely high theoretical testing accuracy. In the experiment, the QWLSI non-null system and the autocollimation null method with a ZYGO interferometer agree with the testing results of the same aspheric surface, which demonstrates the feasibility and accuracy of the QWLSI aspheric non-null testing method.
Owing to the structure of the Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC), associated optimization problems such as capacity region computation and beamforming optimization are typically non-convex, and cannot be solved directly. One feasible approach to these problems is to transform them into their dual multiple access channel (MAC) problems, which are easier to deal with due to their convexity properties. The conventional BC-MAC duality is established via BC-MAC signal transformation, and has been successfully applied to solve beamforming optimization, signal-to-interference-plus-noise ratio (SINR) balancing, and capacity region computation. However, this conventional duality approach is applicable only to the case, in which the base station (BS) of the BC is subject to a single sum power constraint. An alternative approach is minimax duality, established by Yu in the framework of Lagrange duality, which can be applied to solve the per-antenna power constraint problem. This paper extends the conventional BC-MAC duality to the general linear constraint case, and thereby establishes a general BC-MAC duality. This new duality is applied to solve the capacity computation and beamforming optimization for the MIMO and multiple-input single-output (MISO) BC, respectively, with multiple linear constraints. Moreover, the relationship between this new general BC-MAC duality and minimax duality is also presented. It is shown that the general BC-MAC duality offers more flexibility in solving BC optimization problems relative to minimax duality. Numerical results are provided to illustrate the effectiveness of the proposed algorithms.
No abstract is provided for this article.
In this paper, we consider a novel mobile relaying technique, where the relay nodes are mounted on unmanned aerial vehicles (UAVs) and hence are capable of moving at high speed. Compared with conventional static relaying, mobile relaying offers a new degree of freedom for performance enhancement via careful relay trajectory design. We study the throughput maximization problem in mobile relaying systems by optimizing the source/relay transmit power along with the relay trajectory, subject to practical mobility constraints (on the UAV's speed and initial/final relay locations), as well as the information-causality constraint at the relay. It is shown that for the fixed relay trajectory, the throughput-optimal source/relay power allocations over time follow a “staircase” water filling structure, with non-increasing and non-decreasing water levels at the source and relay, respectively. On the other hand, with given power allocations, the throughput can be further improved by optimizing the UAV's trajectory via successive convex optimization. An iterative algorithm is thus proposed to optimize the power allocations and relay trajectory alternately. Furthermore, for the special case with free initial and final relay locations, the jointly optimal power allocation and relay trajectory are derived. Numerical results show that by optimizing the trajectory of the relay and power allocations adaptive to its induced channel variation, mobile relaying is able to achieve significant throughput gains over the conventional static relaying.
In this paper, we consider an intelligent reflecting surface (IRS)-aided single-user system where an IRS with discrete phase shifts is deployed to assist the uplink communication. A practical transmission protocol is proposed to execute channel estimation and passive beamforming successively. To minimize the mean square error (MSE) of channel estimation, we first formulate an optimization problem for designing the IRS reflection pattern in the training phase under the constraints of unit-modulus, discrete phase, and full rank. This problem, however, is NP-hard and thus difficult to solve in general. As such, we propose a low-complexity yet efficient method to solve it sub-optimally, by constructing a near-orthogonal reflection pattern based on either discrete Fourier transform (DFT)-matrix quantization or Hadamard-matrix truncation. Based on the estimated channel, we then formulate an optimization problem to maximize the achievable rate by designing the discrete-phase passive beamforming at the IRS with the training overhead and channel estimation error taken into account. To reduce the computational complexity of exhaustive search, we further propose a low-complexity successive refinement algorithm with a properly-designed initialization to obtain a high-quality suboptimal solution. Numerical results are presented to show the significant rate improvement of our proposed IRS training reflection pattern and passive beamforming designs as compared to other benchmark schemes.
