By Topic

Call blocking performance of distributed algorithms for dynamic channel allocation in microcells

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

3 Author(s)
L. J. Cimini ; AT&T Bell Labs., Holmdel, NJ, USA ; G. J. Foschini ; Chik-Lin I

The authors determine the blocking performance of channel allocation algorithms where every channel is available for use in every cell and where decisions are made by mobiles based only on local observations. Using a novel Erlang-B approximation method, together with simulation, they demonstrate that even the simplest algorithm, the timid, compares favorably with impractical, centrally administered fixed channel allocation. The results suggest that an aggressive algorithm, that is, one requiring call reconfigurations, could provide substantially reduced blocking. Practical algorithms are presented that take major steps toward achieving the excellent performance of the best aggressive algorithm but that have the stability of the timid algorithm

Published in:

Communications, 1992. ICC '92, Conference record, SUPERCOMM/ICC '92, Discovering a New World of Communications., IEEE International Conference on

Date of Conference:

14-18 Jun 1992