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.

中文翻译：

---

一种应用于时间网络的共识路由算法的实验方法

本文介绍了基于共识的路由算法 (CRA) 在真实设备中的实现。CRA 的优势是基于可用性函数进行路线计算，同时考虑了定界邻域的局部条件。该属性允许选择最佳候选以在临时网络内建立连接。之前，已经展示了所提出算法的操作的模拟，本文展示了其在使用开放硬件的物理环境中的性能。通过这种方式，考虑了设备之间的通信延迟和任务调度的真实度量。前面提到的特性使 CRA 成为应用于时间网络的一个很好的选择，因为它们存在的时间很短，因此它们不需要路由是双向的。