Throughput scaling of wireless ad hoc networks with no side information

Shengshan Cui; Alexander M. Haimovich

doi:10.1109/LCOMM.2010.080410.100994

Throughput scaling of wireless ad hoc networks with no side information

Research output: Contribution to journal › Article › peer-review

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.

Original language	English (US)
Article number	5557640
Pages (from-to)	836-838
Number of pages	3
Journal	IEEE Communications Letters
Volume	14
Issue number	9
DOIs	https://doi.org/10.1109/LCOMM.2010.080410.100994
State	Published - Sep 2010

All Science Journal Classification (ASJC) codes

Modeling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Keywords

Ad hoc networks
channel state information (CSI)
throughput

Access to Document

10.1109/LCOMM.2010.080410.100994

Cite this

@article{9c0d963341a946cdb43afb0c6aa51fd3,

title = "Throughput scaling of wireless ad hoc networks with no side information",

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.",

keywords = "Ad hoc networks, channel state information (CSI), throughput",

author = "Shengshan Cui and Haimovich, \{Alexander M.\}",

year = "2010",

month = sep,

doi = "10.1109/LCOMM.2010.080410.100994",

language = "English (US)",

volume = "14",

pages = "836--838",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "9",

}

TY - JOUR

T1 - Throughput scaling of wireless ad hoc networks with no side information

AU - Cui, Shengshan

AU - Haimovich, Alexander M.

PY - 2010/9

Y1 - 2010/9

N2 - 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.

AB - 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.

KW - Ad hoc networks

KW - channel state information (CSI)

KW - throughput

UR - https://www.scopus.com/pages/publications/77957714359

UR - https://www.scopus.com/inward/citedby.url?scp=77957714359&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2010.080410.100994

DO - 10.1109/LCOMM.2010.080410.100994

M3 - Article

AN - SCOPUS:77957714359

SN - 1089-7798

VL - 14

SP - 836

EP - 838

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 9

M1 - 5557640

ER -

Throughput scaling of wireless ad hoc networks with no side information

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this