Fragmentation algorithms for DTN links

: Ginzboorg P, Niemi V, Ott J

Publisher: ELSEVIER SCIENCE BV

: 2013

Computer Communications

: COMPUTER COMMUNICATIONS

: COMPUT COMMUN

: 3

: 36

: 3

: 279

: 290

: 12

: 0140-3664

DOI: https://doi.org/10.1016/j.comcom.2012.10.001

In this paper we show how the problem of in-time transmission of fragmented messages in disrupted networks can be solved in the simplest case of transmission over a single disrupted link. To this end, we: (1) classify fragmentation algorithms based on the knowledge available at the sending node and design example algorithms in each class; and (2) compare the performance of four fragmentation algorithms in six simulated environments. (C) 2012 Elsevier B.V. All rights reserved.