With the large-scale deployment of 5G technology, the rationality of communication base station siting is crucial for network performance, construction costs, and operational efficiency. Traditional site selection methods rely heavily on manual experience, exhibiting strong subjectivity and difficulty in balancing multi-objective optimization. Existing heuristic algorithms suffer from slow convergence speeds and susceptibility to local optima. To address these challenges, this paper constructs a multi-objective base station site selection model that simultaneously minimizes costs, maximizes coverage contributions, and minimizes interference. It achieves quantitative balance among objectives through normalization and weight fusion, while introducing constraints to ensure engineering feasibility. Concurrently, the genetic algorithm underwent targeted optimization by introducing an adaptive migration strategy based on population diversity and a cosine-type parameter adjustment strategy. This approach was integrated with the particle swarm optimization algorithm to balance exploration and exploitation while mitigating premature convergence. Experimental validation demonstrates that the improved algorithm achieves faster convergence and greater stability compared to traditional genetic algorithms and particle swarm optimization, while satisfying engineering constraints such as base station quantity, coverage, and interference. This research provides an efficient and feasible solution for intelligent base station site planning.

As a fundamental information carrier in Industrial Internet of Things (IIoT), electromagnetic spectrum data presents critical challenges for efficient spectrum sensing and situational awareness in smart industrial cognitive radio systems. Addressing sparse sampling limitations caused by energy-constrained transceiver nodes in Unmanned Aerial Vehicle (UAV) spectrum monitoring, this paper proposes a compressive sensing-based 3D spectrum tensor completion framework for extrapolative reconstruction in obstructed areas (e.g., building occlusions). First, a Sparse Coding Neural Gas (SCNG) algorithm constructs an overcomplete dictionary adaptive to wide-range spectral fluctuations. Subsequently, a Bag of Pursuits-optimized Orthogonal Matching Pursuit (BoP-OOMP) framework enables adaptive key-point sampling through multi-path tree search and temporary orthogonal matrix dimensionality reduction. Finally, a Neural Gas competitive learning strategy leverages intermediate BoP solutions for gradient-weighted dictionary updates, eliminating computational redundancy. Benchmark results demonstrate 43.2% reconstruction error reduction at sampling ratios r ≤ 20% across full-space measurements, while achieving decoupling of highly correlated overlapping subspaces—validating superior estimation accuracy and computational efficiency.