Furao Shen

Prof. Furao Shen


Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2007 in Neural Networks
Verified
Journal Article
Closed access
FSFurao Shen
Furao Shen
TOTomotaka Ogura
Tomotaka Ogura
OHOsamu Hasegawa
Osamu Hasegawa

1 January 2020 in Neural Networks
Verified
Journal Article
Closed access
YYYi Yang
Yi Yang
BXBaile Xu
Baile Xu
SSShaofeng Shen
Shaofeng Shen
FSFurao Shen
Furao Shen
JZJian Zhao
Jian Zhao

1 December 2008 in Neural Networks
Verified
Journal Article
Closed access
FSFurao Shen
Furao Shen
OHOsamu Hasegawa
Osamu Hasegawa

5 January 2012 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
JZJun Zheng
Jun Zheng
FSFurao Shen
Furao Shen
HFHongjun Fan
Hongjun Fan
JZJinxi Zhao
Jinxi Zhao

19 April 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
PCPeixin Chen
Peixin Chen
XZXuan Zhou
Xuan Zhou
JZJian Zhao
Jian Zhao
FSFurao Shen
Furao Shen
SSSumei Sun
Sumei Sun
In this paper, we investigate the energy-efficient resource allocation problem in device-to-device (D2D) communications underlaying unmanned aerial vehicle (UAV)-enabled networks. The UAV is deployed as a flying base station to communicate with wireless users in the presence of an eavesdropper in the cell. We consider two types of users: the ground users (GUs) served by the UAV and the D2D users that communicate directly with one another. Our aim is to maximize the total energy efficiency (TEE) of all D2D pairs while guaranteeing the quality of service (QoS) requirements and secrecy rates of all GUs and D2D users via joint power control and channel allocation. The considered TEE maximization problem is a mixed-integer nonlinear programming (MINLP) problem, which is difficult to solve. Therefore, we propose a method that consists of outer and inner loops. In the outer loop, Dinkelbach's algorithm is utilized to transform the original fractional programming problem into a subtractive form. In the inner loop, we employ the alternating optimization method and divide the equivalent optimization problem into two sub-problems: power allocation and channel allocation. Solving the two sub-problems directly using standard convex optimization software may have high complexity. Therefore, we also propose a low-complexity algorithm using the Lagrangian dual and Kuhn—Munkres algorithm to obtain the optimal power allocation in closed-form and the optimal channel allocation, respectively. Simulation results show that the proposed algorithm converges in a small number of iterations. Furthermore, the proposed approach shows its superior performance compared with other benchmark methods.

13 December 2023 in Pattern Recognition
Verified
Journal Article
Closed access
SYSuorong Yang
Suorong Yang
SGSuhan Guo
Suhan Guo
JZJian Zhao
Jian Zhao
FSFurao Shen
Furao Shen