Throughput-delay tradeoff for hierarchical cooperation in ad hoc wireless networks

  • Authors:
  • Ayfer Özgür;Olivier Lévêque

  • Affiliations:
  • Ecole Polytechnique Fédérale de Lausanne, Faculté Informatique et Communications, Lausanne, Switzerland;Ecole Polytechnique Fédérale de Lausanne, Faculté Informatique et Communications, Lausanne, Switzerland

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2010

Quantified Score

Hi-index 754.84

Visualization

Abstract

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) = (log n)2T(n) for T(n) between Θ(√n/log n) and Θ(n/log n), 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). Meanwhile, the present paper considers the network multipleaccess problem, which may be of interest in its own right.