The Sensing-Communication Tradeoff

Pareto Boundary: Two Axes, One Panel

The central ISAC question: for a fixed BS + RIS hardware, what combinations of (comm rate, sensing SNR) are achievable? The Pareto boundary describes this: points on the boundary are efficient β€” cannot improve sensing without hurting comm, or vice versa. Off-boundary points are inefficient β€” dominated by some boundary point. This section characterizes the Pareto boundary for RIS-ISAC and describes how to traverse it via the tradeoff parameter Ξ»\lambda.

Definition:

Scalarized RIS-ISAC Problem

The joint RIS-ISAC optimization can be written as a weighted-sum problem:

max⁑W,Ξ¦(1βˆ’Ξ»)β‹…Rcomm(W,Ξ¦)+Ξ»β‹…Rsens(W,Ξ¦)\max_{\mathbf{W}, \boldsymbol{\Phi}} (1 - \lambda) \cdot R_{\text{comm}}(\mathbf{W}, \boldsymbol{\Phi}) + \lambda \cdot R_{\text{sens}}(\mathbf{W}, \boldsymbol{\Phi})

subject to the usual power and unit-modulus constraints. Here:

  • RcommR_{\text{comm}}: sum rate (or average per-user rate).
  • RsensR_{\text{sens}}: sensing "rate" (log-SNR, beampattern fidelity, or βˆ’CRB-\text{CRB}).
  • λ∈[0,1]\lambda \in [0, 1]: tradeoff parameter.

λ=0\lambda = 0: pure communication (Chapter 5's problem). λ=1\lambda = 1: pure sensing. λ∈(0,1)\lambda \in (0, 1): balanced dual-function design.

Varying Ξ»\lambda traces out the Pareto boundary of the achievable (comm, sensing) region.

Theorem: Pareto Boundary of RIS-ISAC

Let FRISISAC\mathcal{F}^{\text{ISAC}}_{\text{RIS}} and Fno-RISISAC\mathcal{F}^{\text{ISAC}}_{\text{no-RIS}} denote the achievable (Rcomm,Rsens)(R_{\text{comm}}, R_{\text{sens}}) regions with and without RIS. Then:

  1. Fno-RISISACβŠ†FRISISAC\mathcal{F}^{\text{ISAC}}_{\text{no-RIS}} \subseteq \mathcal{F}^{\text{ISAC}}_{\text{RIS}} (RIS is never worse).
  2. For any λ∈[0,1]\lambda \in [0, 1] and solution on the Pareto boundary, the RIS-aided boundary point dominates the no-RIS point.
  3. The Pareto boundary is convex (RIS contributions sum, not compete): the RIS-aided region is a convex expansion of the no-RIS region.

In particular: at any fixed Rcomm⋆R_{\text{comm}}^\star, the RIS boosts achievable RsensR_{\text{sens}} by a factor up to N4N^4 (via Theorem 13.1). And at any fixed Rsens⋆R_{\text{sens}}^\star, the RIS boosts achievable RcommR_{\text{comm}} by up to N2N^2.

For each Ξ»\lambda, the scalarized problem's optimum gives one Pareto-boundary point. Sweeping Ξ»\lambda from 0 to 1 traces the complete Pareto frontier. With the RIS, the frontier expands outward: every (Ξ»,Rcomm,Rsens)(\lambda, R_{\text{comm}}, R_{\text{sens}}) achievable without RIS is also achievable with RIS, plus additional points dominated only by the RIS-augmented solution.

Pareto Frontier: Comm Rate vs. Sensing SNR

Traverse the Pareto frontier by varying Ξ»\lambda. The RIS-aided frontier is pushed outward compared to no-RIS. Change NN to see the outward shift grow.

Parameters
128
8
2
10

AO for Scalarized RIS-ISAC

Complexity: O(Tβ‹…(Cactive-AO+Cpassive))O(T \cdot (C_{\text{active-AO}} + C_{\text{passive}})); typical T = 15-25
Input: channels, target angle θt\boldsymbol{\theta}_t, λ∈[0,1]\lambda \in [0,1], power PtP_t.
Output: (W⋆,Φ⋆)(\mathbf{W}^\star, \boldsymbol{\Phi}^\star) on the Pareto boundary.
1. Initialize Ξ¦(0)\boldsymbol{\Phi}^{(0)}, e.g., all ones.
2. Repeat t=0,1,…t = 0, 1, \ldots:
3. \quad Compute effective channels hk,eff\mathbf{h}_{k,\text{eff}} and sensing channel Hsens\mathbf{H}_{\text{sens}}.
4. \quad Active update: solve
max⁑W(1βˆ’Ξ»)Rcomm+Ξ»Rsens\max_{\mathbf{W}} (1-\lambda) R_{\text{comm}} + \lambda R_{\text{sens}}
s.t. βˆ₯Wβˆ₯2≀Pt\|\mathbf{W}\|^2 \leq P_t.
Use WMMSE for comm; sensing contributes a quadratic term.
Reformulate as SOCP or SDP for convexity.
5. \quad Passive update: solve
max⁑ϕ(1βˆ’Ξ»)Rcomm+Ξ»Rsens\max_{\boldsymbol{\phi}} (1-\lambda) R_{\text{comm}} + \lambda R_{\text{sens}}
s.t. βˆ£Ο•n∣=1|\phi_n| = 1.
Non-convex; use Chapter 6 methods.
6. \quad Check convergence: ∣f(t+1)βˆ’f(t)∣<Ο΅|f^{(t+1)} - f^{(t)}| < \epsilon.
7. return (W,Ξ¦)(\mathbf{W}, \boldsymbol{\Phi}).

One AO iteration is ∼50\sim 50 ms at N=128,K=2N = 128, K = 2 on a modern CPU. Sweeping Ξ»\lambda for the Pareto frontier takes ∼\sim10-20 values Γ—\times 50 ms = 0.5-1 s total β€” offline analysis.

Example: Reading a Pareto Frontier

A RIS-ISAC system has Pareto frontier: Rcomm⋆(Ξ»=0)=5R_{\text{comm}}^{\star}(\lambda = 0) = 5 bits/s/Hz, Rsens⋆(Ξ»=1)=60Β dBR_{\text{sens}}^{\star}(\lambda = 1) = 60\text{ dB} sensing SNR. At Ξ»=0.5\lambda = 0.5 (balanced), what to expect?

Self-Interference in ISAC

A subtle issue: the BS is both transmitter and radar receiver. Its own transmit signal β€” strongly radiated β€” can swamp the (weak) backscattered return. Self-interference must be suppressed, typically by:

  1. Temporal separation: pulse-based radar (listen during silent periods). Loses continuous sensing.
  2. Spatial suppression: RIS-enabled nulling β€” force the RIS to steer the transmit signal away from the radar receive direction. Achievable when the target direction differs from the strong sidelobes.
  3. Dedicated RF chain: separate radar receiver antenna with analog cancellation. Requires hardware upgrade.

The RIS can help with option 2: Ξ¦\boldsymbol{\Phi} is chosen both to focus toward target AND to null toward the receive antennas of the BS's own radar receiver. Adds one more constraint to the joint optimization.

Common Mistake: The Tradeoff Is Not Linear

Mistake:

"At Ξ»=0.5\lambda = 0.5, comm and sensing should each be at half of their full values."

Correction:

The Pareto tradeoff curve is concave, not linear: small weights Ξ»\lambda give disproportionately large sensing gains at small comm cost (and vice versa). The middle of the curve is balanced but both objectives are above half their max values. Reading the curve as linear misses the key ISAC benefit: moderate weighting gives good performance on both axes.