# On the number of active links in random wireless networks

@article{Keshavarz2014OnTN, title={On the number of active links in random wireless networks}, author={Hengameh Keshavarz and Ravi R. Mazumdar and Rahul Roy and Farshid Zoghalchi}, journal={ArXiv}, year={2014}, volume={abs/1412.3098} }

This paper presents results on the typical number of simultaneous point-to-point transmissions above a minimum rate that can be sustained in a network with $n$ transmitter-receiver node pairs when all transmitting nodes can potentially interfere with all receivers. In particular we obtain a scaling law when the fading gains are independent Rayleigh distributed random variables and the transmitters over different realizations are located at the points of a stationary Poisson field in the plane… Expand

#### References

SHOWING 1-10 OF 21 REFERENCES

Communication over a wireless network with random connections

- Computer Science
- IEEE Transactions on Information Theory
- 2006

The model in this paper differs substantially from the many existing approaches in that the channel connections in this network are entirely random: rather than being governed by geometry and a decay-versus-distance law, the strengths of the connections between nodes are drawn independently from a common distribution. Expand

A Lower Bound for the Achievable Throughput in Large Random Wireless Networks Under Fixed Multipath Fading

- Computer Science
- 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks
- 2006

This work shows that a constant times 1/√n bps/node is also achievable, w.h.p., when the channel gains are random, for networks with random node locations under a deterministic channel gain modeling path-loss and absorption. Expand

On the Capacity of Ad Hoc Networks Under Random Packet Losses

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2009

It is shown that in a large network, as the packet travels an asymptotically large number of hops from source to destination, the cumulative impact of packet losses over intermediate links results in a per-node throughput of only <i>O</i>(<sub>radic(n)/<sup>1</sup>) under the previously proposed routing and scheduling strategy. Expand

Throughput Scaling Laws for Wireless Networks With Fading Channels

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2007

A network of n communication links, operating over a shared wireless channel, is considered and it is shown that in the case of Rayleigh fading: (i) the maximum throughput scales like log n; (ii) themaximum throughput is achievable in a distributed fashion. Expand

Rate-Constrained Wireless Networks With Fading Channels: Interference-Limited and Noise-Limited Regimes

- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2011

A network of n wireless communication links is considered in a Rayleigh fading environment and it is shown that, by proper selection of the algorithm parameters, the proposed scheme allows the network to operate in a noise-limited regime in which the transmission rates can be adjusted by the transmission powers. Expand

The Capacity of Wireless Networks: Information-Theoretic and Physical Limits

- Computer Science
- IEEE Transactions on Information Theory
- 2009

The result shows that information-theoretic limits of wireless communication problems can be rigorously obtained without relying on stochastic fading channel models, but studying their physical geometric structure. Expand

Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory

- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2007

An achievable bit rate per source-destination pair in a wireless network of n randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that… Expand

Large wireless networks under fading, mobility, and delay constraints

- Computer Science, Mathematics
- IEEE INFOCOM 2004
- 2004

It is shown that, under a general model of fading, each node can send data to its destination with a rate K/sub 2/n/sup -1// /sup 2/(log n)/sup -3/2, and with probability approaching 1 as the number of nodes n approaches infinity. Expand

The capacity of wireless networks

- Computer Science
- IEEE Trans. Inf. Theory
- 2000

When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for… Expand

Adaptive spatial aloha, fairness and stochastic geometry

- Computer Science, Mathematics
- 2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt)
- 2013

This work considers quasi-static networks in which mobiles learn the local topology and incorporate this information to adapt their medium access probability (MAP) selection to their local environment and shows that the distribution of the optimal MAP can be obtained from that of a certain shot noise process with respect to this Poisson point process. Expand