W-CDMA network design

International Journal of Mobile Network Design and Innovation

Volumn 2, Issue 2, 2007, Pages 92-104

  Cai, Qibin ^a   Kalvenes, Joakim ^b   Kennington, Jeffery ^c   Olinick, Eli V ^c  

^a VERIZON   (United States)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

^c Southern Methodist University   (United States)

Author keywords

Integer programming; Mobile networks; Network design; W CDMA

Indexed keywords

BOUNDARY CONDITIONS; CELLULAR TELEPHONE SYSTEMS; CODE DIVISION MULTIPLE ACCESS; COMPUTER SIMULATION; HEURISTIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; WAVELENGTH DIVISION MULTIPLEXING;

LOWER BOUND MODEL; NETWORK DESIGN; PUBLIC SWITCHED TELEPHONE NETWORK (PSTN); UPPER BOUND MODEL;

WIRELESS NETWORKS;

EID: 35348908863     PISSN: 17442869     EISSN: 17442850     Source Type: Journal    
DOI: 10.1504/IJMNDI.2007.015059     Document Type: Conference Paper

References (12)

1. Amaldi, E., Capone, A. and Malucelli, F. (2001a) 'Discrete Models and algorithms for the capacitated location problems arising in UMTS network planning', Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Rome. ACM, pp. 1-8.
2. Amaldi, E., Capone, A. and Malucelli, F. (2001b) 'Improved models and algorithms for UMTS radio planning. IEEE 54th Vehicular Technology Conference Proceedings, IEEE, pp.920-924.
3. Beasley, J.E. (1989) 'An SST-based algorithm for the steiner problem in graphs', Networks, Vol. 19, No. 1, pp.1-16.
4. Fourer, R., Gay, D.M. and Kernighan, B.W. (2003) AMPL: A Modeling Language for Mathematical Programming, 2nd edition Brooks/ Cole-Thomson Learning, Pacific Grove, CA.
5. Galota, M., Glasser, C., Reith, S. and Vollmer, H. (2001) 'A ploynomial-time approximation scheme for base station positioning in UMTS networks', Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Rome, ACM, pp.52-59.
6. Hata, M. (1980) 'Empirical formula for propagation loss in land mobile radio service', IEEE Transactions on Vehicular Technology, Vol. 29, pp.317-325.
7. Kalvenes, J., Kennington, J. and Olinick, E. (2006) 'Base station location and service assignment in W-CDMA networks', INFORMS Journal on Computing, Vol. 18, No. 3, pp.366-376.
8. Li, J., Kameda, H. and Itoh, H. (1997) 'Balanced assignment of cells in PCS networks', Proceedings of the 1997 ACM Symposium on Applied Computing, pp.297-301, San Jose, CA: ACM Press.
9. Martello, S. and Toth, P. (1990) Knapsack Problems: Algorithms and Computer Implementations, Wiley, Chichester, England.
10. Mathar, R. and M. Schmeink, (2001) 'Optimal base station positioning and channel assignment for 3G mobile networks by integer programming', Annals of Operations Research Vol. 107, pp.225-236.
11. Merchant, A. and Sengupta, B. (1995) 'Assignment of cells to switches in PCS networks', ACM/IEEE Transactions on Networking, Vol. 3, No. 5, pp.521-526.
12. Pisinger, D. (1999) 'Core Problems in Knapsack Algorithms', Operations Research Vol. 47, pp.570-575.