Optimal base station positioning and channel assignment for 3G mobile networks by integer programming

Authors

R. Mathar, M. Schmeink,

Abstract

        In this paper, discrete mathematical programming approaches are used to solve the frequency allocation and cell site selection problem in an integrated setup. Both CDMA (code division multiple access) and FD/TDMA (frequency/time division multiple access) technologies will be important for 3rd generation mobile systems. If all users share the same bandwidth, base transmitter stations should be placed such that a maximum of traffic can be carried at low interference rates. The expected traffic is represented by spatially scattered weighted nodes. The problem to select an optimal set of base station locations from a given pool of configurations is formulated as an integer linear program and solved by combinatorial optimization methods. For systems which employ FD/TDMA schemes, the cell site optimization process depends on the assignment of channels. We suggest an integrated linear programming approach to solve both objectives in a single planning step.Because of the problems' tremendous complexity, special branch-and-bound procedures are developed as exact and approximate solution methods. An examples is given for a typical urban scenario with base transmitters below roof edges.

BibTEX Reference Entry 

@article{MaSc01,
	author = {Rudolf Mathar and Michael Schmeink},
	title = "Optimal base station positioning and channel assignment for 3{G} mobile networks by integer programming",
	pages = "225-236",
	journal = "Annals of Operations Research",
	volume = "107",
	year = 2001,
	hsb = RWTH-CONV-223170,
	}

Downloads

 Download bibtex-file

Sorry, this paper is currently not available for download.