Abstract

Dynamic index coding is a practical generalization of conventional index coding that deals with real dynamic traffic streams. We identify the code-constrained capacity region of a dynamic index coding problem with a complete bi-directional side information graph and introduce the performance metric of dynamic index coding gain to measure how dynamic index coding reduces the required data transmissions. A greedy dynamic index coding scheme is proposed that achieves the maximum coding gain almost everywhere in the identified capacity region. Although the greedy scheme attains the maximum coding gain, its selfish nature may unacceptably increase transmission delay. To address this issue, a time-shared friendly dynamic index coding scheme is introduced that achieves the maximum coding gain over the entire capacity region and offers a lower delay than its greedy counterpart. To obtain the minimum delay, a constrained optimization problem is formulated to tune time-sharing weights in the friendly scheme. The closed-form solution of the optimization is derived for the special two-flow case. Furthermore, the results and analysis are extended to dynamic index coding problems with arbitrary side information graphs. We also use analytical and simulation results to provide graphical intuition for the obtained results.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.