Open Access iconOpen Access

ARTICLE

crossmark

A Base Station Deployment Algorithm for Wireless Positioning Considering Dynamic Obstacles

Aiguo Li1, Yunfei Jia2,*

1 Department of Network Engineering, Xi’an University of Science and Technology, Xi’an, 710600, China
2 College of Computer Science and Technology, Xi’an University of Science and Technology, Xi’an, 710600, China

* Corresponding Author: Yunfei Jia. Email: email

Computers, Materials & Continua 2025, 82(3), 4573-4591. https://doi.org/10.32604/cmc.2025.059184

Abstract

In the context of security systems, adequate signal coverage is paramount for the communication between security personnel and the accurate positioning of personnel. Most studies focus on optimizing base station deployment under the assumption of static obstacles, aiming to maximize the perception coverage of wireless RF (Radio Frequency) signals and reduce positioning blind spots. However, in practical security systems, obstacles are subject to change, necessitating the consideration of base station deployment in dynamic environments. Nevertheless, research in this area still needs to be conducted. This paper proposes a Dynamic Indoor Environment Beacon Deployment Algorithm (DIE-BDA) to address this problem. This algorithm considers the dynamic alterations in obstacle locations within the designated area. It determines the requisite number of base stations, the requisite time, and the area’s practical and overall signal coverage rates. The experimental results demonstrate that the algorithm can calculate the deployment strategy in 0.12 s following a change in obstacle positions. Experimental results show that the algorithm in this paper requires 0.12 s to compute the deployment strategy after the positions of obstacles change. With 13 base stations, it achieves an effective coverage rate of 93.5% and an overall coverage rate of 97.75%. The algorithm can rapidly compute a revised deployment strategy in response to changes in obstacle positions within security systems, thereby ensuring the efficacy of signal coverage.

Keywords

Wireless positioning; base station deployment; dynamic obstacles; dynamic obstacle wireless positioning

Cite This Article

APA Style
Li, A., Jia, Y. (2025). A Base Station Deployment Algorithm for Wireless Positioning Considering Dynamic Obstacles. Computers, Materials & Continua, 82(3), 4573–4591. https://doi.org/10.32604/cmc.2025.059184
Vancouver Style
Li A, Jia Y. A Base Station Deployment Algorithm for Wireless Positioning Considering Dynamic Obstacles. Comput Mater Contin. 2025;82(3):4573–4591. https://doi.org/10.32604/cmc.2025.059184
IEEE Style
A. Li and Y. Jia, “A Base Station Deployment Algorithm for Wireless Positioning Considering Dynamic Obstacles,” Comput. Mater. Contin., vol. 82, no. 3, pp. 4573–4591, 2025. https://doi.org/10.32604/cmc.2025.059184



cc Copyright © 2025 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1027

    View

  • 1050

    Download

  • 0

    Like

Share Link