Stochastic Transceiver Optimization in Multi-Tags Symbiotic Radio Systems

Xihan Chen, Hei Victor Cheng, Kaiming Shen, An Liu, Min-Jian Zhao

Abstract

Symbiotic radio (SR) is emerging as a spectrum- and energy-efficient communication paradigm for future passive Internet-of-things (IoT), where some single-antenna backscatter devices, referred to as Tags, are parasitic in an active primary transmission. The primary transceiver is designed to assist both direct-link (DL) and backscatter-link (BL) communication. In multi-tags SR systems, the transceiver designs become much more complicated due to the presence of DL and inter-Tag interference, which further poses new challenges to the availability and reliability of DL and BL transmission. To overcome these challenges, we formulate the stochastic optimization of transceiver design as the general network utility maximization problem (GUMP). The resultant problem is a stochastic multiple-ratio fractional non-convex problem, and consequently challenging to solve. By leveraging some fractional programming techniques, we tailor a surrogate function with the specific structure and subsequently develop a batch stochastic parallel decomposition (BSPD) algorithm, which is shown to converge to stationary solutions of the GNUMP. Simulation results verify the effectiveness of the proposed algorithm by numerical examples in terms of the achieved system throughput.

Introduction

The Internet of Things (IoT) faces a dual crisis: battery life and spectrum scarcity. Symbiotic Radio (SR) is a promising solution where passive "Tags" (like smart sensors) do not generate their own radio waves; instead, they "hitchhike" on the signals of an active primary transmitter (PT), such as a WiFi router. However, moving from a single-tag to a multi-tag system creates significant interference challenges. The primary signal interferes with the tags, and the tags interfere with each other. Furthermore, these tags are too simple to perform complex tasks like adaptive coding. Existing optimization methods often require real-time knowledge of every tag's symbol—a feat that is practically impossible due to signaling overhead. The challenge is to optimize the system using only statistical information while guaranteeing a minimum Quality of Service (SINR) for every device.

System Model

The system consists of a Primary Transmitter (PT) with multiple antennas, a Primary Receiver (PR), and $K$ single-antenna passive tags. The PT transmits a primary signal which is received by the PR via a direct-link (DL) channel. Simultaneously, each tag backscatters the incident primary signal to the PR via a backscatter-link (BL) channel.

Figure 1: System model of a Multi-Tags Symbiotic Radio System showing the direct-link and backscatter-link channels.

As shown in the system model, the relationship is symbiotic: while tags use the primary signal to transmit their own data, the backscattered signals provide additional multipath components that the primary receiver can use to improve the main signal's decoding. The signal structure is discretized into timeslots within the channel coherence time, where each timeslot consists of $L$ symbols transmitted from the PT.

Figure 3: Frame structure and signal discretization for the primary signal and multiple tag signals within a channel coherence time.

Proposed Methodology

The authors formulate the optimization as a General Network Utility Maximization Problem (GUMP). To solve this non-convex stochastic problem, they employ several sophisticated techniques:

  • Barrier Method: Instead of treating minimum SINR requirements as "hard" constraints, they are incorporated into the objective function using a logarithmic barrier. This penalizes the system as it approaches the SINR threshold, ensuring QoS with high accuracy.
  • Fractional Programming (FP): The SINR equations are ratios of non-convex functions. The authors use FP techniques to transform these into a more manageable "surrogate" function that preserves the underlying problem structure.
  • BSPD Algorithm: The core contribution is the Batch Stochastic Parallel Decomposition (BSPD) algorithm. It processes data in "mini-batches" to estimate the expected values of the random wireless channels.
  • Decoupling: The algorithm is designed so that the optimization of the transmit beamforming (at the PT) and the receive beamforming (at the PR) can be solved independently and in parallel, greatly reducing computational lag.

Key Results and Discussion

Simulation results, based on a PT with 64 antennas and 4 passive tags, demonstrate the effectiveness of the BSPD algorithm:

  • Throughput and Reliability: The proposed scheme achieved a DL transmission rate of 6.167 bps/Hz, significantly outperforming standard benchmarks like EVD-based beamforming and MMSE receivers. Furthermore, the "Worst-case Tag BER" was reduced to $6.129 \times 10^{-3}$, whereas baseline schemes suffered from much higher error rates.
  • Convergence and Scalability: The BSPD algorithm demonstrated rapid convergence within 30–40 iterations. The performance gap between the proposed scheme and baselines widened as the number of transmit antennas increased, showing that the algorithm effectively leverages large antenna arrays (MIMO).
  • Statistical Efficiency: By optimizing based on the statistics of the tag symbols rather than their real-time values, the framework bypasses the massive signaling overhead typically associated with multi-tag backscatter systems.

Conclusion

This framework provides a robust solution for managing interference in multi-tag symbiotic radio environments. While the current model assumes perfect direct-link interference cancellation and block-fading channels, it establishes a foundation for future work in high-mobility environments and higher-order modulation for passive tags. The results confirm that symbiotic radio can significantly enhance both spectrum and energy efficiency for the next generation of IoT devices.

Summary updated

Abstract

Symbiotic radio (SR) is emerging as a spectrum- and energy-efficient communication paradigm for future passive Internet-of-things (IoT), where some single-antenna backscatter devices, referred to as Tags, are parasitic in an active primary transmission. The primary transceiver is designed to assist both direct-link (DL) and backscatter-link (BL) communication. In multi-tags SR systems, the transceiver designs become much more complicated due to the presence of DL and inter-Tag interference, which further poses new challenges to the availability and reliability of DL and BL transmission. To overcome these challenges, we formulate the stochastic optimization of transceiver design as the general network utility maximization problem (GUMP). The resultant problem is a stochastic multiple-ratio fractional non-convex problem, and consequently challenging to solve. By leveraging some fractional programming techniques, we tailor a surrogate function with the specific structure and subsequently develop a batch stochastic parallel decomposition (BSPD) algorithm, which is shown to converge to stationary solutions of the GNUMP. Simulation results verify the effectiveness of the proposed algorithm by numerical examples in terms of the achieved system throughput.
BibTeX
@article{chen2020stochastic,
  author = {Xihan Chen and Hei Victor Cheng and Kaiming Shen and An Liu and Min-Jian Zhao},
  title = {{Stochastic Transceiver Optimization in Multi-Tags Symbiotic Radio Systems}},
  journal = {IEEE Internet of Things Journal},
  year = {2020},
  url = {https://openreview.net/forum?id=pGSWUwG-WBH},
}
Figure