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.
['Osameh M. Al-Kofahi', 'Ahmed E. Kamal']
Coding-Aware Scheduling for Reliable Many-to-One Flows