Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications 2001
DOI: 10.1145/381448.381455
|View full text |Cite
|
Sign up to set email alerts
|

A polynomial-time approximation scheme for base station positioning in UMTS networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
33
0

Year Published

2006
2006
2016
2016

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 57 publications
(33 citation statements)
references
References 8 publications
0
33
0
Order By: Relevance
“…Galota et al [14] exhibit a polynomial time approximation scheme that maximizes the overall utility of base station positioning for a fairly comprehensive model, which includes parameters such as construction costs, operating costs, customer satisfaction and noise interference. The proposed algorithm is significant from a theoretical standpoint, but would be difficult to implement.…”
Section: Related Workmentioning
confidence: 99%
“…Galota et al [14] exhibit a polynomial time approximation scheme that maximizes the overall utility of base station positioning for a fairly comprehensive model, which includes parameters such as construction costs, operating costs, customer satisfaction and noise interference. The proposed algorithm is significant from a theoretical standpoint, but would be difficult to implement.…”
Section: Related Workmentioning
confidence: 99%
“…Results apply directly to TDD mode if the BSs are synchronized. 2 We use the term building a BS to mean either commissioning/activating an existing BS or truly building and installing a new BS. As explained later, the framework allows different costs to be imposed for building a new BS and using an existing BS.…”
Section: A Inputs For the Optimization Frameworkmentioning
confidence: 99%
“…Current and future 3G networks, such as UMTS [1], [2], are based on code division multiple access (CDMA). In a CDMA network, the entire bandwidth allocated to a cell is available to all the users.…”
Section: Introductionmentioning
confidence: 99%
“…The concept of demand nodes was introduced first by Gerlich et al (1996), and it has since been used in different works (e.g., Amaldi et al (2001), Galota et al (2000), Tutschku (1998), Weicker et al (2003)). The basic idea is that the demand node represents the center of an area where the traffic is being generated by the users.…”
Section: Demand Node Modelmentioning
confidence: 99%