Kabushiki Kaisha Toshiba

Sedat Gormus

Magnus Stig Torsten Sandell

Filippo Tosato

Yichao Jin

Zhong Fan

In an embodiment, a method of managing distributed storage in a wireless network is disclosed. The wireless network comprises a plurality of data generating nodes, each data generating node configured to generate and store data symbols and parity symbols. The parity symbols depend on data symbols stored on other data generating nodes. The method comprises receiving indications of link quality estimates for wireless links between the data generating nodes; selecting an arrangement of an array code from a plurality of possible arrangements using the indications of link quality estimates, the array code depending on the number of data generating nodes in the plurality of data generating nodes and a required number of nodes from which all of the data symbols stored in the wireless network can be generated, the arrangement indicating for each data generating node, the dependence of the parity symbols stored on that data generating node on the data symbols stored on other data generating nodes; and sending an indication of the selected arrangement to the data generating nodes.

Reconfigurable encoding arrays for reduced outage probability sensor networks

A method of determining a communication link for sending communication data from a first communications node to any one of a plurality of neighboring candidate nodes, comprising i) for each candidate node, determining a marginal processing gain comprising a measure of the communication data reduction available through aggregating the communication data at the candidate node; and ii) selecting one of the candidate nodes for forming the communication link, wherein the selection is based at least in part on the marginal processing gain determined for each candidate node.

Content centric and load-balancing aware dynamic data aggregation

Opportunistic forwarding of packet based communication is implemented by way of attention to link quality to determine a suitable prioritised route for communication. Ranking of potential routes (or the next hop in a route) can be conducted locally, with reference to a link quality metric also. Channel access by nodes of the same rank in a graph based network can be by way of link quality also.

Growing community of inventors

Bristol, United Kingdom

Sedat Gormus