Optimal Placement Algorithms for Base and Central Stations in Mining Quarries †

Golubeva T. Beloev I.H.
2025 Multidisciplinary Digital Publishing Institute (MDPI)

Engineering Proceedings
2025 #104 Issue 1

This paper proposes algorithms for optimal placement of base stations (BSs) and central stations (CSs) in mining quarries to ensure reliable radio communication for automated machinery. The BS placement is modeled as a minimum dominating set problem, solved using integer linear programming with cutting-plane methods. The CS placement is formulated as a nonlinear programming problem, addressed via a minimum circle covering algorithm. Applied in a 200 km² quarry, the approach achieves full coverage with nine BSs and one CS, minimizing costs and ensuring robust performance. Comparative analyses show superior optimality, scalability, and adaptability, offering a scalable framework for industrial communication infrastructure.

base station placement , central station placement , graph theory , integer linear programming , minimum covering problem , mining quarry

Text of the article Перейти на текст статьи

Department of Cybersecurity, Almaty University of Power Engineering and Telecommunications Named After G. Daukeyev, Almaty, 050013, Kazakhstan
Department of Transport, University of Ruse, Ruse, 7017, Bulgaria

Department of Cybersecurity
Department of Transport

10 лет помогаем публиковать статьи Международный издатель

Книга Публикация научной статьи Волощук 2026 Book Publication of a scientific article 2026