Conferences

@inproceedings{Risc1904:No,

title = {No Plan Survives Contact with the Enemy: On Gains of Coded Multipath over MPTCP in Dynamic Settings},

author = {Frank {Gabriel} and Justus {Rischke} and Frank H. P. {Fitzek} and Maciej {M\"{u}hleisen} and Thorsten {Lohmar}},

year  = {2019},

date = {2019-04-15},

booktitle = {2019 IEEE Wireless Communications and Networking Conference (WCNC) (IEEE 

WCNC 2019)},

address = {Marrakech, Morocco},

abstract = {Systems for assisted and autonomous driving increasingly depend on 

information received and updated through wireless communication. But 

wireless communication often faces performance degradation because of its 

dynamic nature. Using multiple available communication channels, such as 

WiFi, LTE or 5G New Radio, simultaneously can increase the throughput and 

reliability, but also increases the dynamics of the system. MPTCP estimates 

the channel capacity and latency and schedule packets accordingly. However, 

in conditions with unstable channels MPTCP fails to fully utilize the 

available capacity. In this paper, we propose the use of Network Coding to 

efficiently utilize the available resources. We use a channel agnostic, 

random scheduler to maximize the utilization of all available channels. 

This prevents underestimations, but also produces a high number of packet 

loss and duplicate transmissions. We use Network Coding to repair the 

losses and reduce the overhead of redundant data. Our implementation of 

this protocol is evaluated against MPTCP in an emulated multipath network 

with time-varying path properties. The evaluation shows, that the proposed 

protocol utilizes the channels efficiently even in unstable conditions. In 

the evaluated dynamic network, the proposed protocol efficiently utilizes 

94% of the available capacity, while MPTCP is below 80% due to 

underestimation. While our protocol is not suitable for general purpose 

traffic, it provides good performance for large file transfers in unstable 

wireless multipath networks.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Pand1901:MESHMERIZE,

title = {MESHMERIZE: An Interactive Demo of Resilient Mesh Networks in Drones},

author = {Sreekrishna {Pandi} and Frank {Gabriel} and Oleksandr {Zhdanenko} and Simon {Wunderlich} and Frank H. P. {Fitzek}},

year  = {2019},

date = {2019-01-01},

booktitle = {2019 16th IEEE Annual Consumer Communications \& Networking Conference 

(CCNC) (CCNC 2019)},

address = {Las Vegas, USA},

abstract = {Meshmerize is an opportunistic multi-path wireless mesh routing protocol 

designed for dynamic networks. It ensures persistent connectivity to even 

mobile nodes in the network. Classical mesh routing protocols fail 

frequently when the nodes are mobile. In this demo, we demonstrate the 

resilience of Meshmerize and the shortcomings of the classical protocols 

using an emulated drone network. The audience can pilot a (virtual) drone 

in a city through a meshed network of base stations and experience the 

latency and reliability of both protocols first hand.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{gabriel2018multipath,

title = {Multipath Communication with Finite Sliding Window Network Coding for Ultra-Reliability and Low Latency},

author = {Frank {Gabriel} and Anil K. {Chorppath} and Ievgenii A. {Tsokalo} and Frank H. P. {Fitzek}},

doi = {10.1109/ICCW.2018.8403489},

isbn = {2474-9133},

year  = {2018},

date = {2018-05-19},

booktitle = {2018 IEEE International Conference on Communications Workshops (ICC Workshops)},

pages = {1-6},

address = {Kansas City, US},

abstract = {We use random linear network coding (RLNC) based scheme for multipath communication in the presence of lossy links with different delay characteristics to obtain ultra-reliability and low latency. A sliding window version of RLNC is proposed where the coded packets are generated using packets in a window size and are inserted among systematic packets in different paths. The packets are scheduled in the paths in a round robin fashion proportional to the data rates. We use finite encoding and decoding window size and do not rely on feedback for closing the sliding window, unlike the previous work. Our implementation of two paths with LTE and WiFi characteristics shows that the proposed sliding window scheme achieves better latency compared to the block RLNC code. It is also shown that the proposed scheme achieves low latency communication through multiple paths compared to the individual paths for bursty traffic by translating the throughput on both the paths into latency gain.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}