Capacity scaling of large wireless networks with heterogeneous clusters

Authors:
Valentina Martina;Michele Garetto;Emilio Leonardi
Affiliations:
Dipartimento di Elettronica, Politecnico di Torino, Italy;Dipartimento di Informatica, Universití di Torino, Italy;Dipartimento di Elettronica, Politecnico di Torino, Italy
Venue:
Performance Evaluation
Year:
2010

Citing 6
Cited 0

Randomized algorithms

Randomized algorithms
Scaling laws for ad hoc wireless networks: an information theoretic approach

Foundations and Trends® in Networking
Capacity scaling of wireless networks with inhomogeneous node density: upper bounds

IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
The capacity of wireless networks

IEEE Transactions on Information Theory
A deterministic approach to throughput scaling in wireless networks

IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the capacity scaling laws of wireless networks where the spatial distribution of nodes over the network area exhibits a high degree of clustering. In particular we consider the presence of heterogeneous clusters, both in size and in population, which are common in many real systems. We completely characterize the scaling exponent of the resulting network capacity by providing upper and lower bounds which differ at most by a poly-logarithmic factor in the number of nodes.