TY - GEN

T1 - Energy-delay considerations in coded packet flows

AU - Lucani, Daniel E.

AU - Kliewer, Jörg

N1 - Copyright:
Copyright 2013 Elsevier B.V., All rights reserved.

PY - 2011

Y1 - 2011

N2 - We consider a line of terminals which is connected by packet erasure channels and where random linear network coding is carried out at each node prior to transmission. In particular, we address an online approach in which each terminal has local information to be conveyed to the base station at the end of the line and provide a queueing theoretic analysis of this scenario. First, a genie-aided scenario is considered and the average delay and average transmission energy depending on the link erasure probabilities and the Poisson arrival rates at each node are analyzed. We then assume that all nodes cannot send and receive at the same time. The transmitting nodes in the network send coded data packets before stopping to wait for the receiving nodes to acknowledge the number of degrees of freedom, if any, that are required to decode correctly the information. We analyze this problem for an infinite queue size at the terminals and show that there is an optimal number of coded data packets at each node, in terms of average completion time or transmission energy, to be sent before stopping to listen.

AB - We consider a line of terminals which is connected by packet erasure channels and where random linear network coding is carried out at each node prior to transmission. In particular, we address an online approach in which each terminal has local information to be conveyed to the base station at the end of the line and provide a queueing theoretic analysis of this scenario. First, a genie-aided scenario is considered and the average delay and average transmission energy depending on the link erasure probabilities and the Poisson arrival rates at each node are analyzed. We then assume that all nodes cannot send and receive at the same time. The transmitting nodes in the network send coded data packets before stopping to wait for the receiving nodes to acknowledge the number of degrees of freedom, if any, that are required to decode correctly the information. We analyze this problem for an infinite queue size at the terminals and show that there is an optimal number of coded data packets at each node, in terms of average completion time or transmission energy, to be sent before stopping to listen.

UR - http://www.scopus.com/inward/record.url?scp=80054797347&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80054797347&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2011.6034244

DO - 10.1109/ISIT.2011.6034244

M3 - Conference contribution

AN - SCOPUS:80054797347

SN - 9781457705953

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 796

EP - 800

BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

Y2 - 31 July 2011 through 5 August 2011

ER -