Transmit Power Control Policies for Energy Harvesting Sensors With Retransmissions

被引:80
作者
Aprem, Anup [1 ]
Murthy, Chandra R. [1 ]
Mehta, Neelesh B. [1 ]
机构
[1] Indian Inst Sci, Dept Elect Commun Engn, Bangalore 560012, Karnataka, India
关键词
Energy harvesting sensors; power control; ARQ; retransmission; POMDP; MODEL; STRATEGIES; NETWORKS;
D O I
10.1109/JSTSP.2013.2258656
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper addresses the problem of finding outage-optimal power control policies for wireless energy harvesting sensor (EHS) nodes with automatic repeat request (ARQ)-based packet transmissions. The power control policy of the EHS specifies the transmission power for each packet transmission attempt, based on all the information available at the EHS. In particular, the acknowledgement (ACK) or negative acknowledgement (NACK) messages received provide the EHS with partial information about the channel state. We solve the problem of finding an optimal power control policy by casting it as a partially observable Markov decision process (POMDP). We study the structure of the optimal power policy in two ways. First, for the special case of binary power levels at the EHS, we show that the optimal policy for the underlying Markov decision process (MDP) when the channel state is observable is a threshold policy in the battery state. Second, we benchmark the performance of the EHS by rigorously analyzing the outage probability of a general fixed-power transmission scheme, where the EHS uses a predetermined power level at each slot within the frame. Monte Carlo simulation results illustrate the performance of the POMDP approach and verify the accuracy of the analysis. They also show that the POMDP solutions can significantly outperform conventional ad hoc approaches.
引用
收藏
页码:895 / 906
页数:12
相关论文
共 34 条
[1]  
[Anonymous], 2001, LECT NOTES COMPUTER, DOI DOI 10.1007/3-540-45427-6_25
[2]  
[Anonymous], 1998, Supermodularity and complementarity
[3]  
[Anonymous], THESIS BROWN U PROVI
[4]  
[Anonymous], 2003, IJCAI, DOI DOI 10.5555/1630659.1630806
[5]  
[Anonymous], 2005, Wireless Communications
[6]  
[Anonymous], P NCC
[7]  
[Anonymous], 2010, P 2010 IEEE 44 ANN C
[8]  
[Anonymous], 2007, P IEEE 18 INT S PERS
[9]  
[Anonymous], 802 IEEE
[10]  
Bertsekas D. P., 2005, DYNAMIC PROGRAMMING, V1