By Topic

Performance of channel assignment strategies in cellular systems

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

2 Author(s)
Azad, S. ; Dept. of Electr. Eng., Univ. of South Florida, Tampa, FL, USA ; Sankar, R.

A new algorithm for channel assignment in cellular radio communications is proposed. The algorithm uses flexible fixed channel assignment that enables heavily loaded cells having all their nominal channels busy to borrow channels from other lightly loaded cells within the cluster provided they meet the reuse constraints. The cell in the cluster that has the least number of channels in use at that instant is allocated the highest priority to lend a channel. To minimize the traffic carried on borrowed channels we use different call switching strategies at the time of call departure. The main idea is to first return a channel borrowed from a cell that has the least number of nominal channels available to use at the instance of call departure. Simulation study of the algorithm is carried out. The results show that the proposed priority-based channel borrowing algorithm performs well under both uniform and non-uniform traffic distributions

Published in:

Southeastcon '99. Proceedings. IEEE

Date of Conference:

1999