Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Generalized -fair resource allocation in wireless networks Eitan Altman, Konstantin Avrachenkov and Andrey Garnaev
 

Summary: Generalized -fair resource allocation in wireless networks
Eitan Altman, Konstantin Avrachenkov and Andrey Garnaev
Abstract-- The classical water filling problem is concerned
with optimally assigning powers over n independent channels
so as to maximize the total transmitted throughput. If each
channel is associated with another mobile then it is natural
to consider also the problem of fair assignment and to study
tradeoffs between fairness and optimality. The object which is
allocated is the transmission power, and we are interested in
assigning it so as to obtain fairness between either one of three
resulting performance measures: the signal to noise ratio, a
shifted version of it, or the Shannon capacity. We suggest the
generalized -fairness concept. We obtain explicit solutions for
and insight on the fair assignment corresponding to the various
performance measures. For the case of a large number of users
we consider a variational formulation of the problem. The
variational formulation allows us to design distributed resource
allocation algorithms.
I. INTRODUCTION
Fairness concepts have been playing a central role in

  

Source: Avrachenkov, Konstantin - INRIA Sophia Antipolis

 

Collections: Computer Technologies and Information Sciences