Broadcasting in Time-Division Duplexing: A Random Linear Network Coding Approach

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2009

Autores

Daniel E. Lucani (Autor) FEUP; Muriel Médard (Autor) FEUP; Milica Stojanovic (Autor) FEUP

Ata de Conferência Internacional

Título: Workshop on Network Coding, Theory and Applications

Páginas: 62-67

2009 Workshop on Network Coding, Theory and Applications

Lausanne, Switzerland, 15-16 June 2009

Classificação Científica

FOS: Ciências da engenharia e tecnologias > Engenharia electrotécnica, electrónica e informática

CORDIS: Ciências Tecnológicas > Engenharia > Engenharia de comunicações > Engenharia de telecomunicações

Outras Informações

Resumo (PT): We study random linear network coding for broadcasting in time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data packets back-to-back before stopping to wait for the receivers to acknowledge the number of degrees of freedom, if any, that are required to decode correctly the information. We study the mean time to complete the transmission of a block of packets to all receivers. We also present a bound on the number of stops to wait for acknowledgement in order to complete transmission with probability at least 1 - E, for any E > o. We present analysis and numerical results showing that our scheme outperforms optimal scheduling policies for broadcast, in terms of the mean completion time. We provide a simple heuristic to compute the number of coded packets to be sent before stopping that achieves close to optimal performance with the advantage of a considerable reduction in the search time.

Abstract (EN): We study random linear network coding for broadcasting in time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data packets back-to-back before stopping to wait for the receivers to acknowledge the number of degrees of freedom, if any, that are required to decode correctly the information. We study the mean time to complete the transmission of a block of packets to all receivers. We also present a bound on the number of stops to wait for acknowledgement in order to complete transmission with probability at least 1 - E, for any E > o. We present analysis and numerical results showing that our scheme outperforms optimal scheduling policies for broadcast, in terms of the mean completion time. We provide a simple heuristic to compute the number of coded packets to be sent before stopping that achieves close to optimal performance with the advantage of a considerable reduction in the search time.

Idioma: Inglês

Tipo (Avaliação Docente): Científica