Introduction to data compression
Introduction to data compression
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
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
Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
A new networking model for biological applications of ad hoc sensor networks
IEEE/ACM Transactions on Networking (TON)
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A hybrid routing approach for opportunistic networks
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Optimal delay-power tradeoff in sparse delay tolerant networks: a preliminary study
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Quality of Service and Capacity in Constrained Intermittent-Connectivity Networks
IEEE Transactions on Mobile Computing
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Information Theory
HUBCODE: message forwarding using hub-based network coding in delay tolerant networks
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Forward correction and fountain codes in delay-tolerant networks
IEEE/ACM Transactions on Networking (TON)
Towards efficient and practical network coding in delay tolerant networks
Computers & Mathematics with Applications
On Modeling The Impact of Selfish Behaviors on Limited Epidemic Routing in Delay Tolerant Networks
Wireless Personal Communications: An International Journal
Network Coding for Overhead Reduction in Delay Tolerant Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
Epidemic routing has been proposed to reduce the data transmission delay in opportunistic networks, in which data can be either replicated or network coded along the opportunistic multiple paths. In this paper, we introduce an analytical framework to study the performance of network coding based epidemic routing, in comparison with replication based epidemic routing. With extensive simulations, we show that our model successfully characterizes these two protocols and demonstrates the superiority of network coding in opportunistic networks when bandwidth and node buffers are limited. We then propose a priority variant of the network coding based protocol, which has the salient feature that the destination can decode a high priority sub-set of the data much earlier than it can decode any data without the priority scheme. Our analytical results provide insights into how network coding based epidemic routing with priority can reduce the data transmission delay while inducing low overhead.