DocumentCode
2885423
Title
Coding-Aware Scheduling for Reliable Many-to-One Flows
Author
Al-kofahi, Osameh M. ; Kamal, Ahmed E.
Author_Institution
Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA
fYear
2009
fDate
14-18 June 2009
Firstpage
1
Lastpage
5
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.
Keywords
encoding; scheduling; telecommunication network reliability; analog network coding; coding aware scheduling; digital network coding; maximum gain; reliable communication; reliable many-to-one flow; Communications Society; Computer network reliability; Digital relays; Network coding; Processor scheduling; Protection; Protective relaying; Spread spectrum communication; Telecommunication network reliability; Wireless communication;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2009. ICC '09. IEEE International Conference on
Conference_Location
Dresden
ISSN
1938-1883
Print_ISBN
978-1-4244-3435-0
Electronic_ISBN
1938-1883
Type
conf
DOI
10.1109/ICC.2009.5198830
Filename
5198830
Link To Document