Throughput Scaling of Wireless Networks With Random Connections

13 years 2 months ago

Download web.njit.edu

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

Shengshan Cui, Alexander M. Haimovich, Oren Somekh

Real-time Traffic

Communications | Connection Model | Hoc Wireless Networks | ICC 2009 | Throughput Scaling Laws |

claim paper

» Throughput Scaling in Random Wireless Networks A NonHierarchical Multipath Routing Strateg...

» On the Capacity of Hybrid Wireless Networks

» Throughput Scaling Laws for Wireless Networks with Fading Channels

» Throughput capacity of random ad hoc networks with infrastructure support

» On the delay and throughput of digital and analog network coding for wireless broadcast

» Scaling Laws on Multicast Capacity of Large Scale Wireless Networks

» Queuing network models for delay analysis of multihop wireless ad hoc networks

» Throughput Optimal Distributed Power Control of Stochastic Wireless Networks

Post Info
More Details (n/a)

Added	18 Feb 2011
Updated	18 Feb 2011
Type	Journal
Year	2009
Where	ICC
Authors	Shengshan Cui, Alexander M. Haimovich, Oren Somekh, H. Vincent Poor, Shlomo Shamai

Comments (0)

Sciweavers

Throughput Scaling of Wireless Networks With Random Connections

Communications | Connection Model | Hoc Wireless Networks | ICC 2009 | Throughput Scaling Laws |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers