Abstract

Consider network coded multicast traffic over a wireless network in the bandwidth limited regime. We formulate the joint medium access and subgraph optimization problem by means of a graphical conflict model. The nature of network coded flows is not captured by classical link- based scheduling and therefore requires a novel approach based on conflicting hyperarcs. By means of simulations, we evaluate the performance of our algorithm and conclude that it significantly outperforms existing scheduling techniques. Next, we study coding across different sessions. If we restrict coding to “COPE”-type, instantaneously decodable network coding, we provide an online-algorithm for jointly optimal scheduling and network coding and characterize its stability region.

Danail Traskov received the BS degree from Technical University Darmstadt in 2004 and the MS degree from the University of Illinois at Urbana-Champaign in 2006, both in Electrical Engineering. He is currently a PhD candidate at Technical University Munich working in the area of network coding with particular emphasis on wireless networks. He has interned at Bell Labs from May-July 2006 working with Prof. Gerhard Kramer, and has visited the Massachusetts Institute of Technology for the summers of 2007 and 2008 working with Prof. Muriel Medard.