Optimum positioning of base stations for cellular radio networks
Wireless Networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
A polynomial-time approximation scheme for base station positioning in UMTS networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
CDMA Systems Engineering Handbook
CDMA Systems Engineering Handbook
International Journal of Mobile Network Design and Innovation
A decomposition approach for spare capacity assignment for path restorable mesh networks
International Journal of Computers and Applications
Planning wireless networks by shortest path
Computational Optimization and Applications
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II
GUB Covers and Power-Indexed Formulations for Wireless Network Design
Management Science
Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic
Computers and Operations Research
Hi-index | 0.00 |
Designing a wideband code division multiple access (W--CDMA) network is a complicated task requiring the selection of sites for radio towers, analysis of customer demand, and assurance of service quality in terms of signal-to-interference ratio requirements. This investigation presents a net-revenue maximization model that can help a network planner with the selection of tower sites and the calculation of service capacity. The integer programming model takes as input a set of candidate tower locations with corresponding costs, a number of customer locations with corresponding demand for traffic, and the revenue potential for each unit of capacity allocated to each demand point. Based on these data, the model can be used to determine the selection of radio towers and the service capacity of the resulting radio network. The basic model is a large integer program and requires a special algorithm for practical solution. Our algorithm uses a priority branching scheme, an optimization-gap tolerance between 1% and 10%, and two sets of global valid inequalities that tighten the upper bounds obtained from the linear programming relaxation. The algorithm has been implemented in software for the AMPL/CPLEX system and an empirical investigation has been conducted. Using over 300 problem instances with up to 40 towers and 250 service locations, various combinations of algorithm settings have been evaluated. Using the recommended setting results in a design tool that generally runs in under 20 minutes on a 667 MHz AlphaStation.