One key to communications scalability is routing; as such the goal of this paper is to build upon successful efforts towards general routing for space-based networks. With the ever-increasing accessibility of space, the number of assets is increasing, which becomes a critical communications burden in terms of scheduling, spectrum allocation, and resource allocation. In order to mitigate these concerns, a true networking approach is necessary; a standard approach for space systems is Delay Tolerant Networking (DTN). For DTN to be a meaningful answer to the Solar System Internet (SSI) question, DTN must offer meaningful routing solutions that span the heterogeneous collection of links and nodes. This, in turn, depends on the general structure of these disconnected networks - a structure that remains largely unknown. In ground communications networks, routing decisions are made based on several pathfinding algorithms working in tandem. In previous work, we modeled Dijkstra's pathfinding algorithm using sheaves and provided a more general framework for determining paths using sheaves over graphs. Continuing our sheaf-theoretic approach, we introduce here an expansion of our pathfinding sheaf to handle more general information, and we expand on additional pathfinding algorithms that can be represented using sheaves. Moreover, we demonstrate means of combining multiple algorithms into a single sheaf structure so that changes of scale can be presented in the language of sheaves. In addition, space communications networks rely upon radio transmitter antennas which can establish broadcast and multicast communications options, rather than the primarily uni-cast options available to wired networks. Last year, we also introduced a multicast routing sheaf for presenting broadcast, unicast, and multicast communications over a graph. Extending that work, we also introduce queuing sheaves so that we can blend these communications options together to simulate a variety of routing options across space networks. In addition, we include examples to illustrate the applicability of this abstract theory to routing in disconnected networks.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Sheaf Theoretic Models for Routing in Delay Tolerant Networks


    Contributors:


    Publication date :

    2022-03-05


    Size :

    4630669 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Towards Sheaf Theoretic Analyses for Delay Tolerant Networking

    Short, Robert / Hylton, Alan / Cardona, Robert et al. | IEEE | 2021


    Multi-domain routing in Delay Tolerant Networks

    Hylton, Alan / Mallery, Brendan / Hwang, Jihun et al. | IEEE | 2024


    Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

    Dudukovich, Rachel / Raible, Daniel E. | AIAA | 2016


    SnLocate: A Location-Based Routing Protocol for Delay-Tolerant Networks

    Moreira, Elizabete / Magaia, Naercio / Pereira, Paulo Rogério et al. | Springer Verlag | 2021


    A social similarity-aware multicast routing protocol in delay tolerant networks

    Deng,X. / Wang,J. / Liu,Y. et al. | Automotive engineering | 2013