Yi Wang

Yi Wang

Auto-generated profile, based on publicly available information

Yi Wang

Southern University of Science and Technology

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
16 August 2013
Verified
Conference Paper
Open access
XWXitao Wen
Xitao Wen
YCYan Chen
Yan Chen
CHChengchen Hu
Chengchen Hu
CSChao Shi
Chao Shi
YWYi Wang
Yi Wang
The OpenFlow (OF) paradigm embraces third-party development efforts, and therefore suffers from potential trust issue on OF applications (apps). The abuse of such trust could lead to various types of attacks impacting the entire network. In this paper, we propose PermOF, a fine-grained permission system, as the first line of defense, in order to apply minimum privilege on apps. We summarize a set of 18 permissions to be enforced at the API entry of the controller. To accommodate the isolation requirements, we propose a customized isolation mechanism, which achieves comprehensive resource isolation and access control.

31 January 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
Chaogang TangChaogang Tang
Chaogang Tang
XWXianglin Wei
Xianglin Wei
Chunsheng ZhuChunsheng Zhu
Chunsheng Zhu
YWYi Wang
Yi Wang
WJWei Jia
Wei Jia
The advent of 5G technologies enables highly anticipated prospect of the internet of things in smart cities. Smart terminals become a necessity with increasing number of applications and tasks. The limited computational resources and constrained battery energy at terminals compel tasks to be offloaded for execution sometimes. For time-sensitive and safety-critical tasks, fog computing is the preferred option instead of cloud computing, since fog computing brings the computing resources to the edge of networks and thus has relatively shorter response latency. In this context, Vehicular fog computing (VFC) that supplements fog computing by contributing vehicular computing resources has been attracting increasing attention in recent years. However, a few of challenging issues regarding task offloading in VFC still need to be addressed. For example, decision making for task allocation and response latency optimization are not straightforward, since on one hand the connection between vehicles and end users is usually short or intermittent; on the other hand the multi-hop inter-vehicle task forwarding is time-consuming and thus prone to packet loss. To address the latency related issue, we in this paper propose a three-layer architecture of VFC to schedule the tasks offloaded from MDs. RSU is endowed with computing facilities and storing resources such that it can act as not only a gateway to the remote cloud center but also a centralized infrastructure responsible for task scheduling among vehicles. A greedy heuristic based scheduling strategy and algorithms are proposed in the next. Last, an extensive series of experiments are carried out to investigate the proposed scheduling strategy. The results show that the proposed scheduling strategy outperforms other well known heuristics based scheduling strategies such as Min-Min and Max-Min and thus has wide prospects.

1 June 2012
Verified
Conference Paper
Closed access
YWYi Wang
Yi Wang
KHKeqiang He
Keqiang He
HDHuichen Dai
Huichen Dai
WMWei Meng
Wei Meng
JJJunchen Jiang
Junchen Jiang
YCYan Chen
Yan Chen
Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv4/6 address, making fast name lookup a challenging issue. In this paper, we propose an effective Name Component Encoding (NCE) solution with the following two techniques: (1) A code allocation mechanism is developed to achieve memory-efficient encoding for name components, (2) We apply an improved State Transition Arrays to accelerate the longest name prefix matching and design a fast and incremental update mechanism which satisfies the special requirements of NDN forwarding process, namely to insert, modify, and delete name prefixes frequently. Furthermore, we analyze the memory consumption and time complexity of NCE. Experimental results on a name set containing 3,000,000 names demonstrate that compared with the character trie NCE reduces overall 30% memory. Besides, NCE performs a few millions lookups per second (on an Intel 2.8 GHz CPU), a speedup of over 7 times compared with the character trie. Our evaluation results also show that NCE can scale up to accommodate the potential future growth of the name sets.

29 October 2012
Verified
Conference Paper
Open access
JLJun Li
Jun Li
HWHao Wu
Hao Wu
BLBin Liu
Bin Liu
JLJianyuan Lu
Jianyuan Lu
YWYi Wang
Yi Wang
LDLijun Dong
Lijun Dong

1 April 2013
Verified
Conference Paper
Closed access
HDHuichen Dai
Huichen Dai
YWYi Wang
Yi Wang
JFJindou Fan
Jindou Fan
BLBin Liu
Bin Liu
Current Internet is reaching the limits of its capabilities due to its function transition from host-to-host communication to content dissemination. Named Data Networking (NDN) - an instantiation of Content-Centric Networking approach, embraces this shift by stressing the content itself, rather than where it locates. NDN tries to provide better security and privacy than current Internet does, and resilience to Distributed Denial of Service (DDoS) is a significant issue. In this paper, we present a specific and concrete scenario of DDoS attack in NDN, where perpetrators make use of NDN's packet forwarding rules to send out Interest packets with spoofed names as attacking packets. Afterwards, we identify the victims of NDN DDoS attacks include both the hosts and routers. But the largest victim is not the hosts, but the routers, more specifically, the Pending Interest Table (PIT) within the router. PIT brings NDN many elegant features, but it suffers from vulnerability. We propose Interest traceback as a counter measure against the studied NDN DDoS attacks, which traces back to the originator of the attacking Interest packets. At last, we assess the harmful consequences brought by these NDN DDoS attacks and evaluate the Interest traceback counter measure. Evaluation results reveal that the Interest traceback method effectively mitigates the NDN DDoS attacks studied in this paper.

14 April 2022 in IEEE Transactions on Green Communications and Networking
Verified
Journal Article
Closed access
YZYu Zhang
Yu Zhang
GTGuoming Tang
Guoming Tang
QHQianyi Huang
Qianyi Huang
YWYi Wang
Yi Wang
KWKui Wu
Kui Wu
Xun ShaoXun Shao
Xun Shao
Non-intrusive load monitoring (NILM) helps disaggregate a household’s main electricity consumption to energy usages of individual appliances, greatly cutting down the cost of fine-grained load monitoring towards the green home vision. To address the privacy concern in NILM applications, federated learning (FL) could be leveraged for NILM model training and sharing. When applying the FL paradigm in real-world NILM applications, however, we are faced with the challenges of edge resource restriction, edge model personalization, and edge training data scarcity. We present FedNILM, a practical FL paradigm for NILM applications at the edge client. Specifically, FedNILM delivers privacy-preserving and personalized NILM services to large-scale edge clients, by leveraging i) collaborative data aggregation through federated learning, ii) efficient cloud model compression via filter pruning and multi-task learning, and iii) personalized edge model building with unsupervised transfer learning. Our experiments on real-world energy data show that FedNILM can achieve personalized energy disaggregation with the state-of-the-art accuracy, while preserving the user privacy.