About: An Algebraic Approach to Wireless Network Coding with Hierarchical Decode & Forward Strategy     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • 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 tool for 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 generalized to arbitrary number of source nodes when more relays are participating in the communication.
  • 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 tool for 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 generalized to arbitrary number of source nodes when more relays are participating in the communication. (en)
Title
  • An Algebraic Approach to Wireless Network Coding with Hierarchical Decode & Forward Strategy
  • An Algebraic Approach to Wireless Network Coding with Hierarchical Decode & Forward Strategy (en)
skos:prefLabel
  • An Algebraic Approach to Wireless Network Coding with Hierarchical Decode & Forward Strategy
  • An Algebraic Approach to Wireless Network Coding with Hierarchical Decode & Forward Strategy (en)
skos:notation
  • RIV/68407700:21230/12:00193406!RIV13-MSM-21230___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA102/09/1624), S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 121865
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/12:00193406
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Multi-source multi-node wireless networks; physical layer; wireless network coding; hierarchical decode & forward strategy (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [85BAF2DCC8FB]
http://linked.open...v/mistoKonaniAkce
  • Prague
http://linked.open...i/riv/mistoVydani
  • Praha
http://linked.open...i/riv/nazevZdroje
  • POSTER 2012 - 16th International Student Conference on Electrical Engineering
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Hynek, Tomáš
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • České vysoké učení technické v Praze
https://schema.org/isbn
  • 978-80-01-05043-9
http://localhost/t...ganizacniJednotka
  • 21230
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 85 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software