TY - GEN
T1 - Queue based compression in a two-way relay network
AU - Ciftcioglu, Ertugrul Necdet
AU - Sagduyu, Yalin Evren
AU - Yener, Aylin
AU - Berry, Randall A.
PY - 2010
Y1 - 2010
N2 - We consider the problem of joint rate scheduling and lossy data compression in a two-way relay network with distortion-sensitive stochastic packet traffic. A relay node facilitates exchanging packets between the two sources. Network coding at the relay improves energy efficiency at the expense of additional packet delay. In addition, network coding couples the source queues through the distortion levels of their individual packet traffic. This fact motivates having each source adapt the transmission rate and the compression ratio jointly. We first formulate a centralized dynamic scheme for scheduling and compression with the objective of minimizing the energy consumption at the relay while satisfying stability and average distortion constraints. Lyapunov stability arguments are used to define a centralized policy based on the instantaneous queue backlogs and distortion levels. In addition, a decentralized algorithm is proposed where sources have limited (1-bit) information about each other's queue backlog and distortion levels. Numerical results demonstrate that the performance of the proposed decentralized algorithm approaches the energy-delay tradeoffs resulting from the centralized solution.
AB - We consider the problem of joint rate scheduling and lossy data compression in a two-way relay network with distortion-sensitive stochastic packet traffic. A relay node facilitates exchanging packets between the two sources. Network coding at the relay improves energy efficiency at the expense of additional packet delay. In addition, network coding couples the source queues through the distortion levels of their individual packet traffic. This fact motivates having each source adapt the transmission rate and the compression ratio jointly. We first formulate a centralized dynamic scheme for scheduling and compression with the objective of minimizing the energy consumption at the relay while satisfying stability and average distortion constraints. Lyapunov stability arguments are used to define a centralized policy based on the instantaneous queue backlogs and distortion levels. In addition, a decentralized algorithm is proposed where sources have limited (1-bit) information about each other's queue backlog and distortion levels. Numerical results demonstrate that the performance of the proposed decentralized algorithm approaches the energy-delay tradeoffs resulting from the centralized solution.
UR - http://www.scopus.com/inward/record.url?scp=77953712098&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77953712098&partnerID=8YFLogxK
U2 - 10.1109/CISS.2010.5464972
DO - 10.1109/CISS.2010.5464972
M3 - Conference contribution
AN - SCOPUS:77953712098
SN - 9781424474172
T3 - 2010 44th Annual Conference on Information Sciences and Systems, CISS 2010
BT - 2010 44th Annual Conference on Information Sciences and Systems, CISS 2010
T2 - 44th Annual Conference on Information Sciences and Systems, CISS 2010
Y2 - 17 March 2010 through 19 March 2010
ER -
