Stochastic Geometry Meets Optimization: Data-Driven Cellular Planning
Abstract
Deployment optimization of base stations (BSs) is critical for improving cellular network performance metrics such as coverage and capacity, impacting user experience, scalability, and infrastructure cost-effectiveness. Traditional methods that optimize precise BS locations do not generally provide broader insights into spatial deployment priorities or alternative viable deployments. Stochastic geometry approaches, on the other hand, offer a more interpretable intensity-based framework, but rarely utilize real-world user location data or investigate optimal BS deployment strategies. In this work, we propose a data-driven stochastic geometry-based approach that optimizes BS deployment intensity to maximize a network performance metric using samples from an unknown user-location distribution. We specialize the framework to an inhomogeneous Poisson point process (PPP) for cellular coverage analysis. The resulting infinite-dimensional problem is discretized over the deployment area and solved using sampled user locations. We characterize the discretization and sampling errors, apply stochastic mirror ascent to solve the empirical problem, and analyze the selection of concrete BS deployments using independent validation samples. Unlike traditional methods, our approach yields an optimized spatial intensity that reveals deployment priorities across regions and accommodates practical deployment constraints, multi-tier networks, and incremental deployment scenarios. Numerical experiments with synthetic and real-world spatial demand data demonstrate the proposed approach under different network configurations.
Related
- Adaptive Restart under Unknown KL Geometry in Stochastic Weakly-Convex Optimization
- Rennala NSGD: Asynchronous Stochastic Optimization Beyond Euclidean Geometry
- ProofLoom: Proof-Obligation-Driven Theory Construction for Autoformalizing Research-Level Stochastic Optimization
- Control-Geometry Straightening for Sampling-Based Latent Planning
- Learning-Accelerated Optimization-based Trajectory Planning for Cooperative Aerial-Ground Handover Missions
BibTeX
@misc{shukla2026stochastic,
title = {{Stochastic Geometry Meets Optimization: Data-Driven Cellular Planning}},
author = {Abhishek K. Shukla and Abhishek K. Gupta and Ketan Rajawat},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.31793},
eprint = {2610.31793},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.31793},
}
RIS
TY - UNPB
TI - Stochastic Geometry Meets Optimization: Data-Driven Cellular Planning
AU - Abhishek K. Shukla
AU - Abhishek K. Gupta
AU - Ketan Rajawat
PY - 2026
DA - 2026/10/22
PB - arXiv
DO - 10.48550/arxiv.2610.31793
UR - https://arxiv.org/abs/2610.31793
AB - Deployment optimization of base stations (BSs) is critical for improving cellular network performance metrics such as coverage and capacity, impacting user experience, scalability, and infrastructure cost-effectiveness. Traditional methods that optimize precise BS locations do not generally provide broader insights into spatial deployment priorities or alternative viable deployments. Stochastic geometry approaches, on the other hand, offer a more interpretable intensity-based framework, but rarely utilize real-world user location data or investigate optimal BS deployment strategies. In this work, we propose a data-driven stochastic geometry-based approach that optimizes BS deployment intensity to maximize a network performance metric using samples from an unknown user-location distribution. We specialize the framework to an inhomogeneous Poisson point process (PPP) for cellular coverage analysis. The resulting infinite-dimensional problem is discretized over the deployment area and solved using sampled user locations. We characterize the discretization and sampling errors, apply stochastic mirror ascent to solve the empirical problem, and analyze the selection of concrete BS deployments using independent validation samples. Unlike traditional methods, our approach yields an optimized spatial intensity that reveals deployment priorities across regions and accommodates practical deployment constraints, multi-tier networks, and incremental deployment scenarios. Numerical experiments with synthetic and real-world spatial demand data demonstrate the proposed approach under different network configurations.
ER -