Go to:
Logótipo
You are in:: Start > Publications > View > On Coding for Asymmetric Wireless Interfaces
Map of Premises
FC6 - Departamento de Ciência de Computadores FC5 - Edifício Central FC4 - Departamento de Biologia FC3 - Departamento de Física e Astronomia e Departamento GAOT FC2 - Departamento de Química e Bioquímica FC1 - Departamento de Matemática
Publication

On Coding for Asymmetric Wireless Interfaces

Title
On Coding for Asymmetric Wireless Interfaces
Type
Article in International Conference Proceedings Book
Year
2012
Authors
André Moreira
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications Without AUTHENTICUS View ORCID page
Daniel E. Lucani
(Author)
FEUP
Conference proceedings International
International Symposium on Network Coding (NETCOD 2012)
Cambridge, MA, USA, 29 a 30 de Junho de 2012
Scientific classification
FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering
CORDIS: Technological sciences > Engineering > Communication engineering
Other information
Resumo (PT): This paper presents fundamental limits and practi- cal schemes for managing data and feedback of coded flows over multiple, half-duplex communication interfaces (routes). We set forth closed-form bounds on the capacity of resource constrained routes. Our work also provides a systematic approach to exploit these bounds in order to solve the allocation of coded packets with a reliability constraint efficiently, specifically providing a simple mechanism to compute the number of coded packets to be sent through each route. Optimal and heuristic schemes to exploit feedback in the presence of asymmetric packet loss probabilities and propagation delay are proposed and numerical results are provided to support our findings.
Abstract (EN): This paper presents fundamental limits and practi- cal schemes for managing data and feedback of coded flows over multiple, half-duplex communication interfaces (routes). We set forth closed-form bounds on the capacity of resource constrained routes. Our work also provides a systematic approach to exploit these bounds in order to solve the allocation of coded packets with a reliability constraint efficiently, specifically providing a simple mechanism to compute the number of coded packets to be sent through each route. Optimal and heuristic schemes to exploit feedback in the presence of asymmetric packet loss probabilities and propagation delay are proposed and numerical results are provided to support our findings.
Language: English
Type (Professor's evaluation): Scientific
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same scientific areas

Capacity Bounds for Small-World and Dual Radio Networks (2007)
Thesis
Costa, Rui Filipe Mendes Alves da ; João Barros; João Barros
Resumindo e concluindo… Em busca da fase perdida (2009)
Technical Report
Sílvio Almeida Abrantes Moreira
Resumindo e concluindo... Yes, we QAM (2009)
Technical Report
Sílvio Almeida Abrantes Moreira

See all (39)

Recommend this page Top
Copyright 1996-2026 © Faculdade de Ciências da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2026-02-21 at 13:11:11 | Privacy Policy | Personal Data Protection Policy | Whistleblowing | Electronic Yellow Book