On the delay and energy performance in coded two-hop line networks with bursty erasures

Daniel E. Lucani, Jörg Kliewer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

We consider two-hop line networks where the communication links are bursty packet erasure channels modeled as a simple two-state Gilbert-Elliott channel. The first and second node in the line have local information with Poisson-distributed arrivals available and intend to communicate this information to the receiving node in the line. We consider an online approach and random linear network coding for erasure correction. We provide a queueing-theoretic analysis of two different models, a genie aided full duplex model and a partially genie aided half-duplex model, where the genie only provides the channel state information. Channel-aware policies are shown to reduce delay by up to a factor of 3 in our examples and significantly increase the network's stable throughput region compared to a simple queue-length driven policy.

Original languageEnglish (US)
Title of host publicationISWCS'11 - 2011 8th International Symposium on Wireless Communication Systems, Proceedings
Pages502-506
Number of pages5
DOIs
StatePublished - 2011
Externally publishedYes
Event2011 8th International Symposium on Wireless Communication Systems, ISWCS'11 - Aachen, Germany
Duration: Nov 6 2011Nov 9 2011

Publication series

NameProceedings of the International Symposium on Wireless Communication Systems
ISSN (Print)2154-0217
ISSN (Electronic)2154-0225

Other

Other2011 8th International Symposium on Wireless Communication Systems, ISWCS'11
CountryGermany
CityAachen
Period11/6/1111/9/11

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Fingerprint Dive into the research topics of 'On the delay and energy performance in coded two-hop line networks with bursty erasures'. Together they form a unique fingerprint.

Cite this