Computer Science – Information Theory
Scientific paper
2008-02-14
Computer Science
Information Theory
9 pages, 6 figures, to appear in IEEE Transactions on Information Theory, submitted Dec 2007
Scientific paper
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 trade-off $D(n)=(\log n)^2 T(n)$ for T(n) between $\Theta(\sqrt{n}/\log n)$ and $\Theta(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 trade-off complements the previous results of El Gamal et al., which show that the throughput-delay trade-off for multihop schemes is given by D(n)=T(n) where T(n) lies between $\Theta(1)$ and $\Theta(\sqrt{n})$. Meanwhile, the present paper considers the network multiple-access problem, which may be of interest in its own right.
Leveque Olivier
Ozgur Ayfer
No associations
LandOfFree
Throughput-Delay Trade-off for Hierarchical Cooperation in Ad Hoc Wireless Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Throughput-Delay Trade-off for Hierarchical Cooperation in Ad Hoc Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Throughput-Delay Trade-off for Hierarchical Cooperation in Ad Hoc Wireless Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-682557