A hybrid multiple copy routing algorithm in space delay-tolerant networks

With the development of technology and applications in space delay-tolerant networks (SDTNs), increasing attention has been paid on the routing technologies between different DTN nodes. This paper proposes a novel hybrid multiple copy routing (HMCR) algorithm that can be applied not only to deterministic space scenarios but also to opportunistic space scenarios. HMCR combines contact graph and delivery probability metrics to make forwarding decisions. In order to verify the new HMCR algorithm's performance, research work has been carried out to prove its availability in SDTNs. The analysis and simulation results show that, compared with other algorithms such as contact graph routing (CGR), Epidemic, and PRoPHET, the new HMCR algorithm performs well in the areas of message delivery ratios, average end-to-end delays, and transmission overhead, which proves to be suitable for highly dynamic SDTNs.