The Study Of Datagram Routing Algorithm In Satellite Communication Network

With the rapid development of aerospace technology and the expanding field ofhuman activity, the significant position of the satellite communication network in theglobal communications comes to appear increasingly. As an ideal long-distancecommunication pattern, satellite communications have a broad range of applications, itcan overcome the limitations of geographical conditions, send large amounts of dataover long distances at great speed, and meet the needs of a variety of data transmission.As the fundamental technical problem in the satellite communications network, it isextremely important to research and optimize the routing algorithms.Firstly, this paper introduced some concepts of satellite communications and theconstellation design techniques in the satellite communications network. Secondly,depending on the implementation mechanism, the article elaborated on the principle ofthe realization of the existing routing algorithms and their performance. On this basis,we conduct a depth study of the virtual node-based distributed routing algorithm, andcompare its performance with the dynamic routing algorithm based on mobile agent.The analysis shows that in the case of lighter network load, the performance of theDRA algorithm is superior to SDRA-MA algorithm, and in the case of heavy networkload, SDRA-MA algorithm has good adaptive capacity. By the judgment of thenetwork load conditions, we can use these two algorithms alternatively in the processof data packet transmission in the satellite communication network.Finally, the article simulated these two algorithms by software NS-2. In thedifferent network loads, we compare the end-to-end delay and packet loss rate of thesetwo algorithms, analyze the effect of link congestion and node failure on theperformance of the algorithms, and contrast their link utilization and throughput, reachthe purpose of the study of the distributed routing algorithm.