Close category search window
 

Reinforcement Learning-Based Dynamic Guard Channel Scheme with Maximum Packing for Cellular Telecommunications 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)
Lilith, N. ; Sch. of Electr. & Inf. Eng.s, Univ. of South Australia, Mawson Lakes, SA ; Dogancay, K.

This paper presents a distributed reinforcement learning solution to the problem of call admission control for cellular telecommunication networks in the presence of both voice traffic and self-similar data traffic, and user mobility. The developed call admission control architecture is designed to make use of only localised information, and therefore is suitable for implementation in a distributed manner. By way of computer simulations, the call admission control is shown to further improve the revenue raising capability and handoff blocking probability of the optimal maximum packing channel allocation scheme.

Published in:
Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on

Date of Conference: 21-25 Sept. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.