The Three Protocols: ES, MS, TS

Three Ways to Split the Energy

The passivity constraint ∣rn∣2+∣tn∣2≀1|r_n|^2 + |t_n|^2 \leq 1 forces the RIS element to decide how to allocate its incident energy between reflection and transmission. Three canonical protocols have emerged in the literature, each corresponding to a different choice of feasibility structure:

  1. Energy Splitting (ES): continuous partition per element.
  2. Mode Switching (MS): each element chooses reflect-only or transmit-only (binary).
  3. Time Switching (TS): all elements operate in one mode at a time, alternating across time.

This section formalizes each protocol, states its feasibility set, and compares their algorithmic and performance properties.

Definition:

Energy-Splitting (ES) Protocol

In the energy-splitting protocol, each element continuously splits its incident energy between reflection and transmission:

anr,ant∈[0,1],(anr)2+(ant)2=1,a_n^r, a_n^t \in [0, 1], \quad (a_n^r)^2 + (a_n^t)^2 = 1,

with phases ΞΈnr,ΞΈnt\theta_n^r, \theta_n^t independently adjustable (or coupled per hardware). The feasible set is the unit complex sphere per element:

{(rn,tn)∈C2:∣rn∣2+∣tn∣2=1}.\{(r_n, t_n) \in \mathbb{C}^2 : |r_n|^2 + |t_n|^2 = 1\}.

Every element contributes to both half-spaces simultaneously. Both user sets Ur,Ut\mathcal{U}^r, \mathcal{U}^t are served in every coherence block.

ES is the most flexible protocol β€” no hard discretization. The (anr,ant)(a_n^r, a_n^t) are real variables on the unit circle (parametrized by a single angle Ξ±n∈[0,Ο€/2]\alpha_n \in [0, \pi/2]: anr=cos⁑αn,ant=sin⁑αna_n^r = \cos\alpha_n, a_n^t = \sin\alpha_n). This extra real variable per element makes ES the highest-performing but also the most complex.

Definition:

Mode-Switching (MS) Protocol

In the mode-switching protocol, each element commits to one mode:

(anr,ant)∈{(1,0),(0,1)},(a_n^r, a_n^t) \in \{(1, 0), (0, 1)\},

i.e., Ξ²n=1\beta_n = 1 (reflect) or Ξ²n=0\beta_n = 0 (transmit), selected per element. The feasible set is the 2-point set per element, or equivalently {0,1}N\{0, 1\}^N for the vector Ξ²\boldsymbol{\beta}.

MS is a combinatorial problem, closer in spirit to discrete beamforming. It has fewer variables (each element has a binary choice + one phase) and can be solved via element assignment heuristics or integer-relaxation methods.

MS is the simplest protocol to implement in hardware: each element is just a switch (PIN diode) that routes incident energy to the reflection or transmission path. No continuous amplitude control is needed. This simplicity comes at a cost: ∼1\sim 1 dB worse than ES at typical NN because the per-element split is restricted to 0 or 1.

Definition:

Time-Switching (TS) Protocol

In the time-switching protocol, the entire RIS panel operates in one mode at a time, alternating across time:

  • Fraction Ο„\tau of the coherence block: all elements reflect (anr=1,ant=0a_n^r = 1, a_n^t = 0).
  • Fraction 1βˆ’Ο„1 - \tau: all elements transmit (anr=0,ant=1a_n^r = 0, a_n^t = 1).

The phases are independently optimizable in each sub-slot. Ur\mathcal{U}^r is served during the reflect-slot with rate penalty factor Ο„\tau; Ut\mathcal{U}^t during the transmit-slot with factor 1βˆ’Ο„1 - \tau.

TS is the easiest to analyze: each sub-slot is a standard passive-RIS problem. The only joint variable is Ο„βˆˆ[0,1]\tau \in [0, 1], optimized separately from the two sub-slot beamformers. TS is strictly suboptimal to ES (because TS is a special case of ES with binary amplitudes over time, while ES has continuous control), but the performance gap is small at large NN.

Theorem: Protocol Performance Hierarchy

For any channel realization and optimization objective (sum rate, max-min, etc.):

RES⋆β‰₯RMS⋆andRES⋆β‰₯RTS⋆.R_{\text{ES}}^\star \geq R_{\text{MS}}^\star \quad \text{and} \quad R_{\text{ES}}^\star \geq R_{\text{TS}}^\star.

RMSR_{\text{MS}} and RTSR_{\text{TS}} are not generally comparable β€” which wins depends on the specific geometry. However, for large NN with symmetric user distributions across the two half-spaces, RMSβ‰ˆRESR_{\text{MS}} \approx R_{\text{ES}} (the combinatorial search approximates the continuous optimum well).

ES is the most general: continuous amplitude split per element per time. MS is ES restricted to {0,1}\{0, 1\} amplitudes. TS is ES restricted to homogeneous (all-elements-same-mode) amplitudes. Hence ES βŠ‡\supseteq MS and ES βŠ‡\supseteq TS. The rates therefore satisfy RESβ‰₯max⁑(RMS,RTS)R_{\text{ES}} \geq \max(R_{\text{MS}}, R_{\text{TS}}).

STAR-RIS Protocol Comparison

PropertyES (Energy Splitting)MS (Mode Switching)TS (Time Switching)
Per-element amplitudeanr,ant∈[0,1]a_n^r, a_n^t \in [0,1] continuous(anr,ant)∈{(1,0),(0,1)}(a_n^r, a_n^t) \in \{(1,0),(0,1)\}All elements same mode per slot
Variables per element3 (amplitude + 2 phases)2 (mode + 1 phase)1 (phase); shared Ο„\tau
Hardware complexityHigh (fine amplitude control)Medium (binary switch)Low (simple on/off panel)
Optimization difficultyNon-convex + continuousMixed-integer (combinatorial)Convex in Ο„\tau; passive subproblems in slots
Rate ordering (typical)Best (upper bound)Close to ES at large NN∼1\sim 1-22 dB below ES
Implementation maturity (2024)Research prototypesCommercial demosStraightforward from passive RIS

Time-Switching STAR-RIS Optimization

Complexity: O(SΟ„β‹…2β‹…Cpassive)O(S_\tau \cdot 2 \cdot C_{\text{passive}}) where SΟ„S_\tau is the Ο„\tau-grid size, typically 20
Input: channels, BS power PtP_t, user sets Ur,Ut\mathcal{U}^r, \mathcal{U}^t.
Output: τ⋆,Ξ¦r,⋆,Ξ¦t,⋆\tau^\star, \boldsymbol{\Phi}^{r,\star}, \boldsymbol{\Phi}^{t,\star}, precoders.
1. For each Ο„βˆˆ[0,1]\tau \in [0, 1] (bisect or grid-search):
2. \quad Sub-slot 1 (reflection): solve passive-RIS problem for Ur\mathcal{U}^r β†’ (Wr,Ξ¦r,⋆)(\mathbf{W}^{r}, \boldsymbol{\Phi}^{r,\star}).
3. \quad Sub-slot 2 (transmission): solve passive-RIS problem for Ut\mathcal{U}^t β†’ (Wt,Ξ¦t,⋆)(\mathbf{W}^{t}, \boldsymbol{\Phi}^{t,\star}).
4. \quad Compute total rate R(Ο„)=Ο„βˆ‘k∈UrRkr+(1βˆ’Ο„)βˆ‘k∈UtRktR(\tau) = \tau \sum_{k \in \mathcal{U}^r} R_k^r + (1-\tau) \sum_{k \in \mathcal{U}^t} R_k^t.
5. Pick τ⋆=arg⁑max⁑τR(Ο„)\tau^\star = \arg\max_\tau R(\tau).
6. return τ⋆\tau^\star and the corresponding sub-slot solutions.

TS is the easiest protocol to optimize: the Ο„\tau dimension is 1D and convex given sub-slot optima, and each sub-slot is a standard passive-RIS problem solvable via Chapters 5-7. In practice, 20 Ο„\tau values suffice for fine-grained exploration.

ES vs. MS vs. TS Sum Rate

Compare the achievable sum rate of the three protocols across NN, SNR, and user-set ratio ∣Ur∣/∣Ut∣|\mathcal{U}^r|/|\mathcal{U}^t|. ES dominates; MS approaches ES at large NN; TS trails by a small margin that widens when user sets are imbalanced.

Parameters
64
8
3
3
10

Key Takeaway

Choose your protocol based on hardware, not theory. ES is best in simulation; TS is easiest to deploy. MS sits between: it needs only binary switches per element, yet achieves near-ES performance at typical NN. For commercial deployment in 2024-2025: MS with appropriate element selection is the most common choice. For academic benchmarks and upper bounds: ES.

Common Mistake: Don't Compare Protocols Without Normalization

Mistake:

"TS has rate Ο„Rr+(1βˆ’Ο„)Rt\tau R_r + (1-\tau) R_t; ES has Rr+RtR_r + R_t (both served simultaneously). So ES always beats TS by 2Γ—."

Correction:

This is an apples-to-oranges comparison. TS serves each side only a fraction of the time β€” its achievable rate per user is reduced. ES serves both simultaneously but with split energy per element, so per-user rate is also reduced. The correct comparison is total sum-rate over the full coherence time: in TS, total is Ο„Rr+(1βˆ’Ο„)Rt\tau R_r + (1-\tau) R_t; in ES, total is RrES+RtESR_r^{\text{ES}} + R_t^{\text{ES}}. The ES-TS gap is typically 11-3Β dB3\text{ dB} β€” significant but not the 3 dB naive factor of 2.