A simplex K-means algorithm for radio-port placement in cellular networks

To increase capacities of cellular networks, large cells must be replaced by micro and/ or pico cells. Employing small cells increases the number of radio-ports required to cover the same service area. Therefore, optimal placement of radio-ports can minimize the number of radio-ports and reduce the deployment costs, and at the same time, it provides the same required coverage. This paper proposes a hybrid of the Nelder-Mead simplex and K-means algorithms. The algorithm minimizes the maximum path loss experienced by wireless portable handsets. The performance of the proposed algorithm is compared with those of the quasi-Newton algorithm, as well as the exhaustive search. Simulation results show that the simplex K-means algorithm finds better radio-port placements, especially for larger floor plans