Publisher DOI: 10.1109/ACCESS.2021.3121557
Title: Fragment Forwarding in Lossy Networks
Language: 
Authors: Lenders, Martine S. 
Schmidt, Thomas C.  
Wählisch, Matthias 
Keywords: Embedded networks; Internet of Things (IoT); IP networks; fragmentation; multihop wireless mesh networks
Issue Date: 19-Oct-2021
Publisher: IEEE
Journal or Series Name: IEEE access 
Volume: 9
Startpage: 143969
Endpage: 143987
Project: RIOT App Store für das Internet der Dinge - RAPstore; Teilvorhaben: Anwendungskomponenten und Testing 
Verbundprojekt: Privacy-Integrated design and Validation in the constrained IoT - PIVOT; Teilvorhaben: Eingebettete Sicherheit für Inhaltsprojekte 
Abstract: 
This paper evaluates four forwarding strategies for fragmented datagrams in the IoT on top of the common CSMA/CA MAC implementation for IEEE 802.15.4: hop-wise reassembly, a minimal approach to direct forwarding of fragments, classic end-to-end fragmentation, and direct forwarding utilizing selective fragment recovery. Additionally, we evaluate congestion control mechanisms for selective fragment recovery by increasing the feature set of congestion control. Direct fragment forwarding and selective fragment recovery are challenged by the lack of forwarding information at subsequent fragments in 6LoWPAN and thus require additional data at the nodes. We compare the four approaches in extensive experiments evaluating reliability, end-to-end latency, and memory consumption. Our findings indicate that direct fragment forwarding should be deployed with care, since higher packet transmission rates on the link layer can significantly reduce its reliability, which in turn can even further reduce end-to-end latency because of highly increased link layer retransmissions. Selective fragment recovery can compensate this disadvantage but struggles with the same problem underneath, constraining its full potential. Congestion control for selective fragment recovery should be chosen so that small congestion windows that are growable together with fragment pacing are used. In case of less fragments per datagram, pacing is less of a concern, but the congestion window has an upper bound.
URI: http://hdl.handle.net/20.500.12738/12385
ISSN: 2169-3536
Institute: Department Informatik 
Fakultät Technik und Informatik 
Type: Article
Funded by: Bundesministerium für Bildung und Forschung 
Freie Universität Berlin 
Appears in Collections:Publications without full text

Show full item record

Page view(s)

44
checked on Dec 25, 2024

Google ScholarTM

Check

HAW Katalog

Check

Add Files to Item

Note about this record


This item is licensed under a Creative Commons License Creative Commons