Optimal and Approximate Solutions of Object Functions for Base Station Location Problem


The KIPS Transactions:PartC, Vol. 14, No. 2, pp. 179-184, Apr. 2007
10.3745/KIPSTC.2007.14.2.179,   PDF Download:

Abstract

The problem of selecting base station location in the design of mobile communication system has been basically regarded as a problem of assigning maximum users in the cell to the minimum base stations while maintaining minimum SIR, and it is NP-hard. The objective function of warehouse location problem, which has been used by many researchers, is not proper function in the base station locationproblem in CDMA mobile communication. The optimal and approximate solutions have been presented by using proposed object function and algorithms of exact solution, and the simulation results have been assessed and analyzed. The optimal and approximate solutions are found by using mixed integer programming instead of meta-heuristic search methods.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. W. Sohn, "Optimal and Approximate Solutions of Object Functions for Base Station Location Problem," The KIPS Transactions:PartC, vol. 14, no. 2, pp. 179-184, 2007. DOI: 10.3745/KIPSTC.2007.14.2.179.

[ACM Style]
Surg Won Sohn. 2007. Optimal and Approximate Solutions of Object Functions for Base Station Location Problem. The KIPS Transactions:PartC, 14, 2, (2007), 179-184. DOI: 10.3745/KIPSTC.2007.14.2.179.