双目标无线回传拓扑整数规划模型及算法  

Integer Programming Model and Algorithms for Dual-Objective Wireless Return Topology

作　　者：王少虎 胡瑀晖 杨宣浩 龚劬[1] 

机构地区：[1]重庆大学数学实验教学中心,重庆

出　　处：《计算机科学与应用》2019年第12期2249-2255,共7页Computer Science and Application

摘　　要：在实际的Relay部署中,站点的布局及连接受成本、距离、回传质量等多种因素的限制,给站点的拓扑规划带来了挑战。针对通信基站的布局规划问题,建立了成本和路损最小的双目标整数规划模型,并基于K-means聚类算法和Prim算法设计了求解该NP难题的启发式算法。仿真结果表明,该模型和算法可以有效解决无线回传拓扑中的站点规划问题,在降低算法复杂度的同时具有较好的适用性和有效性。In the actual Relay deployment, the layout and connection of the sites are limited by various factors such as cost, distance, and backhaul quality, which bring challenges to the topology planning of the sites. Aiming at the problem of layout planning of communication base stations, a dual-objective station integer programming model is established, and a block partitioning algorithm based on K-means clustering algorithm and a site connection algorithm based on Prim algorithm are designed. The results of simulations show that the model and algorithms can effectively solve the problem of site planning in wireless backhaul topology, and it has better applicability and effectiveness while reducing the complexity of the algorithms.

关 键 词：无线回传拓扑 整数规划 K-MEANS聚类算法 NP难题 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]