Search NASA⌕ Search

Engineering topics

Dhamani, Nihal

Publications and source records attributed to Dhamani, Nihal.

A Demand Access Paradigm for NASA’s Deep Space Network

NASA’s Deep Space Network (DSN) is the primary resource for communications and navigation for interplanetary space missions, for both NASA and partner agencies. As part of an investigation into improved efficiency and responsiveness, we have been exploring and prototyping the infusion of a ”demand access” model into the DSN scheduling process. Today, DSN is fully pre-scheduled in advance, and many users rely on a stable schedule to plan their own spacecraft activities, weeks in advance of execution. However, a new class of missions is emerging that may not be scheduled as far in advance, and may be event-driven in coming across science targets at unpredictable times. These users could take advantage of an on-demand mechanism to download data. Simulations have shown that such a mechanism could improve latency (time from data collection to download) by 2x, as well as more efficiently utilize the available DSN antennas. In this paper, we describe a prototype of a demand access process and how it addresses the challenges of co-existing with a staticallyscheduled body of missions, while providing the benefits of lower latency science data return.

Lucena, Girly↗

Utilizing Schedule Constraints to Improve Automated Scheduling in NASA's Deep Space Network

NASA’s Deep Space Network (DSN) is a mission critical facility that supports many different space missions,from LEO to deep space exploration. In recent years, as the network has suffered from increasing oversubscription, more restrictions have been added to reduce the amount of manual scheduling labor necessary to come to consensus. In this paper, we describe a new auto-mated scheduling tool which takes advantage of these restrictions to bring the scheduling problem closer to feasibility. In addition, we describe an algorithm to reduce problem inputs given a partially-solved problem,thereby bringing the problem even closer to feasibility

Johnston, Mark↗