One-Hop Throughput of Wireless Networks with Random Connections

Details One-Hop Throughput of Wireless Networks with Random Connections One-Hop Throughput of Wireless Networks with Random Connections

2011-11-08

arxiv.org/abs/1111.1827v1

Computer Science

Information Theory

Submitted to IEEE Communications Letters

Scientific paper

We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the throughput scaling of order $n^{1/3-\delta}$, for any $\delta>0$, is proposed, where $n$ is the number of nodes. Such achievable throughput, along with the order $n^{1/3}$ upper bound derived by Cui et al., characterizes the throughput capacity of one-hop schemes for the class of connection models with finite mean and variance.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-53212