Minimum Broadcast Decoding Delay for Generalized Instantly Decodable Network Coding

In this paper, we introduce the concept of generalized instantly decodable network coding (G-IDNC) to further minimize decoding delay in wireless broadcast, compared to strict instantly decodable network coding (S-IDNC), studied in. G-IDNC loosens the strict instant decodability constraint in order...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE Global Telecommunications Conference GLOBECOM 2010 pp. 1 - 5
Main Authors Sorour, S, Valaee, S
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2010
Subjects
Algorithm design and analysis
Decoding
Delay
Encoding
Heuristic algorithms
Network coding
Receivers
Online AccessGet full text

Cover

More Information
Summary:In this paper, we introduce the concept of generalized instantly decodable network coding (G-IDNC) to further minimize decoding delay in wireless broadcast, compared to strict instantly decodable network coding (S-IDNC), studied in. G-IDNC loosens the strict instant decodability constraint in order to target more receivers while preserving the attractive properties of S-IDNC. We show that the minimum decoding delay problem for G-IDNC can be formulated as a maximum weight clique problem over a well structured graph. Since finding the maximum weight clique of a graph is NP-hard, we design a simple heuristic G-IDNC algorithm with sub-optimal performance. However, simulation results show that both proposed optimal and heuristic G-IDNC algorithms considerably outperform several other S-IDNC and G-IDNC optimal and heuristic approaches.
ISBN:1424456363
9781424456369
ISSN:1930-529X
DOI:10.1109/GLOCOM.2010.5683677