The Transport Capacity of a Wireless Network is a Subadditive Euclidean Functional
Information Theory
2010-10-11 v1 math.IT
Abstract
The transport capacity of a dense ad hoc network with n nodes scales like \sqrt(n). We show that the transport capacity divided by \sqrt(n) approaches a non-random limit with probability one when the nodes are i.i.d. distributed on the unit square. We prove that the transport capacity under the protocol model is a subadditive Euclidean functional and use the machinery of subadditive functions in the spirit of Steele to show the existence of the limit.
Cite
@article{arxiv.0807.2859,
title = {The Transport Capacity of a Wireless Network is a Subadditive Euclidean Functional},
author = {Radha Krishna Ganti and Martin Haenggi},
journal= {arXiv preprint arXiv:0807.2859},
year = {2010}
}