Yinxin Wan

Yinxin Wan

Auto-generated profile, based on publicly available information

Yinxin Wan

University of Massachusetts Boston, Boston, Massachusetts, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
13 October 2023 in IEEE Network
Verified
Journal Article
Closed access
ACAlena Chang
Alena Chang
YWYinxin Wan
Yinxin Wan
GXGuoliang Xue
Guoliang Xue
ASArunabha Sen
Arunabha Sen
Low Earth Orbit (LEO) satellites present a compelling opportunity for the establishment of a global quantum information network. However, satellite-based entanglement distribution from a networking perspective has not been fully investigated. Existing works often do not account for satellite movement over time when distributing entanglement and/or often do not permit entanglement distribution along inter-satellite links, which are two shortcomings we address in this paper. We first define a system model which considers both satellite movement over time and inter-satellite links. We next formulate the optimal entanglement distribution (OED) problem under this system model and show how to convert the OED problem in a dynamic physical network to one in a static logical graph which can be used to solve the OED problem in the dynamic physical network. We then propose a polynomial time greedy algorithm for computing satellite-assisted multi-hop entanglement paths. We also design an integer linear programming (ILP)-based algorithm to compute optimal solutions as a baseline to study the performance of our greedy algorithm. We present evaluation results to demonstrate the advantage of our model and algorithms.

9 May 2023
Verified
Conference Paper
Open access
YWYinxin Wan
Yinxin Wan
XLXuanli Lin
Xuanli Lin
ASAbdulhakim Sabur
Abdulhakim Sabur
ACAlena Chang
Alena Chang
KXKuai Xu
Kuai Xu
GXGuoliang Xue
Guoliang Xue
In recent years, Internet of Things (IoT) devices have been extensively deployed in edge networks, including smart homes and offices. Despite the exciting opportunities afforded by the advancements in the IoT, it also introduces new attack vectors and vulnerabilities in the system. Existing studies have shown that the attack graph is an effective model for performing system-level analysis of IoT security. In this paper, we study IoT system vulnerability analysis and network hardening. We first extend the concept of attack graph to weighted attack graph and design a novel algorithm for computing a shortest attack trace in a weighted attack graph. We then formulate the network hardening problem. We prove that this problem is NP-hard, and then design an exact algorithm and a heuristic algorithm to solve it. Extensive experiments on 9 synthetic IoT systems and 2 real-world smart home IoT testbeds demonstrate that our shortest attack trace algorithm is robust and fast, and our heuristic network hardening algorithm is efficient in producing near optimal results compared to the exact algorithm.


10 May 2026
Verified
Conference Paper
Open access
YWYinxin Wan
Yinxin Wan
TXTing Xu
Ting Xu
THTran Ngoc Bao Huynh
Tran Ngoc Bao Huynh
JDJun Dai
Jun Dai
XSXiaoyan Sun
Xiaoyan Sun
GXGuoliang Xue
Guoliang Xue

12 October 2026
Verified
Conference Paper
Open access
GLGuanjie Lin
Guanjie Lin
YWYinxin Wan
Yinxin Wan
SPShichao Pei
Shichao Pei
TXTing Xu
Ting Xu
KXKuai Xu
Kuai Xu
GXGuoliang Xue
Guoliang Xue