Multi-Objective Node Placement Problem In Wireless Network

In this thesis,we develop advanced network planning and optimization techniques to enable effective and efficient deployment of nodes in wireless communication networks.The planning of network is composed of a given set of nodes and a set of communication devices.The node placement problem requires choosing appropriate positions from a set of designated candidate sites to place these nodes such that a set of conflicting objectives are satisfied.In particular,we concentrate on the objectives of maximizing the coverage,minimizing the cost,the total capacitance,and the overlap in the network.We handle a number of constraints and penalty of components which aims to modeling the specific features of the wireless environment intimately.This placement problem is formulated and solved as multi-objective optimization problem using the well-known algorithm which is called Multi-Objective Evolutionary Algorithm Based on Decomposition(MOEA/D)algorithm.We apply an adapting version of this algorithm to solve our problem.The main goal of our proposed algorithm is to find solutions for different region size with different test points that we have expressed in 9 test instances problem.Our experimental results show that MOEA/D has a good performance in a reasonable running time.Furthermore,comparative results prove that our algorithm is effective in all the desired objectives.We illustrate these comparative results by comparing the solutions of our algorithm with the MOGA algorithm which intends solving same Nodes Placement Problem.