Dynamic Index Coding for Wireless Broadcast Networks

Details Dynamic Index Coding for Wireless Broadcast Networks Dynamic Index Coding for Wireless Broadcast Networks

2011-08-09

arxiv.org/abs/1108.1977v1

Computer Science

Information Theory

13 pages, 8 figures

Scientific paper

We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certain packets. This presents a problem of broadcasting in the presence of side information, and is a generalization of the well known (and unsolved) index coding problem of information theory. Rather than achieving the full capacity region, we develop a code-constrained capacity region, which restricts attention to a pre-specified set of coding actions. We develop a dynamic max-weight algorithm that allows for random packet arrivals and supports any traffic inside the code-constrained capacity region. Further, we provide a simple set of codes based on cycles in the underlying demand graph. We show these codes are optimal for a class of broadcast relay problems.

Affiliated with

Also associated with

No associations

Rating

Dynamic Index Coding for Wireless Broadcast Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dynamic Index Coding for Wireless Broadcast Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Index Coding for Wireless Broadcast Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-70548