By Topic

Throughput-Delay Tradeoff for Hierarchical Cooperation in Ad Hoc Wireless Networks

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)
Ozgur, A. ; Fac. Inf. et Commun., Ecole Polytech. Federate de Lausanne (EPFL), Lausanne, Switzerland ; Leveque, O.

Hierarchical cooperation has recently been shown to achieve better throughput scaling than classical multihop schemes under certain assumptions on the channel model in static wireless networks. However, the end-to-end delay of this scheme turns out to be significantly larger than those of multihop schemes. A modification of the scheme is proposed here that achieves a throughput-delay tradeoff D(n) = (logn)2 T(n) for T(n) between ¿(¿(n)/logn) and ¿(n/logn), where D(n) and T(n) are respectively the average delay per bit and the aggregate throughput in a network of n nodes. This tradeoff complements the previous results of El Gamal et al. , which show that the throughput-delay tradeoff for multihop schemes is given by D(n) = T(n) where T(n) lies between ¿(1) and ¿(¿(n).

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 3 )