In wireless network design, researchers frequently face a daunting mathematical reality: modeling how electromagnetic waves propagate and interact in physical space is incredibly complex. When multiple transmitters and receivers operate simultaneously, managing interference requires solving high-dimensional, non-convex optimization problems.
To make large-scale network problems tractable, researchers widely adopt a fundamental simplification: the single-antenna constraint. By assuming that devices operate in a Single-Input Single-Output (SISO) configuration, the spatial dimensions of the communication channel collapse. This turns complex matrix algebra into manageable scalar math, allowing researchers to isolate and optimize high-level network architectures—such as edge caching, non-orthogonal multiple access (NOMA), and intelligent reflecting surfaces—without getting bogged down by the overwhelming complexity of multi-antenna beamforming.
The Tractability of the Scalar Channel
Why start with a single antenna? In a wireless link where both the transmitter and receiver possess only one antenna, the channel state can be represented as a simple scalar value, $h$. The received signal is merely the transmitted signal multiplied by this scalar, plus noise ($y = hx + n$). When multiple base stations and users enter the mix, interference behaves as a straightforward additive sum of scalar powers.
This simplification is incredibly powerful when optimizing network-wide logic, such as user association or admission control. For example, in dense heterogeneous networks (HetNets) where macro towers and small cells overlap, determining which user should connect to which tower to ensure fairness is highly non-linear. Mingyi Hong et al. demonstrated that by enforcing a single-antenna transceiver assumption, it is possible to rigorously map out the computational complexity of max-min fairness and base station association without the confounding variables of spatial multiplexing (Joint Downlink Base Station Association and Power Control for Max-Min Fairness: Computation and Complexity).
Similarly, Tony Q. S. Quek et al. leveraged single-antenna models for small cell access points to apply random matrix theory to large-system analysis (Heterogeneous Cellular Networks Using Wireless Backhaul: Fast Admission Control and Large System Analysis). This abstraction allowed the authors to design fast admission control algorithms based purely on long-term statistical channel data, bypassing the need to track rapidly changing instantaneous multi-antenna signals.
Simplifying Interference in Caching and Scheduling
The single-antenna constraint is particularly useful in content delivery and edge caching research. Here, the primary challenge is combinatorial: deciding which files to store at which base stations to minimize user latency. If base stations use multiple antennas, the interference they cause to neighboring cells depends on the exact directional alignment of their beamforming vectors, making the caching problem nearly impossible to solve directly.
Multi-Antenna (MIMO): Interference = Vector Alignment & Matrix Math (High Complexity)
Single-Antenna (SISO): Interference = Simple Scalar Sum of Powers (Tractable Optimization)
By abstracting the physical layer down to a single antenna, researchers can focus entirely on the mechanics of content placement and scheduling:
- Backhaul Optimization: Xi Peng et al. developed low-complexity, backhaul-aware caching strategies by assuming single-antenna transceivers, successfully isolating the interplay between physical fading and backhaul propagation delays (Backhaul-Aware Caching Placement for Wireless Networks).
- Topology and Scheduling: Richard Combes et al. proved that a simple scheduling rule is mathematically optimal for coded caching in general topologies by utilizing single-antenna base stations to keep interference management straightforward (Utility Optimal Scheduling for Coded Caching in General Topologies).
- Network Trade-offs: Ejder Baştuǧ et al. used single-antenna nodes to cleanly analyze the non-linear trade-offs between coverage, capacity, and backhaul splitting in cache-enabled cellular networks (Edge caching for coverage and capacity-aided heterogeneous networks).
- Cooperative Transmission: When multiple base stations cooperate to transmit cached files, a single-antenna model allows researchers to evaluate successful delivery probabilities without the heavy overhead of multi-antenna precoding, as shown by Tianming Feng et al. (Performance Analysis for Cache-enabled Cellular Networks with Cooperative Transmission).
Isolating Core Mechanisms in NOMA and RIS
Beyond caching, the single-antenna constraint serves as a vital tool for isolating the core mechanics of emerging transmission technologies, such as Non-Orthogonal Multiple Access (NOMA) and Reconfigurable Intelligent Surfaces (RIS).
NOMA allows multiple users to share the exact same frequency and time slot by separating their signals in the power domain rather than the frequency or time domains. However, if nodes have multiple antennas, spatial multiplexing introduces a space domain separation. To understand pure power-domain NOMA without these overlapping effects, researchers rely on single-antenna assumptions. Xinwei Yue et al. used this exact simplification to establish a clean mathematical foundation for comparing different branches of the NOMA framework (Outage Performance of A Unified Non-Orthogonal Multiple Access Framework).
When NOMA is combined with low-power hardware like ambient backscatter sensors, the optimization landscape becomes even more intricate. Zhiguo Ding et al. proposed a hybrid architecture (BAC-NOMA) for 6G massive machine-type communications, utilizing single-antenna nodes to demonstrate how battery-less uplink sensors can share spectrum with primary downlink users without requiring immediate directional beamforming (On the Application of BAC-NOMA to 6G umMTC). Similarly, Xingwang Li et al. evaluated the physical layer security of backscatter NOMA systems under hardware flaws like I/Q imbalance, using single-antenna models to isolate how hardware imperfections paradoxically make signals harder for eavesdroppers to intercept (Secrecy Analysis of Ambient Backscatter NOMA Systems under I/Q Imbalance).
Joint Optimization Space:
[Base Station Precoding] <---> [RIS Phase Shifts] <---> [User Power Allocation]
| |
(Simplified by Single- (Simplified by Single-
Antenna BS Assumption) Antenna User Assumption)
In RIS-aided networks, an intelligent surface acts as a passive mirror, shifting the phase of incoming waves to boost signals or mitigate interference. Optimizing these passive phase shifts alongside active base station beamforming is notoriously difficult. To make these frameworks solvable, researchers systematically apply single-antenna constraints to different parts of the network:
- Access Point Simplification: Chenyu Wu et al. assumed single-antenna access points to make joint channel assignment and power allocation tractable in simultaneously transmitting and reflecting (STAR)-RIS networks (Resource Allocation in STAR-RIS-Aided Networks: OMA and NOMA).
- Latency Reduction: For ultra-reliable low-latency communications (URLLC), Hailiang Xie et al. focused on single-antenna base stations to isolate how reflective beamforming can be tuned to minimize total transmission latency for user groups (User Grouping and Reflective Beamforming for IRS-Aided URLLC).
- Receiver Simplification: Ming-Min Zhao et al. designed a two-timescale optimization framework for secure data and power transmission, assuming single-antenna receivers to prevent the computational complexity of joint beamforming and surface optimization from becoming prohibitive (Secrecy Rate Maximization of RIS-assisted SWIPT Systems: A Two-Timescale Beamforming Design Approach).
- User Equipment Simplification: To maximize the sum-rate in multi-RIS networks, Konstantinos D. Katsanos et al. restricted user equipment to a single antenna, avoiding the intricate multi-antenna user interference that complicates distributed precoder and surface design (Multi-RIS-Empowered Multiple Access: A Distributed Sum-Rate Maximization Approach).
The Frontier: Joint Functions and the Cost of Simplification
As wireless networks evolve to support joint functions—such as combining communication with edge computing or radar sensing—the single-antenna constraint remains a vital stepping stone for initial framework designs.
In Semi-Federated Learning (SemiFL), where edge devices simultaneously upload local machine learning gradients and raw data samples to a base station, managing the communication-computation trade-off is highly complex. Jingheng Zheng et al. designed a joint transceiver framework by assuming single-antenna devices, allowing them to analyze learning convergence without the added burden of managing multi-antenna interference between aggregated gradients and individual data streams (Semi-Federated Learning: Convergence Analysis and Optimization of a Hybrid Learning Framework). Similarly, in Integrated Sensing and Communication (ISAC) systems where the same signal tracks physical targets and transmits data, Chao Zhang et al. utilized a basic SISO model to establish baseline interference patterns and resource sharing rules between radar and communication bands (Semi-Integrated-Sensing-and-Communication (Semi-ISaC) Networks Assisted by NOMA).
The Catch: What Do We Lose?
While the single-antenna constraint makes these diverse problems solvable, it comes at a significant cost. Real-world 5G and 6G networks rely heavily on Multiple-Input Multiple-Output (MIMO) and Massive MIMO architectures. By collapsing the spatial dimension, single-antenna models completely miss out on critical physical-layer capabilities:
- Directional Beamforming: The ability to focus radiation beams directly toward a intended user, minimizing leakage to others.
- Spatial Multiplexing: Transmitting multiple independent data streams over the same frequency resource simultaneously.
- Spatial Interference Suppression: Using multi-antenna receiver arrays to actively null out interfering signals from neighboring cells.
When researchers transition these single-antenna frameworks to multi-antenna systems, the underlying mathematics undergoes a radical shift. Scalar variables become high-dimensional matrices, and optimization objectives lose their convexity. Furthermore, multi-antenna systems demand sophisticated precoding strategies and introduce heavy overhead for acquiring accurate Channel State Information (CSI). Consequently, while the single-antenna constraint is an indispensable tool for building initial intuition and proving theoretical bounds, bridging the gap to multi-antenna reality remains one of the most active and computationally challenging frontiers in wireless research.
Key Foundational Work
Joint Downlink Base Station Association and Power Control for Max-Min Fairness: Computation and Complexity (2014) — contributed 1 concept elements to this direction.
Backhaul-Aware Caching Placement for Wireless Networks (2015) — contributed 1 concept elements to this direction.
Heterogeneous Cellular Networks Using Wireless Backhaul: Fast Admission Control and Large System Analysis (2015) — contributed 1 concept elements to this direction.