SWShaojie Wen

Shaojie Wen

*This is an algorithmically generated author record based on publicly available information.

Shaojie Wen has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Link Connectivity-Based Access Selection Method for Multi-UAV Heterogeneous Networks

    by Shaojie Wen, Lianbing Deng, Zengliang Liu

    While UAV ad hoc networks have made significant progress, implementing it in most of real-application scenarios is challenging due to data explosion. Instead of only ad hoc mode, this work simultaneously considers non-orthogonal multiple access technique (NOMA) and ad hoc mode to handle the problem. We further propose an effective framework to seamlessly integrate these two techniques, namely Multi-UAV heterogeneous networks. Specifically, we formulate the framework as a mixed integer nonlinear programming, in which original problem can be decomposed into two sub-problems, e.g., access mode selection for UAV to UAV mode (U2U) and UAV to Ground Base mode (U2G), and transmission rate optimization. For the access mode selection, to reduce the computational complexity at each UAV, a candidate set is constructed based on the connection time and link quality. After that, the component in candidate set that maximizes the objective function is selected as the access point. Due to the different communication techniques in U2U mode and U2G mode, we can obtain the optimal rate for each UAV by using the NOMA technique in U2G mode and channel prediction method with local information in U2U mode, respectively. For the transmission rate optimization, an effective algorithm is proposed for U2G mode and U2U mode, which considers the effects of the network connectivity and link quality on the optimization performance. Simulation results show that our method can reduce the outage rate and improve the network throughput effectively.


  • Optimal relay selection for UAV-assisted V2V communications

    by Xiying Fan, Di Liu, Bin Fu, Shaojie Wen


  • Open Access

    Joint Channel Allocation and Power Control for Uplink NOMA‐Assisted Multi‐UAV Networks

    by Shaojie Wen, Lianbing Deng, Zengliang Liu

    The explosive growth of data leads to that the traditional wireless networks cannot enable various quality of service (QoS) communication for cellular‐connected multi‐UAV (unmanned aerial vehicle) networks. To overcome this obstacle, we solve the joint optimization problem of channel allocation and power control for uplink NOMA‐assisted multi‐UAV networks. Firstly, we design a mixed integer nonlinear programming framework, where the channel gains are characterized with integral form in time interval and sorted in nondescending order as the priority index of the decoded signal. In order to propose a feasible algorithm, the initial power levels of UAVs are obtained and integrated into the original problem which is reduced to integer programming problem. Then, the UAVs whose channel gain differences satisfy the constraints will be divided into a group to share the same channel, while the initial power levels of UAVs are adjusted to get a more satisfactory initial solution for power control. Combining the solution of channel allocation and the initial power levels, we solve power control problem with asynchronous update mechanism until the power levels of UAVs remain unchanged. Finally, we propose a channel allocation algorithm and a power control algorithm with the asynchronous optimization mechanism, respectively. Simulation results show that the proposed algorithms can effectively improve the network performance in terms of the aggregated rate.


  • Open Access

    UAV-Assisted Data Dissemination in Delay-Constrained VANETs

    by Xiying Fan, Chuanhe Huang, Bin Fu, Shaojie Wen, Xi Chen

    Due to the high mobility of vehicles, the frequent path failures caused by dynamic network topology, and a variety of obstructions, efficient data dissemination with delay constraint in vehicular ad hoc networks (VANETs) is a challenging issue. To address these problems, a novel mobile relaying technique by employing unmanned aerial vehicles (UAVs) is considered to facilitate data dissemination in vehicular environments where the communication infrastructures are not available or the network connectivity is poor. This paper studies and formulates the throughput maximization problem in UAV-assisted VANETs, which aims to achieve high throughput while guarantee the delay constraint of data flows to the vehicles in the area. To maximize the network throughput, the maximization problem tries to find an optimal delivery strategy for data dissemination by optimizing the transmission rate. To solve the problem, the knapsack problem can be reduced to the maximization problem, which is proved NP-hard. A polynomial time approximation scheme is proposed to achieve an approximate solution. Detailed theoretical analysis including time complexity and approximation ratio of the proposed algorithm is presented. Simulation results demonstrate the effectiveness of the proposed algorithm.


  • Open Access

    Delay-Constrained Routing Based on Stochastic Model for Flying Ad Hoc Networks

    by Shaojie Wen, Chuanhe Huang

    This paper aims at solving the end-to-end delay-constrained routing problem in a local way for flying ad hoc networks (FANETs). Due to the high mobility, it is difficult for each node in FANETs to obtain the global information. To solve this issue, we propose an adaptive delay-constrained routing with the aid of a stochastic model, which allows the senders to deliver the packets with only local information. We represent the problem in a mathematical form, where the effective transmission rate is viewed as the optimization objective and the link quality and end-to-end delay as the constraints. And, some mathematical tools are used to obtain the approximate solutions for the optimization problem. Before designing the routing scheme, the senders calculate the transition probability for its relay node by jointly considering local delay estimation and expected one-hop delay. Then, the sender transmits the packets to their relay node with transition probability. Finally, we prove the convergence of the proposed routing algorithm and analyse its performances. The simulation results show that the proposed routing policy can improve the network performance effectively in terms of throughput, loss rate, and end-to-end delay.