A parametric data handling evaluation framework for autonomous lunar networks

Different and exciting exploration opportunities toward the Moon are opening in this decade. In particular, the major space agencies are putting a considerable effort in designing and studying a broad spectrum of missions that will bring back the humans on the Moon. During the evaluation of Lunar mission concepts, having a tool that can quickly assess the best communication and data-handling architecture given a set of satellites and a site of interest is mandatory. In this work, a novel parametric framework is presented and applied to the study of the expected connectivity of Lunar networks. The framework comprises bent-pipe, store-and-forward and store-carry-and-forward networking approaches, covering most common data management options. The methodology is designed to determine the best communication architecture given an arbitrary set of available satellites, ground stations, point of interest, and data volume. The proposed algorithm has been applied in a motivating case study of a networked mission devoted to observing lava tubes sites on the Moon surface. Results validate the approach which can identify the inflection points where different data handling techniques outperform each other.


Introduction
Many space agencies, including NASA and ESA, foresee that mankind will be back on the Moon in the 2020s [1]. In this context, companies and universities are engaged in the definition of a wide spectrum of different mission architectures and concepts [2,3]. At the same time, the general public is engaged in this new-raising space exploration era, inspiring more and more people to pursue space-related careers. This revolution is also affecting missions beyond Earth-orbit based on nano-satellites. Leveraging Commercial Off-The-Shelf (COTS) components, cost-efficient spacecraft have been tested in interplanetary distances [4] and have proven valuable in missions to Mars [5], and others are scheduled for launch to the Moon [6]. Indeed, the new space trend is lowering the cost of access to deep-space, which indicates the realization of a Space Internet that bridges ground, near-Earth, and deep-space assets is imminent in this context.
The establishment of a stable and timely communication link to transport large amount of data to ground can define the success criteria of a mission. Typically, the requirements are aimed at guaranteeing a minimal set of uplink and downlink communication windows. However, to enhance the costeffectiveness, the planning of communications should keep into account different combinations of data volume, relay satellites, and Ground Stations (GSs). This requirement suggests a parametric study of different mission architectures for each lunar site of interest is needed.
In this paper, an algorithm is presented to parametrize and automate the evaluation of the approach, modeling the 1 3 space and ground segment and the possible underlying data handling techniques implemented throughout the mission. In particular, Bent-Pipes (BPs), Store-and-Forwards (S&Fs), Store Carry-and-Forwards (SC&Fs) are included in the framework. The algorithm is formulated in such a way that it can be applied to any Lunar network with minimal effort, just by updating the input parameters. This contribution is evaluated and applied to the lava tube case study to determine which of the existing data handling techniques shall be selected for varying mission parameters.
In the study presented in this paper, we consider a lava tube exploration missions on Marius Hills (MH) skylight. The point of interest lays near the equatorial zone, which is of particular scientific interest because it may become the site of a future human settlements [7]. The first inspection of the site should rely on a robotic mission that should map the lava tube surroundings, the skylights, and the inner aspects of the lava tube. A lunar global coverage network has been considered and it is devoted to understanding a possible visible operational plan to sustain the communication on the observation site. The communication architecture of a network of six satellites orbiting the Moon is proposed to assure stable links in the equatorial and near-equatorial regions.
The choice is due to the push toward satellite constellation for future navigation needs and the power generation requirements of the robotic systems. Our algorithm considers the basic communication parameters (antenna gain, frequency, bandwidth) and the coverage analysis to optimize the presented lava tube mission. We claim that this is a representative scenario of most future Lunar missions. In particular, these aspects (multi-hop, navigation/communication dependencies, small and power-constrained satellites, etc.) are common aspects to other Lunar missions on the roadmap. Variants, however, include the exploration of other areas of the Moon, instead of the equatorial area.
The present paper is organized as follows. In Section II, the mission concept, based on the interest in lava tubes, is introduced as a motivation for a Lunar networking architecture presented in Section III, together with an adequate evaluation framework. Evaluation results are presented in Section IV, and Section V summarizes the findings and draws the more important conclusions.

Lunar communications
Existing Lunar communications are currently handled via ad-hoc and closed (non-interoperable) protocols. In most cases, these are of the bent-pipe type, with possibly data storage as an intermediate step. However, as more Lunar missions are added to the roadmap, the effort of defining a common protocol architecture becomes more relevant.
The Lunar Communications Architecture Working Group from the Interagency Operations Advisory Group (IOAG) has conducted a study for defining a future Lunar Communications Architecture that will facilitate potential cross-support to Lunar missions. These findings are summarized in The Future Lunar Communications Architecture document [8]. The architecture applies to communication assets owned and/or operated by public agencies and their affiliated companies in the private sectors. The overall goal of this report is to achieve an unified position on key technical subjects to ensure a coherent Lunar communications architecture. To this end, 28 Lunar missions comprising a total of 48 space vehicles and involving 10 space agencies during the 2018-2028 era are evaluated (19 missions would require interoperability services with other missions). Thus, this document clearly depicts the most relevant topics around future Lunar networking protocols and technologies.
In particular, the architecture defined by LCAWG considers: (i) Lunar science and exploration orbiters, (ii) Lunar surface mobile and stationary vehicles, (iii) Lunar relay orbiters, (iv) Earth-orbiting relays that provide service to lunar systems, (v) Lunar Ascent and Descent modules, and (vi) associated Earth ground stations and mission operations centers. Communications links covered by the resulting architecture comprises: (1) Earth-Moon link, (2) Lunar proximity link, (3) Lunar cross link, (4) Lunar surface vicinity link, (5) Earth orbiting relay link, and (6) Earth-space link extension. The physical layer for each of these is defined for both RF and optical communications. Table 1 summarizes the frequency, modulation, coding and link layer protocol considered by the IOAG while compiling their report.
Most relevant missions addressed by the IOAG report are led by NASA. In particular, NASA is developing an extensible and scalable lunar communications and navigation architecture, known as LunaNet [9]. The approach is to move away from the traditional link-centric view to a network-centric concept of operations, where self-contained data units are transported through the system. Due to the delay and disruptions of Lunar links, the popular Internet Protocol (IP) suite nowadays connecting the Internet cannot be directly applied [10]. Instead, NASA is putting forward the Delay/Disruption Tolerant Networking (DTN) protocol stack. DTN core Bundle Protocol specifies the structure of self-contained data units known as bundles and transport rules that include store-and-forward functions to ensure generalized, reliable, and robust internetworking among users and nodes. It is by means of the DTN approach that data via future Lunar networks will likely be handled with storecarry-and-forward approaches.

Lava tube exploration mission concept
Lunar lava tubes have raised great interest in the last decade, especially after recent missions such as SELENE and the Lunar Reconnaissance Orbiter (LRO) transmitted highresolution images of these geological formations in the near and the far side of the Moon [11,12]. Essentially, the lava tubes are volcanic architectures that spread below the surface of the Moon (see Fig. 1).
The main scientific interest focus on mainly three skylights on Moon surface: one in Marius Hills, one in Mare Tranquillitatis and the one in Mare Ingenii, which is in the far side of the Moon [13].
A collection of different mission concepts can be found in NASA's advanced concept reports on lava tubes exploration [14] and in the ESA call Sysnova studies 1 . These missions cover a wide spectrum of possibilities for robotic exploration. There are analyses for landing vehicles inside the lava tubes, spherical robots that can fall and roll in the lava tubes, among other innovative and challenging approaches [15]. However, all of them acknowledges a great uncertainty regarding the internal structure and geology of the lava tubes, which remains unknown as of today (existing data from LRO and SELENE missions are unfortunately not enough).
The Politecnico di Torino and the ISAE-SUPAERO are studying a robotic mission for the Marius Hills exploration [16,17]. The pit in Marius Hills should have a depth and a diameter around fifty meters [13], which facilitates possible accesses to the lava tube. Moreover, there is great interest in the analysis of the terrain of the Marius Hills caves because of its high concentration of iron and titanium-rich minerals [13].
In the case study of this paper, the proposed robotic exploration mission has a payload that generates a considerable quantity of images and radar data to create a 3D map of the lava tube. Therefore, the supporting Lunar satellite network should sustain an efficient transmission of significant data volume from the Moon surface to Earth. Due to the high communication constraints inside the lava tubes, the explorations systems should rely on autonomous decision making and operations. Therefore, self-adaptability without human intervention are of essence for both the exploration's bots and the communication satellites.
The following sections presents an algorithm to evaluate the performance of such autonomous mission frameworks under different networking architectures. 1 3

Networking architecture
The objective of the study is to analyze the communication architecture for a mission in the equatorial region of the Moon, based on the lava tube exploration concept. Usually, the analysis of a communication architecture of a complex scenario like a lunar mission starts with different possibilities. For example, one of the main design drivers to choose the need or not of relay satellites is the power onboard the exploration system and which antenna can be used. After deciding the most suitable general architecture, two processes are optimized in parallel: (1) coverage analysis based on the antenna used, (2) decision on which frequency and bandwidth use for a given amount of telemetry and payload data. Our algorithm is an original contribution that can harmonize and decide upon these last two steps. To this end, we combine the coverage analysis with the other communication parameters to find the fittest architecture in one quick run. Moreover, the proposed approach is scalable and adaptable depending on the specific mission. It can deal with any number of ground stations and with any number of satellites, exploring the best communication configuration depending on the mission requirements. Although it produces coherent results with expectations and previous missions, the data are still rough estimations to be refined in more detailed and specific analysis afterwards. However, the output already helps the designers shape their mission architecture and start planning the operations for future exploration systems. The resulting set-up should achieve a global coverage scenario where at least one satellite is in Line-of-Sight (LOS) per Earth day with the site of interest during the overall mission evaluation period. This will create redundancy in the communications relays: if a satellite fails or enters into safe mode, another satellite can replace it, operating on its behalf. Moreover, at least one communication window per day is required in order to maximize the access toward Earth of the lava tubes' exploration systems, which in turn, will maximize the possible scientific return of the mission.

Orbital and ground segment configuration
To comply with the aforementioned principles, the space segment of the satellite constellation is based on the Lunar global coverage network from [18]. In particular, the constellation is constituted by six satellites around the Moon with a semi-major axis of 6500 km. Three of them have a Right Ascension of the Ascending Node (RAAN) Ω = 0 • , an inclination i = 40 • and different mean anomalies . The remaining three satellites have similar characteristics but have a Right Ascension of the Ascending Node (RAAN) equal to 90 • . The orbital parameters and satellites' characteristics are summarized in Table 2.
The ground segment, on the other hand, is comprised of Deep Space Network (DSN) ground stations [19], in particular the ones in California (Goldstone), Australia (Canberra) and Spain (Madrid). The geographic coordinates, with respect to the Earth's or Moon's Latitude and Longitude, are presented in Table 3.
To evaluate how the communication changes during the various orbits of the Moon around the Earth, the communications opportunities are analyzed for a year long. During the year, the overall elements of the mission have been modeled using the mission analysis tool System Tool Kit (STK), from AGI company [20]. Nonetheless, any tool able to compute accesses between a satellite and a point of interest may be used to create the inputs for the explained simulation framework.

Channel and data handling
Following the guidelines in [21] and looking at previous reference missions [22][23][24], the payload data communication band was set to X-Band. The telemetry data employs S-Band [23]. The X-Band has relatively few constraints in terms of maximum bandwidth, and it is one of the most used bands for space missions around or on the Moon and Mars. Moreover, it is less susceptible to Earth weather variation like the K or Ku band, that are even less restricted in bandwidth. The data rate was set to 150 Mbit/s, following the ITU suggestions [21]. Nevertheless, the overall analysis is parametric and different values of data rate can be used to plan the communications between Earth and Moon using the proposed approach. Data volumes have been estimated considering the huge number of imaging material from the scientific payload, which should be sent to Earth. Following the approach in [25], a preliminary data volume of 160 Gb per single transfer was defined for the proposed mission. This value is just a parameter in the simulation: changing the daily data volume is possible to appreciate how the communication schedule can change, and this modification is easily implementable in the proposed model. Indeed, the data volume sensitivity evaluation can be quite interesting during the preliminary phase of the design of a mission, in the domain of conceptual design. This volume of data will be then compressed at a ratio 15:1, following the suggestions of [26].
The possible envisioned data handling approaches are: (1) simple BPs communication, (2) S&Fs, (3) SC&Fs architecture. The BP communication relays on the creation of a physical bridge between the lunar site and the DSN network. In this communication mode, the satellite should be in LOS of both the scientific target and the Earth. In the S&F architecture, the data should be all received within a communication window and should be all sent in another communication window. In the SC&F architecture, the fraction of data not sent toward Earth from the satellites are stored, and the next useful communication window is used to forward them to Earth. The SC&F is following the new philosophy of the Delay Tolerant Networks (DTNs) to facilitate and automate communication planning in space-related networks.

Evaluation framework
After defining the physical layer architecture, the satellite constellation and the position of the site of interest, the study continues analyzing the connectivity among Earth, the satellites and the lunar site of interest. Subsequently, all accesses between Marius Hills, each satellite, and each ground station, have been incorporated into a single algorithm for postprocessing. Figure 2 presents a simplified flowchart of the proposed evaluation algorithm, while Algorithm 1 shows a minimum logical working example.
The procedure requires in input: the accesses among each satellite and GSs, the chosen data volume D (set at 160 Gb for this analysis), and the selection of the coupling elements, i.e. the whole set of possibilities and combination of satellites and GSs,. Once these parameters are set, the algorithm combines all accesses in a single file sorted by the starting time. else find ∆t min among SCF (D rem , ↑ N SCF ) or new sat SF (D, ↑ N SF ) Explore further sat able to receive UP data. In any, repeat DW phase (4:8) 10: Set In the first stage, possibilities to upload data from Marius Hills to the first available satellite are considered. Once the upload is completed, that given satellite is excluded from subsequent uploads, but the others can still receive data. Each satellite that has received the data can perform the download phase, by looking for the first subsequent GSs available. The process repeats with all the possible GSs, if available. Downlink contacts that end first, are prioritized in the algorithm; namely, there is a reward process that favors satellites that are usually faster than others to perform the whole upload and download process.
More specifically, both the upload and the download phases can be completed either in a single access window or several. Depending on the chosen D, the same access window may be sufficiently large or not to allow a complete transmission, given t 0,i and t f ,i , with i = 1, n , where n is the total number of available accesses over the whole year. The generic transmission requires a total time T = f D, t del , SF , where the delay time t del considers 32 bits used for the interpacket time, both at the beginning and at the end of the transmission. The single packet size is here considered equal to SPS = 6400 bits, and a Safety Factor SF = 20 s is added to the computed minimum transmission time to account for a safe link establishment between transmitter and receiver.
Therefore, T is a value that remains constant once the initial parameters are selected (i.e., all transmissions, both in upload and download, require the same total time). Therefore, a complete transmission can take place if t 0,i + T < t f ,i . In this case, the assumed communication architecture is S&F. .
If the transmission cannot be completed in a single time window, the e SC&F architecture is still possible and the algorithm calculates the remaining data volume D rem to then proceed to search for the following opportunities to complete the download phase. It should be noted that the further evaluated contacts assume the same combination of satellite-Ground Station (both upload and download) to verify if it is more convenient to proceed with a e SC&F or to select a new satellite later in time; this evaluation terminates once D rem = 0 . Total occurrences of the e S&F and e SC&F architecture utilization are accumulated for the whole evaluation year for each satellite/Ground Station pair. It is assumed that the first satellite to complete the upload can proceed with the immediate download, and the first Ground Station to receive the entire download is the chosen one among those in range.
The access times are always analyzed by increasing the initial time. However, before proceeding with future access windows, the algorithm first checks if the satellite that completes an upload phase can perform a download in the remaining upload window. This is the only exception that allows a single bi-directional exploration and that does not violate any physical law. This particular operation requires further explanation and, to this end, we present Algorithm 2.

Algorithm 2 Bi-directional exploration -Minimal Pseudo Code
Retrive MH→sat UP access window times t 0 and t f 2: Compute upload time t f,up = t 0 + T if t f,up + T < t f then 4: Perform UP Check for previous access windows not concluded at t 0,dw < t f,up 6: if ∃ previous access window (backward exploration) then Set t 0,dw = t f,up 8: if t 0,dw + T < t f then Conclude DW in the same UP access window 10: else (forward exploration) Check for future access windows that can start downloads at t 0,dw < t f 12: Set t 0,dw = t 0,access if t 0,dw + T < t f then 14: Conclude DW in the same UP access window

Fig. 3 Spurious accesses removal
Let t f ,up = t 0,i + T be the moment at which the upload phase ends for a specific satellite in the i-th access. The algorithm first checks if there is enough time left ( t f ,up + T < t f ,i ) in the same window, which spans between t f ,up and t f ,i . If this applies, it searches through previous accesses started before ( t 0,dw < t f ,up ) or after ( t 0,dw > t f ,up ) the upload completion but still not concluded. Once identified the moment t 0,dw at which the download can start, if t f ,dw = t 0,dw + T < t f ,i , then the same satellite can perform the download phase immediately after the upload without seeking subsequent accesses. This may happen in the best case at t 0,dw = t f ,up , i.e. as soon as the upload is completed if there is a previous active downlink access window; otherwise in a later moment.
Regardless of this particular bi-directional search, the specific satellite with the uploaded data start to search in all future accesses the occasions to perform the download exploiting a greedy search algorithm. To this end, the satellite considers the type of e S&F or e SC&F architecture it uses. Once this happens, the satellite is re-inserted in the list of eligible candidates for the upload, and the cycle begins again. Figure 3 shows a post-processing analysis, for a sample week in the considered year (specifically, week 14/52), in which all accesses with a duration less than a certain safety threshold f t del , SF are deleted.

Simulation results
Satellites are numbered as S i,Ω , i = 1, 2, 3 , and each S i represents a pair of satellites, for a total of 6 satellites in two orbital families, with different RAAN, Ω = {0, ∕2} . The four sub-images show individual accesses, day by day, for each satellite and for each Ground Station. The deleted opportunities (again, those with Δt below the safety threshold) are identified with an x and crossed out. This operation is performed for all the weeks and for all combinations of satellites and GSs, to remove small contact opportunities which will not be considered due to their short duration. Clearly, Marius Hills shows way more access compared to GSs. It is worth pointing out that this post-processing operation does not affect the obtained metrics since such short windows would have been discarded anyway by the evaluation algorithm, but it does increase the computational efficiency.
The first analysis performed is related to the BP architecture. In this case, the satellite must be simultaneously in LOS with both Marius Hills and at least a single Ground Station. The analysis is performed for the entire year, but in Fig. 4 it is possible to appreciate an excerpt of 28 days in which are shown the trends of the accesses towards Marius Hills and towards each Ground Station for each satellite Specifically, each satellite level, identified by the name S i,Ω , shows the successful BP communications between a specific Ground Station and Marius Hills through the satellite for a sample month. Two adjacent connected symbols represent the beginning and the end of a specific communication opportunity, while a filled symbol is used for communication windows lasting less that 30 min.
The performance shown repeats qualitatively throughout the year: the BP solution can cover less than 10% of the available accesses and only for a limited period. Moreover, for sufficiently large windows (e.g., 6 h), even if the communication can take place entirely, it would be unlikely that new data could be produced in the same time window to be sent from Marius Hills to a Ground Station through the satellite via BP. Therefore, the volume of data transferred per access would be reduced. These considerations are the main disadvantage of the BP architecture found in this evaluation. Therefore, as mentioned in the algorithm's presentation, the focus of the study is to understand the inflection point, i.e. the best trade-off, between the S&F and SC&F communication architecture. Figure 5 shows the usage trend of each Ground Station by each satellite, namely the number of successful accesses, without considering the transferable data or a specific communication architecture. These results derive from the algorithm set to search for the quickest upload and download occasions. It is noticeable that all the satellites with RAAN Ω = 2 , namely S i,90 , i = 1, 2, 3 , have worse connectivity than those with RAAN Ω = 0 , S i,0 , i = 1, 2, 3 . It is also interesting to observe that there are more accesses to Canberra and Goldstone, compared to Madrid. Nevertheless, fewer accesses do not necessarily imply worse performances or a minor volume of data transferred, as they may indicate that the majority of transmissions happens in a single SC&F communication.
The algorithm flexibility allows performing a study with the selection of specific permutations of GSs and satellites. For the considerations about coverage and the actual use of individual GSs or satellites, it has proved particularly useful to observe how the results would change with the elimination of one or more of these elements. Throughout the following analysis, it was decided to use only 3 out of the six satellites, precisely the ones with Ω = 0 , which showed to be the best ones in terms of accesses and transmitted data, Fig. 6 Year round SF (blue) and SCF (red) architecture usage; total data transferred (black) vs selected data volume; satellites ( S 1 × , S 2 ∇ , S 3 ⋆ ) to separate GSs Table 4 Total data D over 1 year (Tbit), S&F/SC&F usage value (N) and S&F percentage ( % ) per each satellite and GSs combination for D = 160 Gbit as seen in Fig. 5. Henceforth, they are referred merely as S i , i = 1, 2, 3.
As can be seen in the following graphs, the analysis was performed under varying combinations of GSs and depending on the desired data volume D. Specifically, D ranges between 160 Gbit and 8 Tbit to analyze a broad spectrum of possible or future mission scenarios.
In Fig. 6 the three selected satellites can communicate only with a singular Ground Station, while Fig. 7 shows the scenario in which the algorithm allows a combined use of the most convenient Ground Station time to time. Figure 6 contains the trends of the combined use of S&F and SC&F architectures and the volume of data transferred over the whole year. Both trends are indeed dependent on the data volume D. Results show that the use of the S&F architecture is recommended up to a specific date volume, beyond which the SC&F architectures prevails. The bifurcation point is around 1.5 Tbit for this scenario and tends to increase its value with the addition of GSs ( ≈ 2 Tbit for 2 Fig. 7 Year round S&F (blue) and SC&F (red) architecture usage; total data transferred (black) vs selected data volume; satellites ( S 1 × , S 2 ∇ , S 3 ⋆ ) to aggragated GSs  combined GSs, ≈ 2.5 Tbit for 3 simultaneous GSs, as seen in Fig. 7). In general, this cutting point could oscillate for similar analysis as a function of the orbital parameters of the constellations of satellites, the number of satellites, and the GSs combination. For particularly high D, the access windows become too short to allow complete communications and the SC&F architecture dominates completely. Figure 7 clearly shows that the combined use of all GSs produce an overall greater data transfer for every data volume selection, while still presenting the mentioned inflection point at a slightly higher threshold, i.e. D ≈ 2.5 Tbit.
More considerations and further hybrid cases are included in Tables 4, 5 and 6 in the next page, which present the results for three distinct data volume values, i.e. D = [0.16, 2.08, 4.00] Tbit. In these three examples the three satellites S i , i = 1, 2, 3 are communicating for a whole year with one or more GSs. For each scenario, results include the values of the total data volume transferred (single S i and cumulative Σ ), the number of accesses in S&F or SC&F and the percentage of S&F use. Table 4 shows the D = 160 Gbit case, in which there is a strong prevalence of S&F architecture. The communication windows are sufficiently large to safeguard almost always a complete transmission. With increasing available GSs also increases the percentage of S&F, as potentially one previously forced SC&F manages to be covered by an alternative GS. Also increases the overall data transmitted, given that time periods without communications are reduced. It is noteworthy that having eliminated the three satellites S i,90 , i = 1, 2, 3 , has allowed to prefer the use of Madrid, in opposition to the preliminary results noted in Fig. 5: there are higher transmitted data, also traced by the greater number of SF communications. The combination Goldstone-Madrid appears the best between the pairs and is slightly improved in the aggregate scenario. Table 5 contains the same results with D = 2.08 Tbit, value beyond the estimated cutting point for the choice of the communication architecture. In fact, the percentage values of S&F use are almost all below 50% , showing that for the higher D values the SC&F architecture is more convenient. Nevertheless, it proves once again that the access windows are still large enough to allow a great part of the communications taking place in a single transmission. The data volume, compared to the previous one, is 10 times higher, but the overall transmitted data values are increased to a lesser extent.
For comparison, Table 6 shows the opposite limit scenario. A data volume D equal to 4 Tbit cannot increase significantly the D tot . The satellites require almost every time the whole available access window to complete a transmission. This consideration comply with both the low values of S&F% and with the graphs shown in Fig. 5.

Conclusions
The cislunar space is on the spot. Lava tubes are among a large set of potentially interesting resources on the Moon that motivates robotic and human exploration in the upcoming years. However, the proper assessment of a supporting Lunar network infrastructures remains an open research topic.
In this paper, we offered a generic algorithm to validate different potential mission architectures that involve a point of interest, a satellite constellation and some GSs on Earth. The whole algorithm is widely adaptable to different scenarios by changing the sole coordinates, orbital parameters, or dispositions of the considered elements. Specifically, we performed a lava tube case study by means of an adequate Lunar network which required non-trivial evaluation to determine the best trade-off between different data handling approaches. Moreover, the algorithm easily accommodates specific needs. For example, if an important action must happen in a specific time frame, e.g. for commanding/ operations, it can be taken into account by imposing that other upload/download operations cannot use that specific opportunity window. This opportunity removal operation is an action that the code already does when discarding, for example, access windows below a certain duration threshold. A good improvement would be to include a GUI to help the user select the ground stations, the accessibility windows, and the satellites; *.mex files and inter-language codes may also be written to let the code work directly with STK, perform the accessibility study, and then perform the communication part described in the paper.
The study outlines an analysis framework for studying and comparing different communication architectures. It uses the mentioned input parameters to provide different possible coupling of GSs and satellites to optimize the amount of data forwarded towards Earth. Therefore, it is possible to schedule the different operations for the robotic exploration systems with respect at the communication opportunities and their duration. Thus, we contributed with an algorithm that ensures a consistent analysis of the case study and any other potential Lunar networks.
Besides extending the study over different Lunar network configurations, future research includes the addition of protocol-and routing-specific techniques into the evaluation loop.
The potential applications of the presented framework are many and adapt to numerous scenarios foreseen or already in development by numerous space agencies. For example, in the framework of the In-Situ Resource Utilization (ISRU), numerous feasibility studies have been completed to demonstrate how specific devices, such as electromagnetic launchers, can be used to transport resources from the lunar soil in the vicinity of the Moon [27]; an adequate communications framework can constantly monitor these payloads and may prove to be of invaluable importance, given that a satellite constellation can monitor the payloads' continuous positioning and distribution so to facilitate rendezvous operations. In addition, NASA has recently published a White Paper in which is stated the operative orbit for the future Lunar Orbital Platform-Gateway (LOP-G, also known as DSG) [28]. This particular Near Rectilinear Halo Orbit allows an almost permanent coverage of the Earth's GSs, avoiding eclipses and signal losses: a further interesting application of the presented framework would be to place a satellite constellation on such NRHO, properly spaced apart from the foreseen LOP-G positioning, to further validate what the best configurations and architectures are in this powerful and fundamental scenario and to provide a backup in the rare occasions in which the LOP-G cannot directly communicate with Earth.
Funding Open access funding provided by Politecnico di Torino within the CRUI-CARE Agreement.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http:// creat iveco mmons. org/ licen ses/ by/4. 0/.