Problem
Research questions and friction points this paper is trying to address.
Enterprise Network
Radio Node Placement
SINR Optimization
A Framework for Enterprise Network Dimensioning
🤖 AI Summary
研究利用随机几何和整数线性规划方法解决企业网络中无线节点放置问题，并提出基于加权k-调和平均的聚类策略及顺序最小割算法优化SINR。
📝 Abstract
We study radio node (RN) placement for indoor enterprise networks. Using stochastic geometry (SG), we derive the meta-distribution (MD) of the SINR for a test user equipment (UE), with and without cooperation from outdoor macro base stations (MBSs), and compare these results with an integer linear programming (ILP) approach. SG provides an estimate of the required number of RNs but not their locations, while ILP can yield inaccurate local optima and requires high computational power. To address this, we investigate clustering-based algorithms for initializing RN locations using UE location distributions. Along with standard methods, we propose a weighted $k$-harmonic means (WKHM) clustering strategy tailored to maximize SINR. We then introduce a constrained sequential minimum cut algorithm, \texttt{SeqMinCut}, to merge multiple RNs into larger cells and further improve SINR. This is the first work that integrates SG-based statistical analysis, optimization, and clustering to obtain system design insights, dimensioning rules, and planning strategies for enterprise 5G.
Innovation
Methods, ideas, or system contributions that make the work stand out.
stochastic geometry
weighted k-harmonic means clustering
constrained sequential minimum cut algorithm
🔎 Similar Papers
No similar papers found.
