Information-theoretic Capacity of Clustered Random Networks

13 years 5 months ago

Download www.tlc-networks.polito.it

Abstract-We analyze the capacity scaling laws of clustered ad hoc networks in which nodes are distributed according to a doubly stochastic shotnoise Cox process. We identify five different operational regimes, and for each regime we devise a communication strategy that allows to achieve a throughput to within a poly-logarithmic factor (in the number of nodes) of the maximum theoretical capacity.

Michele Garetto, Alessandro Nordio, Carla-Fabiana

Real-time Traffic

Ad Hoc | CORR 2010 | Education | Maximum Theoretical Capacity | Stochastic Shotnoise Cox |

claim paper

» An InformationTheoretical View of NetworkAware Malware Attacks

» Asymptotic SumCapacity of Random Gaussian Interference Networks Using Interference Alignme...

» On the capacity of the reachback channel in wireless sensor networks

» On the scaling laws of dense wireless sensor networks

» Bounds for the capacity of wireless multihop networks imposed by topology and demand

» Capacity scaling in delay tolerant networks with heterogeneous mobile nodes

» R2 Random Push with Random Network Coding in Live PeertoPeer Streaming

» Product Multicommodity Flow in Wireless Networks

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Michele Garetto, Alessandro Nordio, Carla-Fabiana Chiasserini, Emilio Leonardi

Comments (0)

Sciweavers

Information-theoretic Capacity of Clustered Random Networks

Ad Hoc | CORR 2010 | Education | Maximum Theoretical Capacity | Stochastic Shotnoise Cox |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers