Energy consumption in coded queues for wireless information exchange

We show the close relation between network coding and queuing networks with negative and positive customers. Moreover, we develop Markov reward error bounding techniques for networks with negative and positive customers. We obtain bounds on the energy consumption in a wireless information exchange setting using network coding.

[1]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[2]  Anthony Ephremides,et al.  A queueing model for random linear coding , 2007, MILCOM 2007 - IEEE Military Communications Conference.

[3]  Anthony Ephremides,et al.  Network Coding in Wireless Queueing Networks: Tandem Network Case , 2006, 2006 IEEE International Symposium on Information Theory.

[4]  Richard F. Serfozo,et al.  Markov network processes with string transitions , 1998 .

[5]  Christina Fragouli,et al.  Network Coding Fundamentals , 2007, Found. Trends Netw..

[6]  Devavrat Shah,et al.  ARQ for network coding , 2008, 2008 IEEE International Symposium on Information Theory.

[7]  M. Medard,et al.  On Delay Performance Gains From Network Coding , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[8]  A. Ephremides,et al.  Some Optimization Trade-offs in Wireless Network Coding , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[9]  L. Keller,et al.  Online Broadcasting with Network Coding , 2008, 2008 Fourth Workshop on Network Coding, Theory and Applications.

[10]  Xiuli Chao,et al.  Queueing networks with string transitions of mixed vector additions and vector removals , 2001 .

[11]  M. Puterman,et al.  Perturbation theory for Markov reward processes with applications to queueing systems , 1988, Advances in Applied Probability.

[12]  Muriel Médard,et al.  On coding for reliable communication over packet networks , 2005, Phys. Commun..

[13]  Yunnan Wu,et al.  Information Exchange in Wireless Networks with Network Coding and Physical-layer Broadcast , 2004 .

[14]  E. Gelenbe.  Product-form queueing networks with negative and positive customers , 1991 .