On Minimizing Broadcast Completion Delay for Instantly Decodable Network Coding

In this paper, we consider the problem of minimizing the mean completion delay in wireless broadcast for instantly decodable network coding. We first formulate the problem as a stochastic shortest path (SSP) problem. Although finding the packet selection policy using SSP is intractable, we use this...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE International Conference on Communications pp. 1 - 5
Main Authors Sorour, S, Valaee, S
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2010
Subjects
Computational complexity
Computational modeling
Decoding
Delay
Network coding
Propagation losses
Satellite broadcasting
Stochastic processes
Streaming media
Throughput
Online AccessGet full text

Cover

More Information
Summary:In this paper, we consider the problem of minimizing the mean completion delay in wireless broadcast for instantly decodable network coding. We first formulate the problem as a stochastic shortest path (SSP) problem. Although finding the packet selection policy using SSP is intractable, we use this formulation to draw the theoretical properties of efficient selection algorithms. Based on these properties, we propose a simple online selection algorithm that efficiently minimizes the mean completion delay of a frame of broadcast packets, compared to the random and greedy selection algorithms with a similar computational complexity. Simulation results show that our proposed algorithm indeed outperforms these random and greedy selection algorithms.
ISBN:1424464021
9781424464029
ISSN:1550-3607
1938-1883
DOI:10.1109/ICC.2010.5502758