Literature Database Entry

zubow2025towards


Anatolij Zubow, Sascha Rösler, Juan A. Cabrera, Frank H. P. Fitzek and Falko Dressler, "Towards Resilient and Efficient Multi-RAT Operation through Network Coding," Proceedings of 20th IEEE/IFIP Wireless On-demand Network systems and Services Conference (WONS 2025), Hintertux, Austria, January 2025. (to appear)


Abstract

The usage of network devices equipped with multiple radio access technologies is a promising way to achieve high throughput, low latency, and resilient wireless communication. However, classical scheduling approaches cannot realize the full potential because packet loss on one radio interface can result in resources on the other interfaces to remain unused. This is particularly a problem in situations with asymmetric link data and loss rates. We show that the performance of a multi-RAT system can be significantly improved by the application of intra-flow network coding where the loss of a single or multiple coded packets on one interface does not result in blockage and hence unused radio resources on some other interface. Moreover, it is less sensitive to transmission failures on the backward direction used by automatic repeat request (ARQ). Results from simulations reveal that our approach is able to outperform a classical approach in terms of throughput by factor of up-to 4.4× in certain scenarios.

Quick access

BibTeX BibTeX

Contact

Anatolij Zubow
Sascha Rösler
Juan A. Cabrera
Frank H. P. Fitzek
Falko Dressler

BibTeX reference

@inproceedings{zubow2025towards,
    author = {Zubow, Anatolij and R{\"{o}}sler, Sascha and Cabrera, Juan A. and Fitzek, Frank H. P. and Dressler, Falko},
    note = {to appear},
    title = {{Towards Resilient and Efficient Multi-RAT Operation through Network Coding}},
    publisher = {IEEE},
    address = {Hintertux, Austria},
    booktitle = {20th IEEE/IFIP Wireless On-demand Network systems and Services Conference (WONS 2025)},
    month = {1},
    year = {2025},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.