Feijiang Han

Feijiang Han

Auto-generated profile, based on publicly available information

Feijiang Han

School of Computer Science and engineering, Central South University, Changsha, China

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
31 October 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JTJianheng Tang
Jianheng Tang
KFKejia Fan
Kejia Fan
WXWenxuan Xie
Wenxuan Xie
FHFeijiang Han
Feijiang Han
ZQZhenzhe Qu
Zhenzhe Qu
Tian WangTian Wang
Tian Wang
Mobile crowdsourcing (MCS) is an emerging paradigm that harnesses the collective power of the crowd to tackle large-scale tasks. To ensure the high-quality worker selection, various combinatorial multiarmed bandit (CMAB)-based schemes have been proposed. However, previous schemes often overlook critical issues. First, the post-unknown worker recruitment (PUWR) problem emerges when the quality of a worker remains unknown despite reported worker data. Second, the presence of Sybil Requesters is often neglected, who manipulate ratings to deceive workers for malicious purposes. To tackle these challenges, we present an innovative scheme called bi-directional trust verification-based CMAB (BTV-CMAB). First, we propose a truth quality discovery approach that effectively addresses the PUWR problem by estimating worker quality. Additionally, we employ a BTV mechanism to assess the Degree of Trust (DoT) of requesters and the reputation of workers. To select top-notch workers for MCS, we combine the worker quality and reputation into an upper confidence bound (UCB) index. The effectiveness of the BTV-CMAB scheme is supported by theoretical proof, which demonstrates its ability to ensure truthfulness and individual rationality. Furthermore, experimental results reveal promising improvements achieved by our scheme, including a 17.44%, increase in the platform’s revenue and a significant decrease in regret of up to 88.26%. To the best of our knowledge, this study is the first to propose utilizing a BTV mechanism to effectively address the PUWR problem and counter the threat of Sybil attacks in the CMAB-based worker recruitment process.

28 December 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
KFKejia Fan
Kejia Fan
JTJianheng Tang
Jianheng Tang
WXWenxuan Xie
Wenxuan Xie
FHFeijiang Han
Feijiang Han
YHYajiang Huang
Yajiang Huang
SZShaobo Zhang
Shaobo Zhang
The Energy Internet (EI) aims to build a sustainable energy ecosystem by connecting diverse energy sources and prosumers. Mobile Crowd Sensing (MCS) enables efficient data collection for monitoring and aggregation from distributed devices. Given the complex behavior of workers driven by self-interest, recruiting trustworthy, high-quality, and inexpensive workers remains a significant challenge in research and practice. Previous studies often assume that worker characteristics are known or can be obtained after data collection. However, evaluating worker qualities is quite challenging in the face of multi-source data and complex workers. To address this, we propose a Completion Rate Learning based Multi-Armed Bandit reverse Auction (CRL-MABA) scheme for identifying and selecting high-quality workers in MCS. Our CRL-MABA scheme first proposes a Spatial-Temporal Upper Confidence Bound (STUCB) method to recruit workers, considering both the quality of workers for exploitation and the spatiotemporal features for exploration. In addition, the Dual-Stage Data Estimation Mechanism (DSDEM) and Long-Term and Short-Term Memory Learning (LTSTML) are designed to identify workers accurately and efficiently. Importantly, our proposed scheme avoids the impractical assumptions in previous works while satisfying important criteria such as truthfulness, individual rationality, and computational efficiency. The effectiveness of our scheme is demonstrated through extensive experimental results, which show its superiority over existing strategies.

9 June 2025 in Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies
Verified
Journal Article
Open access
KFKejia Fan
Kejia Fan
YHYajiang Huang
Yajiang Huang
JHJingyu He
Jingyu He
FHFeijiang Han
Feijiang Han
JTJianheng Tang
Jianheng Tang
YLYunhuai Liu
Yunhuai Liu
Leveraging collective capabilities, crowdsourcing has become a popular approach for ubiquitous service construction. The most classical paradigm constructs AI services on the platform using the workers' collected data centrally, leading to widespread data privacy concerns. Federated Learning represents another classical attempt to preserve data privacy through the workers' local training in a distributed and iterative manner. However, due to their inherited reliance on the gradients for back-propagation, they both suffer from the famous problem of "catastrophic forgetting". As incremental demands arise, continual training will significantly compromise previously learned knowledge within the AI model, leading to the degradation of service quality. To overcome these limitations, we propose a ubiquitous Crowdsourced Analytic Learning Mechanism, named CALM. By introducing analytic learning into crowdsourcing with meticulously designed computation and communication protocols, our CALM can effectively achieve data privacy preservation and absolute knowledge memorization. In CALM, the workers are required to locally perform lightweight computations without back-propagation using their collected data. Subsequently, they only need to upload the privacy-preserved results to the platform rather than the raw data. Finally, the platform can recursively aggregate the workers' uploaded results to continually update the AI model for providing ongoing services. Our CALM guarantees that the recursively derived model is fully equivalent to that obtained from centralized training using the complete dataset, fundamentally avoiding catastrophic forgetting. Theoretical analyses are comprehensively presented regarding the validity, security, efficiency, and interpretability of CALM. Extensive experiments using multiple real-world datasets are conducted to validate the state-of-the-art performance of CALM for continual service construction.

2 August 2024 in Information and Software Technology
Verified
Journal Article
Closed access
FZFangfang Zhou
Fangfang Zhou
YFYilun Fan
Yilun Fan
SLShenglan Lv
Shenglan Lv
LJLijia Jiang
Lijia Jiang
ZCZhuo Chen
Zhuo Chen
YZYing Zhao
Ying Zhao