Throughput Scaling Laws for Wireless Networks with Fading Channels

Details Throughput Scaling Laws for Wireless Networks with Fading Channels Throughput Scaling Laws for Wireless Networks with Fading Channels

2007-07-13

arxiv.org/abs/0707.1912v1

Computer Science

Information Theory

Submitted to IEEE Transactions on Information Theory (Revised)

Scientific paper

A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that each link can be active and transmit with a constant power P or remain silent. The objective is to maximize the throughput over the selection of active links. By deriving an upper bound and a lower bound, it is shown that in the case of Rayleigh fading (i) the maximum throughput scales like $\log n$ (ii) the maximum throughput is achievable in a distributed fashion. The upper bound is obtained using probabilistic methods, where the key point is to upper bound the throughput of any random set of active links by a chi-squared random variable. To obtain the lower bound, a decentralized link activation strategy is proposed and analyzed.

Affiliated with

Also associated with

No associations

Rating

Throughput Scaling Laws for Wireless Networks with Fading Channels 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 Throughput Scaling Laws for Wireless Networks with Fading Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Throughput Scaling Laws for Wireless Networks with Fading Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-60015