## 3 Results: Combined Hashing Scheme for MVL Linked List
### Modified MVLL with Mixing Data from Internal Subsystems and External Nodes  
The proposed scheme of data transfer for the network mobile agent is given in Figures 2 and 3, it involves partner agents \(A_{0}\) and \(A_{1}\) and \(Q\) collaborating network nodes \(V_{q}\), considered as verifiers \(V\) like in [29; 51]. It suppose three basic procedures I, II, and III marked by red, blue and green arrows. Steps I and II are shown in Figure 2, and step III is given in Figure 3.  
The main task of step I in Figure 2 is to provide agent \(A_{1}\) by the set of quasi-random keys by means QKD line, and to transform the finally processed quantum key into the subset of fragmented quasi-random keys written in subsystems \(S_{2},\ldots,\ S_{N}\). Thus, data flow I (red) supposes periodic loading of the mobile agent by quasi-random keys, received via the wireless QKD line [67; 68], connecting agent \(A_{0}\) with mobile agent \(A_{1}\) in the trusted service zone providing appropriate level of security. The generated key is to be further fragmented to the set of 8-bit one-time quasi-random keys in order to adapt the system for 8-bit microcontrollers. These keys are to be accumulated and used for internal verification procedures, the needed throughput of quasi-random numbers source may be even less than \(\sim 1\) Kbit/s. In the considered verification scheme the source of so-called entangled photons from route verification scheme [29] is not obligatory, and can be changed for any low-throughput QKD line, providing generation of quasi random one-time keys. For simplicity internal subsystem \(S_{1}\) is shown as one supervisor module to control data exchange between external and internal devices.  
to the agent's task. This moment may e.g., respond to the visit to the next check-point. Then module \(S_{1}\) activates the step II (tagged by blue arrows) to form the new entry, which includes the sequential polling of internal subsystems \(S_{2},\dots,\ S_{N}\) to receive preliminary selected parameters for the external backup. Further internal hashing procedure should approve these data. Here for simplicity we do not consider any routine communications between the agent and external nodes which may interrupt the process.  
Step III of the procedure is shown in Figure 3 and refers to the external distributed storage formation [19], which partially use blockchain scheme [25; 26] with network protocols like e.g., [69; 70]. In contrast to MVLL version proposed in [19], the new one may use more verification data from external nodes. E.g., space coordinates \((x,y,z)\) of the mobile checkpoint node can be useful to approve the passed route of the mobile agent. Polling of \(Q\) free collaborating nodes (first green arrow) is to be done according to the initially given list of participants, and the reply transfer (backward oriented green arrow in middle) returns assigned quasi-random hash values and possible additional technical parameters. After the polling procedure the agent \(A_{1}\) should resend the completed new entry to all involved participants (third green arrow). Data extraction from distributed external storages is supposed to be especially requested.