Coding-aware scheduling for reliable many-to-one flows

  • Authors:
  • Osameh M. Al-Kofahi;Ahmed E. Kamal

  • Affiliations:
  • Department of Electrical and Computer Engineering, Iowa State University;Department of Electrical and Computer Engineering, Iowa State University

  • Venue:
  • ICC'09 Proceedings of the 2009 IEEE international conference on Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We revisit the problem of scheduling the sources transmissions in a many-to-one flow to provide reliable communication between n sources and a single destination. The performance of coding-aware scheduling is studied based on both digital network coding (DNC) and analog network coding (ANC). We discuss some special cases in which an optimal ANC-based schedule can be constructed efficiently. Finally, we show that the maximum gain from using ANC is theoretically bounded by n, where n is the number of sources.