Contact Graph Routing for Interplanetary Overlay Networks - DTSN

EasyChair Preprint 8382

Abstract

Studies have been proposed for development of satellite networks and Delay Tolerant Networks (DTN) has been acknowledged as one of the potential candidate to develop these networks. All the characteristics of DTN of non-continuous and lack of end-to-end path have been considered and satellite networks have been developed accordingly. For such dynamic and huge networks (in terms of distance), topology prediction and routing techniques are very complex and the routing tables are also huge when all possible routes are taken into account which leads to a very limited and degraded forwarding performance. To form the routing tables for such complex networks there exists few algorithms, such as Contact Graph Routing(CGR), but it comes with a lot of complexity, implications and issues. Considering the DTSN constellation scenarios, the simulation results show that using these novel routing table techniques the calculation effort and network flow metrics could be reduced many-fold.

Keyphrases: Contact Graph Routing, Delay Tolerant Satellite Networks, satellite networks

@booklet{EasyChair:8382,
  author    = {Armaan Garg},
  title     = {Contact Graph Routing for Interplanetary Overlay Networks - DTSN},
  howpublished = {EasyChair Preprint 8382},
  year      = {EasyChair, 2022}}