Research of Gateway Deployment for Wireless Mesh Networks Based on the Great Full Connected Sub-graphs
Fan Ren-shen · Journal of Chinese Computer Systems · 2015
In Wireless Mesh Networks,the deployment of gateways has a direct effect on network quality of service and plays an important role to improve network performance. In this paper,to solve the geometric K-center problem,an improved PSO algorithm based on great full connected sub-graphs is proposed to optimize the minimum coverage radius. The algorithm can be described as to find full connected sub-graphs in given network topology,then great full connected sub-graphs with the most complete function are filtered out,and the position of initial center points are obtained by great full connected sub-graphs. Combining initial center points with PSO,the particles are initialized at the position of initial center points,random inertia weight is introduced,and the fitness function is redesigned,the algorithm can get optimal solution. Comparing CPSO with other algorithms,the simulation results showthat the proposed method can achieve better optimization effect and convergence rate.