Coding Improves the Throughput-Delay Tradeoff in Mobile Wireless Networks

DOI10.1109/TIT.2012.2208573zbMATH Open1364.94295arXiv0908.4211MaRDI QIDQ2989720FDOQ2989720

Edmund M. Yeh, Emina Soljanin, Zhenning Kong

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We study the throughput-delay performance tradeoff in large-scale wireless ad hoc networks. It has been shown that the per source-destination pair throughput can be improved from Theta(1/sqrt(n log n)) to Theta(1) if nodes are allowed to move and a 2-hop relay scheme is employed. The price paid for such an improvement on throughput is large delay. Indeed, the delay scaling of the 2-hop relay scheme is Theta(n log n) under the random walk mobility model. In this paper, we employ coding techniques to improve the throughput-delay trade-off for mobile wireless networks. For the random walk mobility model, we improve the delay from Theta(n log n) to Theta(n) by employing Reed-Solomon codes. Our approach maintains the diversity gained by mobility while decreasing the delay.

Full work available at URL: https://arxiv.org/abs/0908.4211

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (3)

• Optimal Rate–Delay Tradeoffs and Delay Mitigating Codes for Multipath Routed and Network Coded Networks
• The actual maximum throughput of mobile ad hoc networks with Reed-Solomon coding
• Sending Perishable Information: Coding Improves Delay-Constrained Throughput Even for Single Unicast

This page was built for publication: Coding Improves the Throughput-Delay Tradeoff in Mobile Wireless Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989720)