## 1 Introduction
These methods have a high probability of escape failure because the dynamic scheduling links of such approaches and the system execution body itself can still be \"bypassed or short-circuited\" by exploiting high-risk vulnerabilities. Additionally, the diversity and dynamism introduced by MTD do not change the logical nature of software and hardware vulnerability backdoors, nor can they prevent coordinated attacks from internal and external sources [24]. Indeed, packet routing and communication security are two energy-consuming and critical network functions, making secure and reliable communication in heterogeneous networks a challenging task [25; 26]. Many current approaches primarily detect threats and respond to them from a policy perspective. However, a more technical response from a network function perspective can also be effective. For example, the receiver could make sender know that the receiver has successfully received each packet or group of packets through an acknowledgment packet sent by the receiving node. However, this technique is impractical in a lossy environment--such as when the network is under attack from physical or information domains--because the acknowledgment messages themselves are at risk of being lost. Additionally, transmitting a large number of acknowledgment messages or waiting for their reception can significantly increase network overhead and communication delay [27]. Therefore, proposing path redundancy and path backup schemes from a transport perspective is particularly important to enhance reliability and protect against multiple network threats, such as Denial of Service (DoS) attacks, through multipath routing. However, in severely constrained environments, even multipath routing techniques may be difficult to implement, especially if their traditional principles remain unchanged (i.e., the involvement of all network nodes in the multipath routing process throughout the network lifecycle). Achieving secure and reliable data transmission in heterogeneous networks is thus a crucial and complex research area that warrants in-depth exploration. In this context, our study makes several significant contributions:  
1. A generic secure and reliable multi-objective optimized multipath transmission algorithm for heterogeneous networks is proposed: We propose an algorithm capable of constructing multiple redundant transmission paths in heterogeneous networks composed of various sub-networks. By considering the unique characteristics and task requirements of heterogeneous networks, multiple optimization objectives are introduced into the path selection process. This allows the computation of multiple optimal paths that not only meet performance requirements such as delay and reliability but also effectively avoid potential security threats, ensuring efficient and secure transmission across different types of network environments. 2. Optimization of path planning decisions: Path planning decisions in this context represent a mixed-integer programming problem (MIPP), an NP-hard problem. Additionally, there are trade-offs between optimization objectives, and the dimensionality of the solution is variable, making it difficult for traditional algorithms to solve these problems in polynomial time. To address this, we propose optimizing the initial population range using the Optimized Non-dominated Sorting Genetic Algorithm II, which considers multiple objective functions, such as task reliability and delay. This approach filters out the optimal combination of paths to satisfy different demand objectives, ultimately obtaining the Pareto-optimal solution set for the optimization problem. 3. Innovative application of the deletion graph method: After calculating the primary path, we propose simplifying the topological map using the deletion graph method. Unless no other links are available, this method ensures that any redundant paths do not share common links with the original path. This approach enhances the security of the transmission process and improves transmission reliability.