Throughput scaling of wireless ad hoc networks with no side information

Document Type

Article

Publication Date

9-1-2010

Abstract

This letter studies the throughput of wireless ad hoc networks in which neither the source nodes nor the destination nodes have channel state information. Work reported in [3] has shown that in the regime of a large network with a total number of nodes n → ∞, the throughput scales at most as log log n. We present a scheme that achieves a throughput scaling of Θ (log n) for the Gauss-Markov fading process and for network sizes of practical interest. © 2010 IEEE.

Identifier

77957714359 (Scopus)

Publication Title

IEEE Communications Letters

External Full Text Location

https://doi.org/10.1109/LCOMM.2010.080410.100994

ISSN

10897798

First Page

836

Last Page

838

Issue

9

Volume

14

This document is currently not available here.

Share

COinS