English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study the throughput-delay performance tradeoff in large-scale wireless adhoc networks. It has been shown that the per source-destination pair throughputcan be improved from Theta(1/sqrt(n log n)) to Theta(1) if nodes are allowed tomove and a 2-hop relay scheme is employed. The price paid for such animprovement on throughput is large delay. Indeed, the delay scaling of the2-hop relay scheme is Theta(n log n) under the random walk mobility model. Inthis paper, we employ coding techniques to improve the throughput-delaytrade-off for mobile wireless networks. For the random walk mobility model, weimprove the delay from Theta(n log n) to Theta(n) by employing Reed-Solomoncodes. Our approach maintains the diversity gained by mobility while decreasingthe delay.

Coding Improves the Throughput-Delay Trade-off in Mobile Wireless Networks