Rate Constrained Random Access over a Fading Channel

Details Rate Constrained Random Access over a Fading Channel Rate Constrained Random Access over a Fading Channel

2009-08-22

arxiv.org/abs/0908.3265v1

Computer Science

Computer Science and Game Theory

Scientific paper

In this paper, we consider uplink transmissions involving multiple users communicating with a base station over a fading channel. We assume that the base station does not coordinate the transmissions of the users and hence the users employ random access communication. The situation is modeled as a non-cooperative repeated game with incomplete information. Each user attempts to minimize its long term power consumption subject to a minimum rate requirement. We propose a two timescale stochastic gradient algorithm (TTSGA) for tuning the users' transmission probabilities. The algorithm includes a 'waterfilling threshold update mechanism' that ensures that the rate constraints are satisfied. We prove that under the algorithm, the users' transmission probabilities converge to a Nash equilibrium. Moreover, we also prove that the rate constraints are satisfied; this is also demonstrated using simulation studies.

Affiliated with

Also associated with

No associations

Rating

Rate Constrained Random Access over a Fading 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 Rate Constrained Random Access over a Fading Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rate Constrained Random Access over a Fading Channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-190589