Access Point Planning For Communication Systems

Access point planning plays a vital role in communication systems.Reasonable access point planning can save the construction cost of the system without compro-mising performance,making it possible for the system operator to stay ahead of the competition.This thesis mainly researches the Baseband unit Pool(BBU Pool)plan-ning for Cloud Radio Access Networks(C-RAN)and aggregation point planning in Software Defined Networks(SDN)based smart grid communication system.Approxi-mation algorithms are introduced to solve these problems in order to provide worst-case performance-guaranteed solutions.The contributions of this thesis have been summarized as below:1.This paper analyzes the minimal cost of C-RAN deployment problem while considering the latency requirements of the fronthaul,the traffic demand of remote ra-dio heads(RRHs)and the processing capacity of BBU Pools.The procedure of solving this problem can be divided to three steps.Firstly,giving an initial feasible solution for opening the BBU Pool.Secondly,providing the relaxed form of BBU Pools and RRHs association problem.Thirdly,the local search based(8+?)-approximation algorithm is used to update the current solution of BBU Pool.Numerical results illustrate that the proposed algorithm not only converge stably but also reduce the cost of deploying C-RAN significantly comparing with the genetic algorithm and tabu search algorithm.2.We give the solution for aggregation points planning problem in smart grid.To begin with,we build the cost model of aggregation points planning problem while considering the connection cost between aggregation points and smart meters,the de-ploying cost of aggregation points and the linking cost from aggregation points to the control center.Moreover,the optimization problem takes account of attenuation and delay characteristics of the power line channel.The problem is solved by introducing the primal-dual schema based 5-approximation algorithm.Numerical results verify the effectiveness and reliability of the proposed algorithm.Lastly,by comparing the plan-ning results of two approximation algorithms in different scenes,we can conclude that the results of smaller approximation ratio are not necessarily better than the bigger one,the final result always depends on the form and parameters of the specific problem.In this thesis,the problem of the minimal cost of C-RAN deployment and the aggregation points planning in smart grid are studied by introducing approximation algorithms.Numerical results show that approximate algorithm not only can effec-tively solve the networks planning problems,but it also be able to get worst-case performance-guaranteed solutions,so as to provide a new perspective for a large num-ber of networks planning problems in communication systems.