A1 Refereed original research article in a scientific journal
Fragmentation algorithms for DTN links
Authors: Ginzboorg P, Niemi V, Ott J
Publisher: ELSEVIER SCIENCE BV
Publication year: 2013
Journal: Computer Communications
Journal name in source: COMPUTER COMMUNICATIONS
Journal acronym: COMPUT COMMUN
Number in series: 3
Volume: 36
Issue: 3
First page : 279
Last page: 290
Number of pages: 12
ISSN: 0140-3664
DOI: https://doi.org/10.1016/j.comcom.2012.10.001
Abstract
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.
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.
UTU Research Portal