Evaluation of Classifier Complexity for Delay Tolerant Network Routing

Dudukovich, Rachel ; Clark, Gilbert ; Papachristou, Christos

关键词: AEROSPACE ENGINEERING;    ALGORITHMS;    CLASSIFIERS;    DECISION THEORY;    DEEP SPACE NETWORK;    GROUND STATIONS;    HETEROGENEITY;    LOW EARTH ORBITS;    MACHINE LEARNING;    PICOSATELLITES;    PROTOCOL (COMPUTERS);    RELAY SATELLITES;    SURFACE VEHICLES;   

RP-ID  :  GRC-E-DAA-TN67967

学科分类：航空航天科学

美国|英语

来源: NASA Technical Reports Server

【 摘 要 】

The growing popularity of small cost effective satellites (SmallSats, CubeSats, etc.) creates the potential for a variety of new science applications involving multiple nodes functioning together or independently to achieve a task, such as swarms and constellations. As this technology develops and is deployed for missions in Low Earth Orbit and beyond, the use of delay tolerant networking (DTN) techniques may improve communication capabilities within the network. In this paper, a network hierarchy is developed from heterogeneous networks of SmallSats, surface vehicles, relay satellites and ground stations which form an integrated network. There is a tradeoff between complexity, flexibility, and scalability of user defined schedules versus autonomous routing as the number of nodes in the network increases. To address these issues, this work proposes a machine learning classifier based on DTN routing metrics. A framework is developed which will allow for the use of several categories of machine learning algorithms (decision tree, random forest and deep learning) to be applied to a dataset of historical network statistics, which allows for the evaluation of algorithm complexity versus performance to be explored. We develop the emulation of a hierarchical network, consisting of tens of nodes which form a cognitive network architecture. CORE (Common Open Research Emulator) is used to emulate the network using bundle protocol and DTN IP neighbor discovery.