## 7 Security of Data Transmission  
The RRNS allows the implementation of the integrity, availability, and confidentiality of data by a single mechanism. These features provide an efficient way to ensure reliability and security during data transmission in MANET. This section discusses the principles on which the proposed method of data transmission in a non-hierarchical network is based. To meet MANET requirements, we choose a symmetric encryption scheme, a secure RRNS with a compact set of moduli \(\{p_{1},p_{2},\ldots,p_{k},p_{k+1},\ \ldots,p_{n}\}\), for which \(p_{n}<p_{1}+p_{1}^{0}\), where \(0<\theta<1\). To provide the required level of security, the moduli must be close in size to each other. The combined use of multipath routing, a secure sharing scheme, and the error correction capabilities of RRNS create the conditions for using a new approach to data transport that guarantees transmission reliability and security. The main principles of the proposed approach:  
1. Data are encrypted by a symmetric encryption algorithm and key \(K\). 2. The encrypted data are represented as a set of \(n\) RRNS shares by dividing it on moduli \(\{p_{1},p_{2},\ldots p_{k},\ p_{k+1},\ldots,p_{n}\}\). 3. Key \(K\) is divided based on the perfect Asmuth-Bloom scheme to guarantee a high level of key security. 4. Shares of the secret, which consist of a share of the key and data shares, are sent by a separate route that is associated with this modulo and obtained according to an algorithm with the possibility of multipath routing with division by nodes. 5. If some of them could not be delivered within the given waiting period, the receiving node carries out a verification procedure, which is based on the ability of the RRNS to correct and control data integrity. 6. After checking secret shares for correctness and integrity, the receiving node performs a recovery procedure. 7. To recover the original data, the receiver needs to recover the secret key from key shares and decrypt the data using the obtained key. Figure 5 shows a generalized scheme of the proposed method of data transmission based on encryption, encoding, and data sharing using RRNS. The key is generated first since its size affects the redundancy of the scheme and, therefore, the overall network load. Shares are moved along one of the previously constructed routes without crossing the nodes. After receiving all or part of the shares of the secret, the receiver recovers the secret by performing the error-correcting decoding procedure. The original secret is obtained by decrypting the data decoded from the RRNS using the encryption key. To balance the network load, a weighted SSS is used [39]. The route weight, route length, and route reliability (if a secure routing algorithm is used) can be adapted by changing RRNS parameters. For example, the shortest route can be associated with the largest RRNS modulo. In this case, the message of this route will be the largest, but the transmission along it will be  
Figure 5: A generalized scheme for secure and reliable data transmission based on a computationally secure SSS. faster. By associating moduli with routes, we can achieve an increase in the quality and speed of transmission and an overall offload of the data transmission network. The share of the secret that is represented by the smallest modulo carries less information about the original secret relative to the information by the larger modulo. This feature is applicable to change the flow of information to increase the security of data transmission, transporting the smallest share of the secret along the least reliable route according to some criterion. The proposed approach is characterized by a combination of reliability and security, which are achieved due to several factors. Reliability is based on multipath routing and the RRNS error correction code.