Journal Article

A Base Station Deployment Algorithm for Wireless Positioning Considering Dynamic Obstacles

Jia, Yunfei, Li, Aiguo

2025

Overview

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.

• Publisher: Tech Science Press
• Subject: Algorithms / Effectiveness / Indoor environments / Obstacle avoidance / Personnel / Positioning / Radio signals / Security systems