TY - GEN
T1 - Adaptive harvest-then-cooperate
T2 - 17th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2016
AU - Yao, Qizhong
AU - Huang, Aiping
AU - Shan, Hangguan
AU - Quek, Tony Q.S.
AU - Wang, Wei
N1 - Funding Information:
This work was supported in part by the Fundamental Research Funds for the Central Universities under Grant 2015XZZX001-02; by National Natural Science Foundation of China 61571396; by the National Science and Technology Specific Major Projects under Grant 2015ZX03001031; by Zhejiang Provincial Public Technology Research of China under Grant 2016C31063; by A-STAR SERC under Grant 1224104048; by the MOE ARF Tier 2 under Grant MOE2015-T2-2-104; by the SUTD-ZJU Research Collaboration under Grant SUTD-ZJU/RES/01/2014; and by the Specialized Research Fund for the Doctoral Program of Higher Education under Grant 20120101120077
Publisher Copyright:
© 2016 IEEE.
PY - 2016/8/9
Y1 - 2016/8/9
N2 - In this paper, we consider a network where an access point (AP) wirelessly transfers energy to user equipments (UEs) and UEs use the harvested energy to communicate with the AP. Due to different radio propagation losses, the UEs far from the AP harvest little but consume much, thus suffering high transmission delay, while the UEs close to the AP has redundant energy. To reduce the average delay, we propose an adaptive harvest-then-cooperate (AHC) protocol, where every UE sends data to the AP directly or via other UEs acting as relays in a time-division multiplexing manner. Based on the load and energy distributions, the AP controls the transmit power and routing topology to minimize the average delay. To avoid data overflow in UE relays, we propose a method generating scheduling schemes given the transmit power and the routing topology. The average delay minimization is approximately modeled as a Markov decision process, and a policy iteration algorithm is employed to obtain the optimal combination of the power and the routing. Simulation results demonstrate the effectiveness of the AHC protocol in the delay minimization and reveal that the protocol can relieve the unbalance of the energy distribution.
AB - In this paper, we consider a network where an access point (AP) wirelessly transfers energy to user equipments (UEs) and UEs use the harvested energy to communicate with the AP. Due to different radio propagation losses, the UEs far from the AP harvest little but consume much, thus suffering high transmission delay, while the UEs close to the AP has redundant energy. To reduce the average delay, we propose an adaptive harvest-then-cooperate (AHC) protocol, where every UE sends data to the AP directly or via other UEs acting as relays in a time-division multiplexing manner. Based on the load and energy distributions, the AP controls the transmit power and routing topology to minimize the average delay. To avoid data overflow in UE relays, we propose a method generating scheduling schemes given the transmit power and the routing topology. The average delay minimization is approximately modeled as a Markov decision process, and a policy iteration algorithm is employed to obtain the optimal combination of the power and the routing. Simulation results demonstrate the effectiveness of the AHC protocol in the delay minimization and reveal that the protocol can relieve the unbalance of the energy distribution.
UR - http://www.scopus.com/inward/record.url?scp=84984596949&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84984596949&partnerID=8YFLogxK
U2 - 10.1109/SPAWC.2016.7536862
DO - 10.1109/SPAWC.2016.7536862
M3 - Conference contribution
AN - SCOPUS:84984596949
T3 - IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC
BT - SPAWC 2016 - 17th IEEE International Workshop on Signal Processing Advances in Wireless Communications
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 3 July 2016 through 6 July 2016
ER -