Automatic optimization algorithms for the planning of wireless local area networks

Abstract

The planning of wireless local area network (WLAN) infrastructures that supply large buildings or areas requires the consideration of many aspects (coverage, different traffic densities, interference, cost minimization) and therefore is a difficult task if done manually. In this paper a method is presented that allows to optimize such networks automatically. The approach is based on predictions of the received power to account for the propagation conditions that have a major impact on the performance of WLANs. The optimization is applied to a set of possible locations where access points can be installed. Out of this set a minimum selection of locations is made to meet the given requirements. These requirements consist of the determination of areas with different priorities and the definition of further parameters. The optimization not only takes into account the required coverage and capacity but also the interference situation. The arising co-channel interference is minimized by an appropriate assignment of the available carrier frequencies. The discussed approach may not find the global optimum in all cases, but it yields a suggestive result based on the locations defined by the network planner. Due to the very short computation time different configurations can be analyzed very quickly.

A Minimum-Spanning-Tree-Inspired Algorithm for Channel Assignment in 802.11 Networks

“…Algorithm requires a lot of information concerning the network and intensive calculation and switching. Priority map is the solution of Wertz et al 2004 [13]. The method is quite complicated and a few steps are necessary to obtain an optimal network.…”

An integrated approach for reliability and dependability of Wireless Mesh Networks

“…Various methods and tools exist to calculate close-to-optimal configuration w.r.t. contrary criteria: signal strength, inter-cell overlapping, deployment costs; for instance [2,14,26,27,24]. They apply a combinatorial pre-selection from a set of possible AP-locations, and after that run an optimization of an objective function weighted by the user.…”

Hypergraph T-coloring for automatic frequency planning problem in wireless LAN

“…Those works introduce more complete AFP problem in IEEE 802.11 [19] [20][21] [3]. However [22][23] [24] use only three non-overlapping channels. Complete AFP problem based on SINR total calculation is done in [25] [26].…”