Optimizing wireless networks for heterogeneous spatial loads

Balaji Rengarajan, Gustavo de Veciana

Abstract: Large-scale wireless networks must be designed such that there are no gaps in coverage. It is also desirable to minimize the number of access points used in order to minimize the cost of equipment, installation and maintenance. In this paper, we propose a grid-based approximation algorithm to compute the placement of access points. The algorithm minimizes the number of access points required while ensuring that the received SNR at each location is sufficient to meet the offered load at that location. The algorithm can be used when the offered load is spatially non-homogenous or when access points can be operated in different modes. The proposed algorithm is guaranteed to find a solution with at most O(c <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">opt</sub> log c <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">opt</sub> ) access points, if there exists a solution to the access point placement problem using c <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">opt</sub> access points.