S-CHIRP: Secure communication for heterogeneous IoTs with round-robin protection

Abstract

This work introduces CHIRP -an algorithm for communication between ultra-portable heterogeneous IoT devices with a type of round-robin protection mechanism. This algorithm is presented both in its basic form as well as in a secured form in order to secure and maintain trust boundaries and communication within specific groups of heterogeneous devices. The specific target application scenarios includes resource constrained environments where a co-located swarm of devices (adversarial in mission or objective) is also present. CHIRP, and its secured version (S-CHIRP), enables complete peer-to-peer communication of a n-agent network of devices in as few as n rounds. In addition to the n-round cycle length, the proposed communication mechanism has the following major properties: nodes communication is entirely decentralized, communication is resilient to the loss of nodes, and finally communication is resilient to the (re)-entry of nodes. Theoretical models show that even the secure implementation of this mechanism is capable of scaling to IoT swarms in the million device range with memory constraints in the < 10 MB range.

Learn Muay Thai Basic Movement in Virtual Reality and Sattolo Shuffle Algorithm

“…Based on research [19], the sattolo shuffle algorithm is a modification of the fisher-yates shuffle algorithm by Sandra Sattolo in 1986, this algorithm performs random permutations of a finite set. The results of the modifications made to produce permutations originating from one cycle are more optimal.…”