By Topic

Distributed removal algorithms for multi-rate CDMA cellular communication 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

3 Author(s)

We study the problem of removing users from congested cells. We consider two different objectives for the removal algorithms. The first objective is to maximize the throughput. The second objective is to minimize the number of removed connections. The optimal removing problem can be classified as a combinatorial optimization problem. It is well known that there is no general closed form solution for this type of problem. Furthermore, finding the optimal solutions in medium and large sizes of these problems is usually very exhausting. Consequently, we use heuristics to solve the problem. Our proposed heuristic algorithm is very simple to implement and gives a solution close to the optimum in many different cases.

Published in:

Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th  (Volume:6 )

Date of Conference:

26-29 Sept. 2004