A mixed-integer programming model for the cellular telecommunication network design

Authors:
Filipe F. Mazzini;Geraldo R. Mateus
Affiliations:
Departamento de Ciência da Computação, Av. Antônio Carlos, 6627, Belo Horizonte, MG Brasil 31270 010;Departamento de Ciência da Computação, Av. Antônio Carlos, 6627, Belo Horizonte, MG Brasil 31270 010
Venue:
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Year:
2001

Citing 5
Cited 2

Integer and combinatorial optimization

Integer and combinatorial optimization
Computer networks

Computer networks
Optimum positioning of base stations for cellular radio networks

Wireless Networks
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Lagrangean based methods for solving large-scale cellular network design problems

Wireless Networks
Cellular network configuration with co-channel and adjacent-channel interference constraints

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The cellular telecommunication network design aims to define and dimension the cellular telecommunication system topology in order to serve the voice and/or data traffic demand of a particular geographic region. In this article, we introduce a novel model that addresses the cellular system design problem in a complete fashion. We propose a linear mixed-integer programming model that gathers together into the same model the base station location problem, the frequency channel assignment problem and the base station connection to the fixed network. The purpose of unifying these three problems in the same model is to treat the trade-offs among them providing a higher quality solution to the cellular system design. We still present some computational analyses in order to evaluate the model tradeoffs and its time complexity. In conclusion, we mention our current work towards an effective technique to solve the proposed model.