Aalborg Universitet

Steinwurf Aps

Daniel E Lucani

Frank H P Fitzek

Janus Heide

Morten V Pedersen

Peyman Pahlevani

Jeppe Krigslund

Jonas Hansen

Olav Geil

Martin Hundebøll

Diego Ruano

Márton A Sipos

Martin HUNDEBØLL

Frank HP Fitzek

A protocol for use in wireless mesh networks uses helper nodes to improve data flow in the network. The protocol is compatible with traditional mesh network routing algorithms. Techniques, systems, devices, and circuits for implementing the protocol are described.

Method and apparatus to enhance routing protocols in wireless mesh networks

Disclosed apparatus and method improve the computational efficiency of encoding and decoding data having erasures according to a maximum distance separable (MDS) code based on a Reed-Solomon code. Thus, n encoded fragments are formed by multiplying k data fragments by an n&#xd7;k generator matrix for the MDS code. The code is formed by reducing, in the generator matrix to the extent possible, the size of the finite field to which entries belong&#x2014;in some cases to the base field having only two elements. In this way, unlike codes known in the art, the generator matrix has more than one column whose entries each take values in the finite field having two elements. In some cases, the generator matrix has a column whose entries each take values in one or more intermediate fields between the finite field having two elements and the encoding field.

Accelerated processing for maximum distance separable codes using composite field extensions

A method for use in a distributed storage system having a plurality of nodes, the method including receiving, at a source node, original data, encoding the original data into plurality of coded fragments using a linear code, transmitting at least a first one of the coded fragments from the source node to a first sink node. The method further includes receiving, at the source node, modified data, calculating, at the source node, a coded difference between the original data and the modified data, transmitting the coded difference from the source node to the first sink node; and recovering, at the first sink node, at least a first portion of the modified data using the coded difference and the at least a first one of the coded fragments.

Method for file updating and version control for linear erasure coded and network coded storage

A protocol for use in wireless mesh networks (PlayNCool) uses helper nodes to improve data flow in the network. The protocol is compatible with traditional mesh network routing algorithms. Techniques, systems, devices, and circuits for implementing the protocol are described.

A wireless network protocol (CORE) and related methods, systems, and circuits are disclosed that are capable of enhancing network performance. The protocol uses random linear network coding (RLNC) for intra-session coding in the network, while allowing nodes in the network to set up inter-session coding regions where flows intersect. Within the inter-session coding regions, combinations of coded packets associated with different unicast sessions are permitted. However, packets associated with multiple different unicast sessions are not allowed to be transmitted outside of the coding regions.

Method, apparatus, and protocol for improving performance in a wireless network

Described are network coding (NC) systems and techniques which utilize multiple composite extension finite fields to reduce complexity at various nodes in a network and also reduce overhead due to signal coding coefficients. A coding design uses a series of finite fields where increasingly larger fields are based on a previous smaller field. Techniques disclosed herein can be applied to existing systems using Random Linear Network Coding (RLNC) or Fulcrum codes.

Composite extension finite fields for low overhead network coding

Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity in the network; and (iii) to deliver an end-to-end performance that is close to that of a high field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in a lower field size. Sources may encode using a high field size expansion to increase the number of dimensions seen by the network using a linear mapping. Receivers can tradeoff computational effort with network delay, decoding in the high field size, the low field size, or a combination thereof.

Growing community of inventors

Hobro, Denmark

Daniel E Lucani