Optimum positioning of base stations for cellular radio networks
Wireless Networks
Cell-Based Positioning Method for Wireless Networks
ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
A Model for Conflict Resolution between Coverage and Cost in Cellular Wireless Networks
HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9
A comparison of randomized and evolutionary approaches for optimizing base station site selection
Proceedings of the 2004 ACM symposium on Applied computing
On the design problem of cellular wireless networks
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Efficient algorithm for placing a given number of base stations to cover a convex region
Journal of Parallel and Distributed Computing
Mobile Radio Network Planning Aspects
WIMOB '07 Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
Base station placement on boundary of a convex polygon
Journal of Parallel and Distributed Computing
EURASIP Journal on Wireless Communications and Networking - Special issue on femtocell networks
Channel and Time Slot Allocation for Dense RFID Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
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.