Throughput-Delay Tradeoff for Hierarchical Cooperation in Ad Hoc Wireless Networks
Ayfer Özgür, Olivier Lévêque · IEEE Transactions on Information Theory · 2010
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 tradeoffD(n) = (logn)2T(n) forT(n) between¿(¿(n)/logn) and¿(n/logn), whereD(n) andT(n) are respectively the average delay per bit and the aggregate throughput in a network ofnnodes. This tradeoff complements the previous results of El Gamal et al. , which show that the throughput-delay tradeoff for multihop schemes is given byD(n) =T(n) whereT(n) lies between¿(1)and¿(¿(n).