Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Delay- and Disruption-Tolerant Networking
Delay- and Disruption-Tolerant Networking
Foundations and Trends® in Networking
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Efficient broadcasting using network coding
IEEE/ACM Transactions on Networking (TON)
The throughput order of ad hoc networks employing network coding and broadcasting
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A deterministic approach to throughput scaling in wireless networks
IEEE Transactions on Information Theory
Capacity and delay tradeoffs for ad hoc mobile networks
IEEE Transactions on Information Theory
Optimal throughput-delay scaling in wireless networks - part I: the fluid model
IEEE Transactions on Information Theory
Optimal Throughput–Delay Scaling in Wireless Networks—Part II: Constant-Size Packets
IEEE Transactions on Information Theory
Optimal Delay–Throughput Tradeoffs in Mobile Ad Hoc Networks
IEEE Transactions on Information Theory
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Stochastic analysis of network coding in epidemic routing
IEEE Journal on Selected Areas in Communications
Optimal precoding for bi-directional MIMO transmission with network coding
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Hi-index | 0.00 |
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.