TY - JOUR
T1 - Auction-Based Time Scheduling for Backscatter-Aided RF-Powered Cognitive Radio Networks
AU - Gao, Xiaozheng
AU - Wang, Ping
AU - Niyato, Dusit
AU - Yang, Kai
AU - An, Jianping
N1 - Publisher Copyright:
© 2002-2012 IEEE.
PY - 2019/3
Y1 - 2019/3
N2 - This paper investigates the time scheduling for a backscatter-Aided radio-frequency-powered cognitive radio network, where multiple secondary transmitters transmit data to the same secondary gateway in the backscatter mode and the harvest-Then-Transmit mode. With many secondary transmitters connected to the network, the total transmission demand of the secondary transmitters may frequently exceed the transmission capacity of the secondary network. As such, the secondary gateway is more likely to assign the time resource, i.e., the backscattering time in the backscatter mode and the transmission time in the harvest-Then-Transmit mode, to the secondary transmitters with higher transmission valuations. Therefore, according to a variety of demand requirements from secondary transmitters, we design two auction-based time scheduling mechanisms for the time resource assignment. In the auctions, the secondary gateway acts as the seller as well as the auctioneer, and the secondary transmitters act as the buyers to bid for the time resource. We design the winner determination, the time scheduling, and the pricing schemes for both the proposed auction-based mechanisms. Furthermore, the economic properties, such as individual rationality and truthfulness, and the computational efficiency of our proposed mechanisms are analytically evaluated. The simulation results demonstrate the effectiveness of our proposed mechanisms.
AB - This paper investigates the time scheduling for a backscatter-Aided radio-frequency-powered cognitive radio network, where multiple secondary transmitters transmit data to the same secondary gateway in the backscatter mode and the harvest-Then-Transmit mode. With many secondary transmitters connected to the network, the total transmission demand of the secondary transmitters may frequently exceed the transmission capacity of the secondary network. As such, the secondary gateway is more likely to assign the time resource, i.e., the backscattering time in the backscatter mode and the transmission time in the harvest-Then-Transmit mode, to the secondary transmitters with higher transmission valuations. Therefore, according to a variety of demand requirements from secondary transmitters, we design two auction-based time scheduling mechanisms for the time resource assignment. In the auctions, the secondary gateway acts as the seller as well as the auctioneer, and the secondary transmitters act as the buyers to bid for the time resource. We design the winner determination, the time scheduling, and the pricing schemes for both the proposed auction-based mechanisms. Furthermore, the economic properties, such as individual rationality and truthfulness, and the computational efficiency of our proposed mechanisms are analytically evaluated. The simulation results demonstrate the effectiveness of our proposed mechanisms.
KW - Cognitive networks
KW - auction theory
KW - backscatter
KW - energy harvesting
KW - time scheduling
UR - http://www.scopus.com/inward/record.url?scp=85062939803&partnerID=8YFLogxK
U2 - 10.1109/TWC.2019.2895340
DO - 10.1109/TWC.2019.2895340
M3 - Article
AN - SCOPUS:85062939803
SN - 1536-1276
VL - 18
SP - 1684
EP - 1697
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 3
M1 - 8632710
ER -