On the Fairness of Rate Allocation in Gaussian Multiple Access Channel and Broadcast Channel

Details On the Fairness of Rate Allocation in Gaussian Multiple Access Channel and Broadcast Channel On the Fairness of Rate Allocation in Gaussian Multiple Access Channel and Broadcast Channel

2006-11-03

arxiv.org/abs/cs/0611015v1

Computer Science

Information Theory

26 pages

Scientific paper

The capacity region of a channel consists of all achievable rate vectors. Picking a particular point in the capacity region is synonymous with rate allocation. The issue of fairness in rate allocation is addressed in this paper. We review several notions of fairness, including max-min fairness, proportional fairness and Nash bargaining solution. Their efficiencies for general multiuser channels are discussed. We apply these ideas to the Gaussian multiple access channel (MAC) and the Gaussian broadcast channel (BC). We show that in the Gaussian MAC, max-min fairness and proportional fairness coincide. For both Gaussian MAC and BC, we devise efficient algorithms that locate the fair point in the capacity region. Some elementary properties of fair rate allocations are proved.

Affiliated with

Also associated with

No associations

Rating

On the Fairness of Rate Allocation in Gaussian Multiple Access Channel and Broadcast Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Fairness of Rate Allocation in Gaussian Multiple Access Channel and Broadcast Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Fairness of Rate Allocation in Gaussian Multiple Access Channel and Broadcast Channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-163767