Cart (Loading....) | Create Account
Close category search window

Performance Evaluation on Common Radio Resource Management Algorithms

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

5 Author(s)
Leijia Wu ; Sydney & Wireless Technol. Lab., Univ. of Technol., Sydney, Sydney, NSW, Australia ; Sabbagh, A. ; Sandrasegaran, K. ; Elkashlan, M.
more authors

The next generation wireless network is expected to be a heterogeneous. The Radio Access Technology (RAT) selection algorithm, including initial RAT selection and vertical handover, is one of the key research areas in Common Radio Resource Management (CRRM). A suitable RAT selection algorithm can maximize the system performance and Quality of Service (QoS) by allocating users to the most suitable RAT in the case of two or more RATs co-located in the same coverage area. This paper evaluates the performance of three RAT selection algorithms, load balancing based using maximum resource consumption, load balancing based using minimum resource consumption and service based algorithms, in terms of traffic distribution, blocking probability, throughput and throughput fairness for a co-located GERAN/UTRAN/WLAN network. Simulation results show that in terms of blocking probability, the service based algorithm is the worst one when the traffic load is high. In terms of data throughput, the load balancing based using maximum resource consumption algorithm performs better than the other two when the traffic load is low. However, the service based algorithm outperforms the other two when the traffic load is high. In terms of throughput fairness, the service based algorithm achieves the best performance.

Published in:

Advanced Information Networking and Applications Workshops (WAINA), 2010 IEEE 24th International Conference on

Date of Conference:

20-23 April 2010

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.