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

Balls and bins distributed load balancing algorithm for channel allocation

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)
Petrova, M. ; Dept. of Wireless Networks, RWTH Aachen Univ., Aachen, Germany ; Olano, N. ; Mahonen, P.

In this paper we validate through simulations the convergence properties of our earlier proposed balls and bins channel allocation algorithm. The algorithm supports dynamic channel allocation based on local link quality information and does not require exchange of network information. Each radio evaluates periodically a cost function related to the desired QoS. Based on the calculated cost the radio may change the channel with probability proportional to the excess of the current cost over a cost threshold set by the user application. Earlier theoretical work showed the algorithm has low complexity and excellent convergence properties. In this paper we show that radio network simulations confirm the results. In terms of aggregate network throughput the algorithm offers on average modest gains. The most remarkable improvement that the proposed algorithm offers is in terms of fairness. The results show that the worst link throughput in the network can be improved up to 70%. The algorithm guarantees a certain minimum performance to all the links in the network that is determined by the maximum cost set. If all the transmitters have the same cost threshold and there exists a suitable link allocation for the cost threshold set then fairness in the convergence state is guaranteed.

Published in:

Wireless On-demand Network Systems and Services (WONS), 2010 Seventh International Conference on

Date of Conference:

3-5 Feb. 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.