Optimization of Base Stations Positioning in Mobile Networks
Cell planning is a very complex task because many aspects should be taken into account including the traffic distribution, geography, antenna height of base stations, frequency, and so forth. This becomes more complicated when several constraints are considered such as the quality of service, maximum output power of transmitters, types of power control, and other network requirements. The problems are assignment of mobile stations to the appropriate base station and finding good locations of the base stations. This paper presents a constraint satisfaction problem model for base station location in 3G W-CDMA uplink environments. This is similar to a warehouse location problem, so it is NP-hard and consequently cannot be practically solved by exact methods for real size networks. Thus we apply constraint satisfaction techniques such as variable ordering and value ordering to get good approximate solutions. The algorithm has been implemented by using both integer programming and constraint programming.
KeywordsMobile Station Constraint Satisfaction Problem Traffic Distribution Total Output Power Total Transmitted Power
Unable to display preview. Download preview PDF.
- 1.ITU-T Focus Group on Traffic Engineering for Personal Communication. E.750 Series of Recommendations on Traffic Engineering Aspects of Networks Supporting Mobile and UPT Services. Technical Reference, ITU, Geneva, CH (1999) Google Scholar
- 2.Glasser, C., Reith, S., Vollmer, H.: The Complexity of Base Station Positioning in Cellular Networks. In: Approximation and Randomized Algorithms in Communication Networks, ICALP Workshops 2000, Proceedings in Informatics, vol. 8, pp. 167–177. Carleton Scientific, Ottawa (2000)Google Scholar
- 4.ILOG OPL Studio 3.7 User’s ManualGoogle Scholar
- 5.Smith, B.M.: Constraint Programming in Practice: Scheduling a Rehearsal. Report APES-67-2003 (September 2003)Google Scholar
- 9.Mathar, R., Schmeink, M.: Optimal Base Station Positioning and Channel Assignment for 3G Mobile Networks by Integer Programming. In: Ann. of Operations Research, pp. 225–236 (2001)Google Scholar
- 10.Eisenblatter, A., Fledderus, E.R., Fugenschuh, A., Geerdes, H.F., Heideck, B., Junglas, D., Koch, T., Kurner, T., Martin, A.: Mathematical Methods for Automatic Optimization of UMTS Radio Networks. Technical Report IST-2000-28088-MOMENTUM-D43-PUB (2003)Google Scholar
- 11.Kumar, V.: Algorithms for Constraint Satisfaction Problems: A Survey. AI Magazine 13, 32–44 (1992)Google Scholar