Forward Correction and Fountain codes in Delay Tolerant Networks
| dc.creator | Altman, Eitan | |
| dc.creator | De Pellegrini, Francesco | |
| dc.date | 2008-08-27 | |
| dc.date | 2009-01-19 | |
| dc.date.accessioned | 2026-07-07T12:30:54Z | |
| dc.date.available | 2026-07-07T12:30:54Z | |
| dc.description | Delay tolerant Ad-hoc Networks make use of 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 that needs to be delivered is replicated in the network. Our objective in this paper is to study 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 which validate the model | |
| dc.description | 10 pages - typos fixes | |
| dc.identifier | https://arxiv.org/abs/0808.3747 | |
| dc.identifier | http://arxiv.org/abs/0808.3747 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/216280 | |
| dc.subject | Networking and Internet Architecture | |
| dc.subject | Performance | |
| dc.title | Forward Correction and Fountain codes in Delay Tolerant Networks | |
| dc.type | text |