Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/199909
Title: Minimization of Transmission Completion Time in Wireless Powered Communication Networks
Authors: Kaikai Chi;Yi-Hua Zhu;Yanjun Li;Liang Huang;Ming Xia
Year: 2017
Publisher: IEEE
Abstract: Recently, the newly emerging wireless powered communication network (WPCN) has drawn significant interests, where network nodes are powered by the energy harvested from the radio-frequency (RF) signal. This paper studies the WPCN where one hybrid sink (H-sink) coordinates the wireless energy/information transmissions to/from a set of one-hop nodes powered by the harvested RF energy only. The transmission completion time (TCT) minimization for the uplink (UL) transmissions of a given number of bits per node is considered. First, we prove that the harvest-then-transmit (HTT) transmission strategy is one of the transmission strategies able to achieve the minimal TCT, where all nodes first harvest the RF energy broadcast by the H-sink in the downlink and then send their independent information to the H-sink in the UL by time-division multiple access. Then for the HTT transmission, we prove that in order to achieve the minimal TCT, each node must transmit with constant power and consume all available energy, which helps to simplify the considered TCT minimization problem to be the optimization of time allocated for the H-sink's wireless energy transfer and the nodes' wireless information transmissions, and we formulate the optimal time allocation problem as a nonlinear optimization problem. Finally, we prove that it is a convex optimization problem. Due to the inexistence of explicit closed-form expressions of optimal time allocations to minimize TCT, one efficient algorithm is presented to obtain the optimal time allocations. Simulation results show that, compared with the available transmission strategies, the designed TCT-minimized transmission achieves a significantly smaller TCT.
URI: http://localhost/handle/Hannan/199909
volume: 4
issue: 5
More Information: 1671,
1683
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7890406.pdf992.58 kBAdobe PDF
Title: Minimization of Transmission Completion Time in Wireless Powered Communication Networks
Authors: Kaikai Chi;Yi-Hua Zhu;Yanjun Li;Liang Huang;Ming Xia
Year: 2017
Publisher: IEEE
Abstract: Recently, the newly emerging wireless powered communication network (WPCN) has drawn significant interests, where network nodes are powered by the energy harvested from the radio-frequency (RF) signal. This paper studies the WPCN where one hybrid sink (H-sink) coordinates the wireless energy/information transmissions to/from a set of one-hop nodes powered by the harvested RF energy only. The transmission completion time (TCT) minimization for the uplink (UL) transmissions of a given number of bits per node is considered. First, we prove that the harvest-then-transmit (HTT) transmission strategy is one of the transmission strategies able to achieve the minimal TCT, where all nodes first harvest the RF energy broadcast by the H-sink in the downlink and then send their independent information to the H-sink in the UL by time-division multiple access. Then for the HTT transmission, we prove that in order to achieve the minimal TCT, each node must transmit with constant power and consume all available energy, which helps to simplify the considered TCT minimization problem to be the optimization of time allocated for the H-sink's wireless energy transfer and the nodes' wireless information transmissions, and we formulate the optimal time allocation problem as a nonlinear optimization problem. Finally, we prove that it is a convex optimization problem. Due to the inexistence of explicit closed-form expressions of optimal time allocations to minimize TCT, one efficient algorithm is presented to obtain the optimal time allocations. Simulation results show that, compared with the available transmission strategies, the designed TCT-minimized transmission achieves a significantly smaller TCT.
URI: http://localhost/handle/Hannan/199909
volume: 4
issue: 5
More Information: 1671,
1683
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7890406.pdf992.58 kBAdobe PDF
Title: Minimization of Transmission Completion Time in Wireless Powered Communication Networks
Authors: Kaikai Chi;Yi-Hua Zhu;Yanjun Li;Liang Huang;Ming Xia
Year: 2017
Publisher: IEEE
Abstract: Recently, the newly emerging wireless powered communication network (WPCN) has drawn significant interests, where network nodes are powered by the energy harvested from the radio-frequency (RF) signal. This paper studies the WPCN where one hybrid sink (H-sink) coordinates the wireless energy/information transmissions to/from a set of one-hop nodes powered by the harvested RF energy only. The transmission completion time (TCT) minimization for the uplink (UL) transmissions of a given number of bits per node is considered. First, we prove that the harvest-then-transmit (HTT) transmission strategy is one of the transmission strategies able to achieve the minimal TCT, where all nodes first harvest the RF energy broadcast by the H-sink in the downlink and then send their independent information to the H-sink in the UL by time-division multiple access. Then for the HTT transmission, we prove that in order to achieve the minimal TCT, each node must transmit with constant power and consume all available energy, which helps to simplify the considered TCT minimization problem to be the optimization of time allocated for the H-sink's wireless energy transfer and the nodes' wireless information transmissions, and we formulate the optimal time allocation problem as a nonlinear optimization problem. Finally, we prove that it is a convex optimization problem. Due to the inexistence of explicit closed-form expressions of optimal time allocations to minimize TCT, one efficient algorithm is presented to obtain the optimal time allocations. Simulation results show that, compared with the available transmission strategies, the designed TCT-minimized transmission achieves a significantly smaller TCT.
URI: http://localhost/handle/Hannan/199909
volume: 4
issue: 5
More Information: 1671,
1683
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7890406.pdf992.58 kBAdobe PDF