Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

A Distributed Multi-Service Resource Allocation Algorithm in Heterogeneous Wireless Access Medium

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)
Ismail, M. ; Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON, Canada ; Weihua Zhuang

In this paper, radio resource allocation in a heterogeneous wireless access medium is studied. Mobile terminals (MTs) are assumed to have multi-homing capabilities. Both constant bit rate and variable bit rate services are considered. A novel algorithm is developed for the resource allocation. Unlike existing solutions in literature, the proposed algorithm is distributed in nature, such that each network base station / access point can perform its own resource allocation to support the MTs according to their service classes. The coordination among different available wireless access networks' base stations is established via the MT multiple radio interfaces in order to provide the required bandwidth to each MT. A priority mechanism is employed, so that each network gives a higher priority on its resources to its own subscribers as compared to other users. Numerical results demonstrate the validity of the proposed algorithm.

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:30 ,  Issue: 2 )