Optimization Under Discrete Power and Rate Constraints

This direction is split into other directions: continuous power control. Its last version stays readable and citable here.

Version 1 of 123 papers27 conceptsfrozen 2026-10-04

In theoretical network science, we often treat variables like transmission power and data rates as continuous values. We imagine a "volume knob" that can be turned to any infinitesimal position to perfectly balance interference or maximize throughput. This assumption allows us to use the powerful tools of calculus and convex optimization to find elegant solutions.

However, physical hardware does not have an infinite-resolution knob. Transmitters operate at discrete power levels; wireless radios choose from a finite set of Modulation and Coding Schemes (MCS); and power grid equipment like transformer taps move in distinct steps. This discrepancy between continuous theory and discrete reality is not just a rounding error—it fundamentally changes the complexity and behavior of network optimization.

The Complexity of the Staircase

The primary reason researchers prefer continuous models is computational efficiency. In many scenarios, maximizing the total sum-rate of a system is solvable in polynomial time when power is continuous. But as Ya-Feng Liu demonstrates in Complexity Analysis of Joint Subcarrier and Power Allocation for the Cellular Downlink OFDMA System, introducing discrete power levels or bit-loading constraints often transforms these manageable problems into NP-hard combinatorial challenges.

When we move from a smooth "ramp" (continuous) to a "staircase" (discrete), the optimization landscape becomes jagged. Standard gradient-based methods get stuck or fail to converge because the underlying relationship between power and throughput becomes discontinuous. Martin Schubert notes in A General Theory for SIR Balancing that this combinatorial complexity is often entirely unaccounted for in the idealized models used to design network protocols.

Why Rounding is Not Enough

A common engineering intuition is to solve the problem in the continuous domain and simply "round" the result to the nearest hardware-supported level. Research shows this is often suboptimal or even destructive to system stability.

In Optimal Discrete Power Control in Poisson-Clustered Ad Hoc Networks, Beiyu Rong and Chun-Hung Liu point out that simply discretizing a continuous algorithm can break its convergence properties. However, they also show that if a discrete scheme is designed from the ground up—leveraging the specific geometry of the network—it can actually outperform constant power control by boosting spatial reuse.

The gap between theory and practice is most visible at the edges of performance. Antonios Michaloliakos and Giuseppe Caire argue in Performance Modeling of Next-Generation Wireless Networks that using continuous capacity formulas (like Shannon’s Law) leads to inaccurate designs, particularly in low signal-to-noise ratio (SNR) regimes. In these environments, the "gaps" between available hardware bitrates are large enough that continuous approximations fail to predict actual performance.

Bridging the Gap with New Mechanisms

To handle these "chunky" constraints, researchers are developing algorithms that treat discreteness as a first-class citizen rather than an afterthought:

Beyond Wireless: Optical and Power Grids

This challenge extends beyond cellular networks. In flexible-grid optical networks, Juzi Zhao and Henk Wymeersch showed in Power optimization in nonlinear flexible-grid optical networks that while individual power tuning can save 24% in bandwidth, those gains are only realizable if the optimization accounts for the discrete power steps of the transmitters.

Similarly, in power systems, Zhengshuo Li and Jianhui Wang highlight in Robust Estimation of Reactive Power for an Active Distribution System that the discrete nature of capacitor banks and transformer taps makes it difficult to identify a "guaranteed" range of operation for the grid.

The shift in this research direction is clear: the most effective network optimizations are those that stop pretending the world is continuous and start designing for the discrete steps of the hardware that actually runs it.

Papers in this version

History & citationVersion 1 · 2026-10-04

Split into other directions · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_optimization_under_discrete_power_and_ra_9e843557,
  title = {Optimization Under Discrete Power and Rate Constraints},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/optimization-under-discrete-power-and-rate-constraints/rdr_9e84355715114a53b61b787da197c1db},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_optimization_under_discrete_power_and_ra_9e843557_v1,
  title = {Optimization Under Discrete Power and Rate Constraints},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/optimization-under-discrete-power-and-rate-constraints/rdr_9e84355715114a53b61b787da197c1db/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}