By Topic

Rotational coding achieves multicast capacity of deterministic wireless 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
$31 $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)
Khojastepour, M.A. ; NEC Labs. America, Princeton, NJ, USA ; Keshavarz-Haddad, A.

In this paper we study the maximum throughput of network coding schemes for a single multicast session in wireless networks. We adapt ??deterministic channel model?? proposed in for modeling wireless interference. We introduce a novel rotational coding scheme that can achieve the well-known minimum cutset bound. This coding scheme has lower encoding complexity in comparison with the existing random linear coding schemes which makes it a good candidate for practical systems. Moreover, we present a fundamental result on the rate of information that can be sent through any cutset. This can be used as criteria for analyzing the maximum throughput of linear network codes.

Published in:

Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on

Date of Conference:

Sept. 30 2009-Oct. 2 2009