By Topic

Base station placement in indoor wireless systems using binary integer programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Wong, J.K.L. ; Dept. of Electr. & Comput. Eng., Auckland Univ. ; Mason, A.J. ; Neve, M.J. ; Sowerby, K.W.

The placement of base stations is an important issue in planning wireless systems because it can have a significant influence on the overall system performance. In this paper, we propose a novel binary integer programming formulation of the base station placement problem that allows the user to find an optimal base station configuration in an interference-limited CDMA system using the branch-and-bound (B&B) method. The results are compared to those obtained from a customised version of genetic algorithm (GA). It is shown that although the B&B method guarantees an optimal solution, its computational time increases dramatically with the size of the problem and hence its application may be restricted to small problems. In contrast, although the customised GA method does not guarantee an optimal solution, it is shown to be effective in solving the base station placement problem in most cases and its computational time does not increase as dramatically as the B&B method. This observation suggests that the GA may be useful for solving larger problems where the B&B method fails to find a solution within a reasonable time

Published in:

Communications, IEE Proceedings  (Volume:153 ,  Issue: 5 )