An efficient algorithm to solve base station location and channel assignment problems in a cellular network
by Robert Aboolian, Sheldon Lou
International Journal of Management and Network Economics (IJMNE), Vol. 1, No. 2, 2009

Abstract: 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.

Online publication date: Thu, 30-Apr-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Management and Network Economics (IJMNE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com