An efficient algorithm to solve base station location and channel assignment problems in a cellular network
Robert Aboolian and
International Journal of Management and Network Economics, 2009, vol. 1, issue 2, 176-185
Call blockage may incur large losses in areas prone to traffic accidents. We formulate an optimisation problem that chooses base station locations and assign channels to them so as to minimise the overall installation and call blockage costs. Since this problem is a difficult non-linear integer program, we develop an efficient algorithm that finds the optimal solution. The paper features the so-called demand areas that characterise the demand for service of a large number of itinerant cell phone users travelling over a geographic area.
Keywords: facility location models; minimum cost covering location; nonlinear integer programming; wireless networks; channel allocation; base station location; cellular networks; call blockage; cell phones; mobile phones. (search for similar items in EconPapers)
References: Add references at CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
Access to full text is restricted to subscribers.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmnec:v:1:y:2009:i:2:p:176-185
Access Statistics for this article
More articles in International Journal of Management and Network Economics from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().