Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2509.14567

Resource Allocation for Mutualistic Symbiotic Radio with Hybrid Active-Passive Communications

Hong Guo·Yinghui Ye·Haijian Sun·Liqin Shi·Rose Qingyang Hu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Mutualistic SR is a communication paradigm that offers high spectrum efficiency and low power consumption, where the SU transmits information by modulating and backscattering the PT's signal, enabling shared use of spectrum and power with PT. In return, the PT's performance can be enhanced by SU's backscattered signal, forming a mutualistic relationship. However, the low modulation rate causes extremely inferior transmission rates for SUs. To improve the SU transmission rate, this paper proposes a new mutualistic SR with HAPC to explore the tradeoff between BC and AC in terms of power consumption and transmission rate, enabling each SU to transmit signal via passive BC and AC alternatively. We propose two problems to maximize the total rate of all SUs under the fixed and dynamic SIC ordering, respectively. The fixed SIC ordering-based problem is to jointly optimize the SUs' reflection coefficients, the transmit power of each SU during AC, and the time allocation for each SU during BC and AC, subject to the energy causality constraint and the PT's transmission rate gain constraint. In addition to pondering the constraints involved in the fixed SIC ordering-based problem, the dynamic SIC ordering-based problem, which is a mixed integer programming one, further considers the SIC ordering constraint. The above two problems are solved by our proposed SCA-based and BCD-based iterative algorithms, respectively. Simulation results demonstrate that: 1) the proposed mutualistic SR system outperforms traditional designs in terms of the rates achieved by SUs under the same constraints; 2) the total rate of all SUs under the dynamic SIC ordering is larger than that of the fixed one when the PT's minimum rate gain is high, and becomes nearly identical when the PT's minimum rate gain is low.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hong Guo, Yinghui Ye, Haijian Sun, Liqin Shi, Rose Qingyang Hu. 2025-09-18. Resource Allocation for Mutualistic Symbiotic Radio with Hybrid Active-Passive Communications. https://doi.org/10.1109/tccn.2025.3612686

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Beyond the "G" Frontier: A Time Traveler's Century-Long Vision for Wireless Intelligence

This article travels one century into the future--from 2025 to 2125--through the analytical lens of the Information--Curvature Efficiency Law (ICEL), an organizing ansatz that reframes wireless capacity around the curvature of the information manifold. It contends that wireless evolution will not proceed through incremental generations such as 6G or 7G, but through a curvature-managed integration of electromagnetics, biology, and thermodynamics. The technical instantiation of ICEL for phase-coded continuous apertures--where curvature is realized as the affine-quotient second derivative of the aperture phase, with a compact synthesis operator and a Fredholm-determinant capacity--is developed rigorously in a companion theory paper and stress-tested against SVD, Fourier, Zernike-like, matched-focus, and RIS baselines in a companion benchmark paper. The present essay supplies the physical intuition, the century-scale narrative, and a set of cross-domain extensions (biology, thermodynamics, ecology) that are explicitly labeled as illustrative extrapolations, not independent derivations.

cs.IT↗
arXiv2026

New lower bounds for kissing numbers in dimensions $25$--$31$

The kissing number in dimension $d$ is the largest number of non-overlapping congruent spheres that can simultaneously touch a central sphere of the same size. We study dimensions $25$-$31$, where the best previous constructions are based on Leech lifting from the optimal kissing configuration in dimension $24$. Our method exploits the absence of contacts between the unlifted bulk and the block consisting of lifted and auxiliary vectors. Rotating this block while keeping the bulk fixed creates room for two antipodal points in dimensions $26$, $27$, and $28$, and one point in dimension $29$. Three further modifications yield improvements in dimensions $25$, $30$ and $31$: (a) a nonorthogonal diagonal linear deformation of the lifted block admits two antipodal points in dimension $25$; (b) rotating the additional coordinates of the lifted vectors and then applying a small orthogonal transformation to the resulting lifted block as a whole admits two antipodal points in dimension $30$; (c) rotating only the additional coordinates of the lifted vectors admits four nonantipodal points in dimension $31$. Together, these constructions yield the new lower bounds $τ_{25}\geq 197058$, $τ_{26}\geq 198552$, $τ_{27}\geq 200046$, $τ_{28}\geq 204522$, $τ_{29}\geq 209497$, $τ_{30}\ge 220442$, and $τ_{31}\geq 238354$.

cs.IT↗
arXiv2026

Minimum distances of primitive narrow-sense BCH codes via good zero-sets

Determining the exact minimum distances of BCH codes remains a open problem. We establish the minimum distances of several families of primitive narrow-sense BCH codes, showing that they attain their designed distances. Our approach centers on $\mathbb{F}_q$-good zero-sets, which we introduce through a derivative condition on their vanishing polynomials. We show that a $q$-ary primitive narrow-sense BCH code of length $q^m-1$ and designed distance $2\leqδ\leq q^m-1$ has minimum distance $δ$ if and only if there exists an $\mathbb{F}_q$-good zero-set of cardinality $δ+1$ in the finite field $\mathbb{F}_{q^m}$ with $q^m$ elements. To construct $\mathbb{F}_q$-good zero-sets, we develop several methods based on polynomial substitutions, power maps, and shifted inverses, as well as direct constructions using polynomials of special forms. Together with suitable initial $\mathbb{F}_q$-good zero-sets, including those arising from known minimum-distance results, these methods yield new good zero-sets of various cardinalities and hence families of primitive narrow-sense BCH codes whose minimum distances equal their designed distances. These families cover a broad range of designed distances, with several known minimum-distance results recovered as special cases.

cs.IT↗