A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Fragmentation algorithms for DTN links
Tekijät: Ginzboorg P, Niemi V, Ott J
Kustantaja: ELSEVIER SCIENCE BV
Julkaisuvuosi: 2013
Journal: Computer Communications
Tietokannassa oleva lehden nimi: COMPUTER COMMUNICATIONS
Lehden akronyymi: COMPUT COMMUN
Numero sarjassa: 3
Vuosikerta: 36
Numero: 3
Aloitussivu: 279
Lopetussivu: 290
Sivujen määrä: 12
ISSN: 0140-3664
DOI: https://doi.org/10.1016/j.comcom.2012.10.001
Tiivistelmä
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.
Turun yliopiston Tutkimustietojärjestelmän portaali