Novel Computationally Efficient Multiple Access-Point/Router Deployment Approach for Full Line of Sight Coverage Over Arbitrary Indoor Polygonal/Prismatic Fields of Interest

Nowadays, wireless local-area networks (WLANs) are widely deployed in residential and commercial areas. How to ensure full coverage is always an important challenge during the deployment of access-points (APs) and routers. In this study, we investigate the full Line of Sight (LoS) coverage problem. We will focus on how to achieve the full LoS coverage using a minimal number of APs/routers in an arbitrary polygonal/prismatic field-of-interest, which may be simply or multiply connected subject to a certain restricted link-range. We propose a new visibility-polygon-based approach for doing so. The performance of our proposed new approach is then evaluated in terms of the coverage efficiency, the total number of APs/routers, and the peak link-distance ratio for achieving the full LoS coverage. Meanwhile, we also compare our proposed new approach with the existing schemes. Compared to the existing schemes, our proposed novel visibility-polygon-based approach can achieve the full LoS coverage by requiring the same number of APs/routers but much less computation time.