00000nam 2200000za 4500 9.821273 CaOODSP 20240219183442 cr ||||||||||| 160719s2013 onc|||||o f000 0 eng d CaOODSP eng eng fre n-cn--- D68-6/081-2013E-PDF McKenzie-Picot, S. Routing algorithm analysis for a nanosatellite constellation in low earth orbit [electronic resource] / by S. McKenzie-Picot and P. Gavigan. [Ottawa] : Defence Research and Development Canada, c2013. x, 16 p. : tables, graphs. Technical Memorandum ; 2013-081 "October 2013." Includes bibliographical references. This paper examines possible routing algorithms in a proposed network of nanosatellites with the goal of finding networking methods that could be effectively used in a dynamic environment with limited computing power. Three routing algorithms were created and their performance was compared to Dijkstra’s shortest path algorithm. The chaos method transmitted to accessible satellites at random. The minimum distance method transmitted to the closest unused satellite. The grouping method grouped satellites by their physical position in the network and made transmission decisions based on these groups. Each algorithm was run for every possible combination of source and destination satellite in the network to find average transmission times, distances, and number of network nodes used. It was found that the grouping method had performance comparable to Dijkstra’s algorithm while requiring less computing power, and was acceptable for high-speed network requirements, such as live voice. The chaos method was acceptable for lower speed applications and for satellites that had little computing power, and the minimum distance method improved on chaos method with little extra computing power required. gccst Technical reports Nanosatellites Constellations Gavigan, P. Defence R&D Canada. Technical memorandum (Defence R&D Canada) 2013-081 (CaOODSP)9.820564 PDF 597 KB https://publications.gc.ca/collections/collection_2016/rddc-drdc/D68-6-081-2013-eng.pdf