面向协作通信的基站规划分析-信息与通信工程；信号与信息处理专业毕业论文.docxVIP

重庆大学 重庆大学硕士学位本文 英文摘要 PAGE PAGE IV between different base stations is limited in actual situation. A joint optimization algorithm is proposed to solve the established models, in which the methodologies of mesh adaptive direct search and successive elimination have been used as output of the site optimization model is used as input variables of the number optimization model of base stations. ③ Two optimization models are solved under the assumption when user distribution follows a uniform, single Gaussian and multiple Gaussian by Monte Carlo method combining with the joint optimization algorithm. As the coverage of base station overlapping degree increases, the number and total transmit power of base stations will be reduced, while the overlap degree is fixed, the number of base stations is inversely proportional to the total transmit power of base stations. Numerical results show that the joint algorithm with good convergence can more effectively reduce the number of base stations or the total transmission power compared with the K-means clustering algorithm, although time complexity of the latter is lower. The research of the study as an exploration to the deployment of the base stations of cooperative communication can be extended to any other user distributions. Related work can provide a reasonable reference for the construction of the next generation mobile communication network. Keywords: cooperative communication, base station deployment, optimal site placement, overlapping coverage 重庆大学硕 重庆大学硕士学位论文 目 录 目 录 中文摘要I 英文摘要 II 1 绪 论 1 1.1 课题研究背景及意义 1 1.1.1 无线通信发展历史、现状及前景 1 1.1.2 基站规划问题的研究意义 3 1.2 基站规划问题的国内外研究现状 5 1.3 本文研究内容及结构安排 7 1.3.1 本文主要研究内容 7 1.3.2 本文各章节结构安排 9 2 基站规划相关基础理论 10 2.1 基站规划问题概述 10 2.1.1 路径损耗传播模型 10 2.1.2 网络覆盖率 11 2.1.3 网络服务质量 12 2.2 基站规划问题建模思路 12 2.3 基站规划问题的常用求解方法 13 2.3.1 最优化问题求解算法概述 13 2.3.2 网格自适应直接搜索算法 18 2.4 本章小结 19 3.面向协作通信基站规划的最优化模型 20 3.1 最优化模型参数设置 21 3.2 基站站址优化模型 21 3.3 基站数量优化模型 25 3.4 本章小结 25 4 最