By Topic

An adaptive handover boundaries algorithm

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $31
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)
Kourtis, S. ; Motorola Ltd., UK ; Tafazolli, R.

Cellular network design is based on worst case traffic scenarios that a certain cell might experience. However, reality has shown that traffic tends to vary quite a lot both on a short-term and long-term basis. Although the long-term changes of the traffic can be accommodated by adding capacity where required, the short-term changes are very difficult to accommodate, as these need almost real-time adaptability of the system. This paper describes an adaptive approach to the short-term congestion problem. The proposed algorithm makes substantial utilisation of the coverage areas among the cells by dynamically changing the handover margins of neighbouring cells. In this way, equalisation of the traffic load is achieved among several adjacent cells and the system performance is substantially enhanced

Published in:

3G Mobile Communication Technologies, 2000. First International Conference on (Conf. Publ. No. 471)

Date of Conference:

2000