Throughput Scaling of Wireless Networks With Random Connections

Details Throughput Scaling of Wireless Networks With Random Connections Throughput Scaling of Wireless Networks With Random Connections

2008-09-23

arxiv.org/abs/0809.4019v3

Computer Science

Information Theory

13 pages, 4 figures, To appear in IEEE Transactions on Information Theory

Scientific paper

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an on-off strategy, and receiving nodes employ conventional single-user decoding. The following results are proven: 1) For a class of connection models with finite mean and variance, the throughput scaling is upper-bounded by $O(n^{1/3})$ for single-hop schemes, and $O(n^{1/2})$ for two-hop (and multihop) schemes. 2) The $\Theta (n^{1/2})$ throughput scaling is achievable for a specific connection model by a two-hop opportunistic relaying scheme, which employs full, but only local channel state information (CSI) at the receivers, and partial CSI at the transmitters. 3) By relaxing the constraints of finite mean and variance of the connection model, linear throughput scaling $\Theta (n)$ is achievable with Pareto-type fading models.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-110065