Wireless Network Gateway Placement by Evolutionary Graph Clustering
Gateway placement is an important problem in the design of a backbone wireless network (BWN) as it directly affects the installation and ongoing running costs of the BWN. From a computational point of view, the gateway placement problem is a constrained combinatorial optimization problem. In this paper, we transform the gateway problem into a graph clustering problem and design a repairing genetic algorithm (RGA) to solve the graph clustering problem. Different from traditional GAs, this RGA embeds a procedure that can detect and repair those infeasible solutions generated by the crossover and mutation operators. Experimental results show that the infeasible solution detecting and repairing procedure can not only reduce the computation time of the RGA, but also improve the quality of the solutions generated by the RGA. In this paper, we also conduct an empirical study of the computational efficiency of the RGA. The analysis result shows that its computational efficiency is quadratic, which is computationally efficient.
KeywordsBackbone wireless network Gateway placement Graph clustering Genetic algorithm Evolutionary computation
- 4.Chandra, R., Qiu, L., Jain, K., Mahdian, M.: Optimizing the placement of internet taps in wireless neighborhood networks. In: IEEE International Conference on Network Protocols, pp. 271–282. IEEE (2004)Google Scholar
- 5.Hamdi, M., Franck, L., Lagrange, X.: Gateway placement in hybrid manet-satellite networks. In: IEEE Vehicular Technology Conference, pp. 1–5. IEEE (2012)Google Scholar
- 9.Tang, M.: Gateways placement in backbone wireless mesh networks. Int. J. Commun. Netw. Syst. Sci. 2(1), 44 (2009)Google Scholar
- 11.Wong, J.L., Jafari, R., Potkonjak, M.: Gateway placement for latency and energy efficient data aggregation [wireless sensor networks]. In: IEEE International Conference on Local Computer Networks, pp. 490–497. IEEE (2004)Google Scholar