Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A method of determining a communication link for sending communication data from a first communications node to any one of a plurality of neighbouring 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.

Abstract: A method of establishing a communication path in a sensor network, the sensor network having a tree structure comprising a plurality of root nodes representative of access point devices in said sensor network, and at least one non-root node representative of a sensor device in said sensor network, wherein each node in said sensor network is associated with a rank value determining its position relative to other nodes, such that said non-root node has higher rank value than said root node, the method comprising forwarding a control message from each root node in a subset of said plurality of root nodes, the control message comprising a tree size value associated with said each root node in said subset, the tree size value defining the number of non-root nodes associated with each root node in said subset; and upon reception of said control message, selecting one of said root nodes in said subset to establish a communication path between said at least one non-root node, based on said tree size values of said ro

Abstract: 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.