Font Size: a A A

Optimization Of Information Transmission Path For Interplanetary Internet

Posted on:2015-05-09Degree:MasterType:Thesis
Country:ChinaCandidate:T LinFull Text:PDF
GTID:2308330479489970Subject:Information and Communication Engineering
Abstract/Summary:PDF Full Text Request
With the continuous development of science and technology, people are no longer limited to the exploration of the solar system from Moon and Mars which are closer to Earth, people began to carry out other planets in the solar system exploration activities. Deep space exploration need the support of deep space communications. In deep space communication,the direct link can not be transmit information reliably. It needs rela y communication. So building a relay communication network has become an integral part of deep-space communication systems. Interplanetary Internet is defined by a set of stable, high availability, high capacity relay nodes. It includes the data link(direct link or multi-hop link) between the distance basic unit, and provides navigation and positioning information, remote telemetry information between the detector s, space stations, spacecraft, planets satellites orbiters. it also can store and forward scientific data. Interplanetary Internet link has discontinuities, asymmetry, long delay and other characteristics resulting in the complexity of research on deep space network.In light of this, this paper describes the development of deep space communication and the structure of interplanetary Internet, and demonstrates the feasibility of selecting Lagrangian point as interplanetary Internet nodes and to determine the selection criteria of satellite communication link.Interplanetary Internet is a classic DTN network, this paper describes the DTN network and CGR algorithm’s feasibility and limitations when looking for a information transmission path, to improve the Dijkstra algorithm which is applied in the static network,and propose the shortest time path algorithm and minimum energy path algorithm.Finally, STK software is used to build interplanetary Internet scene, and the simulation shows access time and link distance of Interplanetary Internet which chose the Lagrange points as nodes. According to the simulation data, the simulation analysis and comparison has been done between CGR algorithm, the shortest time algorithms and minimum energy path algorithm. The results prove the effectiveness of the optimization algorithm.
Keywords/Search Tags:Interplanetary Internet, Lagrangian point, CGR, shortest time, minimum energy
PDF Full Text Request
Related items