Planning Base Station and Relay Station Locations in IEEE 802.16j Multi-Hop Relay Networks

Abstract

In this paper, a problem formulation for determining optimal node location for base stations (BSs) and relay stations (RSs) in relay-based 802.16 networks is developed. The formulation results in an Integer Programming problem. A small modification to the original model is also considered in which the state space is reduced by limiting which nodes can be associated with which. Standard branch and bound techniques are used to solve the problem. The key findings of the paper are that standard techniques can be used to find solutions to problems of small metropolitan scale or for areas within a larger city.