On the Tree Construction of Multi Hop Wireless Mesh Networks With Evolutionary Algorithms

In this paper, we study the structure of WiMAX mesh networks and the influence of tree structureon the performance of the network. From a given network graph, we search for trees, which fulfillsome network, QoS requirements. Since the searching space is very huge, we use geneticalgorithm in order to find solution in acceptable time.We use NetKey representation which is an unbiased representation with high locality, and due tohigh locality we expect standard genetic operators like n-point cross over and mutation workproperly and there is no need for problem specific operators. This encoding belongs to class ofweighted encoding family. In contrast to other representation such as characteristics vectorencoding which can only indicate whether a link is established or not, weighted encodings useweights for genotype and can thus encode the importance of links. Moreover, by using properfitness function we can search for any desired QoS constraint in the network.