An official website of the United States government
In this paper, we investigate the potential of employing reconfigurable intelligent surface (RIS) in integrated sensing and communication (ISAC) systems. In particular, we consider an RIS-assisted ISAC system in which a multi-antenna base station (BS) simultaneously performs multi-user multi-input single-output (MU-MISO) communication and target detection. We aim to jointly design the transmit beamforming and receive filter of the BS, and the reflection coefficients of the RIS to maximize the sum-rate of the communication users, while satisfying a worst-case radar output signal-to-noise ratio (SNR), the transmit power constraint, and the unit modulus property of the reflecting coefficients. An efficient iterative algorithm based on fractional programming (FP), majorization-minimization (MM), and alternative direction method of multipliers (ADMM) is developed to solve the complicated non-convex problem. Simulation results verify the advantage of the proposed RIS-assisted ISAC scheme and the effectiveness of the developed algorithm.
more »
« less
SCA-Based Beamforming Optimization for IRS-Enabled Secure Integrated Sensing and Communication
Integrated sensing and communication (ISAC) is expected to be offered as a fundamental service in the upcoming sixth-generation (6G) communications standard. However, due to the exposure of information-bearing signals to the sensing targets, ISAC poses unique security challenges. In recent years, intelligent reflecting surfaces (IRSs) have emerged as a novel hardware technology capable of enhancing the physical layer security of wireless communication systems. Therefore, in this paper, we consider the problem of transmit and reflective beamforming design in a secure IRS-enabled ISAC system to maximize the beampattern gain at the target. The formulated non-convex optimization problem is challenging to solve due to the intricate coupling between the design variables. Moreover, alternating optimization (AO) based methods are inefficient in finding a solution in such scenarios, and convergence to a stationary point is not theoretically guaranteed. Therefore, we propose a novel successive convex approximation (SCA)-based second-order cone programming (SOCP) scheme in which all of the design variables are updated simultaneously in each iteration. The proposed SCA-based method significantly outperforms a penalty-based benchmark scheme previously proposed in this context. Moreover, we also present a detailed complexity analysis of the proposed scheme, and show that despite having slightly higher per-iteration complexity than the benchmark approach the average problem-solving time of the proposed method is notably lower than that of the benchmark scheme.
more »
« less
- PAR ID:
- 10517896
- Publisher / Repository:
- IEEE
- Date Published:
- Journal Name:
- Proc. GLOBECOM 2023 - 2023 IEEE Global Communications Conference
- ISBN:
- 979-8-3503-1090-0
- Page Range / eLocation ID:
- 5992 to 5997
- Format(s):
- Medium: X
- Location:
- Kuala Lumpur, Malaysia
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Integrated sensing and communication (ISAC) is a key enabling technique for future wireless networks owing to its efficient hardware and spectrum utilization. In this paper, we focus on dual-functional waveform design for a multi-input multi-output (MIMO) orthogonal frequency division multiplexing (OFDM) ISAC system, which is considered to be a promising solution for practical deployment. Since the dual-functional waveform carries communication information, its random nature leads to high range-Doppler sidelobes in the ambiguity function, which in turn degrades radar sensing performance. To suppress range- Doppler sidelobes, we propose a novel symbol-level precoding (SLP)-based waveform design for MIMO-OFDM ISAC systems by fully exploiting the available temporal degrees of freedom. Our goal is to minimize the range-Doppler integrated sidelobe level (ISL) while satisfying the constraints of target illumination power, multi-user communication quality of service (QoS), and constant-modulus transmission. To solve the resulting non-convex waveform design problem, we develop an efficient algorithm using the majorization-minimization (MM) and alternative direction method of multipliers (ADMM) methods. Simulation results show that the proposed waveform has significantly reduced range-Doppler sidelobes compared with signals designed only for communications and other baselines. In addition, the proposed waveform design achieves target detection and estimation performance close to that achievable by waveforms designed only for radar, which demonstrates the superiority of the proposed SLP-based ISAC approach.more » « less
-
Integrated sensing and communication (ISAC) systems traditionally presuppose that sensing and communication (S&C) channels remain approximately constant during their coherence time. However, a “DISCO” reconfigurable intelligent surface (DRIS), i.e., an illegitimate RIS with random, time-varying reflection properties that acts like a “disco ball,” introduces a paradigm shift that enables active channel aging more rapidly during the channel coherence time. In this letter, we investigate the impact of DISCO jamming attacks launched by a DRIS-based fully-passive jammer (FPJ) on an ISAC system. Specifically, an ISAC problem formulation and a corresponding waveform optimization are presented in which the ISAC waveform design considers the trade-off between the S&C performance and is formulated as a Pareto optimization problem. Moreover, a theoretical analysis is conducted to quantify the impact of DISCO jamming attacks. Numerical results are presented to evaluate the S&C performance under DISCO jamming attacks and to validate the derived theoretical analysis.more » « less
-
In this paper, an intelligent reflecting surface (IRS) is leveraged to enhance the physical layer security of an integrated sensing and communication (ISAC) system in which the IRS is deployed to not only assist the downlink communication for multiple users, but also create a virtual line-of-sight (LoS) link for target sensing. In particular, we consider a challenging scenario where the target may be a suspicious eavesdropper that potentially intercepts the communication-user information transmitted by the base station (BS). To ensure the sensing quality while preventing the eavesdropping, dedicated sensing signals are transmitted by the BS. We investigate the joint design of the phase shifts at the IRS and the communication as well as radar beamformers at the BS to maximize the sensing beampattern gain towards the target, subject to the maximum information leakage to the eavesdropping target and the minimum signal-to-interference-plus-noise ratio (SINR) required by users. Based on the availability of perfect channel state information (CSI) of all involved user links and the potential target location of interest at the BS, two scenarios are considered and two different optimization algorithms are proposed. For the ideal scenario where the CSI of the user links and the potential target location are perfectly known at the BS, a penalty-based algorithm is proposed to obtain a high-quality solution. In particular, the beamformers are obtained with a semi-closed-form solution using Lagrange duality and the IRS phase shifts are solved for in closed form by applying the majorization-minimization (MM) method. On the other hand, for the more practical scenario where the CSI is imperfect and the potential target location is uncertain in a region of interest, a robust algorithm based on the $$\cal S$$ -procedure and sign-definiteness approaches is proposed. Simulation results demonstrate the effectiveness of the proposed scheme in achieving a trade-off between the communication quality and the sensing quality, and also show the tremendous potential of IRS for use in sensing and improving the security of ISAC systems.more » « less
-
In this paper, we focus on simple bilevel optimization problems, where we minimize a convex smooth objective function over the optimal solution set of another convex smooth constrained optimization problem. We present a novel bilevel optimization method that locally approximates the solution set of the lower-level problem using a cutting plane approach and employs an accelerated gradient-based update to reduce the upper-level objective function over the approximated solution set. We measure the performance of our method in terms of suboptimality and infeasibility errors and provide non-asymptotic convergence guarantees for both error criteria. Specifically, when the feasible set is compact, we show that our method requires at most (max{1/ϵf‾‾√,1/ϵg}) iterations to find a solution that is ϵf-suboptimal and ϵg-infeasible. Moreover, under the additional assumption that the lower-level objective satisfies the r-th Hölderian error bound, we show that our method achieves an iteration complexity of (max{ϵ−2r−12rf,ϵ−2r−12rg}), which matches the optimal complexity of single-level convex constrained optimization when r=1.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/GLOBECOM54140.2023.10437283
