An experimental approach to the consensus routing algorithm applied to temporal networks.

This article presents the implementation in real devices of the consensus-based routing algorithm (CRA). The CRA has the advantage of basing the route calculation on an availability function, considering the local conditions of a delimited neighborhood. This attribute allows the best candidate to be chosen to establish a connection within the temporary network.Previously, simulations of the operation of the presented algorithm have been shown, this article shows its performance in a physical environment, using open hardware. In this way, real measures of communication latency between devices and task scheduling are considered. The characteristics as mentioned earlier make the CRA a good option to apply in temporal networks since they are present for brief moments, so they do not require the route to be two-way. [ABSTRACT FROM AUTHOR]