An efficient algorithm to solve base station location and channel assignment problems in a cellular network
AbstractCall 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Inderscience Enterprises Ltd in its journal Int. J. of Management and Network Economics.
Volume (Year): 1 (2009)
Issue (Month): 2 ()
Contact details of provider:
Web page: http://www.inderscience.com/browse/index.php?journalID==259
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.;
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Graham Langley) or (Christopher F. Baum).
If references are entirely missing, you can add them using this form.