Erasure-Coding Based Routing for Opportunistic Networks

Introduction

Most current approaches for routing in DTN are based on sending multiple identical copies of packages over different paths. There is always a tradeoff between overhead and delay. The flooding algorithm, for example, has the best delay, but the worst overhead. The direct algorithm on the other side has the worst delay but the best overhead. We present an erasure coding based algorithm, that achieves a better worst-case delay performance than existing approaches wiht a fixed overhead.

Erasure Codes

${\frac {1}{n}}$

Material

• the paper: "Erasure-Coding Based Routing for Opportunistic Networks.pdf"