Wireless data performance in multi-cell scenarios

Thomas Bonald, Sem C. Borst, Nidhi Hegde, Alexandre Proutière

Abstract

The performance of wireless data systems has been extensively studied in the context of a single base station. This paper investigates flow-level performance in networks with multiple base stations, specifically examining the complex, dynamic interaction of active flows across cells caused by inter-cell interference. Lower service rates due to interference result in longer delays and more active flows, creating a feedback loop between neighboring base stations. We model this as a network of multi-class processor-sharing queues with time-varying service rates. Given the intractability of exact analysis, we derive insensitive bounds and approximations for key metrics like flow throughput and transfer delays, providing simple expressions that remain robust across varying statistical characteristics.

Introduction: The Challenge of Dynamic Coupling

Most classical studies of wireless performance focus on a single base station in isolation. However, in modern cellular networks, base stations (BSs) are rarely alone; they interfere significantly with their neighbors. This creates a "dynamic coupling" problem: if Base Station A has many active users, it stays active longer, creating more interference for Base Station B. This interference slows down data rates in Cell B, meaning users there take longer to finish their downloads. Consequently, Base Station B stays active longer, which then continues to interfere with Base Station A.

This feedback loop makes the system incredibly difficult to analyze mathematically—even a simple two-cell model is considered "barely tractable." This research provides a mathematical framework to predict performance in these interfering environments by modeling the system as a network of processor-sharing queues.

Modeling Framework: Processor-Sharing Queues

The authors model the network as a system of multi-class Processor-Sharing (PS) queues. In this model, each cell is a queue where the available bandwidth is shared equally among active users. Crucially, the service rate of a cell changes dynamically based on which neighboring cells are currently transmitting.

To solve the intractability of the exact model, two types of bounds are introduced:

  1. First-degree bounds: Crude estimates assuming neighbors are either always on or always off.
  2. Second-degree bounds: Tighter estimates that account for neighbor activity using two "limiting regimes":
  3. Fluid regime: Assumes neighbor activity changes infinitely fast, effectively "averaging out" the interference.
  4. Quasi-stationary (QS) regime: Assumes neighbor activity changes very slowly, effectively "freezing" the interference state for the duration of a flow.

A key feature of these methods is insensitivity: the resulting formulas depend only on the average traffic load, not the specific distribution of file sizes.

Simulation Scenarios and Network Topologies

The mathematical models were validated using numerical simulations based on the HDR (High Data Rate) standard. The authors examined several network topologies to test the robustness of their bounds, ranging from simple linear models to complex grids.

Figure 4: A linear network topology modeling users along a highway or street.
Figure 6: A standard hexagonal cellular grid with seven cells and omni-directional antennas.

These topologies allow for the study of different interference patterns and demonstrate how the proposed bounds perform in realistic cellular layouts.

Key Insights and Results

The research yielded several critical findings for network design:

  • The Synchronization Effect: Neighboring cells tend to synchronize their activity. If a neighbor is busy, you become slower and stay busy longer; if a neighbor goes idle, your speed increases, allowing you to finish faster.
  • Accuracy of the QS Bound: Surprisingly, the "Quasi-stationary lower bound" turned out to be a remarkably sharp approximation for actual network performance in almost all simulated scenarios. In hexagonal networks, these bounds were nearly indistinguishable from complex simulations.
  • The Power of Insensitivity: Performance is "insensitive" to the exact traffic distribution. Simulations using both exponential and heavy-tailed file size distributions yielded nearly identical results. This means engineers can predict network capacity using only the average load ($\rho$) without needing to know the complex "shape" of the traffic.
  • Interference Impact: The results quantitatively show how much "edge users" (those far from the BS) suffer compared to "center users" as neighbor interference fluctuates.

Conclusion and Future Directions

While the model provides a robust framework, it has limitations. It assumes base stations transmit at full power or are silent, not accounting for dynamic power control. It also assumes users stay in one cell for the duration of their transfer, which may not hold for large files at high speeds. Future work could extend this to "inter-cell scheduling," where base stations coordinate activity to intentionally reduce interference, a strategy that this research helps facilitate by providing a clear understanding of multi-cell dynamics.

Summary updated

Abstract

The performance of wireless data systems has been extensively studied in the context of a single base station. In the present paper we investigate the flow-level performance in networks with multiple base stations. We specifically examine the complex, dynamic interaction of the number of active flows in the various cells introduced by the strong impact of interference between neighboring base stations. For the downlink data transmissions that we consider, lower service rates caused by increased interference from neighboring base stations result in longer delays and thus a higher number of active flows. This in turn results in a longer duration of interference on surrounding base stations, causing a strong correlation between the activity states of the base stations. Such a system can be modelled as a network of multi-class processor-sharing queues, where the service rates for the various classes at each queue vary over time as governed by the activity state of the other queues. The complex interaction between the various queues renders an exact analysis intractable in general. A simplified network with only one class per queue reduces to a coupled-processors model, for which there are few results, even in the case of two queues. We thus derive bounds and approximations for key performance metrics like the number of active flows, transfer delays, and flow throughputs in the various cells. Importantly, these bounds and approximations are insensitive, yielding simple expressions, that render the detailed statistical characteristics of the system largely irrelevant.
BibTeX
@inproceedings{bonald2004wireless,
  author = {Thomas Bonald and Sem C. Borst and Nidhi Hegde and Alexandre Proutière},
  title = {{Wireless data performance in multi-cell scenarios}},
  booktitle = {SIGMETRICS},
  year = {2004},
  doi = {10.1145/1005686.1005730},
}
Figure