AAU Student Projects - visit Aalborg University's student projects portal
A master's thesis from Aalborg University
Book cover


MAC/Routing layer interaction with Wireless Network Coding

Authors

;

Term

10. term

Publication year

2007

Pages

56

Abstract

Netværkskodning (network coding) giver netværk mulighed for at kombinere flere datastrømme, også når de går i begge retninger, så de kan behandles samlet i stedet for hver for sig. Det kan reducere antallet af nødvendige overførsler og øge gennemstrømningen, altså mængden af data leveret pr. tidsenhed. For at udnytte dette bedst muligt kan man vælge ruter, hvor datastrømme mødes og kan kodes sammen. Sådanne metoder kaldes kodningsbevidst rutevalg. I denne afhandling foreslår, implementerer og evaluerer vi to kodningsbevidste rutealgoritmer. Den første er motorvejsbaseret rutevalg, hvor trafik ledes gennem et sæt forudbestemte “motorveje” for at maksimere interaktion mellem strømme. Den anden er en mere adaptiv algoritme, som ved ankomst af en ny strøm vælger den rute, der giver mest mulig gavnlig interaktion med de eksisterende strømme i netværket. Gennem analytiske beregninger og simuleringer viser vi, at netværkskodning øger gennemstrømningen i forhold til traditionel transmission, og at vores kodningsbevidste rutevalg med netværkskodning kan give op til 50% højere gennemstrømning end netværkskodning kombineret med konventionelt rutevalg.

Network coding allows a network to combine multiple data flows, including flows in both directions, so they can be processed together rather than separately. This can reduce the number of transmissions and increase throughput, meaning the amount of data delivered per unit time. To make the most of this, routes can be chosen so that flows meet and can be coded together; this approach is known as coding-aware routing. In this thesis, we propose, implement, and evaluate two coding-aware routing algorithms. The first is highway-based routing, which steers traffic along a set of predetermined “highways” to maximize interaction among flows. The second is a more adaptable algorithm that, for each newly arriving flow, picks a route that maximizes beneficial interaction with the flows already in the network. Using analytical models and simulations, we show that network coding improves throughput compared with conventional transmission, and that coupling it with our coding-aware routing can yield up to 50% higher throughput than network coding combined with conventional routing.

[This abstract was generated with the help of AI]