By Topic

Fairness in cellular mobile 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

2 Author(s)
Sarkar, S. ; Dept. of Electr. Eng., Pennsylvania Univ., Philadelphia, PA, USA ; Sivarajan, K.N.

Channel allocation algorithms for channelized cellular systems are discussed from a new perspective, viz., fairness of allocation. The concepts of relative and absolute fairness are introduced and discussed. It is shown that under certain reasonable assumptions, there exists an absolute (max-min) fair carried traffic intensity vector (a vector describing the traffic carried in the cells of the system). We also show that this vector is unique. We describe some properties of the max-min fair carried traffic intensity vector in an asymptotic limit where the traffic and the number of channels are scaled together. For each traffic pattern, we determine a fixed channel allocation which attains this max-min fair carried traffic intensity vector independent of the value of the offered traffic, in the same asymptotic limit. Finally, we discuss a tradeoff between being max-min fair and trying to maximize revenue. We conclude by discussing some possible extensions of our work.

Published in:

Information Theory, IEEE Transactions on  (Volume:48 ,  Issue: 8 )