Aggregate computing, on the other hand, addresses device coordination in open systems with a layered approach [1]}, separating systems into abstraction layers that decomposing systems engineering into separable tasks, much like the OSI model does for communication networks, [2]}.
The layers span from applications to a field calculus (providing distributed scoping of shared information), and an abstract device model (for services such as neighborhood discovery).
Between these, a middle layer facilitates resilient device interactions and comprises three classes of basis set modules that are themselves distributed graph algorithms:
(i) \(G\) -blocks that spread information through a network of devices,
(ii) \(C\) -blocks that summarize salient information about the network to be used by interacting units,
and (iii) \(T\) -blocks that maintain temporary state.
Prior work [3]}, [4]}, [5]}, has shown that a broad class of device interactions can be realized by interconnections of these three blocks. Our long term research goal is analyze the stability of compositions of these blocks including in feedback.
This paper is concerned with a rigorous analysis of the most general \( G \) -block of [5]}, after making it resilient to network perturbations.
