By Topic

Performance evaluation of channel allocation algorithms with the new reshuffle technique

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

2 Author(s)
Lohner, A. ; Dept. of Electron. & Electr. Eng., King''s Coll., London, UK ; Aghvami, A.H.

This paper deals with the new reshuffle strategy for channel allocation algorithms. The need for a reshuffle strategy arises when the normal channel allocation algorithm wants to block a new call arrival or handover. It removes the congestion, frees channels and allocates them, so in some cases the blocking probability decreases by over 50%. The allocation algorithms are simulated in a cellular mobile network. The results obtained are compared with those achieved by channel allocation algorithms without the reshuffle technique and a new theoretical performance limit of blocking probability is derived

Published in:

Personal, Indoor and Mobile Radio Communications, 1995. PIMRC'95. Wireless: Merging onto the Information Superhighway., Sixth IEEE International Symposium on  (Volume:2 )

Date of Conference:

27-29 Sep 1995