Abstract
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 coding instead of replication is used in MANETs, an order improvement on the scaling laws of MANETs can be achieved. Note that previous work showed that network coding could only provide constant improvement on the throughput of static wireless networks. Our work thus differentiates MANETs from static wireless networks by the role network coding plays. © 2006 IEEE.
| Original language | English |
|---|---|
| Article number | 5072353 |
| Pages (from-to) | 662-672 |
| Journal | IEEE Journal on Selected Areas in Communications |
| Volume | 27 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - Jun 2009 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Research Keywords
- Fundamental limits
- Mobile ad hoc networks (MANETs)
- Mobility
- Network coding
- Scaling laws
- Throughput-delay-storage tradeoff