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

A mobility optimization CRRM approach for Next Generation Wireless Networks

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)
Sabbagh, A.A. ; Centre for Real-Time Inf. Networks (CRIN), Univ. of Technol., Sydney (UTS), Sydney, NSW, Australia ; Braun, R. ; Abolhasan, M.

Next Generation Wireless Networks (NGWN) are predicted to be heterogeneous in nature. This is achieved through the integration of different Radio Access Technologies (RATs) over a common platform. Common Radio Resource Management (CRRM) was proposed to manage radio resource utilization in heterogeneous wireless networks and to provide required Quality of Service (QoS) for allocated calls. RAT selection algorithms are an integral part of the CRRM algorithms. Their role is to decide, when a new or Vertical Handover (VHO) call is requested, which of the available RATs is most suitable to fit the need of the incoming call and when to admit them. In this paper, we propose an intelligent hybrid RAT selection approach for mobility optimization (patent pending 1) which includes sorting available RATs, collecting information on each RAT using the IEEE P1900.4 Protocol, and making decisions for selecting the most suitable RAT for incoming calls. A comparison for the performance of centralized load-balancing, distributed and the proposed mobility optimization algorithms is presented in terms of new calls blocking probability, VHO calls dropping probability and satisfactions probability. Simulation results show that the proposed algorithm performs better than the centralized load-balancing and distributed algorithms in terms of blocking, dropping and satisfactions probabilities.

Published in:

Computer & Information Science (ICCIS), 2012 International Conference on  (Volume:2 )

Date of Conference:

12-14 June 2012

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.