An Algebraic Approach to Wireless Network Coding with Hierarchical Decode & Forward Strategy

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00193406" target="_blank" >RIV/68407700:21230/12:00193406 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

An Algebraic Approach to Wireless Network Coding with Hierarchical Decode & Forward Strategy

Popis výsledku v původním jazyce

We address a Wireless Network Coding (WNC) communication scheme based on a Hierarchical Decode & Forward (HDF) strategy for an arbitrary complex full connected wireless network with one layer of relays. Complicated network structure opens novel issues that cannot be investigated in simpler two source networks that have been intensively investigated so far. On the other hand more complex network gives us more degrees of freedom for the WNC/HDF design. In this paper we provide an efficient algebraic toolfor description of the WNC/HDF network operations performed by the network nodes. By manipulations of simple algebraic structures -- vectors and matrices -- over a given finite field $mathbb{F}$ we are able to design a scheme that significantly overcomes a classical orthogonally separated routing paradigm. We provide necessary conditions on individual relay operations so as to guarantee reliable sources -- destinations communication. An exclusive law defined for simple networks can be g

Název v anglickém jazyce

An Algebraic Approach to Wireless Network Coding with Hierarchical Decode & Forward Strategy

Popis výsledku anglicky

We address a Wireless Network Coding (WNC) communication scheme based on a Hierarchical Decode & Forward (HDF) strategy for an arbitrary complex full connected wireless network with one layer of relays. Complicated network structure opens novel issues that cannot be investigated in simpler two source networks that have been intensively investigated so far. On the other hand more complex network gives us more degrees of freedom for the WNC/HDF design. In this paper we provide an efficient algebraic toolfor description of the WNC/HDF network operations performed by the network nodes. By manipulations of simple algebraic structures -- vectors and matrices -- over a given finite field $mathbb{F}$ we are able to design a scheme that significantly overcomes a classical orthogonally separated routing paradigm. We provide necessary conditions on individual relay operations so as to guarantee reliable sources -- destinations communication. An exclusive law defined for simple networks can be g

Druh

D - Stať ve sborníku

CEP obor

JA - Elektronika a optoelektronika, elektrotechnika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA102%2F09%2F1624" target="_blank" >GA102/09/1624: Mobilní rádiové komunikační systémy s distribuovaným, kooperativním a MIMO zpracováním</a><br>

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

POSTER 2012 - 16th International Student Conference on Electrical Engineering

ISBN

978-80-01-05043-9

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

1-8

Název nakladatele

Czech Technical University in Prague

Místo vydání

Praha

Místo konání akce

Prague

Datum konání akce

17. 5. 2012

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—