140 research outputs found
MIMO Interference Alignment Over Correlated Channels with Imperfect CSI
Interference alignment (IA), given uncorrelated channel components and
perfect channel state information, obtains the maximum degrees of freedom in an
interference channel. Little is known, however, about how the sum rate of IA
behaves at finite transmit power, with imperfect channel state information, or
antenna correlation. This paper provides an approximate closed-form
signal-to-interference-plus-noise-ratio (SINR) expression for IA over
multiple-input-multiple-output (MIMO) channels with imperfect channel state
information and transmit antenna correlation. Assuming linear processing at the
transmitters and zero-forcing receivers, random matrix theory tools are
utilized to derive an approximation for the post-processing SINR distribution
of each stream for each user. Perfect channel knowledge and i.i.d. channel
coefficients constitute special cases. This SINR distribution not only allows
easy calculation of useful performance metrics like sum rate and symbol error
rate, but also permits a realistic comparison of IA with other transmission
techniques. More specifically, IA is compared with spatial multiplexing and
beamforming and it is shown that IA may not be optimal for some performance
criteria.Comment: 21 pages, 7 figures, submitted to IEEE Transactions on Signal
Processin
Physical Layer Security in Integrated Sensing and Communication Systems
The development of integrated sensing and communication (ISAC) systems has been spurred by the growing congestion of the wireless spectrum. The ISAC system detects targets and communicates with downlink cellular users simultaneously. Uniquely for such scenarios, radar targets are regarded as potential eavesdroppers which might surveil the information sent from the base station (BS) to communication users (CUs) via the radar probing signal. To address this issue, we propose security solutions for ISAC systems to prevent confidential information from being intercepted by radar targets.
In this thesis, we firstly present a beamformer design algorithm assisted by artificial noise (AN), which aims to minimize the signal-to-noise ratio (SNR) at the target while ensuring the quality of service (QoS) of legitimate receivers. Furthermore, to reduce the power consumed by AN, we apply the directional modulation (DM) approach to exploit constructive interference (CI). In this case, the optimization problem is designed to maximize the SINR of the target reflected echoes with CI constraints for each CU, while constraining the received symbols at the target in the destructive region.
Apart from the separate functionalities of radar and communication systems above, we investigate sensing-aided physical layer security (PLS), where the ISAC BS first emits an omnidirectional waveform to search for and estimate target directions. Then, we formulate a weighted optimization problem to simultaneously maximize the secrecy rate and minimize the Cram\'er-Rao bound (CRB) with the aid of the AN, designing a beampattern with a wide main beam covering all possible angles of targets. The main beam width of the next iteration depends on the optimal CRB. In this way, the sensing and security functionalities provide mutual benefits, resulting in the improvement of mutual performances with every iteration of the optimization, until convergence.
Overall, numerical results show the effectiveness of the ISAC security designs through the deployment of AN-aided secrecy rate maximization and CI techniques. The sensing-assisted PLS scheme offers a new approach for obtaining channel information of eavesdroppers, which is treated as a limitation of conventional PLS studies. This design gains mutual benefits in both single and multi-target scenarios
On the Ergodic Achievable Rates of Spectrum Sharing Networks with Finite Backlogged Primary Users and an Interference Indicator Signal
Spectrum sharing networks are communication setups in which unlicensed secondary users (SUs) are permitted to work within the spectrum resources of licensed primary users (PUs). This paper aims to study the ergodic achievable rates of spectrum sharing networks with finite backlogged primary user and an interference indicator signal. Here, in contrast to the standard interference-avoiding schemes, the secondary user activity is not restricted within the primary user inactive periods. Considering both fading and nonfading channels, the unlicensed user ergodic achievable rate is obtained for different unlicensed user transmission power and licensed user received interference power or signal-to-interference-and-noise (SINR) constraints. In the case of fading channels, the results are obtained for both short-and long-term primary user quality-of-service requirements. Further, the results are generalized to the case of multiple interfering users. In terms of unlicensed user ergodic achievable rate, analytical results indicate that while the standard interference-avoiding approach is the optimal transmission scheme at low secondary user or high primary user transmission powers, higher rates can be achieved via simultaneous transmission at high secondary user SINRs. Moreover, numerical results show that, using an interference indicator signal, there is considerable potential for data transmission of unlicensed users under different licensed users quality-of-service requirements
Achievable rates of full-duplex MIMO radios in fast fading channels with imperfect channel estimation
We study the theoretical performance of two full-duplex multiple-input multiple-output (MIMO) radio systems: a full-duplex bi-directional communication system and a full-duplex relay system. We focus on the effect of a (digitally manageable) residual self-interference due to imperfect channel estimation (with independent and identically distributed (i.i.d.) Gaussian channel estimation error) and transmitter noise. We assume that the instantaneous channel state information (CSI) is not available the transmitters. To maximize the system ergodic mutual information, which is a non-convex function of power allocation vectors at the nodes, a gradient projection algorithm is developed to optimize the power allocation vectors. This algorithm exploits both spatial and temporal freedoms of the source covariance matrices of the MIMO links between transmitters and receivers to achieve higher sum ergodic mutual information. It is observed through simulations that the full-duplex mode is optimal when the nominal self-interference is low, and the half-duplex mode is optimal when the nominal self-interference is high. In addition to an exact closed-form ergodic mutual information expression, we introduce a much simpler asymptotic closed-form ergodic mutual information expression, which in turn simplifies the computation of the power allocation vectors
Optimization of a Power Splitting Protocol for Two-Way Multiple Energy Harvesting Relay System
Energy harvesting (EH) combined with cooperative communications constitutes a
promising solution for future wireless technologies. They enable additional
efficiency and increased lifetime to wireless networks. This paper investigates
a multiple-relay selection scheme for an EH-based two-way relaying (TWR)
system. All relays are considered as EH nodes that harvest energy from
renewable energy and radio frequency (RF) sources. Some of them are selected to
forward data to the destinations. The power splitting (PS) protocol, by which
the EH node splits the input RF signal into two components for EH and
information transmission, is adopted at the relay nodes. The objective is to
jointly optimize i) the set of selected relays, ii) their PS ratios, and iii)
their transmit power levels in order to maximize data rate-based utilities over
multiple coherent time slots. A joint-optimization solution based on geometric
programming (GP) and binary particle swarm optimization is proposed to solve
non-convex problems for two utility functions reflecting the level of fairness
in the TWR transmission. Numerical results illustrate the system's behavior
versus various parameters and show that the performance of the proposed scheme
is very close to that of the optimal branch-and-bound method and that GP
outperforms the dual problem-based method
Secure Transmission Design for Cognitive Radio Networks With Poisson Distributed Eavesdroppers
In this paper, we study physical layer security
in an underlay cognitive radio (CR) network. We consider
the problem of secure communication between a secondary
transmitter-receiver pair in the presence of randomly distributed
eavesdroppers under an interference constraint set by the primary
user. For different channel knowledge assumptions at the
transmitter, we design four transmission protocols to achieve the
secure transmission in the CR network. We give a comprehensive
performance analysis for each protocol in terms of transmission
delay, security, reliability, and the overall secrecy throughput.
Furthermore, we determine the optimal design parameter for
each transmission protocol by solving the optimization problem
of maximizing the secrecy throughput subject to both security
and reliability constraints. Numerical results illustrate the performance
comparison between different transmission protocols.ARC Discovery Projects Grant DP15010390
Secure Directional Modulation with Few-Bit Phase Shifters: Optimal and Iterative-Closed-Form Designs
In this paper, directional modulation (DM) is investigated to enhance physical layer security. Practical transmitter designs are exploited under imperfect channel state information (CSI) and hardware constraints, such as finite-resolution phase shifters (PSs) and per-antenna power budget. Tailored for the practical issues in realizing DM, a series of practical scenarios are investigated. Starting from the scenario where eavesdroppers (Eve)s’ information is completely unknown, corresponding designs are proposed to optimize legitimate users (LU)s’ receiving performance while randomizing the Eves’ received signal. When the Eves’ CSI is imperfectly known, in the second scenario, the Eves’ receiving performance is further deteriorated by imposing destructive interference to the Eves. For each scenario, three algorithms are proposed under hardware constraints and imperfect CSI, i.e. one direct-mapping algorithm suitable for high/moderate number of bits in PSs, one heuristic algorithm with improved receiving performance at the cost of complexity, and one iterative-closed-form algorithm with enhanced practicality of symbol-level based DM. Simulation demonstrates that the algorithms achieve lower symbol error rate (SER) at the LUs while significantly deteriorating the Eves’ SER, leading to an improved secrecy throughput over the benchmarks
- …