We analyze the capacity scaling laws of clustered ad hoc networks in which nodes are distributed according to a doubly stochastic shot-noise Cox process. We identify five different operational regimes, and for each regime we devise a communication strategy that allows to achieve a throughput featuring the same scaling exponent as the maximum theoretical capacity.

Information-theoretic capacity of clustered random networks

GARETTO, MICHELE;
2010-01-01

Abstract

We analyze the capacity scaling laws of clustered ad hoc networks in which nodes are distributed according to a doubly stochastic shot-noise Cox process. We identify five different operational regimes, and for each regime we devise a communication strategy that allows to achieve a throughput featuring the same scaling exponent as the maximum theoretical capacity.
2010
IEEE International Symposium on Information Theory (ISIT), 2010
Austin, TX
13-18 June 2010
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
IEEE
1698
1702
9781424478903
M. GARETTO; A. NORDIO; C.-F. CHIASSERINI; E. LEONARDI
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2318/78870
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 1
social impact