Parity-based loss recovery for reliable multicast transmission
IEEE/ACM Transactions on Networking (TON)
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
PfHSN '96 Proceedings of the TC6 WG6.1/6.4 Fifth International Workshop on Protocols for High-Speed Networks V
Information Theory, Inference & Learning Algorithms
Information Theory, Inference & Learning Algorithms
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Using redundancy to cope with failures in a delay tolerant network
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Erasure-coding based routing for opportunistic networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Network coding: an instant primer
ACM SIGCOMM Computer Communication Review
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance modeling of network coding in epidemic routing
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
Power law and exponential decay of inter contact times between mobile devices
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Routing in Delay-Tolerant Networks Comprising Heterogeneous Node Populations
IEEE Transactions on Mobile Computing
Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks
Performance Evaluation
Efficient erasure correcting codes
IEEE Transactions on Information Theory
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
Criticality condition for information floating with random walk of nodes
Performance Evaluation
| Hi-index | 0.00 |
Delay-tolerant ad hoc networks leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other. To decrease delivery delay, the information to be delivered is replicated in the network. Our objective in this paper is to study a class of replication mechanisms that include coding in order to improve the probability of successful delivery within a given time limit. We propose an analytical approach that allows to quantify tradeoffs between resources and performance measures (energy and delay). We study the effect of coding on the performance of the network while optimizing parameters that govern routing. Our results, based on fluid approximations, are compared to simulations that validate the model.