Planning Base Station and Relay Station Locations for IEEE 802.16j Network with Capacity Constraints

In this paper, two formulations for planning base station (BS) and Relay Station (RS) locations are proposed: a rather complex 0-1 integer programming model which can be used to determine which set of locations should be selected from a given set of BS and RS locations and a simpler decomposition approach which focuses first on the BS location problem followed by the RS location determination. The two approaches are compared and the results show that the simpler decomposition approach can find solutions using significantly less resources which are very minimally lower in quality than that found by the more complex formulation. Hence, the decomposition approach can be used to solve larger 802.16j network planning problems.