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