Broadcasting Automata and Patterns on Z^2

Nickson, Thomas and Potapov, Igor
(2014) Broadcasting Automata and Patterns on Z^2. In: Automata, Universality, Computation. Springer. ISBN 978-3-319-09039-9

[img] Text
1410.0573v1.pdf - Unspecified

Download (783kB)


The Broadcasting Automata model draws inspiration from a variety of sources such as Ad-Hoc radio networks, cellular automata, neighbourhood se- quences and nature, employing many of the same pattern forming methods that can be seen in the superposition of waves and resonance. Algorithms for broad- casting automata model are in the same vain as those encountered in distributed algorithms using a simple notion of waves, messages passed from automata to au- tomata throughout the topology, to construct computations. The waves generated by activating processes in a digital environment can be used for designing a vari- ety of wave algorithms. In this chapter we aim to study the geometrical shapes of informational waves on integer grid generated in broadcasting automata model as well as their potential use for metric approximation in a discrete space. An explo- ration of the ability to vary the broadcasting radius of each node leads to results of categorisations of digital discs, their form, composition, encodings and gener- ation. Results pertaining to the nodal patterns generated by arbitrary transmission radii on the plane are explored with a connection to broadcasting sequences and ap- proximation of discrete metrics of which results are given for the approximation of astroids, a previously unachievable concave metric, through a novel application of the aggregation of waves via a number of explored functions.

Item Type: Book Section
Uncontrolled Keywords: cs.FL, cs.FL, cs.DC
Subjects: ?? QA75 ??
Depositing User: Symplectic Admin
Date Deposited: 11 Dec 2015 11:31
Last Modified: 17 Dec 2022 01:31
Related URLs: