# Traffic-Predictive Routing Strategy for Satellite Networks
## 6 Simulation Analysis
### Simulation Scenario
#### 6.2.2 Scenario 2: Number of Different Communication Connections  
The scheme proposed in this article is verified under the condition of different numbers of communication connection pairs. In this experiment, the node packet forwarding rate is set to 4500 packets/s, and simulation verification is performed when the number of communication connection pairs is 10, 20, 30, 40, 50, and 60. (1) Packet delivery rate  
As shown in Figure 9, as the number of communication connection pairs increases, it means that more data traffic is injected into the network. Therefore, the load on the network is further increased, resulting in packet loss and ultimately a decrease in the packet delivery rate of the routing protocol. G-AODV introduces a traffic prediction mechanism in the route discovery phase to predict congested nodes to the maximum extent. This avoids the addition of heavily loaded nodes, and the established routing path will not suffer from local overloading or massive packet loss. Compared with E-AODV, DS-DSR, and NCMDSDV, the packet delivery rate of G-AODV has increased by 15%, 18%, and 20%, respectively. Figure 8: Packet loss rate curve under different packet delivery rate scenarios. Figure 9: Packet delivery rate curve. As shown in Figure 10, as the number of communication connection pairs increases, the network load increases, so the average end-to-end delay of all routing protocols continues to increase. The G-AODV protocol selects the path with lighter load and aims to achieve load balancing. In a load-balanced network, network resources are allocated and managed efficiently to ensure that no node is overloaded. This means that the network can cope better with the load even as the number of communication connection pairs increases. Therefore, increasing the number of communication connections will introduce some additional delays, but these delays will be limited by effective load balancing. At the same time, the G-AODV protocol can quickly restore broken paths during the routing maintenance phase to ensure smooth communication. Compared with E-AODV, DS-DSR, and NCMDSDV, the average end-to-end delay of G-AODV has been reduced. As shown in Figure 11, when the number of communication connection pairs increases, the large number of connections may introduce more signal interference and link quality fluctuations. As a result, the probability of link failure in the network increases, eventually leading to the loss of data packets. Additionally, when the number of connections increases rapidly, data traffic increases and the network may struggle to cope, resulting in packet loss. On the basis of achieving load balancing, G-AODV provides a solution when the link is broken, that is, the route maintenance mechanism. After the link is broken, the route maintenance mechanism is immediately adopted to ensure the link connection, which controls the increase in packet loss rate to a certain extent. G-AODV uses node stability to select different satellite nodes for link repair, which can effectively prevent the increase in packet loss rate caused by secondary link breaks. The simulation results show that as the number of communication connection pairs increases, the packet loss rate of G-AODV is significantly lower than that of the comparative routing strategy. Compared with E-AODV, DS-DSR, and NCMDSDV, the packet loss rate of G-AODV is reduced by 4%, 10%, and 18%, respectively. Figure 10: Average end-to-end delay curve under different communication connection logarithmic scenarios. G-AODV relies on GRU and attention mechanisms to predict theoretical values for the future. The GRU model itself is relatively complex, comprising multiple gate units internally. With the introduction of attention mechanisms, the model can more effectively focus on crucial information, albeit at the cost of introducing additional parameters and computations, leading to a further increase in overall model complexity. In comparison to traditional protocols such as E-AODV, DS-DSR, and NCMDSDV, G-AODV exhibits higher complexity.