Chaokun Zhang

Chaokun Zhang

Auto-generated profile, based on publicly available information

Chaokun Zhang

Tianjin University

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
15 July 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
CWChen Wu
Chen Wu
Tie QiuTie Qiu
Tie Qiu
CZChaokun Zhang
Chaokun Zhang
WQWenyu Qu
Wenyu Qu
DWDapeng Oliver Wu
Dapeng Oliver Wu
Indoor positioning technology based on Wi-Fi fingerprint recognition has been widely studied owing to the pervasiveness of hardware facilities and the ease of implementation of software technology. However, the similarity-based method is not sufficiently accurate, whereas the offline training of the neural network-based method is overly time consuming. An efficient model with high positioning accuracy is therefore not yet available. We propose a stacking ensemble broad learning localization system using channel state information as a fingerprint, which is termed EnsemLoca. A bootstrapping method is used to build the training set, which enables the EnsemLoca system to build the base learner in parallel by using bagging. The broad learning system (BLS), which is a novel neural network model, as a base learner, not only has the advantage of time complexity but also offers a sparse representation in which the features are filtered. A unique base learner is constructed by randomly selecting the samples and features, and they are combined by stack generalization. The experimental results show that the EnsemLoca system achieves higher accuracy than several machine-learning algorithms in both line-of-sight (LOS) and non-LOS environments, and is even stronger than deep neural networks characterized by accuracy. At the same time, it has the same theoretical complexity as BLS, which greatly reduces the offline training time.

8 September 2017 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
JEJinlong E.
Jinlong E.
YCYong Cui
Yong Cui
PWPeng Wang
Peng Wang
Zhenhua LiZhenhua Li
Zhenhua Li
CZChaokun Zhang
Chaokun Zhang
Cloud storage services such as Dropbox have been widely used for file collaboration among multiple users. However, this desirable functionality is yet restricted to the “walled-garden” of each service. At present, the only feasible approach to cross-cloud file collaboration seems to be using web APIs, whose performance is known to be highly unstable and unpredictable. Now that using inefficient web APIs is inevitable, in this paper we attempt to achieve sound user-perceived performance for cross-cloud file collaboration. This attempt is enabled by two key observations from real-world measurements. First, for each cloud, we are always able to deploy one or several nearby (client) proxies which can efficiently access the web APIs. Second, during file collaboration, significant similarity exists among different versions of a file. This can be exploited to substantially reduce inter-proxy traffic and thus shorten the data sync time. Guided by the observations, we design and implement an open-source prototype system called CoCloud. Currently, it supports file collaboration among four popular cloud storage services in the US and China. Its performance is well acceptable to users under representative workloads, even approaching or exceeding that of intra-cloud collaboration in many cases.

5 May 2021
Verified
Conference Paper
Closed access
ZZZehao Zhao
Zehao Zhao
CZChaokun Zhang
Chaokun Zhang
Tie QiuTie Qiu
Tie Qiu
KLKeqiu Li
Keqiu Li
In Mobile crowdsensing (MCS), the platform needs an adequate user group to accomplish tasks. Its recruiting worker strategy is essential for sensor data quality. Social-network-assisted worker recruitment effectively expands task coverage. However existing studies enclose two impractical assumptions: influence between users is determined by the number of friends and the recruiting reward is fixed. To solve this problem, a novel influence and cost trade-off (ICT) algorithm is proposed to apply the worker recruitment strategy in the real world. ICT uses linear equations to estimate influence and cost iteratively under the impact of the seed set. Using the influence model based on social interaction, the algorithm selects a near-optimal set of seeds by the revenue-cost-ratio. Empirical studies on three realworld datasets verify that ICT achieves higher performance than baseline methods under various settings.

2 March 2026 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
TTTao Tang
Tao Tang
CZChaokun Zhang
Chaokun Zhang
GCGong Chen
Gong Chen
JEJinlong E
Jinlong E
PLPengcheng Lyu
Pengcheng Lyu
Cooperative perception facilitated by vehicle-to-vehicle (V2V) data sharing has emerged as a crucial enabler for safe and efficient autonomous driving. However, the current state-of-the-art algorithms are unable to resolve severe performance degradation caused by communication impairments in realistic V2V scenarios. This paper models the V2V communication quality and confirms their fragile robustness under loss conditions. To this end, we propose a robust and efficient cooperative perception framework. Specifically, we propose RoCooper, a robust fusion algorithm. It leverages the lossless ego feature as an anchoring foundation, then utilizes multi-dimensional feature correlations and dynamic regional selective cross-learning. This allows it to perform multi-scale feature recovery and judiciously fuse multi-view features from neighboring vehicles. In addition, we design ReduAdapt, an efficient redundancy-aware scheduling scheme that first constructs hierarchical metadata to decompose 3D perception space, then applies dynamic multi-factor thresholds for region-specific cropping, and finally performs retention-driven adaptive compression, enabling connect vehicles to prioritize critical data streams while dynamically suppressing redundant transmissions, thereby maximizing effective throughput. Extensive evaluations of real-world datasets demonstrate that our method achieves state-of-the-art performance in varying impairment scenarios, while delivering more efficient compression-transmission at comparable levels.

27 February 2025 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
SHShen He
Shen He
CZChaokun Zhang
Chaokun Zhang
TTTao Tang
Tao Tang
WQWenyu Qu
Wenyu Qu
Visual perception, as a core component of Intelligent Transportation Systems (ITS), plays a key role in enhancing safety and efficiency in urban mobility. While single-task visual perception methods have applications in areas like pedestrian detection and traffic sign recognition, the complexity of real-world scenarios necessitates a shift toward multi-task approaches. This paper introduces the Edge-assisted Multi-task Visual Perception (EMVP) system, which is specifically designed to address the computational intensity and dynamic concurrency challenges inherent to multi-task processing in edge environments. EMVP adopts a collaborative architecture that strategically partitions computational tasks between vehicles and Road-Side Units (RSUs). By integrating Convolutional Neural Networks (CNNs) and Vision Transformers (ViTs), the system achieves a lightweight yet efficient multi-task model for resource-constrained environments. To adapt to the dynamic and concurrent nature of multi-vehicle scenarios, EMVP incorporates a content-aware adaptive inference mechanism based on reinforcement learning, enabling dynamic task scheduling to improve Quality of Service (QoS). Experimental results demonstrate that, compared to the single-task baseline model, the multi-task model of EMVP reduces the computational cost by 86.59% on average while achieving a 4.32% improvement in accuracy. Additionally, in dynamic multi-access environments, EMVP’s adaptive scheduling mechanism, which leverages spatiotemporal content awareness, achieves an average QoS improvement of 7.36% over the sub-optimal method.

29 September 2020
Verified
Book Chapter
Closed access
PDF file
SGShuxin Ge
Shuxin Ge
WWWeixu Wang
Weixu Wang
CZChaokun Zhang
Chaokun Zhang
XZXiaobo Zhou
Xiaobo Zhou
QZQinglin Zhao
Qinglin Zhao