CaltechAUTHORS
  A Caltech Library Service

Coding for parallel links to maximize expected decodable-message value

Chang, Christopher S. and Klimesh, Matthew A. (2010) Coding for parallel links to maximize expected decodable-message value. In: 44th Annual Conference on Information Sciences and Systems (CISS). IEEE , Piscataway, NJ. ISBN 978-1-4244-7417-2 . http://resolver.caltech.edu/CaltechAUTHORS:20170309-150018311

[img] PDF - Published Version
See Usage Policy.

2851Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20170309-150018311

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.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/CISS.2010.5464855DOIArticle
http://ieeexplore.ieee.org/document/5464855/PublisherArticle
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.
Funders:
Funding AgencyGrant Number
NASA/JPL/CaltechUNSPECIFIED
Record Number:CaltechAUTHORS:20170309-150018311
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20170309-150018311
Official Citation:C. S. Chang and M. A. Klimesh, "Coding for parallel links to maximize expected decodable-message value," 2010 44th Annual Conference on Information Sciences and Systems (CISS), Princeton, NJ, 2010, pp. 1-6. doi: 10.1109/CISS.2010.5464855
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:75004
Collection:CaltechAUTHORS
Deposited By: Kristin Buxton
Deposited On:09 Mar 2017 23:14
Last Modified:09 Mar 2017 23:14

Repository Staff Only: item control page