Distributionally Robust Chance-Constrained Backscatter Communication-Assisted Computation Offloading in WBANs

被引:18
作者
Ling, Zhuang [1 ]
Hu, Fengye [1 ]
Zhang, Yu [2 ,3 ,4 ]
Fan, Lei [5 ]
Gao, Feifei [2 ,3 ,4 ]
Han, Zhu [6 ,7 ]
机构
[1] Jilin Univ, Coll Commun Engn, Changchun 130012, Peoples R China
[2] Tsinghua Univ THUAI, Inst Artificial Intelligence, Beijing 100084, Peoples R China
[3] Tsinghua Univ, State Key Lab Intelligent Technol & Syst, Beijing 100084, Peoples R China
[4] Tsinghua Univ, Beijing Natl Res Ctr Informat Sci & Technol BNRis, Dept Automat, Beijing 100084, Peoples R China
[5] Univ Houston, Dept Engn Technol, Houston, TX 77004 USA
[6] Univ Houston, Dept Elect & Comp Engn, Houston, TX 77004 USA
[7] Kyung Hee Univ, Dept Comp Sci & Engn, Seoul 446701, South Korea
基金
中国国家自然科学基金;
关键词
Task analysis; Optimization; Backscatter; Computational modeling; Wireless communication; Radio frequency; Medical services; Wireless body area networks (WBANs); mobile edge computation offloading; backscatter communication; Bernstein-type-inequality (BTI) method; conditional value-at-risk (CVaR) method; POWERED SENSOR NETWORKS; WIRELESS INFORMATION; ENERGY; OPTIMIZATION; MINIMIZATION; PERFORMANCE; THROUGHPUT; DESIGN; SECURE;
D O I
10.1109/TCOMM.2021.3056714
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Implementing wireless body area networks (WBANs) is very challenging, due to limited power supply, inadequate computation capability, and imperfect channel state information (CSI). In this paper, we propose a hybrid offloading scheme with backscatter communication (BackCom) under imperfect CSI, where each sensor firstly receives radio frequency (RF) energy and then offloads body data task via low-power BackCom to the access point (AP) for edge computing. Aiming to minimize the end-to-end system latency, we jointly optimize the computation speed of AP for processing computation tasks, the power of the signal transmitted by the AP, and the power reflection coefficient under energy and data rate chance constraints. To solve the proposed distributionally robust chance-constrained optimization problem, we approximate chance constraints by the Bernstein-type-inequality (BTI) method and Conditional value-at-risk (CVaR) method in the Gaussian distribution and arbitrary distribution of channel estimation errors, respectively. To tackle the NP-hard problem efficiently, the original problem can be decomposed into two subproblems, which are solved by successive linear programming and iterative algorithm, respectively. Simulation results show that the CVaR method outperforms the other methods for the non-Gaussian CSI mismatch, and the Bernstein method is more suitable for the Gaussian distribution of CSI errors.
引用
收藏
页码:3395 / 3408
页数:14
相关论文
共 46 条
[41]   WET-Enabled Passive Communication Networks: Robust Energy Minimization With Uncertain CSI Distribution [J].
Yao, Qizhong ;
Huang, Aiping ;
Shan, Hangguan ;
Quek, Tony Q. S. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17 (01) :282-295
[42]   Computation Offloading With Data Caching Enhancement for Mobile Edge Computing [J].
Yu, Shuai ;
Langar, Rami ;
Fu, Xiaoming ;
Wang, Li ;
Han, Zhu .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (11) :11098-11112
[43]   Energy-Optimal Mobile Cloud Computing under Stochastic Wireless Channel [J].
Zhang, Weiwen ;
Wen, Yonggang ;
Guan, Kyle ;
Kilper, Dan ;
Luo, Haiyun ;
Wu, Dapeng Oliver .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2013, 12 (09) :4569-4581
[44]   A Robust Design for Ultra Reliable Ambient Backscatter Communication Systems [J].
Zhang, Yu ;
Li, Bin ;
Gao, Feifei ;
Han, Zhu .
IEEE INTERNET OF THINGS JOURNAL, 2019, 6 (05) :8989-8999
[45]   Simultaneous Wireless Information and Power Transfer Strategies in Relaying Network With Direct Link to Maximize Throughput [J].
Zhao, Nan ;
Hu, Fengye ;
Li, Zan ;
Gao, Yue .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (09) :8514-8524
[46]   Distributionally robust joint chance constraints with second-order moment information [J].
Zymler, Steve ;
Kuhn, Daniel ;
Rustem, Berc .
MATHEMATICAL PROGRAMMING, 2013, 137 (1-2) :167-198