By Topic

Optimizing redundancy using MDS codes and dynamic symbol allocation in mobile ad hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Anna Kacewicz ; School of Electrical and Computer Engineering, Cornell University, Ithaca, NY 14853, USA ; Stephen B. Wicker

We consider the design of a network in which packet transmissions between two nodes are to be guaranteed a certain probability of success. There are N independent paths between the two nodes, each path having a fixed probability of success (perhaps representing an a priori estimate of the security of the path). The original message is encoded using a maximum-distance separable code. We find the minimum redundancy and optimal path symbol allocation for the 3-path case based on a desired success probability and the path success probabilities. Two algorithms are presented for determining the minimum required redundancy - an exponential time algorithm (MRAET) and a polynomial time algorithm (MRAPT). We show that MRAET is optimal in several cases, and that both algorithms perform very well.

Published in:

Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on

Date of Conference:

19-21 March 2008