Improving In-Network Computing in IoT Through Degeneracy

  title={Improving In-Network Computing in IoT Through Degeneracy},
  author={Merim Dzaferagic and Neal McBride and Ryan Thomas and Irene Macaluso and Nicola Marchetti},
  journal={IEEE Systems Journal},
We present a novel way of considering in-network computing (INC), using ideas from statistical mechanics. We model the execution of a distributed computation with graphs called functional topologies, which allows us to provide a formal definition for degeneracy and redundancy in the context of INC. Degeneracy for INC is defined as the structural multiplicity of possible options available within the network to perform the same function with a given macroscopic property (e.g., delay). Two… 

Figures from this paper

Deploying Hierarchical Mesh Networks for Supporting Distributed Computing in Industrial Internet of Things

An in-network-computation-oriented node placement (INP) algorithm that decomposes the whole problem into several delay constrained relay node placement problems, and solves them sequentially, and proves that the INP algorithm ensures explicit time complexity and approximation ratio.

Complex Systems: A Communication Networks Perspective Towards 6G

This work attempts to review basic models of complex networks from a communication networks perspective, focusing on their structural and evolutionary properties, and aims to reveal the models, that may apply when modeling the 5G and 6G mobile communication networks.

Framework for the Identification of Rare Events via Machine Learning and IoT Networks

An industrial cyber-physical system (CPS) based on the Internet of Things (IoT) that is designed to detect rare events based on machine learning and an introduction to the solution to be developed by the FIREMAN consortium.



The Network As a Computer: A Framework for Distributed Computing Over IoT Mesh Networks

This paper presents an element of this vision, whereby the operations of an artificial neural network is mapped onto the communication of a multihop IoT network for simultaneous data transfer and processing, and can reduce the latency in delivering processed information.

Network Flows for Function Computation

This work designs computing and communicating schemes to obtain the function at the terminal at the maximum rate, and develops a fast combinatorial primal-dual algorithm to obtain near-optimal solutions to these linear programs.

Toward a theory of in-network computation in wireless sensor networks

The topic of this article is to survey some lines of research that may be useful in developing a theory of in-network computation, which aims to elucidate how a wireless sensor network should efficiently perform such distributed computation.

On distributed computation rate optimization for deploying cloud computing programming frameworks

A new network flow model with a generalized flowconservation law is developed to enable a systematic design of distributed algorithms for computation rate utility maximization problems (CRUM) in cloud computing.

Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms

This work shows that obtaining minimum-delay and minimum-cost embeddings are both NP-complete problems and that cost minimization is actually MAX SNP-hard, and describes an algorithm that obtains the minimum- cost embedding in polynomial time.

Computing and communicating functions over sensor networks

The maximum rate at which functions of sensor measurements can be computed and communicated to the sink node is studied, focusing on symmetric functions, where only the data from a sensor is important, not its identity.

Multi-Session Function Computation and Multicasting in Undirected Graphs

This paper considers a simple class of computation strategies based on Steiner-tree packing (so-called computation trees), which does not involve block coding and has minimal delay, and shows a close connection between the function computation problem and a communication problem involving multiple multicasts.

A Functional Complexity Framework for the Analysis of Telecommunication Networks

A connection is made between functional complexity, robustness and response to changes that may appear in the system configuration and the implementation and the outcome of a network function which correlates the characteristics of the outcome with the complex relationships that underpin the functional structure.

Optimal mapping of virtual networks with hidden hops

This paper proposes an algorithm based on optimization theory, to map the virtual links and nodes requiring a specific demand, looking for the maximization of the spare bandwidth and spare CPU in the substrate network, taking into account the CPU demanded by the hidden hops when a virtual link is mapped.

On power-law relationships of the Internet topology

These power-laws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period, and can be used to generate and select realistic topologies for simulation purposes.