On the improvement of scaling laws for large-scale MANETs with network coding

@article{Zhang2009OnTI,
  title={On the improvement of scaling laws for large-scale MANETs with network coding},
  author={Chi Zhang and Xiaoyan Zhu and Yuguang Fang},
  journal={IEEE Journal on Selected Areas in Communications},
  year={2009},
  volume={27}
}
This paper investigates the problem of how much benefit network coding can contribute to the network performance in terms of throughput, delay, and storage requirements for mobile ad hoc networks (MANETs), compared to when only replication, storage and forwarding are allowed in relay nodes. We characterize the throughput-delay-storage tradeoffs under different node mobility patterns, i.e., i.i.d. and random walk mobility, with and without network coding. Our results show that when random linear… CONTINUE READING

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 19 CITATIONS

Optimal Configuration of Network Coding in Ad Hoc Networks

  • IEEE Transactions on Vehicular Technology
  • 2015
VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Throughput and Delay Analysis for Convergecast with MIMO in Wireless Networks

  • IEEE Transactions on Parallel and Distributed Systems
  • 2012
VIEW 7 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Mobility Weakens the Distinction Between Multicast and Unicast

  • IEEE/ACM Transactions on Networking
  • 2016
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Optimal Throughput–Delay Tradeoff in MANETs With Supportive Infrastructure Using Random Linear Coding

  • IEEE Transactions on Vehicular Technology
  • 2016
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Multicast Delivery Delay in General Two-Hop Relay MANETs

  • 2017 International Conference on Networking and Network Applications (NaNA)
  • 2017
VIEW 1 EXCERPT

Multicast Delivery Probability of MANETs with Limited Packet Redundancy

  • 2016 International Conference on Networking and Network Applications (NaNA)
  • 2016
VIEW 1 EXCERPT

References

Publications referenced by this paper.
SHOWING 1-10 OF 35 REFERENCES

Algebraic gossip: a network coding approach to optimal multiple rumor mongering

  • IEEE Transactions on Information Theory
  • 2006
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Capacity and delay tradeoffs for ad hoc mobile networks

  • IEEE Trans. Information Theory
  • 2005
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Reversible markov chains and random walks on graphs

D. Aldous, J. Fill
  • Monograph in preparation. [Online]. Available: http://www.stat.berkeley.edu/∼aldous/RWG/book.html
  • 2005
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Throughput-storage tradeoff in ad hoc networks

  • Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
  • 2005
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

The capacity of wireless networks

  • IEEE Trans. Information Theory
  • 2000
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Optimal Delay–Throughput Tradeoffs in Mobile Ad Hoc Networks

  • IEEE Transactions on Information Theory
  • 2007
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Throughput-delay trade-off in energy constrained wireless networks

  • International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.
  • 2004
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Bounds on the benefit of network coding: Throughput and energy saving in wireless networks

A. Keshavarz-Haddadt, R. Riedi
  • Proc. INFOCOM 2008, Phoenix, AZ, April 2008.
  • 2008
VIEW 2 EXCERPTS

Efficient routing in intermittently connected mobile networks: the multiple-copy case

Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra
  • 2008
VIEW 1 EXCERPT