arXiv:2604.22056cs.LGcs.NI2026-04

用学习模型优化城市基站部署,兼顾覆盖与功耗

Learning Coverage- and Power-Optimal Transmitter Placement from City Maps: A Comparative Study of Direct and Indirect Neural Approaches

论文配图:Learning Coverage- and Power-Optimal Transmitter Placement from City Maps: A Comparative Study of Direct and Indirect Neural Approaches
图 1 · 摘自论文原文
  • 用神经网络直接预测最优发射位置,避免暴力搜索
  • 覆盖最优比功耗最优少5.5%覆盖,功耗最优少13.86%功率
  • 双分数图方法在小候选集下仍保持高精度,适合实际部署

最优无线发射机部署是无线网络规划的核心任务,但大规模情况下穷举搜索成本过高。本文在学习传播模型下研究单发射机场景,实现了在测量标注不可行、射线追踪计算不可行的条件下,对像素级部署进行可扩展的全面评估。提出包含167,525个城市场景的数据集RadioMapSeer-Deployment,提供覆盖最优与功耗最优发射位置的双重真值标签。基准分析揭示覆盖-功耗不对称权衡:覆盖最优部署损失13.86%接收功率,功耗最优部署损失5.50%覆盖;最佳平衡点位于理想点(100%,100%)的$ar{d}=2.60$处。评估两种学习范式:间接热力图模型预测接收功率地图,直接分数图模型预测可行发射位置的目标景观。热力图中判别模型实现单次预测速度提升1350-2400×,扩散模型支持多样本推理,提升单目标性能并复用样本池获得强平衡部署,无需显式多目标训练。双分数图策略结合功率与覆盖分数图,匹配穷举平衡最优($ar{d}=2.60$),在更小候选预算下仍保持接近,速度提升14-22×(含候选评估开销)。双分数图整体最强,热力图则因物理意义明确的中间输出和扩散模型的推理时搜索能力而具吸引力。

原文摘要 · Abstract (English)

Optimal wireless transmitter placement is a central task in radio-network planning, and exhaustive search becomes prohibitively expensive at scale. This paper studies the single-transmitter setting under a learned propagation model, enabling exhaustive per-pixel assessment at scale in a regime where measurement-based labeling is infeasible and ray-tracing-based labeling is computationally out of reach. We introduce a dataset of 167525 urban scenarios (RadioMapSeer-Deployment) with dual ground-truth labels for coverage-optimal and power-optimal transmitter locations. Benchmark analysis reveals an asymmetric coverage-power trade-off: coverage-optimal placement sacrifices 13.86% of received-power, whereas power-optimal placement sacrifices 5.50% of coverage; the best balanced placement lies at $\bar{d}=2.60$ from the ideal point (100%,100%). We evaluate two learning formulations: indirect heatmap-based models predicting received-power radio maps, and direct score-map models predicting the objective landscape over feasible transmitter locations. Within the heatmap family, discriminative models deliver one-shot predictions 1350-2400$\times$ faster than exhaustive search, while diffusion models additionally support multi-sample inference that improves single-objective performance and, by reusing the same sample pool under a balanced criterion, recovers strong balanced placements without explicit multi-objective training. Dual score-map strategies combining power and coverage score-maps match the exhaustive balanced optimum ($\bar{d}=2.60$) and remain close to it across smaller candidate budgets, at 14-22$\times$ speedups including the cost of evaluating shortlisted candidates. Dual score-map methods are strongest overall, whereas heatmap formulations remain attractive for their physically meaningful intermediate maps and, in the diffusion setting, for inference-time search.

无线部署神经网络优化算法城市建模

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。