Shaojie Wen

Shaojie Wen

Auto-generated profile, based on publicly available information

Shaojie Wen

Zhuhai Da Hengqin Science and Technology Development Co., Ltd., Zhuhai, P. R. China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
25 October 2018 in Mobile Information Systems
Verified
Journal Article
Open access
PDF file
XFXiying Fan
Xiying Fan
CHChuanhe Huang
Chuanhe Huang
BFBin Fu
Bin Fu
SWShaojie Wen
Shaojie Wen
XCXi Chen
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.

1 August 2018 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
SWShaojie Wen
Shaojie Wen
CHChuanhe Huang
Chuanhe Huang
XCXi Chen
Xi Chen
JMJianhua Ma
Jianhua Ma
NXNaixue Xiong
Naixue Xiong
ZLZongpeng Li
Zongpeng Li

21 May 2021 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
XFXiying Fan
Xiying Fan
DLDi Liu
Di Liu
BFBin Fu
Bin Fu
SWShaojie Wen
Shaojie Wen

13 August 2018 in Mobile Information Systems
Verified
Journal Article
Open access
SWShaojie Wen
Shaojie Wen
CHChuanhe Huang
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.


18 April 2022 in International Journal of Pattern Recognition and Artificial Intelligence
Verified
Journal Article
Closed access
PDF file
SWShaojie Wen
Shaojie Wen
LDLianbing Deng
Lianbing Deng
ZLZengliang Liu
Zengliang Liu