Coding for parallel links to maximize expected decodable-message value
- Creators
- Chang, Christopher S.
- Klimesh, Matthew A.
Abstract
Future communication scenarios for NASA spacecraft may involve multiple communication links and relay nodes, so that there is essentially a network in which there may be multiple paths from a sender to a destination. The availability of individual links may be uncertain. In this paper, scenarios are considered in which the goal is to maximize a payoff that assigns weight based on the worth of data and the probability of successful transmission. Ideally, the choice of what information to send over the various links will provide protection of high value data when many links are unavailable, yet result in communication of significant additional data when most links are available. Here the focus is on the simple network of multiple parallel links, where the links have known capacities and outage probabilities. Given a set of simple inter-link codes, linear programming can be used to find the optimal timesharing strategy among these codes. Some observations are made about the problem of determining all potentially useful codes, and techniques to assist in such determination are presented.
Additional Information
© 2010 IEEE. This research was carried out at the Jet Propulsion Laboratory, California Institute of Technology, under a contract with the National Aeronautics and Space Administration.Attached Files
Published - 05464855.pdf
Files
Name | Size | Download all |
---|---|---|
md5:6474dc7598ea470b0a21eb823430c132
|
2.9 MB | Preview Download |
Additional details
- Eprint ID
- 75004
- Resolver ID
- CaltechAUTHORS:20170309-150018311
- NASA/JPL/Caltech
- Created
-
2017-03-09Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field