An Efficient Algorithm for Optimizing Base Station Site Selection to Cover a Convex Square Region in Cell Planning

It is gradually more significant to optimally select base stations in the design of cellular networks, as the customers stipulate cheaper and better wireless services. From a set of prospective site locations, a subset needs to be preferred which optimizes two critical objectives: service coverage and financial cost. Discovering the optimum base station locations for a cellular radio network is considered as a mathematical optimization problem. In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The intention is to place a given number of base-stations in a given convex region and to assign range to each of them such that every point in the region is covered by at least one base-station and the maximum range assigned is curtailed. It is basically covering a region by a given number of equal radius circles where the objective is to minimize the radius. A computational method for finding good coverings of a square with equal circles is presented. An algorithm is designed that determines the optimal locations of base stations without performing an exhaustive search. The proposal will try to minimize the number of installed towers, makes tower’s location feasible, and provides full area coverage with an intention to reduce the overlapping.