Critical Sequence Based Stage Scheduling Algorithm and Hierarchical Network Transfer Function for Half-duplex WPNC Networks

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00233401" target="_blank" >RIV/68407700:21230/15:00233401 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Critical Sequence Based Stage Scheduling Algorithm and Hierarchical Network Transfer Function for Half-duplex WPNC Networks

Popis výsledku v původním jazyce

Wireless Physical Layer Network Coding (WPNC) based communication networks deliver the information from sources to destinations through the complex relay network. In order to properly design Network Coded Modulation transmitted by network nodes and relayprocessing including the Hierarchical Network Code (HNC) maps, we need a formal description of the global network processing function. Any practical implementation also implies the half-duplex constrained relays which imposes the network to work in multiple stages. We present a polynomial based formalism defining the Hierarchical Network Transfer Function (H-NTF). It captures all phenomena related to the stage dependent transmit and receive act ivity over the network, including potential buffering, andmainly the hierarchy of forming the local HNC maps into the global hierarchical flow description. Using the polynomial formalism of H-NTF, we develop the half-duplex constrained stage scheduling algorithm. It starts with finding a minima

Název v anglickém jazyce

Critical Sequence Based Stage Scheduling Algorithm and Hierarchical Network Transfer Function for Half-duplex WPNC Networks

Popis výsledku anglicky

Wireless Physical Layer Network Coding (WPNC) based communication networks deliver the information from sources to destinations through the complex relay network. In order to properly design Network Coded Modulation transmitted by network nodes and relayprocessing including the Hierarchical Network Code (HNC) maps, we need a formal description of the global network processing function. Any practical implementation also implies the half-duplex constrained relays which imposes the network to work in multiple stages. We present a polynomial based formalism defining the Hierarchical Network Transfer Function (H-NTF). It captures all phenomena related to the stage dependent transmit and receive act ivity over the network, including potential buffering, andmainly the hierarchy of forming the local HNC maps into the global hierarchical flow description. Using the polynomial formalism of H-NTF, we develop the half-duplex constrained stage scheduling algorithm. It starts with finding a minima

Druh

O - Ostatní výsledky

CEP obor

JA - Elektronika a optoelektronika, elektrotechnika

OECD FORD obor

—

Projekt

<a href="/cs/project/LD12062" target="_blank" >LD12062: Bezdrátové síťové kódování a zpracování signálu v kooperativních a distribuovaných multi-terminálových a multi-uzlových komunikačních systémech</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2015

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ů