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 ) ² T ( 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 ).