A Graph-based Study of Throughput and Delay in Instantly Decodable and Opportunistic Network Coded Systems
Dr. Neda Aboutorab (ANU)
APPLIED SIGNAL PROCESSING SERIESDATE: 2013-05-15
TIME: 11:00:00 - 12:00:00
LOCATION: RSISE Seminar Room, ground floor, building 115, cnr. North and Daley Roads, ANU
CONTACT: JavaScript must be enabled to display this email address.
ABSTRACT:
Recent advancements in graph-based optimization and analysis of instantly decodable network coded (IDNC) systems has motivated further investigation to better understand the complicated interplay of their completion time (as a measure of throughput) and delay performance. This talk will provide an overview of the IDNC graph-based packet selection techniques that aim to optimize the completion time and decoding delay of IDNC systems in isolation or jointly. Furthermore, we will introduce new methods to extend the graph representation of traditional IDNC scheme to more general opportunistic network coding scenarios, where receivers can store non-instantly decodable packets (NIDP), and use them in a systematic way for later decodings. In such systems, the decoding opportunities created by the stored NIDPs at the receivers can be exploited to further improve their completion time and decoding delay. We show that IDNC graph representations can be extended to analyze and optimize these opportunistic schemes with no or limited increase in complexity.
