By Topic

Throughput Scaling of Wireless Ad Hoc Networks With No Side Information

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shengshan Cui ; Qualcomm Inc., San Diego, CA, USA ; Haimovich, A.M.

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

Published in:

Communications Letters, IEEE  (Volume:14 ,  Issue: 9 )