Abstract

With the rapid development of mobile communication technology, communication networks are becoming more and more complex, which makes the planning of communication networks, especially the selection of station sites, more and more complicated. How to efficiently cluster the areas to be covered and plan the distribution of base station sites so that the benefits can be maximized with the minimum cost is a problem that has received a lot of attention. Station site planning is a combinatorial optimization problem, which is usually solved using intelligent optimization algorithms. In this paper, according to the known conditions, the site planning is carried out in the target area, and the number and location of new macro base stations and micro base stations are reasonably allocated so that 90% of the total service volume of weak coverage points are covered by the planned base stations, and the coordinates of the new sites and the types of base stations at the sites are given. On this basis, considering that the coverage area of each station is a graph consisting of three sectors, the results of the optimal station site and sector angle and the ratio of the total service volume of the weak coverage points that can be covered at most are given by recalculating whether the new stations can cover 90% of the total service volume of the weak coverage points under the conditions of the optimal station site and sector angle.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call