Redundancy adaptation for multi-path intra-flow network coding in wireless mesh networks

Paul Louis Ageneau, Chuchu Wu, Nadia Boukhatem, Mario Gerla

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Network coding can significantly enhance throughput and reliability in loss prone wireless networks. Adapting network coding redundancy is critical, since overredundancy wastes network resources and hurts performance and under-estimated redundancy prevents decoding at destination. In this paper, we study the tradeoff between application tolerated loss rate and network overhead introduced by network coding redundancy. We first propose an analytic model that determines a simple redundancy bound to adapt network coding redundancy according to the measured packet loss rate and the targeted maximum application loss rate. Then, we propose a distributed algorithm with adaptive redundancy for reliable data delivery in wireless meshes. In the algorithm, each node opportunistically makes use of multiple paths available in the network to deliver data to the destination. We demonstrate the benefits of our schemes through simulation in various network scenarios.

Original languageEnglish
Title of host publication2016 IEEE 84th Vehicular Technology Conference, VTC Fall 2016 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509017010
DOIs
Publication statusPublished - 2 Jul 2016
Externally publishedYes
Event84th IEEE Vehicular Technology Conference, VTC Fall 2016 - Montreal, Canada
Duration: 18 Sept 201621 Sept 2016

Publication series

NameIEEE Vehicular Technology Conference
Volume0
ISSN (Print)1550-2252

Conference

Conference84th IEEE Vehicular Technology Conference, VTC Fall 2016
Country/TerritoryCanada
CityMontreal
Period18/09/1621/09/16

Fingerprint

Dive into the research topics of 'Redundancy adaptation for multi-path intra-flow network coding in wireless mesh networks'. Together they form a unique fingerprint.

Cite this