Research on gateway deployment of WMN based on maximum coupling subgraph and PSO algorithm

详细信息    查看全文

• 作者：Yang Li ; Shuqiang Huang ; Rensheng Fan ; Zhen Zhang ; Yuyu Zhou
• 关键词：Wireless mesh network ; Gateway deployment ; Geometric K ; center problem ; Particle swarm optimization algorithm ; Maximum coupling subgraph ; Representative point
• 刊名：Soft Computing
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：21
• 期：4
• 页码：923-933
• 全文大小：
• 刊物类别：Engineering
• 刊物主题：Computational Intelligence; Artificial Intelligence (incl. Robotics); Mathematical Logic and Foundations; Control, Robotics, Mechatronics;
• 出版者：Springer Berlin Heidelberg
• ISSN：1433-7479
• 卷排序：21

文摘

The maximum distance from the access points to the nearest gateways determines the network time delay, and has an important effect on network performance in wireless mesh networks. Motivated by the gateway deployment problem, this study is focused on optimizing the gateway deployment by minimizing the maximum distance. This is done by first improving upon theorems so that the plane can be divided into several intersecting regions; vertices locate in the same region are equivalent and can connect the same access points; the coordinates of the regions can also be determined. Then, maximum coupling subgraph is used in order to recognize the maximum intersecting regions; meanwhile, the coordinates are calculated by representative points. Lastly, an RPSO algorithm is designed in which representative points are taken as the initial particles to search the optimal gateway deployment. The simulation results demonstrate that the optimal gateway deployment, as determined by the RPSO algorithm process, has a smaller coverage radius, a more stable result and a faster convergence rate as compared to other algorithms.