By Topic

Random linear coding for multicast over a time-varying channel

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

3 Author(s)
Randy Cogill ; Systems and Information Engineering Department, University of Virginia, USA ; Brooke Shrader ; Anthony Ephremides

The use of random linear coding of packets is known to be beneficial for both multicast transmission as well as transmission over time-varying communication channels. In this work we consider both scenarios in conjunction and characterize the stable multicast throughput performance. We first consider a scheduling strategy that is able to observe the state of the channel and we provide an upper bound on the throughput. We then consider a random linear coding strategy that performs coding over multiple multicast flows and we provide a lower bound on the throughput. We show that instances exist for which coding outperforms scheduling with channel state information.

Published in:

Communication, Control, and Computing, 2008 46th Annual Allerton Conference on

Date of Conference:

23-26 Sept. 2008