| Abstract: | Optimal scheduling is essential to minimize the time wastage and maximize throughput in high propagation delay networks such as in underwater and satellite communication. Understanding the drawbacks of synchronous scheduling, this paper addresses an asynchronous optimal scheduling problem to minimize the time wastage during the transmission. The proposed scheduling problem is analyzed in both broadcast and non‐broadcast networks, which is highly applicable in high propagation delay networks. In broadcast networks, the proposed scheduling method reduces to a graph‐theoretic model that is shown to be equivalent to the classic algorithmic asymmetric traveling salesman problem (TSP) which is NP‐Hard. Although it is NP‐Hard, the TSP is well‐investigated with many available methods to find the best solution for up to tens of thousands of nodes. In non‐broadcast networks, the optimal solution to the scheduling problem considers the possibility of parallel transmission, which is optimized using graph coloring algorithm. The groups obtained through graph coloring are solved using Asymmetric Traveling Salesman algorithm to obtain the optimal schedule. The proposed method efficiently solves the scheduling problem for networks of practical size. |
