无线Mesh网络部署几何连通覆盖问题求解方法

Method of Geometric Connected Disk Cover Problem for Wireless Mesh Networks Deployment

用户覆盖和网络连通是无线Mesh网络规划面临的重要挑战,传统上是对它们独立进行分析。为了有效结合二者进行网络部署,将网络的分层特性、用户需求、网络连通、部署开销等因素考虑在内,提出了面向无线Mesh网的几何连通圆盘覆盖问题。利用备选点集选择算法来将连续空间选址问题转变为离散空间选址问题,并采用改进的多目标遗传算法对优化问题进行求解,从而获得Pareto解集。实验结果证明,提出的方案可以有效解决网络部署的优化问题。

User coverage and network connectivity are important for wireless mesh networks planning which are studied separately in traditional ways.In order to effectively combine these two factors,ageometric connected disk cover problem for wireless mesh networks was proposed considering hierarchical network characteristics,user demands,network connectivity and deployment cost.Continuous spatial location selection problem is transformed into discrete problem by the set of candidate points＇ generation algorithm.An improved multi-objective genetic algorithm was proposed to get Pareto solutions.Experimental results prove the efficiency of this scheme to deploy mesh networks.