Engineering Papers⌕ Search

Engineering topics

Cheung, Kar-Ming

Publications and source records attributed to Cheung, Kar-Ming.

At least 73 records · Page 4

Proximity Link Design and Performance Options for a Mars Areostationary Relay Satellite

Current and near-term Mars relay telecommunications services are provided by a set of NASA and ESA Mars science orbiters equipped with UHF relay communication payloads employing operationally simple low gain antennas. These have been extremely successful in supporting a series of landed Mars mission, greatly increasing data return relative to direct-to-Earth lander links. Yet their relay services are fundamentally constrained by the short contact times available from the selected science orbits. Future Mars areostationary orbiters, flying in circular, equatorial, 1- sol orbits, offer the potential for continuous coverage of Mars landers and rovers, radically changing the relay support paradigm. Achieving high rates on the longer slant ranges to areostationary altitude will require steered, high-gain links. Both RF and optical options exist for achieving data rates in excess of 100 Mb/s. Several point designs offer a measure of potential user burden, in terms of mass, volume, power, and pointing requirements for user relay payloads, as a function of desired proximity link performance.

telecommunications↗

Inflatable Antenna for CubeSat: Extension of the Previously Developed S-Band Design to the X-Band

The inflatable antenna for CubeSat is a 1 meter antenna reflector designed with one side reflective Mylar, another side clear Mylar with a patch antenna at the focus. The development of this technology responds to the increasing need for more capable communication systems to allow CubeSats to operate autonomously in interplanetary missions. An initial version of the antenna for the S-Band was developed and tested in both anechoic chamber and vacuum chamber. Recent developments in transceivers and amplifiers for CubeSat at X-band motivated the extension from the S-Band to the X-Band. This paper describes the process of extending the design of the antenna to the X-Band focusing on patch antenna redesign, new manufacturing challenges and initial results of experimental tests.

Babuscia, Alessandra↗

Development of Cooperative Communication Techniques for a Network of Small Satellites and Cubesats in Deep Space

This paper aims to address this problem by proposing cooperative communication approaches in which multiple CubeSats communicate cooperatively together to improve the link performance with respect to the case of a single satellite transmitting. Three approaches are proposed: a beam-forming approach, a coding approach, and a network approach. The approaches are applied to the specific case of a proposed constellation of CubeSats at the Lunar Lagrangian point L1 which aims to perform radio astronomy at very low frequencies (30 KHz -3 MHz). The paper describes the development of the approaches, the simulation and a graphical user interface developed in Matlab which allows to perform trade-offs across multiple constellation's configurations.

Babuscia, Alessandra↗

Integrating Space Communication Network Capabilities via Web Portal Technologies

We have developed a service portal prototype as part of an investigation into the feasibility of using Java portlet technology as a means of providing integrated access to NASA communications network services. Portal servers provide an attractive platform for this role due to the various built-in collaboration applications they can provide, combined with the possibility to develop custom inter-operating portlets to extent their functionality while preserving common presentation and behavior. This paper describes various options for integration of network services related to planning and scheduling, and results based on use of a popular open-source portal framework. Plans are underway to develop an operational SCaN Service Portal, building on the experiences reported here.

web services↗

Link Analysis for Space Communication Links Using ARQ Protocol

In space communications, standard link analysis assumes that messages are sent once. For a communication link that uses an error-correction coding scheme, bit-error-rate (BER) or frame-error-rate (FER), and link margins are common metrics that characterize the quality of a link, and they are used to determine the supportable data rate. With the advent of Automatic Repeat-reQuest (ARQ) protocols, when messages are corrupted during transmission, they can be resent multiple times automatically until they are correctly received and acknowledged. The concept of BER, FER, and link margin cannot be directly applied, and the link analysis approach for ARQ links needs to be re-examined.

Cheung, Kar-Ming↗

Coarse-Grain Bandwidth Estimation Scheme for Large-Scale Network

A large-scale network that supports a large number of users can have an aggregate data rate of hundreds of Mbps at any time. High-fidelity simulation of a large-scale network might be too complicated and memory-intensive for typical commercial-off-the-shelf (COTS) tools. Unlike a large commercial wide-area-network (WAN) that shares diverse network resources among diverse users and has a complex topology that requires routing mechanism and flow control, the ground communication links of a space network operate under the assumption of a guaranteed dedicated bandwidth allocation between specific sparse endpoints in a star-like topology. This work solved the network design problem of estimating the bandwidths of a ground network architecture option that offer different service classes to meet the latency requirements of different user data types. In this work, a top-down analysis and simulation approach was created to size the bandwidths of a store-and-forward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. These techniques were used to estimate the WAN bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network. A new analytical approach, called the "leveling scheme," was developed to model the store-and-forward mechanism of the network data flow. The term "leveling" refers to the spreading of data across a longer time horizon without violating the corresponding latency requirement of the data type. Two versions of the leveling scheme were developed: 1. A straightforward version that simply spreads the data of each data type across the time horizon and doesn't take into account the interactions among data types within a pass, or between data types across overlapping passes at a network node, and is inherently sub-optimal. 2. Two-state Markov leveling scheme that takes into account the second order behavior of the store-and-forward mechanism, and the interactions among data types within a pass. The novelty of this approach lies in the modeling of the store-and-forward mechanism of each network node. The term store-and-forward refers to the data traffic regulation technique in which data is sent to an intermediate network node where they are temporarily stored and sent at a later time to the destination node or to another intermediate node. Store-and-forward can be applied to both space-based networks that have intermittent connectivity, and ground-based networks with deterministic connectivity. For groundbased networks, the store-and-forward mechanism is used to regulate the network data flow and link resource utilization such that the user data types can be delivered to their destination nodes without violating their respective latency requirements.

Cheung, Kar-Ming↗

Mixed Integer Programming and Heuristic Scheduling for Space Communication

Optimal planning and scheduling for a communication network was created where the nodes within the network are communicating at the highest possible rates while meeting the mission requirements and operational constraints. The planning and scheduling problem was formulated in the framework of Mixed Integer Programming (MIP) to introduce a special penalty function to convert the MIP problem into a continuous optimization problem, and to solve the constrained optimization problem using heuristic optimization. The communication network consists of space and ground assets with the link dynamics between any two assets varying with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time, and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view period are selected to maximize the communication efficiency within the network. Mathematical formulations for the constrained mixed integer optimization problem were derived, and efficient analytical and numerical techniques were developed to find the optimal solution. By setting up the problem using MIP, the search space for the optimization problem is reduced significantly, thereby speeding up the solution process. The ratio of the dimension of the traditional method over the proposed formulation is approximately an order N (single) to 2*N (arraying), where N is the number of receiving antennas of a node. By introducing a special penalty function, the MIP problem with non-differentiable cost function and nonlinear constraints can be converted into a continuous variable problem, whose solution is possible.

Lee, Charles H.↗

Coarse-Grain Bandwidth Estimation Techniques for Large-Scale Space Network

In this paper, we describe a top-down analysis and simulation approach to size the bandwidths of a store-andforward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. We use these techniques to estimate the wide area network (WAN) bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network.

Cheung, Kar-Ming↗

Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

We developed framework and the mathematical formulation for optimizing communication network using mixed integer programming. The design yields a system that is much smaller, in search space size, when compared to the earlier approach. Our constrained network optimization takes into account the dynamics of link performance within the network along with mission and operation requirements. A unique penalty function is introduced to transform the mixed integer programming into the more manageable problem of searching in a continuous space. The constrained optimization problem was proposed to solve in two stages: first using the heuristic Particle Swarming Optimization algorithm to get a good initial starting point, and then feeding the result into the Sequential Quadratic Programming algorithm to achieve the final optimal schedule. We demonstrate the above planning and scheduling methodology with a scenario of 20 spacecraft and 3 ground stations of a Deep Space Network site. Our approach and framework have been simple and flexible so that problems with larger number of constraints and network can be easily adapted and solved.

Mixed Integer Programming↗

Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

In this paper, we propose to solve the constrained optimization problem in two phases. The first phase uses heuristic methods such as the ant colony method, particle swarming optimization, and genetic algorithm to seek a near optimal solution among a list of feasible initial populations. The final optimal solution can be found by using the solution of the first phase as the initial condition to the SQP algorithm. We demonstrate the above problem formulation and optimization schemes with a large-scale network that includes the DSN ground stations and a number of spacecraft of deep space missions.

Communication Network Scheduling↗

Wallops' Low Elevation Link Analysis for the Constellation Launch/Ascent Links

Prior to the redirection of the Constellation Program, the Wallops 11.3-meter ground station was tasked to support the Orion's Dissimilar Voice (DV) link and the Ares's Development Flight Instrument (DFI) link. Detailed analysis of the launch trajectories indicates that during the launch and ascent operation, the critical events of Orion-Ares main engine cut off (MECO) and Separation occur at low elevation angle. We worked with engineers from both Wallops Flight Facility (WFF) and Johnson Space Center (JSC) to perform an intensive measurement and link analysis campaign on the DV and DFI links. The main results were as follows: (1) The DV links have more than 3 dB margin at MECO and Separation. (2) The DFI links have 0 dB margin at Separation during certain weather condition in summer season. (3) Tropospheric scintillation loss is the major impairment at low elevation angle. (4) The current scintillation models in the Recommendation ITU-R P.618 (Propagation data and prediction methods required for the design of Earth-space telecommunication systems), which are based on limited experimental and theoretical work, exhibit idiosyncratic behaviors. We developed an improved model based on the measurements of recent Shuttle mission launch and ascent links and the ITU propagation data. (5) Due to the attitude uncertainty of the Orion-Ares stack, the high dynamics of the launch and ascent trajectory, and the irregularity of the Orion and Ares antenna patterns, we employed new link analysis approach to model the spacecraft antenna gain. In this paper we discuss the details of the aforementioned results.

Cheung, Kar-Ming↗