Constrained wireless network planning

Abstract

In this paper we define the Constrained Wireless Network Planning problem. Given is an orientation of access points which, if supplied with network connectivity, is able to provide a required level of coverage to clients. The goal is to find a division of these access points in source locations and repeater locations such that each of the access points is provided with network connectivity, while not all need to be directly connected to an existing network. The origin of the constraints in this problem are threefold. First, there is a restriction on the allowed distance between a source and a repeater location. Second, there is a restriction on the number of repeaters which may be provided with network connectivity by a source. Third, a repeater location may not provide another location with network connectivity. In this paper we propose an Iterated Local Search procedure to solve this problem. We apply this procedure to a problem arising in the field of multi-service planning in Smart Cities.