The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
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
Pocket switched networks and human mobility in conference environments
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
Estimation based erasure-coding routing in delay tolerant networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
A hybrid routing approach for opportunistic networks
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Towards flexibility and accuracy in space DTN communications
Proceedings of the 8th ACM MobiCom workshop on Challenged networks
Agent-based multicast opportunistic routing protocol for wireless networks
Proceedings of the 2nd ACM workshop on High performance mobile opportunistic systems
| Hi-index | 0.00 |
We investigate the problem of routing in opportunistic networks and propose a novel routing algorithm, which combines probabilistic routing with erasure coding. Erasure coding generates large amounts of code blocks with fixed overhead; we apply a sophisticated but realistic method to allocate the generated code blocks to nodes that relies on a probabilistic metric for evaluating node potential. Our goal is to enhance further the robustness of the erasure-coding based forwarding in worst-case delays but also in small-delay scenarios. We detail our algorithm and evaluate its performance against other well-known routing algorithms. We exploit scenarios with adequate resource storage as well as scenarios with limited storage capacity. In both cases, our algorithm yields promising results.