By Topic

Sliding window based CAC for adaptive service in mobile network

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)
Peng Zhao ; Coll. of Inf. Eng., Beijing Univ. of Posts & Telecommun., China ; Hui Min Zhang

The CAC algorithm of a mobile network is responsible for reducing the handoff drop ratio (HDR) to an acceptable low level as well as achieving a high acceptance ratio for locally generated calls. Algorithms based on dynamic resource reservation depend on complex measurement, calculation and information exchange between cells. Recently, an adaptive service has been proposed to protect the QoS of mobile users and increase the capacity of a mobile network. We introduce a new sliding window based CAC algorithm especially designed for the adaptive service. This algorithm can avoid the complex estimation of the handoff probability in the dynamic algorithm, and simulation results show that this algorithm can reduce the HDR to nearly zero and can also get a higher acceptance ratio than the dynamic algorithm.

Published in:

Personal, Indoor and Mobile Radio Communications, 2002. The 13th IEEE International Symposium on  (Volume:5 )

Date of Conference:

15-18 Sept. 2002