2026· IEEE Transactions on Cognitive Communications and Networking· Vol 12, pp. 11324-11340· 0 citations· 27 references
Computer Science
Abstract
This paper proposes a novel terrain-aware, two-layer, graphics processing unit (GPU)-accelerated framework for base station placement optimization. In the first layer, three-dimensional (3D) K-means clustering is employed for initial base station seeding using real geographical, population, and elevation data, while two-dimensional (2D) K-means is applied in scenarios without elevation information. The second layer utilizes the quantum-inspired Raute optimizer (QRO), an adaptive hybrid metaheuristic that refines the initial placements. QRO dynamically alternates between exploration and exploitation through quantum-governed role switching and incorporates a novel inter-algorithm “bartering” mechanism for solution exchange with other heuristics. To validate the proposed framework, a comprehensive benchmarking study is performed on both terrain-aware 3D and 2D configurations. Within each framework, QRO is rigorously compared against six established metaheuristics. The GPU-accelerated simulations adopt the 3GPP rural macro (RMa) model and assess population coverage, convergence, and runtime. Additional experiments confirm robustness to spectrum-sensing errors and linear scalability with massive user densities. Results show that QRO—especially with bartering—consistently achieves higher coverage with faster convergence than competing metaheuristics. Multi-objective evaluation further demonstrates tunable trade-offs between coverage maximization and interference mitigation for practical network planning.
The Three-Dimensional Trailer Loading Problem (3D-TLP) involves determining the optimal placement and orientation of heterogeneous items within the confined space of a trailer while maximizing volume utilization and satisfying a wide range of complex logistical and safety constraints. The 3D-TLP is NP-hard, rendering e...
A. Del Río, L. Diaz, L. De Vicente et al.· 0 citations
An obstacle-aware routing framework that combines a 1 m occupancy grid, A* shortest-path computation, and an Improved Mayfly Optimization Algorithm (IMOA) is developed, establishing routing-efficiency gains under the evaluated protocol.
Ze Yang, Xin-Ying Cheng, Hao-Min Wang· Sustainability· 0 citations
The experimental results show that MSE-CDO improves the performance of the original CDO on most benchmark functions, achieves the best overall Friedman rank among the compared algorithms, and obtains competitive solutions for the considered engineering problems.
A. Ali, H. Bahamish, S. A. al-Shami· Jurnal Komputer Teknologi In...· 0 citations
Coverage optimization in WSNs is critical for disaster warning and industrial monitoring, but is challenging due to multi-modality and high-dimensionality. Particle swarm optimization (PSO) offers fast convergence and simple parameter tuning, yet suffers from premature convergence and parameter sensitivity in multi-pea...
Yu-Xuan Zhou, Shao-Qiang Ye, Di-Wen Kang et al.· Baghdad Science Journal· 0 citations
Findings prove that SBOA is an effective and scalable clustering platform that can be applied to real-time FANET deployments during disaster recovery, surveillance, and monitoring operations in large regions.
Zaheer Aslam, Taj Rahman, Ghassan Husnain et al.· Telecommunications Systems· 0 citations
Data-intensive Mobile Edge Computing (MEC) demands a synergy between server placement and task scheduling, yet these processes operate on disparate optimization horizons. This paper proposes JET, a two-stage optimization framework that bridges this gap through placement-aware scheduling. In the offline stage, an evolut...
Sadra Galavani, Abolfazl Younesi, Mohsen Ansari· IEEE Open Journal of the Com...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.