By Topic

A set partitioning approach for cellular planning of mobile radio network

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
$33 $13
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

1 Author(s)
S. Z. Ali ; Dept. of Electr. & Electron. Eng., Imperial Coll. of Sci., Technol. & Med., London, UK

In the design of radio networks, the problem of cellular planning is of critical importance. The present paper addresses the problem of determining the minimum number of base stations required to cover a design area, the associated optimal cell sizes, and the best topographical configurations for the cells, while meeting system performance requirements. The problem is formulated as a set partitioning problem, where the requirements of radio coverage, non-uniform traffic distribution, and topographical constraints are taken into account. A highly efficient branch and bound algorithm is then used to obtain the guaranteed optimal solution. By considering a range of benchmark network problems that have appeared in the literature, it is shown that the proposed technique has a significantly superior performance to other known techniques.

Published in:

Communications, 2002. ICC 2002. IEEE International Conference on  (Volume:2 )

Date of Conference:

2002