Energy-Efficient Relaying over Multiple Slots with Causal CSI

In many communication scenarios, such as in cellular systems, the energy cost is substantial and should be conserved, yet there is a growing need to support many real-time applications that require timely data delivery. To model such a scenario, in this paper we consider the problem of minimizing the expected sum energy of delivering a message of a given size from a source to a destination subject to a deadline constraint. A relay is present and can assist after it has decoded the message. Causal channel state information (CSI), in the form of present and past SNRs of all links, is available for determining the optimal power allocation for the source and relay. We obtain the optimal power allocation policy by dynamic programming and explore its structure. We also obtain conditions for which the minimum expected sum energy is bounded given a general channel distribution. In particular, we show that for Rayleigh and Rician fading channels, relaying is necessary for the minimum expected sum energy to be bounded. This illustrates the fundamental advantage of relaying from the perspective of energy efficient communications when only causal CSI is available. Numerical results are obtained which show the reduction in the expected sum energy under different communication scenarios.

[1]  Josef Hadar,et al.  Rules for Ordering Uncertain Prospects , 1969 .

[2]  Min Chen,et al.  Distributed power allocation strategies for parallel relay networks , 2008, IEEE Transactions on Wireless Communications.

[3]  Urbashi Mitra,et al.  Energy-efficient scheduling with individual packet delay constraints over a fading channel , 2009, Wirel. Networks.

[4]  Eytan Modiano,et al.  Optimal transmission scheduling over a fading channel with energy and deadline constraints , 2006, IEEE Transactions on Wireless Communications.

[5]  Michael J. Neely,et al.  Optimal routing with mutual information accumulation in wireless networks , 2010, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[6]  Juyul Lee,et al.  Asymptotically optimal policies for hard-deadline scheduling over fading channels , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[7]  Sumei Sun,et al.  Power Minimization of Cooperative Relay Transmission with Relay's Private Information , 2011, 2011 IEEE Vehicular Technology Conference (VTC Fall).

[8]  Jean-Paul M. G. Linnartz,et al.  Rate adaptation using acknowledgement feedback in finite-state markov channels with collisions , 2009, IEEE Transactions on Wireless Communications.

[9]  Juyul Lee,et al.  Energy-efficient scheduling of delay constrained traffic over fading channels , 2008, 2008 IEEE International Symposium on Information Theory.

[10]  Shidong Zhou,et al.  On the Monotonicity, Log-Concavity, and Tight Bounds of the Generalized Marcum and Nuttall $Q$-Functions , 2010, IEEE Transactions on Information Theory.

[11]  Urbashi Mitra,et al.  Delay-Constrained Energy-Efficient Scheduling over a Multihop Link , 2007, 2007 IEEE International Symposium on Information Theory.

[12]  P. Sadeghi,et al.  Finite-state Markov modeling of fading channels - a survey of principles and applications , 2008, IEEE Signal Processing Magazine.

[13]  Mohamed-Slim Alouini,et al.  Digital Communication over Fading Channels: Simon/Digital Communications 2e , 2004 .

[14]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[15]  Andreas F. Molisch,et al.  Cooperative Transmission for Wireless Networks Using Mutual-Information Accumulation , 2011, IEEE Transactions on Information Theory.

[16]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[17]  Sumei Sun,et al.  Relaying with Deadline Constraint: Energy Minimization with Full Channel State Information , 2012, 2012 IEEE 75th Vehicular Technology Conference (VTC Spring).

[18]  Giuseppe Caire,et al.  The throughput of hybrid-ARQ protocols for the Gaussian collision channel , 2001, IEEE Trans. Inf. Theory.

[19]  Gregory W. Wornell,et al.  Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks , 2003, IEEE Trans. Inf. Theory.

[20]  Ness B. Shroff,et al.  Low-Complexity and Distributed Energy Minimization in Multihop Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

[21]  Sumei Sun,et al.  Relaying for Energy-Efficient Scheduling with Deadline , 2010, 2010 IEEE International Conference on Communications.

[22]  Sumei Sun,et al.  Energy Minimization in OFDMA Downlink Systems: A Sequential Linear Assignment Algorithm for Resource Allocation , 2012, IEEE Wireless Communications Letters.

[23]  Gerhard Kramer,et al.  Cooperative Communications , 2007, Found. Trends Netw..

[24]  Shuguang Cui,et al.  Energy-Efficient Cooperative Communication Based on Power Control and Selective Single-Relay in Wireless Sensor Networks , 2008, IEEE Transactions on Wireless Communications.

[25]  ModianoEytan,et al.  A calculus approach to energy-efficient data transmission with quality-of-service constraints , 2009 .

[26]  Eytan Modiano,et al.  A Calculus Approach to Energy-Efficient Data Transmission With Quality-of-Service Constraints , 2009, IEEE/ACM Transactions on Networking.

[27]  John N. Tsitsiklis,et al.  The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..

[28]  Dinesh Rajan,et al.  Power Efficient Delay Allocation in Multihop Wireless Networks , 2007, IEEE Transactions on Vehicular Technology.