Optimization of base stations positioning in mobile networks

Authors:
Surgwon Sohn;Geun-Sik Jo
Affiliations:
Division of Computer Engineering, Hoseo University, Asan, Korea;School of Computer Science & Engineering, Inha University, Incheon, Korea
Venue:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Year:
2006

Citing 3
Cited 4

Algorithms for constraint-satisfaction problems: a survey

AI Magazine
Discrete models and algorithms for the capacitated location problems arising in UMTS network planning

DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Planning UMTS base station location: optimization models with power control and algorithms

IEEE Transactions on Wireless Communications

Class-based fair code allocation with delay guarantees for OVSF-CDMA and VSF-OFCDM in next-generation cellular networks

EURASIP Journal on Wireless Communications and Networking
Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic

Computers and Operations Research
Channel and Time Slot Allocation for Dense RFID Networks

Wireless Personal Communications: An International Journal
A local search heuristic to solve the planning problem of 3G UMTS all-IP release 4 networks with realistic traffic

International Journal of Autonomous and Adaptive Communications Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.