CONTACT GRAPH ROUTING FOR INTER SATELLITE NETWORKING

Abstract

This study tends to improve communication effectiveness among satellite through contact graph routing for inter-satellite networking. For deep space mission, the research systematically ad- dresses the problem of extreme latency which is as a result of the vast distance between space objects, also it addresses the issue of intermittent connectivity and low goodput by reviewing literatures, setting up of a conceptual framework, developing an algorithm, simulating and comparing with existing algorithms. The result shows comparisons of incremental forwarding and batch forwarding whilst using a bundle aggregation technique proving that contact graph routing can be optimized upon arrival with the implementation of the Licklider Transmission Protocol Convergence Layer (LTPCL). The research states that DTN protocols are important in terms of routing efficiency and also, it was observed that the implementation of a bundle aggregation techniques contributes greatly to the development of better space communication systems.